Comparison of sequencing problems

Problem 1
Job1 Job2 Job3 Job4 Solution Sequence Method Remark
Machine1 3 2 7 10 22
43 1342/2341 NEW Optimal
Machine2 10 8 9 12 39
47 2134 Palmer
Machine3 2 1 5 6 14
50 4312 CDS/ Dannenbring

Problem 2
Job1 Job2 Job3 Job4 Solution Sequence Method Remark
Machine1 3 1 5 2
36 2134 NEW /PALMER Optimal
Machine2 9 8 8 7
40 2413 CDS
Machine3 6 5 7 3
41 4213 Dannenbring

Problem 3
Job1 Job2 Job3 Job4 Solution Method Remark
Machine1
2 0 1 3 40 1342 NEW Optimal
Machine2
3 4 6 8 40 3421 PALMER
Machine3
5 10 12 2 42 1243 Dannenbring
Machine4
4 1 7 9 46 1423 CDS

Problem 4

Job1 Job2 Job3 Job4 Job5 Job6 Solution Sequence Method Remark
Machine1
0 1 9 3 5 2 70 263541 NEW Optimal
Machine2
9 6 2 13 8 7 70 653241 PALMER Optimal
Machine3
13 12 2 9 11 9 70 236451 Dannenbring Optimal
Machine4
3 3 8 4 9 8 76 635421 CDS
Machine5
2 3 7 8 7 9

Problem 6
Job1 Job2 Job3 Job4 Job5 Job6 Job7 Job8 Job9 Solution Sequence Method Remark
M1 1 6 9 3 5 4 2 7 3 103 179654382 NEW Optimal
M2 9 16 12 13 8 7 8 9 12 105 196453278 CDS
M3 13 2 2 9 11 9 6 5 9 106 659471382 Palmer
M4 3 3 8 4 9 8 8 1 3 108 694531278 Dannenbring
M5 2 3 7 8 7 9 0 4 9

Problem 7
Job1 Job2 Job3 Job4 Job5 Job6 Job7 Job8 Job9 Job10 Solution Sequence Method Remark
M1 13 2 7 10 12 6 9 5 15 16 317 1 4 5 6 7 10 9 8 3 2 NEW Optimal
M2 3 23 27 17 14 17 23 36 19 28 325 1 6 2 4 3 8 7 9 10 5 Dannenbring
M3 10 4 8 3 5 10 13 1 29 17 326 1 6 2 5 4 7 3 9 10 8 CDS
M4 31 36 32 38 18 21 24 27 30 33 344 7 9 10 6 4 2 1 8 3 5 Palmer
M5 4 1 5 6 9 11 22 10 21 22