From 9802bd39fdfd9429fdd6b10f867e038f50e70a4d Mon Sep 17 00:00:00 2001 From: Arthur Bit-Monnot Date: Tue, 6 Apr 2021 10:01:14 +0200 Subject: [PATCH] Correct typos --- README.md | 2 +- src/main/java/jobshop/solvers/DescentSolver.java | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index d027f6e..21efe0d 100644 --- a/README.md +++ b/README.md @@ -27,7 +27,7 @@ AVG - - 1.0 - 9.1 Fields in the result view are the following : - `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 - `runtime`: time taken by the solver in milliseconds (rounded) - `makespan`: makespan of the solution diff --git a/src/main/java/jobshop/solvers/DescentSolver.java b/src/main/java/jobshop/solvers/DescentSolver.java index bc8ca7c..97a81dd 100644 --- a/src/main/java/jobshop/solvers/DescentSolver.java +++ b/src/main/java/jobshop/solvers/DescentSolver.java @@ -44,7 +44,7 @@ public class DescentSolver implements Solver { * machine 1 : (0,2) (2,1) (1,1) * 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) * Applying this swap on the above resource order should result in the following one : * machine 0 : (0,1) (1,2) (2,2)