|
@@ -0,0 +1,119 @@
|
|
1
|
+package jobshop.solvers;
|
|
2
|
+
|
|
3
|
+import jobshop.BestKnownResults;
|
|
4
|
+import jobshop.Instance;
|
|
5
|
+import jobshop.Result;
|
|
6
|
+import org.junit.Test;
|
|
7
|
+
|
|
8
|
+import java.io.IOException;
|
|
9
|
+import java.nio.file.Paths;
|
|
10
|
+import java.util.List;
|
|
11
|
+import java.util.stream.Collectors;
|
|
12
|
+
|
|
13
|
+import static jobshop.solvers.GreedySolver.Priority.*;
|
|
14
|
+
|
|
15
|
+public class GreedySolverTest {
|
|
16
|
+ @Test
|
|
17
|
+ public void testSPT() {
|
|
18
|
+ List<String> instancesNames = BestKnownResults.instancesMatching("la");
|
|
19
|
+ instancesNames.addAll(BestKnownResults.instancesMatching("ft"));
|
|
20
|
+
|
|
21
|
+ List<Instance> instances = instancesNames.stream().map(name -> {
|
|
22
|
+ Instance instance = null;
|
|
23
|
+ try {
|
|
24
|
+ instance = Instance.fromFile(Paths.get("instances/", name));
|
|
25
|
+ } catch (IOException e) {
|
|
26
|
+ e.printStackTrace();
|
|
27
|
+ }
|
|
28
|
+ return instance;
|
|
29
|
+ }).collect(Collectors.toList());
|
|
30
|
+
|
|
31
|
+ GreedySolver solver = new GreedySolver(SPT);
|
|
32
|
+ Result result;
|
|
33
|
+ for (int i = 0; i < instances.size(); i++) {
|
|
34
|
+ result = solver.solve(instances.get(i), 100000);
|
|
35
|
+ assert result.schedule.get().isValid();
|
|
36
|
+ if (BestKnownResults.isKnown(instancesNames.get(i))) {
|
|
37
|
+ assert result.schedule.get().makespan() >= BestKnownResults.of(instancesNames.get(i));
|
|
38
|
+ }
|
|
39
|
+ }
|
|
40
|
+ }
|
|
41
|
+
|
|
42
|
+ @Test
|
|
43
|
+ public void testLPT() throws IOException {
|
|
44
|
+ List<String> instancesNames = BestKnownResults.instancesMatching("la");
|
|
45
|
+ instancesNames.addAll(BestKnownResults.instancesMatching("ft"));
|
|
46
|
+
|
|
47
|
+ List<Instance> instances = instancesNames.stream().map(name -> {
|
|
48
|
+ Instance instance = null;
|
|
49
|
+ try {
|
|
50
|
+ instance = Instance.fromFile(Paths.get("instances/", name));
|
|
51
|
+ } catch (IOException e) {
|
|
52
|
+ e.printStackTrace();
|
|
53
|
+ }
|
|
54
|
+ return instance;
|
|
55
|
+ }).collect(Collectors.toList());
|
|
56
|
+
|
|
57
|
+ GreedySolver solver = new GreedySolver(LPT);
|
|
58
|
+ Result result;
|
|
59
|
+ for (int i = 0; i < instances.size(); i++) {
|
|
60
|
+ result = solver.solve(instances.get(i), 100000);
|
|
61
|
+ assert result.schedule.get().isValid();
|
|
62
|
+ if (BestKnownResults.isKnown(instancesNames.get(i))) {
|
|
63
|
+ assert result.schedule.get().makespan() >= BestKnownResults.of(instancesNames.get(i));
|
|
64
|
+ }
|
|
65
|
+ }
|
|
66
|
+ }
|
|
67
|
+
|
|
68
|
+ @Test
|
|
69
|
+ public void testSRPT() throws IOException {
|
|
70
|
+ List<String> instancesNames = BestKnownResults.instancesMatching("la");
|
|
71
|
+ instancesNames.addAll(BestKnownResults.instancesMatching("ft"));
|
|
72
|
+
|
|
73
|
+ List<Instance> instances = instancesNames.stream().map(name -> {
|
|
74
|
+ Instance instance = null;
|
|
75
|
+ try {
|
|
76
|
+ instance = Instance.fromFile(Paths.get("instances/", name));
|
|
77
|
+ } catch (IOException e) {
|
|
78
|
+ e.printStackTrace();
|
|
79
|
+ }
|
|
80
|
+ return instance;
|
|
81
|
+ }).collect(Collectors.toList());
|
|
82
|
+
|
|
83
|
+ GreedySolver solver = new GreedySolver(SRPT);
|
|
84
|
+ Result result;
|
|
85
|
+ for (int i = 0; i < instances.size(); i++) {
|
|
86
|
+ result = solver.solve(instances.get(i), 100000);
|
|
87
|
+ assert result.schedule.get().isValid();
|
|
88
|
+ if (BestKnownResults.isKnown(instancesNames.get(i))) {
|
|
89
|
+ assert result.schedule.get().makespan() >= BestKnownResults.of(instancesNames.get(i));
|
|
90
|
+ }
|
|
91
|
+ }
|
|
92
|
+ }
|
|
93
|
+
|
|
94
|
+ @Test
|
|
95
|
+ public void testLRPT() throws IOException {
|
|
96
|
+ List<String> instancesNames = BestKnownResults.instancesMatching("la");
|
|
97
|
+ instancesNames.addAll(BestKnownResults.instancesMatching("ft"));
|
|
98
|
+
|
|
99
|
+ List<Instance> instances = instancesNames.stream().map(name -> {
|
|
100
|
+ Instance instance = null;
|
|
101
|
+ try {
|
|
102
|
+ instance = Instance.fromFile(Paths.get("instances/", name));
|
|
103
|
+ } catch (IOException e) {
|
|
104
|
+ e.printStackTrace();
|
|
105
|
+ }
|
|
106
|
+ return instance;
|
|
107
|
+ }).collect(Collectors.toList());
|
|
108
|
+
|
|
109
|
+ GreedySolver solver = new GreedySolver(LRPT);
|
|
110
|
+ Result result;
|
|
111
|
+ for (int i = 0; i < instances.size(); i++) {
|
|
112
|
+ result = solver.solve(instances.get(i), 100000);
|
|
113
|
+ assert result.schedule.get().isValid();
|
|
114
|
+ if (BestKnownResults.isKnown(instancesNames.get(i))) {
|
|
115
|
+ assert result.schedule.get().makespan() >= BestKnownResults.of(instancesNames.get(i));
|
|
116
|
+ }
|
|
117
|
+ }
|
|
118
|
+ }
|
|
119
|
+}
|