pfaure/Metaheuristiques
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Correct typos

Browse source
This commit is contained in:
Arthur Bit-Monnot 2021-04-06 10:01:14 +02:00
parent ac9c0ce9ac
commit 9802bd39fd
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -27,7 +27,7 @@ AVG - - 1.0 - 9.1
Fields in the result view are the following : Fields in the result view are the following :
- `instance`: name of the instance - `instance`: name of the instance
- `size`: size of the instance `{nom-jobs}x{num-tasks}` - `size`: size of the instance `{num-jobs}x{num-tasks}`
- `best`: best known resultfor this instance - `best`: best known resultfor this instance
- `runtime`: time taken by the solver in milliseconds (rounded) - `runtime`: time taken by the solver in milliseconds (rounded)
- `makespan`: makespan of the solution - `makespan`: makespan of the solution

2
src/main/java/jobshop/solvers/DescentSolver.java
View file

@ -44,7 +44,7 @@ public class DescentSolver implements Solver {
* machine 1 : (0,2) (2,1) (1,1) * machine 1 : (0,2) (2,1) (1,1)
* machine 2 : ... * machine 2 : ...
* *
* The swam with : machine = 1, t1= 0 and t2 = 1 * The swap with : machine = 1, t1= 0 and t2 = 1
* Represent inversion of the two tasks : (0,2) and (2,1) * Represent inversion of the two tasks : (0,2) and (2,1)
* Applying this swap on the above resource order should result in the following one : * Applying this swap on the above resource order should result in the following one :
* machine 0 : (0,1) (1,2) (2,2) * machine 0 : (0,1) (1,2) (2,2)