Java/src/test/java/com/thealgorithms/dynamicprogramming/OptimalJobSchedulingTest.java at master · TheAlgorithms/Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
packagecom.thealgorithms.dynamicprogramming;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

importorg.junit.jupiter.api.Test;

/**
 * @author georgioct@csd.auth.gr
 */
publicclassOptimalJobSchedulingTest {

@Test
publicvoidtestOptimalJobScheduling1() {

intnumberProcesses = 5;
intnumberMachines = 4;

int[][] run = {{5, 1, 3, 2}, {4, 2, 1, 3}, {1, 5, 2, 1}, {2, 3, 4, 2}, {1, 1, 3, 1}};

int[][] transfer = {{0, 1, 2, 4}, {1, 0, 2, 3}, {2, 2, 0, 1}, {4, 3, 1, 0}};

OptimalJobSchedulingopt = newOptimalJobScheduling(numberProcesses, numberMachines, run, transfer);

opt.execute();

int[][] costs = {{5, 1, 3, 2}, {6, 3, 4, 5}, {5, 8, 6, 6}, {7, 9, 10, 8}, {8, 9, 12, 9}};

for (inti = 0; i < numberProcesses; i++) {

for (intj = 0; j < numberMachines; j++) {

assertEquals(costs[i][j], opt.getCost(i, j));
 }
 }
 }

@Test
publicvoidtestOptimalJobScheduling2() {

intnumberProcesses = 3;
intnumberMachines = 3;

int[][] run = {{5, 1, 3}, {4, 2, 1}, {1, 5, 2}};

int[][] transfer = {{0, 1, 2}, {1, 0, 2}, {2, 2, 0}};

OptimalJobSchedulingopt = newOptimalJobScheduling(numberProcesses, numberMachines, run, transfer);

opt.execute();

int[][] costs = {{5, 1, 3}, {6, 3, 4}, {5, 8, 6}};

for (inti = 0; i < numberProcesses; i++) {

for (intj = 0; j < numberMachines; j++) {

assertEquals(costs[i][j], opt.getCost(i, j));
 }
 }
 }

@Test
publicvoidtestOptimalJobScheduling3() {

intnumberProcesses = 6;
intnumberMachines = 4;

int[][] run = {
 {5, 1, 3, 2},
 {4, 2, 1, 1},
 {1, 5, 2, 6},
 {1, 1, 2, 3},
 {2, 1, 4, 6},
 {3, 2, 2, 3},
 };

int[][] transfer = {
 {0, 1, 2, 1},
 {1, 0, 2, 3},
 {2, 2, 0, 2},
 {1, 3, 2, 0},
 };

OptimalJobSchedulingopt = newOptimalJobScheduling(numberProcesses, numberMachines, run, transfer);

opt.execute();

int[][] costs = {{5, 1, 3, 2}, {6, 3, 4, 3}, {5, 8, 6, 9}, {6, 7, 8, 9}, {8, 8, 12, 13}, {11, 10, 12, 12}};

for (inti = 0; i < numberProcesses; i++) {

for (intj = 0; j < numberMachines; j++) {

assertEquals(costs[i][j], opt.getCost(i, j));
 }
 }
 }
}