rlacroix/Metaheuristiques-Lacroix-Lejeune
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

tests done

Browse source
This commit is contained in:
alejeune 2023-03-17 11:10:47 +01:00
parent 9f341ba5f4
commit 2494bafd79
1 changed files with 27 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

40
src/test/java/jobshop/encodings/ManualEncodingTests.java
View file

@ -30,7 +30,7 @@ public class ManualEncodingTests {
this.reference = result.get();
}
@Ignore("Not ready yet")
@Test
public void testManualSchedule() {
System.out.println("***** Reference schedule to reproduce ******");
@ -39,19 +39,26 @@ public class ManualEncodingTests {
System.out.println("GANTT: " + this.reference.asciiGantt());
Schedule manualSchedule = new Schedule(instance);
// TODO: encode the same solution
//manualSchedule.setStartTime(....);
manualSchedule.setStartTime(0,0,0);
manualSchedule.setStartTime(1,0,0);
manualSchedule.setStartTime(0,1,3);
manualSchedule.setStartTime(1,1,3);
manualSchedule.setStartTime(0,2,6);
manualSchedule.setStartTime(1,2,8);
assert manualSchedule.equals(this.reference);
}
@Ignore("Not ready yet")
@Test
public void testManualResourceOrder() {
ResourceOrder manualRO = new ResourceOrder(instance);
// TODO: encode the same solution
//manualRO.addTaskToMachine(..., new Task(..., ...));
manualRO.addTaskToMachine(0, new Task(0,0));
manualRO.addTaskToMachine(0, new Task(1,1));
manualRO.addTaskToMachine(1, new Task(1,0));
manualRO.addTaskToMachine(1, new Task(0,1));
manualRO.addTaskToMachine(2, new Task(0,2));
manualRO.addTaskToMachine(2, new Task(1,2));
Optional<Schedule> optSchedule = manualRO.toSchedule();
assert optSchedule.isPresent() : "The resource order could not be converted to a schedule (probably invalid)";
@ -59,25 +66,32 @@ public class ManualEncodingTests {
assert schedule.equals(this.reference) : "The manual resource order encoding did not produce the same schedule";
}
@Ignore("Not ready yet")
@Test
public void testOptimalResourceOrder() {
ResourceOrder manualRO = new ResourceOrder(instance);
// TODO: encode the optimal solution
//manualRO.addTaskToMachine(..., new Task(..., ...));
manualRO.addTaskToMachine(0, new Task(0,0));
manualRO.addTaskToMachine(0, new Task(1,1));
manualRO.addTaskToMachine(1, new Task(1,0));
manualRO.addTaskToMachine(1, new Task(0,1));
manualRO.addTaskToMachine(2, new Task(1,2));
manualRO.addTaskToMachine(2, new Task(0,2));
Optional<Schedule> optSchedule = manualRO.toSchedule();
assert optSchedule.isPresent() : "The resource order cuold not be converted to a schedule (probably invalid)";
assert optSchedule.isPresent() : "The resource order could not be converted to a schedule (probably invalid)";
Schedule schedule = optSchedule.get();
assert schedule.makespan() == 11 : "The manual resource order encoding did not produce the optimal schedule";
}
@Ignore("Not ready yet")
@Test
public void testInvalidResourceOrder() {
ResourceOrder manualRO = new ResourceOrder(instance);
// TODO: construct a complete but invalid solution in the resource order encoding
manualRO.addTaskToMachine(0, new Task(1,1));
manualRO.addTaskToMachine(0, new Task(0,0));
manualRO.addTaskToMachine(1, new Task(0,1));
manualRO.addTaskToMachine(1, new Task(1,0));
manualRO.addTaskToMachine(2, new Task(0,2));
manualRO.addTaskToMachine(2, new Task(1,2));
assert manualRO.toSchedule().isEmpty();
}
}