num_jobs int64 2 100 | num_machines int64 2 50 | prompt_jobs_first stringlengths 516 37.9k | instruction stringclasses 10
values | prompt_machines_first stringlengths 496 43.1k | input stringlengths 2.57k 37.9k ⌀ | output stringlengths 267 131k | path stringlengths 0 15 | matrix stringlengths 3.65k 56.2k ⌀ |
|---|---|---|---|---|---|---|---|---|
40 | 40 | J0:
M10:122 M29:26 M15:178 M33:126 M17:174 M22:20 M3:98 M38:99 M6:111 M24:104 M34:89 M1:71 M25:184 M27:19 M11:182 M0:19 M8:9 M32:151 M36:12 M12:65 M39:175 M14:139 M23:139 M30:92 M21:66 M28:62 M19:100 M13:26 M5:137 M16:158 M9:52 M37:14 M26:113 M31:92 M2:126 M20:38 M35:81 M18:80 M7:113 M4:63
J1:
M27:113 M2:125 M22:44 M3... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J25: 65 J36: 105 J35: 189 J4: 48 J26: 69 J31: 175 J11: 10 J34: 168 J27: 104 J17: 74 J21: 132 J7: 100 J29: 90 J32: 53 J0: 19 J12: 51 J2: 180 J37: 141 J5: 146 J16: 23 J6: 103 J14: 173 J20: 58 J28: 21 J18: 182 J9: 23 J30: 60 J19: 171 J3: 104 J22: 6 J24: 82 J15: 18 J13: 177 J23: 183 J1: 184 J10: 143 J33: 70 J39: 192 J3... | J0:
M10:122 M29:26 M15:178 M33:126 M17:174 M22:20 M3:98 M38:99 M6:111 M24:104 M34:89 M1:71 M25:184 M27:19 M11:182 M0:19 M8:9 M32:151 M36:12 M12:65 M39:175 M14:139 M23:139 M30:92 M21:66 M28:62 M19:100 M13:26 M5:137 M16:158 M9:52 M37:14 M26:113 M31:92 M2:126 M20:38 M35:81 M18:80 M7:113 M4:63
J1:
M27:113 M2:125 M22:44 M3... | Solution:
J3-M1: 0+30 -> 30,J5-M2: 0+168 -> 168,J27-M4: 0+57 -> 57,J8-M5: 0+59 -> 59,J11-M6: 0+83 -> 83,J35-M7: 0+93 -> 93,J0-M10: 0+122 -> 122,J17-M11: 0+188 -> 188,J39-M12: 0+94 -> 94,J18-M13: 0+111 -> 111,J15-M16: 0+28 -> 28,J13-M18: 0+41 -> 41,J19-M20: 0+9 -> 9,J25-M21: 0+82 -> 82,J9-M25: 0+5 -> 5,J1-M27: 0+113 -> ... | 40x40_276.jsp | 40 40
10 122 29 26 15 178 33 126 17 174 22 20 3 98 38 99 6 111 24 104 34 89 1 71 25 184 27 19 11 182 0 19 8 9 32 151 36 12 12 65 39 175 14 139 23 139 30 92 21 66 28 62 19 100 13 26 5 137 16 158 9 52 37 14 26 113 31 92 2 126 20 38 35 81 18 80 7 113 4 63
27 113 2 125 22 44 36 183 30 131 13 154 26 183 23 126 12 186 1 157 ... |
40 | 20 | J0:
M17:214 M8:232 M14:54 M4:237 M15:150 M3:106 M13:157 M19:24 M5:6 M10:228 M18:232 M6:218 M16:123 M12:84 M9:84 M2:73 M1:189 M0:134 M7:71 M11:244
J1:
M17:232 M11:15 M9:238 M18:133 M14:8 M3:256 M19:174 M1:142 M2:28 M15:54 M16:264 M0:122 M13:20 M10:194 M5:235 M8:31 M7:145 M4:15 M12:80 M6:146
J2:
M13:64 M14:103 M4:10 M0... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J24: 206 J31: 222 J2: 190 J12: 76 J23: 249 J28: 252 J35: 70 J3: 61 J20: 31 J27: 268 J15: 271 J21: 257 J37: 226 J8: 37 J16: 234 J18: 96 J11: 9 J29: 154 J33: 109 J26: 270 J36: 51 J1: 122 J17: 141 J32: 93 J39: 202 J9: 139 J10: 68 J25: 124 J7: 126 J19: 171 J22: 177 J0: 134 J4: 107 J14: 215 J30: 147 J6: 200 J34: 113 J5:... | J0:
M17:214 M8:232 M14:54 M4:237 M15:150 M3:106 M13:157 M19:24 M5:6 M10:228 M18:232 M6:218 M16:123 M12:84 M9:84 M2:73 M1:189 M0:134 M7:71 M11:244
J1:
M17:232 M11:15 M9:238 M18:133 M14:8 M3:256 M19:174 M1:142 M2:28 M15:54 M16:264 M0:122 M13:20 M10:194 M5:235 M8:31 M7:145 M4:15 M12:80 M6:146
J2:
M13:64 M14:103 M4:10 M0... | Solution:
J26-M1: 0+188 -> 188,J15-M2: 0+116 -> 116,J6-M3: 0+12 -> 12,J29-M4: 0+224 -> 224,J18-M8: 0+141 -> 141,J10-M9: 0+260 -> 260,J5-M10: 0+111 -> 111,J22-M11: 0+150 -> 150,J9-M12: 0+52 -> 52,J2-M13: 0+64 -> 64,J28-M14: 0+12 -> 12,J8-M15: 0+124 -> 124,J36-M17: 0+192 -> 192,J12-M3: 12+169 -> 181,J6-M19: 12+123 -> 135... | 40x20_1470.jsp | 40 20
17 214 8 232 14 54 4 237 15 150 3 106 13 157 19 24 5 6 10 228 18 232 6 218 16 123 12 84 9 84 2 73 1 189 0 134 7 71 11 244
17 232 11 15 9 238 18 133 14 8 3 256 19 174 1 142 2 28 15 54 16 264 0 122 13 20 10 194 5 235 8 31 7 145 4 15 12 80 6 146
13 64 14 103 4 10 0 190 5 69 8 54 11 85 16 88 19 98 12 153 1 255 18 233... |
30 | 20 | J0:
M3:98 M13:181 M6:121 M7:98 M12:166 M5:17 M17:109 M16:110 M9:78 M19:52 M15:37 M8:72 M14:115 M18:143 M4:131 M11:31 M0:75 M2:99 M10:99 M1:99
J1:
M13:13 M0:67 M5:74 M16:106 M10:94 M1:119 M7:38 M8:40 M15:25 M14:86 M9:151 M12:51 M19:20 M18:22 M4:65 M6:24 M17:26 M11:162 M3:128 M2:107
J2:
M5:144 M18:178 M10:76 M2:39 M16:... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J6: 30 J9: 163 J13: 62 J17: 18 J25: 34 J26: 171 J1: 67 J11: 16 J29: 5 J14: 14 J27: 53 J7: 129 J19: 133 J8: 55 J15: 118 J16: 154 J4: 86 J18: 8 J23: 63 J3: 149 J5: 10 J12: 35 J24: 179 J28: 60 J0: 75 J10: 135 J2: 84 J20: 67 J21: 79 J22: 21
M1:
J4: 174 J29: 98 J19: 160 J20: 156 J22: 21 J26: 145 J21: 61 J1: 119 J6: 40 ... | J0:
M3:98 M13:181 M6:121 M7:98 M12:166 M5:17 M17:109 M16:110 M9:78 M19:52 M15:37 M8:72 M14:115 M18:143 M4:131 M11:31 M0:75 M2:99 M10:99 M1:99
J1:
M13:13 M0:67 M5:74 M16:106 M10:94 M1:119 M7:38 M8:40 M15:25 M14:86 M9:151 M12:51 M19:20 M18:22 M4:65 M6:24 M17:26 M11:162 M3:128 M2:107
J2:
M5:144 M18:178 M10:76 M2:39 M16:... | Solution:
J17-M0: 0+18 -> 18,J5-M2: 0+28 -> 28,J15-M3: 0+17 -> 17,J16-M4: 0+180 -> 180,J3-M5: 0+69 -> 69,J29-M6: 0+112 -> 112,J20-M7: 0+122 -> 122,J11-M10: 0+42 -> 42,J4-M11: 0+124 -> 124,J18-M12: 0+134 -> 134,J1-M13: 0+13 -> 13,J22-M14: 0+78 -> 78,J23-M15: 0+95 -> 95,J28-M19: 0+59 -> 59,J8-M3: 17+57 -> 74,J6-M0: 18+30... | 30x20_1769.jsp | 30 20
3 98 13 181 6 121 7 98 12 166 5 17 17 109 16 110 9 78 19 52 15 37 8 72 14 115 18 143 4 131 11 31 0 75 2 99 10 99 1 99
13 13 0 67 5 74 16 106 10 94 1 119 7 38 8 40 15 25 14 86 9 151 12 51 19 20 18 22 4 65 6 24 17 26 11 162 3 128 2 107
5 144 18 178 10 76 2 39 16 75 13 14 1 36 19 114 4 8 14 139 11 43 6 131 7 87 12 1... |
50 | 20 | J0:
M13:90 M18:161 M1:59 M5:32 M12:54 M16:141 M11:80 M15:183 M2:64 M0:91 M10:126 M3:162 M17:154 M6:132 M9:58 M19:156 M14:181 M8:51 M4:32 M7:59
J1:
M7:45 M6:144 M10:101 M2:117 M18:172 M17:60 M9:58 M19:170 M13:42 M0:135 M3:31 M8:50 M4:84 M5:71 M15:102 M16:54 M11:181 M14:53 M12:90 M1:92
J2:
M16:26 M4:174 M1:88 M0:28 M6:... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J4: 83 J5: 107 J11: 148 J44: 173 J49: 78 J20: 133 J6: 186 J22: 98 J48: 86 J2: 28 J18: 147 J29: 185 J34: 181 J16: 61 J27: 57 J39: 185 J41: 139 J45: 76 J3: 10 J10: 160 J14: 52 J38: 23 J0: 91 J1: 135 J12: 97 J13: 76 J24: 190 J36: 38 J21: 158 J40: 70 J9: 72 J23: 145 J7: 126 J17: 178 J26: 167 J31: 105 J46: 104 J8: 77 J1... | J0:
M13:90 M18:161 M1:59 M5:32 M12:54 M16:141 M11:80 M15:183 M2:64 M0:91 M10:126 M3:162 M17:154 M6:132 M9:58 M19:156 M14:181 M8:51 M4:32 M7:59
J1:
M7:45 M6:144 M10:101 M2:117 M18:172 M17:60 M9:58 M19:170 M13:42 M0:135 M3:31 M8:50 M4:84 M5:71 M15:102 M16:54 M11:181 M14:53 M12:90 M1:92
J2:
M16:26 M4:174 M1:88 M0:28 M6:... | Solution:
J49-M0: 0+78 -> 78,J31-M1: 0+25 -> 25,J13-M2: 0+32 -> 32,J6-M3: 0+118 -> 118,J14-M4: 0+18 -> 18,J26-M5: 0+48 -> 48,J22-M6: 0+11 -> 11,J1-M7: 0+45 -> 45,J39-M9: 0+36 -> 36,J46-M10: 0+40 -> 40,J21-M11: 0+44 -> 44,J35-M12: 0+17 -> 17,J0-M13: 0+90 -> 90,J17-M14: 0+39 -> 39,J42-M15: 0+26 -> 26,J2-M16: 0+26 -> 26,J... | 50x20_564.jsp | 50 20
13 90 18 161 1 59 5 32 12 54 16 141 11 80 15 183 2 64 0 91 10 126 3 162 17 154 6 132 9 58 19 156 14 181 8 51 4 32 7 59
7 45 6 144 10 101 2 117 18 172 17 60 9 58 19 170 13 42 0 135 3 31 8 50 4 84 5 71 15 102 16 54 11 181 14 53 12 90 1 92
16 26 4 174 1 88 0 28 6 9 11 42 8 156 5 178 9 9 3 115 15 138 10 97 19 128 18 ... |
30 | 15 | J0:
M0:159 M8:183 M13:73 M11:109 M1:45 M14:139 M9:217 M2:13 M4:93 M10:7 M5:43 M3:200 M6:190 M7:54 M12:185
J1:
M4:132 M3:126 M10:209 M2:94 M8:43 M6:48 M9:52 M13:212 M0:229 M7:210 M1:89 M14:193 M5:153 M12:136 M11:155
J2:
M4:51 M3:151 M0:134 M2:212 M13:85 M1:158 M6:42 M7:193 M5:41 M10:96 M11:227 M12:84 M9:36 M8:170 M14:... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 159 J7: 68 J14: 191 J17: 132 J2: 134 J12: 101 J19: 6 J28: 72 J18: 25 J10: 128 J22: 58 J23: 102 J11: 41 J24: 115 J25: 226 J26: 54 J27: 184 J1: 229 J3: 19 J6: 57 J5: 59 J15: 69 J20: 199 J4: 35 J9: 76 J13: 185 J29: 111 J8: 122 J21: 215 J16: 147
M1:
J23: 214 J8: 72 J18: 30 J13: 84 J16: 34 J27: 139 J0: 45 J3: 43 J2... | J0:
M0:159 M8:183 M13:73 M11:109 M1:45 M14:139 M9:217 M2:13 M4:93 M10:7 M5:43 M3:200 M6:190 M7:54 M12:185
J1:
M4:132 M3:126 M10:209 M2:94 M8:43 M6:48 M9:52 M13:212 M0:229 M7:210 M1:89 M14:193 M5:153 M12:136 M11:155
J2:
M4:51 M3:151 M0:134 M2:212 M13:85 M1:158 M6:42 M7:193 M5:41 M10:96 M11:227 M12:84 M9:36 M8:170 M14:... | Solution:
J7-M0: 0+68 -> 68,J9-M2: 0+68 -> 68,J15-M3: 0+139 -> 139,J28-M4: 0+136 -> 136,J17-M5: 0+7 -> 7,J20-M6: 0+82 -> 82,J16-M8: 0+24 -> 24,J12-M9: 0+88 -> 88,J3-M10: 0+173 -> 173,J24-M11: 0+73 -> 73,J11-M12: 0+18 -> 18,J22-M14: 0+173 -> 173,J18-M5: 7+73 -> 80,J11-M7: 18+27 -> 45,J13-M8: 24+22 -> 46,J8-M7: 45+54 -> ... | 30x15_231.jsp | 30 15
0 159 8 183 13 73 11 109 1 45 14 139 9 217 2 13 4 93 10 7 5 43 3 200 6 190 7 54 12 185
4 132 3 126 10 209 2 94 8 43 6 48 9 52 13 212 0 229 7 210 1 89 14 193 5 153 12 136 11 155
4 51 3 151 0 134 2 212 13 85 1 158 6 42 7 193 5 41 10 96 11 227 12 84 9 36 8 170 14 22
10 173 2 44 7 65 3 182 1 43 5 16 13 105 4 178 0 19... |
40 | 15 | J0:
M8:9 M7:28 M10:34 M11:14 M13:30 M5:7 M0:20 M1:28 M3:26 M14:6 M2:14 M4:32 M9:35 M6:11 M12:9
J1:
M13:5 M6:6 M8:19 M9:17 M10:10 M7:17 M2:21 M0:34 M5:18 M12:28 M11:20 M14:17 M1:30 M3:33 M4:22
J2:
M0:34 M5:33 M14:9 M11:20 M13:6 M10:16 M9:15 M2:32 M7:11 M12:25 M8:33 M4:33 M1:32 M3:32 M6:12
J3:
M8:9 M5:33 M12:6 M4:32 M... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 34 J5: 28 J32: 5 J38: 27 J9: 15 J16: 13 J22: 25 J24: 31 J13: 15 J20: 18 J11: 33 J31: 36 J35: 32 J23: 22 J30: 21 J0: 20 J12: 32 J15: 21 J18: 6 J19: 29 J1: 34 J3: 13 J4: 11 J6: 19 J8: 25 J17: 17 J34: 36 J10: 10 J21: 26 J29: 19 J39: 34 J14: 24 J25: 29 J33: 10 J37: 10 J27: 29 J28: 13 J7: 32 J36: 26 J26: 31
M1:
J15... | J0:
M8:9 M7:28 M10:34 M11:14 M13:30 M5:7 M0:20 M1:28 M3:26 M14:6 M2:14 M4:32 M9:35 M6:11 M12:9
J1:
M13:5 M6:6 M8:19 M9:17 M10:10 M7:17 M2:21 M0:34 M5:18 M12:28 M11:20 M14:17 M1:30 M3:33 M4:22
J2:
M0:34 M5:33 M14:9 M11:20 M13:6 M10:16 M9:15 M2:32 M7:11 M12:25 M8:33 M4:33 M1:32 M3:32 M6:12
J3:
M8:9 M5:33 M12:6 M4:32 M... | Solution:
J32-M0: 0+5 -> 5,J15-M1: 0+18 -> 18,J28-M3: 0+16 -> 16,J9-M4: 0+23 -> 23,J39-M5: 0+5 -> 5,J20-M7: 0+16 -> 16,J0-M8: 0+9 -> 9,J18-M9: 0+7 -> 7,J4-M10: 0+7 -> 7,J33-M11: 0+10 -> 10,J14-M12: 0+20 -> 20,J1-M13: 0+5 -> 5,J34-M14: 0+23 -> 23,J38-M0: 5+27 -> 32,J39-M2: 5+8 -> 13,J22-M5: 5+14 -> 19,J1-M6: 5+6 -> 11,J... | 40x15_792.jsp | 40 15
8 9 7 28 10 34 11 14 13 30 5 7 0 20 1 28 3 26 14 6 2 14 4 32 9 35 6 11 12 9
13 5 6 6 8 19 9 17 10 10 7 17 2 21 0 34 5 18 12 28 11 20 14 17 1 30 3 33 4 22
0 34 5 33 14 9 11 20 13 6 10 16 9 15 2 32 7 11 12 25 8 33 4 33 1 32 3 32 6 12
8 9 5 33 12 6 4 32 3 5 14 12 6 35 0 13 13 17 10 8 2 5 1 34 7 24 11 14 9 5
10 7 11 ... |
40 | 40 | J0:
M22:28 M15:67 M35:10 M38:94 M0:55 M26:94 M8:60 M24:51 M37:37 M12:42 M20:15 M10:31 M5:13 M34:84 M2:21 M33:82 M28:12 M19:62 M1:9 M9:52 M36:79 M7:94 M27:75 M11:52 M32:33 M23:40 M6:42 M30:78 M21:95 M25:36 M31:65 M14:70 M16:97 M3:56 M18:73 M13:96 M39:82 M29:83 M4:22 M17:9
J1:
M15:81 M4:16 M13:35 M39:7 M25:87 M33:93 M36... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J32: 75 J10: 22 J0: 55 J24: 32 J7: 61 J5: 96 J11: 80 J26: 8 J21: 95 J19: 96 J20: 79 J23: 8 J31: 55 J34: 94 J35: 73 J18: 52 J16: 23 J29: 44 J14: 65 J25: 10 J9: 22 J37: 63 J22: 30 J1: 47 J6: 94 J36: 96 J13: 95 J15: 90 J27: 65 J30: 48 J38: 81 J12: 80 J33: 29 J2: 27 J8: 56 J3: 59 J39: 85 J17: 21 J28: 52 J4: 64
M1:
J10... | J0:
M22:28 M15:67 M35:10 M38:94 M0:55 M26:94 M8:60 M24:51 M37:37 M12:42 M20:15 M10:31 M5:13 M34:84 M2:21 M33:82 M28:12 M19:62 M1:9 M9:52 M36:79 M7:94 M27:75 M11:52 M32:33 M23:40 M6:42 M30:78 M21:95 M25:36 M31:65 M14:70 M16:97 M3:56 M18:73 M13:96 M39:82 M29:83 M4:22 M17:9
J1:
M15:81 M4:16 M13:35 M39:7 M25:87 M33:93 M36... | Solution:
J38-M3: 0+13 -> 13,J18-M4: 0+14 -> 14,J27-M7: 0+83 -> 83,J35-M10: 0+11 -> 11,J25-M12: 0+16 -> 16,J30-M14: 0+84 -> 84,J1-M15: 0+81 -> 81,J11-M16: 0+71 -> 71,J7-M17: 0+52 -> 52,J17-M18: 0+9 -> 9,J13-M19: 0+29 -> 29,J0-M22: 0+28 -> 28,J28-M25: 0+36 -> 36,J31-M26: 0+50 -> 50,J23-M28: 0+48 -> 48,J26-M29: 0+38 -> 3... | 40x40_1508.jsp | 40 40
22 28 15 67 35 10 38 94 0 55 26 94 8 60 24 51 37 37 12 42 20 15 10 31 5 13 34 84 2 21 33 82 28 12 19 62 1 9 9 52 36 79 7 94 27 75 11 52 32 33 23 40 6 42 30 78 21 95 25 36 31 65 14 70 16 97 3 56 18 73 13 96 39 82 29 83 4 22 17 9
15 81 4 16 13 35 39 7 25 87 33 93 36 62 31 61 1 87 30 9 2 12 18 13 20 30 7 14 21 11 27... |
30 | 30 | J0:
M0:69 M8:51 M26:25 M21:32 M16:72 M6:26 M20:79 M29:64 M9:7 M15:5 M19:31 M25:76 M1:10 M24:89 M3:31 M17:67 M28:90 M12:39 M4:72 M22:88 M5:38 M27:20 M13:27 M11:9 M10:75 M7:15 M18:81 M23:91 M2:42 M14:65
J1:
M23:17 M25:23 M18:40 M27:33 M28:101 M13:100 M17:44 M14:12 M21:85 M29:75 M19:36 M9:52 M5:38 M1:29 M20:41 M24:90 M10... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 69 J29: 93 J15: 92 J9: 77 J25: 29 J3: 74 J19: 67 J5: 73 J7: 92 J17: 37 J20: 92 J27: 82 J28: 85 J11: 57 J10: 61 J13: 32 J2: 21 J12: 95 J6: 26 J21: 17 J26: 34 J1: 49 J18: 25 J14: 60 J24: 81 J4: 30 J8: 20 J23: 34 J16: 16 J22: 23
M1:
J3: 19 J4: 73 J15: 39 J19: 88 J10: 30 J5: 66 J14: 65 J28: 10 J0: 10 J1: 29 J20: 6... | J0:
M0:69 M8:51 M26:25 M21:32 M16:72 M6:26 M20:79 M29:64 M9:7 M15:5 M19:31 M25:76 M1:10 M24:89 M3:31 M17:67 M28:90 M12:39 M4:72 M22:88 M5:38 M27:20 M13:27 M11:9 M10:75 M7:15 M18:81 M23:91 M2:42 M14:65
J1:
M23:17 M25:23 M18:40 M27:33 M28:101 M13:100 M17:44 M14:12 M21:85 M29:75 M19:36 M9:52 M5:38 M1:29 M20:41 M24:90 M10... | Solution:
J0-M0: 0+69 -> 69,J4-M6: 0+52 -> 52,J16-M7: 0+11 -> 11,J27-M10: 0+90 -> 90,J18-M11: 0+56 -> 56,J11-M14: 0+32 -> 32,J7-M15: 0+16 -> 16,J20-M16: 0+82 -> 82,J14-M19: 0+67 -> 67,J12-M20: 0+18 -> 18,J2-M21: 0+18 -> 18,J5-M22: 0+96 -> 96,J28-M23: 0+32 -> 32,J6-M24: 0+57 -> 57,J8-M26: 0+33 -> 33,J25-M27: 0+47 -> 47,... | 30x30_2385.jsp | 30 30
0 69 8 51 26 25 21 32 16 72 6 26 20 79 29 64 9 7 15 5 19 31 25 76 1 10 24 89 3 31 17 67 28 90 12 39 4 72 22 88 5 38 27 20 13 27 11 9 10 75 7 15 18 81 23 91 2 42 14 65
23 17 25 23 18 40 27 33 28 101 13 100 17 44 14 12 21 85 29 75 19 36 9 52 5 38 1 29 20 41 24 90 10 8 6 31 26 40 11 54 2 43 8 93 0 49 3 95 15 89 4 32... |
100 | 50 | J0:
M31:23 M18:9 M36:7 M37:9 M40:34 M9:20 M38:67 M19:60 M23:17 M22:85 M14:32 M45:32 M44:74 M48:68 M21:46 M32:20 M20:92 M3:20 M41:63 M2:72 M43:102 M25:79 M13:58 M16:5 M1:102 M30:70 M49:12 M0:75 M10:22 M24:38 M33:65 M7:30 M39:79 M34:82 M29:47 M4:59 M6:11 M8:16 M42:77 M47:99 M46:20 M28:19 M35:73 M12:61 M17:67 M11:58 M5:99... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J58: 82 J28: 57 J31: 85 J49: 19 J70: 81 J65: 8 J11: 97 J19: 29 J27: 30 J33: 77 J2: 60 J42: 43 J76: 17 J80: 65 J99: 13 J22: 11 J55: 18 J89: 59 J39: 23 J57: 76 J20: 6 J24: 101 J73: 94 J50: 46 J53: 85 J60: 92 J61: 80 J85: 13 J74: 94 J45: 99 J43: 69 J94: 95 J8: 5 J44: 71 J97: 82 J98: 83 J79: 89 J46: 40 J48: 101 J15: 56... | J0:
M31:23 M18:9 M36:7 M37:9 M40:34 M9:20 M38:67 M19:60 M23:17 M22:85 M14:32 M45:32 M44:74 M48:68 M21:46 M32:20 M20:92 M3:20 M41:63 M2:72 M43:102 M25:79 M13:58 M16:5 M1:102 M30:70 M49:12 M0:75 M10:22 M24:38 M33:65 M7:30 M39:79 M34:82 M29:47 M4:59 M6:11 M8:16 M42:77 M47:99 M46:20 M28:19 M35:73 M12:61 M17:67 M11:58 M5:99... | Solution:
J58-M0: 0+82 -> 82,J36-M1: 0+18 -> 18,J10-M2: 0+19 -> 19,J61-M3: 0+44 -> 44,J62-M4: 0+63 -> 63,J72-M5: 0+5 -> 5,J74-M6: 0+37 -> 37,J8-M7: 0+21 -> 21,J59-M8: 0+17 -> 17,J37-M9: 0+56 -> 56,J63-M10: 0+23 -> 23,J45-M12: 0+36 -> 36,J57-M13: 0+65 -> 65,J25-M15: 0+26 -> 26,J83-M16: 0+10 -> 10,J9-M17: 0+32 -> 32,J96-... | 100x50_81.jsp | 100 50
31 23 18 9 36 7 37 9 40 34 9 20 38 67 19 60 23 17 22 85 14 32 45 32 44 74 48 68 21 46 32 20 20 92 3 20 41 63 2 72 43 102 25 79 13 58 16 5 1 102 30 70 49 12 0 75 10 22 24 38 33 65 7 30 39 79 34 82 29 47 4 59 6 11 8 16 42 77 47 99 46 20 28 19 35 73 12 61 17 67 11 58 5 99 26 13 15 10 27 90
2 35 36 82 45 59 4 22 18 ... |
40 | 20 | J0:
M3:138 M17:150 M4:151 M15:226 M10:40 M13:223 M19:266 M8:189 M16:89 M18:211 M1:67 M0:188 M12:76 M7:18 M11:13 M14:152 M2:132 M5:68 M9:165 M6:56
J1:
M2:101 M11:93 M19:256 M16:192 M18:88 M0:237 M5:15 M9:56 M13:232 M12:153 M3:171 M4:79 M15:252 M6:212 M17:80 M10:89 M7:51 M8:228 M14:196 M1:133
J2:
M13:261 M19:90 M14:255... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 205 J32: 27 J14: 247 J25: 215 J4: 186 J6: 230 J19: 209 J24: 150 J7: 150 J11: 53 J16: 130 J28: 135 J22: 131 J1: 237 J27: 72 J5: 181 J34: 257 J35: 28 J2: 265 J31: 266 J12: 26 J26: 78 J30: 101 J36: 137 J39: 141 J13: 257 J0: 188 J9: 180 J38: 114 J18: 224 J8: 26 J10: 21 J33: 236 J37: 196 J20: 76 J17: 100 J21: 56 J23... | J0:
M3:138 M17:150 M4:151 M15:226 M10:40 M13:223 M19:266 M8:189 M16:89 M18:211 M1:67 M0:188 M12:76 M7:18 M11:13 M14:152 M2:132 M5:68 M9:165 M6:56
J1:
M2:101 M11:93 M19:256 M16:192 M18:88 M0:237 M5:15 M9:56 M13:232 M12:153 M3:171 M4:79 M15:252 M6:212 M17:80 M10:89 M7:51 M8:228 M14:196 M1:133
J2:
M13:261 M19:90 M14:255... | Solution:
J32-M0: 0+27 -> 27,J34-M1: 0+29 -> 29,J20-M2: 0+8 -> 8,J26-M3: 0+102 -> 102,J39-M4: 0+85 -> 85,J21-M5: 0+126 -> 126,J11-M6: 0+90 -> 90,J36-M8: 0+16 -> 16,J17-M9: 0+187 -> 187,J25-M10: 0+73 -> 73,J9-M11: 0+16 -> 16,J35-M12: 0+89 -> 89,J8-M13: 0+11 -> 11,J22-M15: 0+222 -> 222,J14-M16: 0+26 -> 26,J13-M17: 0+97 -... | 40x20_569.jsp | 40 20
3 138 17 150 4 151 15 226 10 40 13 223 19 266 8 189 16 89 18 211 1 67 0 188 12 76 7 18 11 13 14 152 2 132 5 68 9 165 6 56
2 101 11 93 19 256 16 192 18 88 0 237 5 15 9 56 13 232 12 153 3 171 4 79 15 252 6 212 17 80 10 89 7 51 8 228 14 196 1 133
13 261 19 90 14 255 16 106 7 97 3 31 10 256 0 265 9 176 6 261 1 63 17 ... |
40 | 15 | J0:
M11:250 M6:114 M10:206 M8:85 M13:230 M9:194 M1:57 M7:243 M4:100 M2:133 M14:218 M0:215 M5:129 M12:79 M3:247
J1:
M6:245 M10:80 M7:94 M0:166 M9:169 M13:51 M2:234 M4:20 M3:121 M5:28 M8:38 M11:128 M12:46 M1:107 M14:175
J2:
M7:221 M13:28 M9:133 M5:31 M11:168 M6:147 M2:23 M14:152 M1:20 M3:262 M8:47 M4:47 M12:141 M0:261 ... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J32: 161 J23: 21 J28: 101 J33: 265 J34: 243 J1: 166 J17: 138 J19: 232 J36: 192 J27: 81 J39: 226 J10: 98 J26: 132 J37: 194 J4: 8 J21: 122 J35: 197 J13: 17 J29: 75 J12: 163 J31: 70 J38: 76 J0: 215 J3: 101 J16: 240 J25: 70 J5: 245 J6: 206 J22: 209 J24: 98 J2: 261 J7: 156 J9: 216 J14: 101 J18: 5 J8: 20 J11: 221 J15: 22... | J0:
M11:250 M6:114 M10:206 M8:85 M13:230 M9:194 M1:57 M7:243 M4:100 M2:133 M14:218 M0:215 M5:129 M12:79 M3:247
J1:
M6:245 M10:80 M7:94 M0:166 M9:169 M13:51 M2:234 M4:20 M3:121 M5:28 M8:38 M11:128 M12:46 M1:107 M14:175
J2:
M7:221 M13:28 M9:133 M5:31 M11:168 M6:147 M2:23 M14:152 M1:20 M3:262 M8:47 M4:47 M12:141 M0:261 ... | Solution:
J32-M0: 0+161 -> 161,J39-M2: 0+167 -> 167,J6-M3: 0+87 -> 87,J5-M4: 0+53 -> 53,J8-M5: 0+245 -> 245,J23-M6: 0+76 -> 76,J34-M7: 0+16 -> 16,J38-M8: 0+37 -> 37,J22-M9: 0+132 -> 132,J7-M10: 0+104 -> 104,J27-M11: 0+29 -> 29,J13-M12: 0+40 -> 40,J16-M13: 0+7 -> 7,J16-M1: 7+196 -> 203,J12-M13: 7+153 -> 160,J10-M7: 16+2... | 40x15_924.jsp | 40 15
11 250 6 114 10 206 8 85 13 230 9 194 1 57 7 243 4 100 2 133 14 218 0 215 5 129 12 79 3 247
6 245 10 80 7 94 0 166 9 169 13 51 2 234 4 20 3 121 5 28 8 38 11 128 12 46 1 107 14 175
7 221 13 28 9 133 5 31 11 168 6 147 2 23 14 152 1 20 3 262 8 47 4 47 12 141 0 261 10 193
7 236 2 206 1 254 9 96 4 114 8 172 13 176 10 ... |
50 | 15 | J0:
M11:8 M12:7 M14:5 M8:7 M6:14 M10:5 M2:9 M9:11 M4:5 M3:14 M1:14 M5:10 M7:11 M0:6 M13:5
J1:
M9:11 M8:10 M0:5 M5:5 M4:13 M13:12 M10:7 M1:11 M7:9 M3:12 M12:8 M6:8 M14:10 M11:14 M2:6
J2:
M0:6 M6:6 M4:10 M5:5 M14:9 M2:9 M3:12 M7:12 M13:5 M10:13 M8:10 M11:10 M9:8 M1:12 M12:7
J3:
M1:6 M13:13 M12:12 M5:10 M4:13 M14:5 M6:... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 6 J4: 7 J5: 8 J7: 9 J27: 7 J34: 10 J35: 7 J1: 5 J6: 14 J24: 11 J25: 14 J28: 7 J47: 14 J9: 8 J10: 11 J13: 10 J36: 12 J31: 7 J16: 11 J42: 13 J8: 6 J14: 9 J22: 11 J40: 13 J26: 10 J39: 14 J3: 7 J17: 14 J29: 13 J43: 12 J32: 14 J48: 9 J12: 8 J23: 7 J45: 8 J21: 6 J33: 11 J41: 9 J44: 10 J46: 8 J49: 12 J37: 9 J0: 6 J18:... | J0:
M11:8 M12:7 M14:5 M8:7 M6:14 M10:5 M2:9 M9:11 M4:5 M3:14 M1:14 M5:10 M7:11 M0:6 M13:5
J1:
M9:11 M8:10 M0:5 M5:5 M4:13 M13:12 M10:7 M1:11 M7:9 M3:12 M12:8 M6:8 M14:10 M11:14 M2:6
J2:
M0:6 M6:6 M4:10 M5:5 M14:9 M2:9 M3:12 M7:12 M13:5 M10:13 M8:10 M11:10 M9:8 M1:12 M12:7
J3:
M1:6 M13:13 M12:12 M5:10 M4:13 M14:5 M6:... | Solution:
J2-M0: 0+6 -> 6,J3-M1: 0+6 -> 6,J17-M2: 0+8 -> 8,J26-M3: 0+8 -> 8,J24-M4: 0+11 -> 11,J25-M5: 0+8 -> 8,J40-M6: 0+10 -> 10,J11-M7: 0+5 -> 5,J9-M8: 0+5 -> 5,J30-M9: 0+5 -> 5,J39-M10: 0+6 -> 6,J20-M11: 0+6 -> 6,J49-M12: 0+6 -> 6,J36-M13: 0+9 -> 9,J18-M14: 0+7 -> 7,J14-M8: 5+7 -> 12,J1-M9: 5+11 -> 16,J4-M0: 6+7 ->... | 50x15_681.jsp | 50 15
11 8 12 7 14 5 8 7 6 14 10 5 2 9 9 11 4 5 3 14 1 14 5 10 7 11 0 6 13 5
9 11 8 10 0 5 5 5 4 13 13 12 10 7 1 11 7 9 3 12 12 8 6 8 14 10 11 14 2 6
0 6 6 6 4 10 5 5 14 9 2 9 3 12 7 12 13 5 10 13 8 10 11 10 9 8 1 12 12 7
1 6 13 13 12 12 5 10 4 13 14 5 6 11 11 10 0 7 3 11 9 14 10 11 7 5 2 12 8 9
0 7 3 13 9 6 1 9 5 14 1... |
30 | 20 | J0:
M0:79 M8:32 M15:10 M16:109 M9:214 M17:196 M10:22 M13:97 M12:142 M2:30 M3:52 M11:182 M14:35 M7:162 M19:28 M1:126 M5:103 M4:33 M6:167 M18:100
J1:
M0:206 M14:178 M11:109 M1:14 M9:188 M8:185 M19:132 M10:16 M16:59 M7:41 M18:159 M2:164 M3:87 M5:57 M4:39 M12:122 M6:17 M17:201 M15:200 M13:157
J2:
M11:127 M18:11 M10:120 M... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 79 J1: 206 J4: 126 J23: 201 J8: 87 J10: 149 J22: 188 J21: 10 J24: 30 J7: 147 J16: 60 J20: 142 J5: 63 J9: 32 J11: 133 J25: 56 J27: 20 J2: 83 J12: 167 J17: 31 J19: 142 J6: 15 J15: 209 J14: 133 J18: 35 J29: 193 J3: 206 J26: 25 J28: 64 J13: 146
M1:
J24: 116 J12: 166 J29: 27 J18: 206 J21: 10 J1: 14 J3: 65 J19: 106 ... | J0:
M0:79 M8:32 M15:10 M16:109 M9:214 M17:196 M10:22 M13:97 M12:142 M2:30 M3:52 M11:182 M14:35 M7:162 M19:28 M1:126 M5:103 M4:33 M6:167 M18:100
J1:
M0:206 M14:178 M11:109 M1:14 M9:188 M8:185 M19:132 M10:16 M16:59 M7:41 M18:159 M2:164 M3:87 M5:57 M4:39 M12:122 M6:17 M17:201 M15:200 M13:157
J2:
M11:127 M18:11 M10:120 M... | Solution:
J0-M0: 0+79 -> 79,J24-M1: 0+116 -> 116,J3-M2: 0+116 -> 116,J22-M3: 0+114 -> 114,J14-M4: 0+86 -> 86,J6-M6: 0+94 -> 94,J21-M9: 0+29 -> 29,J11-M10: 0+85 -> 85,J2-M11: 0+127 -> 127,J10-M12: 0+70 -> 70,J26-M13: 0+24 -> 24,J13-M14: 0+167 -> 167,J15-M15: 0+78 -> 78,J25-M16: 0+10 -> 10,J27-M18: 0+31 -> 31,J9-M19: 0+1... | 30x20_2098.jsp | 30 20
0 79 8 32 15 10 16 109 9 214 17 196 10 22 13 97 12 142 2 30 3 52 11 182 14 35 7 162 19 28 1 126 5 103 4 33 6 167 18 100
0 206 14 178 11 109 1 14 9 188 8 185 19 132 10 16 16 59 7 41 18 159 2 164 3 87 5 57 4 39 12 122 6 17 17 201 15 200 13 157
11 127 18 11 10 120 7 80 12 24 5 24 14 201 4 51 1 182 19 99 6 213 17 170... |
40 | 15 | J0:
M5:73 M7:134 M4:103 M12:23 M14:165 M9:14 M6:12 M3:103 M8:104 M0:154 M2:88 M13:56 M11:17 M1:84 M10:92
J1:
M11:154 M2:40 M10:102 M14:114 M12:39 M1:46 M3:90 M7:38 M13:23 M0:15 M4:166 M9:159 M6:27 M5:152 M8:38
J2:
M3:46 M13:79 M14:165 M4:108 M6:131 M12:119 M2:117 M10:33 M7:48 M11:126 M5:61 M0:119 M1:13 M9:14 M8:93
J... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J26: 20 J31: 108 J3: 153 J7: 31 J15: 69 J30: 109 J34: 46 J23: 81 J11: 119 J8: 32 J19: 163 J24: 98 J32: 134 J9: 64 J13: 64 J17: 143 J35: 101 J4: 165 J14: 140 J22: 86 J27: 49 J39: 119 J12: 31 J29: 8 J0: 154 J1: 15 J16: 16 J38: 87 J20: 41 J33: 78 J36: 128 J2: 119 J5: 104 J21: 145 J25: 147 J6: 107 J28: 113 J10: 104 J18... | J0:
M5:73 M7:134 M4:103 M12:23 M14:165 M9:14 M6:12 M3:103 M8:104 M0:154 M2:88 M13:56 M11:17 M1:84 M10:92
J1:
M11:154 M2:40 M10:102 M14:114 M12:39 M1:46 M3:90 M7:38 M13:23 M0:15 M4:166 M9:159 M6:27 M5:152 M8:38
J2:
M3:46 M13:79 M14:165 M4:108 M6:131 M12:119 M2:117 M10:33 M7:48 M11:126 M5:61 M0:119 M1:13 M9:14 M8:93
J... | Solution:
J26-M0: 0+20 -> 20,J14-M1: 0+9 -> 9,J4-M2: 0+111 -> 111,J2-M3: 0+46 -> 46,J39-M4: 0+130 -> 130,J19-M5: 0+16 -> 16,J3-M6: 0+112 -> 112,J35-M7: 0+19 -> 19,J37-M8: 0+53 -> 53,J20-M9: 0+61 -> 61,J12-M10: 0+35 -> 35,J38-M11: 0+76 -> 76,J32-M12: 0+34 -> 34,J33-M14: 0+81 -> 81,J17-M1: 9+104 -> 113,J24-M5: 16+32 -> 4... | 40x15_691.jsp | 40 15
5 73 7 134 4 103 12 23 14 165 9 14 6 12 3 103 8 104 0 154 2 88 13 56 11 17 1 84 10 92
11 154 2 40 10 102 14 114 12 39 1 46 3 90 7 38 13 23 0 15 4 166 9 159 6 27 5 152 8 38
3 46 13 79 14 165 4 108 6 131 12 119 2 117 10 33 7 48 11 126 5 61 0 119 1 13 9 14 8 93
6 112 0 153 8 144 9 75 2 139 7 154 10 167 13 73 5 93 12... |
40 | 20 | J0:
M0:26 M18:26 M11:13 M14:8 M12:51 M10:41 M2:61 M13:15 M8:44 M16:29 M3:47 M7:60 M15:55 M4:17 M9:25 M19:35 M17:49 M6:18 M5:9 M1:40
J1:
M14:14 M3:23 M12:13 M6:57 M17:45 M9:5 M18:51 M1:62 M15:5 M4:42 M11:41 M7:62 M10:58 M0:9 M19:37 M2:52 M8:21 M5:8 M16:24 M13:34
J2:
M7:22 M8:33 M1:27 M5:59 M17:40 M15:55 M6:48 M3:34 M1... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 26 J4: 32 J8: 25 J12: 58 J5: 12 J18: 61 J24: 41 J34: 14 J14: 16 J39: 29 J31: 11 J33: 19 J17: 62 J21: 50 J36: 18 J3: 22 J29: 11 J15: 12 J27: 51 J20: 29 J13: 51 J30: 33 J7: 33 J35: 14 J6: 24 J23: 56 J32: 24 J1: 9 J22: 47 J25: 60 J26: 26 J38: 46 J11: 16 J16: 23 J19: 59 J28: 27 J37: 34 J9: 36 J10: 20 J2: 63
M1:
J7... | J0:
M0:26 M18:26 M11:13 M14:8 M12:51 M10:41 M2:61 M13:15 M8:44 M16:29 M3:47 M7:60 M15:55 M4:17 M9:25 M19:35 M17:49 M6:18 M5:9 M1:40
J1:
M14:14 M3:23 M12:13 M6:57 M17:45 M9:5 M18:51 M1:62 M15:5 M4:42 M11:41 M7:62 M10:58 M0:9 M19:37 M2:52 M8:21 M5:8 M16:24 M13:34
J2:
M7:22 M8:33 M1:27 M5:59 M17:40 M15:55 M6:48 M3:34 M1... | Solution:
J4-M0: 0+32 -> 32,J26-M1: 0+15 -> 15,J27-M3: 0+49 -> 49,J5-M4: 0+13 -> 13,J3-M5: 0+40 -> 40,J2-M7: 0+22 -> 22,J12-M8: 0+10 -> 10,J6-M9: 0+8 -> 8,J20-M10: 0+61 -> 61,J37-M11: 0+50 -> 50,J21-M12: 0+21 -> 21,J13-M14: 0+8 -> 8,J8-M15: 0+7 -> 7,J31-M16: 0+59 -> 59,J34-M17: 0+47 -> 47,J35-M18: 0+6 -> 6,J25-M19: 0+2... | 40x20_570.jsp | 40 20
0 26 18 26 11 13 14 8 12 51 10 41 2 61 13 15 8 44 16 29 3 47 7 60 15 55 4 17 9 25 19 35 17 49 6 18 5 9 1 40
14 14 3 23 12 13 6 57 17 45 9 5 18 51 1 62 15 5 4 42 11 41 7 62 10 58 0 9 19 37 2 52 8 21 5 8 16 24 13 34
7 22 8 33 1 27 5 59 17 40 15 55 6 48 3 34 11 63 18 5 19 60 14 53 4 58 16 59 2 60 9 7 10 61 12 47 13 ... |
50 | 20 | J0:
M11:222 M0:25 M6:55 M5:134 M1:136 M18:73 M10:9 M15:92 M2:150 M19:43 M3:138 M14:226 M8:13 M7:180 M4:185 M16:173 M9:183 M12:27 M17:158 M13:183
J1:
M14:64 M0:223 M2:145 M6:199 M3:133 M1:212 M9:46 M15:186 M18:99 M5:150 M13:68 M19:188 M12:162 M7:206 M10:120 M11:38 M8:180 M17:100 M16:48 M4:27
J2:
M8:221 M4:92 M10:169 M... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J13: 174 J17: 175 J22: 163 J0: 25 J1: 223 J16: 31 J32: 106 J3: 140 J23: 30 J24: 5 J39: 82 J40: 106 J10: 154 J5: 36 J11: 35 J49: 124 J26: 99 J15: 162 J20: 201 J31: 60 J21: 105 J37: 170 J8: 94 J18: 127 J44: 94 J9: 207 J35: 34 J41: 78 J45: 147 J47: 109 J46: 140 J42: 208 J48: 154 J12: 183 J28: 96 J30: 87 J33: 202 J36: ... | J0:
M11:222 M0:25 M6:55 M5:134 M1:136 M18:73 M10:9 M15:92 M2:150 M19:43 M3:138 M14:226 M8:13 M7:180 M4:185 M16:173 M9:183 M12:27 M17:158 M13:183
J1:
M14:64 M0:223 M2:145 M6:199 M3:133 M1:212 M9:46 M15:186 M18:99 M5:150 M13:68 M19:188 M12:162 M7:206 M10:120 M11:38 M8:180 M17:100 M16:48 M4:27
J2:
M8:221 M4:92 M10:169 M... | Solution:
J22-M0: 0+163 -> 163,J26-M1: 0+47 -> 47,J14-M2: 0+101 -> 101,J19-M3: 0+185 -> 185,J36-M5: 0+89 -> 89,J34-M6: 0+33 -> 33,J42-M7: 0+57 -> 57,J20-M8: 0+133 -> 133,J16-M9: 0+100 -> 100,J28-M10: 0+51 -> 51,J47-M11: 0+30 -> 30,J7-M13: 0+143 -> 143,J1-M14: 0+64 -> 64,J38-M15: 0+34 -> 34,J44-M16: 0+49 -> 49,J40-M17: ... | 50x20_805.jsp | 50 20
11 222 0 25 6 55 5 134 1 136 18 73 10 9 15 92 2 150 19 43 3 138 14 226 8 13 7 180 4 185 16 173 9 183 12 27 17 158 13 183
14 64 0 223 2 145 6 199 3 133 1 212 9 46 15 186 18 99 5 150 13 68 19 188 12 162 7 206 10 120 11 38 8 180 17 100 16 48 4 27
8 221 4 92 10 169 16 80 3 76 17 94 15 128 5 86 14 105 7 110 1 10 13 7 ... |
50 | 20 | J0:
M15:22 M3:140 M9:116 M6:27 M16:16 M13:79 M8:113 M4:175 M12:14 M7:176 M5:141 M10:165 M1:10 M18:66 M0:37 M19:8 M11:18 M14:146 M17:156 M2:115
J1:
M10:17 M11:51 M2:137 M6:104 M16:73 M13:41 M0:126 M4:150 M19:104 M8:73 M14:130 M1:78 M15:57 M12:31 M3:177 M5:64 M18:82 M7:141 M17:39 M9:15
J2:
M12:143 M0:180 M19:72 M6:177 ... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 180 J7: 43 J9: 50 J29: 28 J31: 111 J42: 59 J48: 172 J39: 118 J4: 31 J1: 126 J3: 165 J17: 65 J23: 7 J25: 168 J37: 79 J15: 86 J20: 116 J21: 19 J38: 157 J46: 59 J49: 154 J30: 78 J32: 164 J34: 80 J24: 12 J26: 97 J27: 71 J12: 39 J16: 25 J35: 103 J5: 68 J11: 182 J18: 134 J0: 37 J6: 101 J33: 30 J40: 139 J28: 67 J43: 1... | J0:
M15:22 M3:140 M9:116 M6:27 M16:16 M13:79 M8:113 M4:175 M12:14 M7:176 M5:141 M10:165 M1:10 M18:66 M0:37 M19:8 M11:18 M14:146 M17:156 M2:115
J1:
M10:17 M11:51 M2:137 M6:104 M16:73 M13:41 M0:126 M4:150 M19:104 M8:73 M14:130 M1:78 M15:57 M12:31 M3:177 M5:64 M18:82 M7:141 M17:39 M9:15
J2:
M12:143 M0:180 M19:72 M6:177 ... | Solution:
J20-M1: 0+59 -> 59,J31-M2: 0+102 -> 102,J16-M3: 0+31 -> 31,J24-M4: 0+42 -> 42,J13-M5: 0+65 -> 65,J37-M6: 0+19 -> 19,J27-M7: 0+116 -> 116,J33-M8: 0+161 -> 161,J6-M9: 0+116 -> 116,J1-M10: 0+17 -> 17,J26-M11: 0+95 -> 95,J10-M12: 0+21 -> 21,J46-M13: 0+11 -> 11,J38-M14: 0+49 -> 49,J0-M15: 0+22 -> 22,J47-M17: 0+59 ... | 50x20_845.jsp | 50 20
15 22 3 140 9 116 6 27 16 16 13 79 8 113 4 175 12 14 7 176 5 141 10 165 1 10 18 66 0 37 19 8 11 18 14 146 17 156 2 115
10 17 11 51 2 137 6 104 16 73 13 41 0 126 4 150 19 104 8 73 14 130 1 78 15 57 12 31 3 177 5 64 18 82 7 141 17 39 9 15
12 143 0 180 19 72 6 177 14 40 2 178 7 169 9 184 5 103 1 138 3 89 4 137 10 53... |
100 | 50 | J0:
M37:103 M38:34 M43:39 M26:40 M35:33 M32:79 M30:89 M15:82 M21:84 M34:80 M25:48 M17:14 M44:91 M47:9 M14:6 M6:18 M22:90 M39:11 M7:19 M13:55 M10:5 M20:102 M12:6 M9:77 M23:74 M18:50 M3:51 M28:8 M42:5 M0:86 M8:100 M1:29 M29:62 M19:90 M33:83 M4:105 M27:102 M46:23 M2:77 M36:104 M49:78 M45:60 M11:23 M40:68 M31:42 M48:100 M1... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J83: 26 J8: 15 J42: 48 J74: 63 J28: 69 J52: 75 J62: 102 J64: 102 J76: 74 J33: 73 J46: 62 J65: 40 J16: 71 J53: 23 J94: 16 J3: 104 J9: 19 J75: 82 J26: 84 J34: 34 J44: 42 J98: 31 J84: 19 J7: 91 J18: 50 J24: 10 J41: 5 J72: 54 J31: 95 J78: 79 J56: 65 J71: 8 J32: 99 J90: 8 J99: 55 J19: 26 J36: 11 J12: 29 J25: 62 J50: 23 ... | J0:
M37:103 M38:34 M43:39 M26:40 M35:33 M32:79 M30:89 M15:82 M21:84 M34:80 M25:48 M17:14 M44:91 M47:9 M14:6 M6:18 M22:90 M39:11 M7:19 M13:55 M10:5 M20:102 M12:6 M9:77 M23:74 M18:50 M3:51 M28:8 M42:5 M0:86 M8:100 M1:29 M29:62 M19:90 M33:83 M4:105 M27:102 M46:23 M2:77 M36:104 M49:78 M45:60 M11:23 M40:68 M31:42 M48:100 M1... | Solution:
J27-M1: 0+30 -> 30,J46-M2: 0+12 -> 12,J48-M3: 0+72 -> 72,J32-M4: 0+43 -> 43,J96-M5: 0+64 -> 64,J1-M6: 0+16 -> 16,J67-M7: 0+52 -> 52,J53-M8: 0+16 -> 16,J43-M9: 0+30 -> 30,J4-M10: 0+25 -> 25,J75-M12: 0+82 -> 82,J63-M13: 0+41 -> 41,J52-M14: 0+54 -> 54,J65-M16: 0+76 -> 76,J64-M17: 0+73 -> 73,J12-M19: 0+49 -> 49,J... | 100x50_3534.jsp | 100 50
37 103 38 34 43 39 26 40 35 33 32 79 30 89 15 82 21 84 34 80 25 48 17 14 44 91 47 9 14 6 6 18 22 90 39 11 7 19 13 55 10 5 20 102 12 6 9 77 23 74 18 50 3 51 28 8 42 5 0 86 8 100 1 29 29 62 19 90 33 83 4 105 27 102 46 23 2 77 36 104 49 78 45 60 11 23 40 68 31 42 48 100 16 26 5 17 41 87 24 6
6 16 5 79 10 103 30 43 ... |
50 | 15 | J0:
M13:10 M8:17 M14:128 M12:67 M7:24 M11:116 M9:83 M3:98 M0:47 M6:68 M4:69 M5:96 M1:146 M10:141 M2:44
J1:
M4:126 M10:137 M6:42 M9:16 M12:56 M0:7 M8:17 M7:124 M3:119 M1:16 M11:62 M14:65 M2:42 M5:18 M13:52
J2:
M14:7 M11:53 M13:99 M0:26 M2:85 M4:115 M7:56 M8:65 M12:96 M9:68 M1:73 M10:86 M6:144 M5:76 M3:116
J3:
M6:6 M8... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J13: 137 J6: 136 J27: 62 J28: 45 J47: 36 J9: 55 J24: 27 J38: 47 J49: 76 J2: 26 J17: 6 J26: 27 J36: 102 J44: 137 J3: 97 J18: 45 J1: 7 J20: 83 J32: 106 J34: 149 J35: 79 J37: 125 J39: 126 J41: 12 J48: 71 J8: 19 J15: 96 J0: 47 J30: 147 J43: 15 J45: 141 J5: 71 J23: 11 J46: 19 J4: 150 J19: 108 J25: 22 J7: 121 J12: 69 J14... | J0:
M13:10 M8:17 M14:128 M12:67 M7:24 M11:116 M9:83 M3:98 M0:47 M6:68 M4:69 M5:96 M1:146 M10:141 M2:44
J1:
M4:126 M10:137 M6:42 M9:16 M12:56 M0:7 M8:17 M7:124 M3:119 M1:16 M11:62 M14:65 M2:42 M5:18 M13:52
J2:
M14:7 M11:53 M13:99 M0:26 M2:85 M4:115 M7:56 M8:65 M12:96 M9:68 M1:73 M10:86 M6:144 M5:76 M3:116
J3:
M6:6 M8... | Solution:
J13-M0: 0+137 -> 137,J49-M1: 0+21 -> 21,J21-M2: 0+6 -> 6,J9-M4: 0+9 -> 9,J29-M5: 0+18 -> 18,J3-M6: 0+6 -> 6,J19-M7: 0+42 -> 42,J35-M8: 0+15 -> 15,J32-M9: 0+97 -> 97,J46-M10: 0+5 -> 5,J40-M11: 0+66 -> 66,J22-M12: 0+84 -> 84,J0-M13: 0+10 -> 10,J2-M14: 0+7 -> 7,J4-M10: 5+16 -> 21,J37-M2: 6+9 -> 15,J38-M6: 6+142 ... | 50x15_457.jsp | 50 15
13 10 8 17 14 128 12 67 7 24 11 116 9 83 3 98 0 47 6 68 4 69 5 96 1 146 10 141 2 44
4 126 10 137 6 42 9 16 12 56 0 7 8 17 7 124 3 119 1 16 11 62 14 65 2 42 5 18 13 52
14 7 11 53 13 99 0 26 2 85 4 115 7 56 8 65 12 96 9 68 1 73 10 86 6 144 5 76 3 116
6 6 8 139 1 52 9 135 0 97 11 136 13 83 14 49 2 109 5 117 4 21 10 ... |
50 | 15 | J0:
M13:58 M0:10 M12:14 M11:34 M4:25 M7:34 M5:17 M10:13 M8:53 M6:22 M9:58 M2:50 M3:53 M1:27 M14:17
J1:
M10:25 M13:59 M8:41 M4:43 M5:48 M2:36 M11:18 M3:16 M9:21 M14:16 M6:56 M0:45 M1:8 M7:14 M12:5
J2:
M4:28 M5:29 M7:9 M9:6 M10:10 M8:15 M2:54 M11:26 M12:8 M0:21 M13:23 M14:7 M6:34 M3:13 M1:37
J3:
M8:12 M14:47 M7:52 M1:... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 27 J14: 55 J33: 60 J41: 14 J43: 16 J0: 10 J20: 30 J46: 7 J48: 16 J45: 30 J17: 31 J32: 6 J40: 59 J4: 33 J13: 8 J21: 40 J16: 42 J22: 55 J24: 52 J25: 43 J15: 60 J27: 15 J31: 52 J30: 28 J35: 19 J47: 10 J3: 56 J6: 57 J38: 54 J49: 13 J2: 21 J9: 59 J18: 59 J19: 50 J29: 45 J1: 45 J11: 54 J28: 20 J34: 21 J36: 40 J26: 46... | J0:
M13:58 M0:10 M12:14 M11:34 M4:25 M7:34 M5:17 M10:13 M8:53 M6:22 M9:58 M2:50 M3:53 M1:27 M14:17
J1:
M10:25 M13:59 M8:41 M4:43 M5:48 M2:36 M11:18 M3:16 M9:21 M14:16 M6:56 M0:45 M1:8 M7:14 M12:5
J2:
M4:28 M5:29 M7:9 M9:6 M10:10 M8:15 M2:54 M11:26 M12:8 M0:21 M13:23 M14:7 M6:34 M3:13 M1:37
J3:
M8:12 M14:47 M7:52 M1:... | Solution:
J41-M0: 0+14 -> 14,J49-M1: 0+10 -> 10,J7-M2: 0+13 -> 13,J30-M3: 0+5 -> 5,J39-M4: 0+17 -> 17,J18-M5: 0+11 -> 11,J48-M6: 0+42 -> 42,J24-M7: 0+9 -> 9,J3-M8: 0+12 -> 12,J6-M10: 0+20 -> 20,J17-M11: 0+35 -> 35,J9-M12: 0+42 -> 42,J0-M13: 0+58 -> 58,J29-M14: 0+14 -> 14,J42-M3: 5+38 -> 43,J37-M7: 9+15 -> 24,J22-M1: 10... | 50x15_971.jsp | 50 15
13 58 0 10 12 14 11 34 4 25 7 34 5 17 10 13 8 53 6 22 9 58 2 50 3 53 1 27 14 17
10 25 13 59 8 41 4 43 5 48 2 36 11 18 3 16 9 21 14 16 6 56 0 45 1 8 7 14 12 5
4 28 5 29 7 9 9 6 10 10 8 15 2 54 11 26 12 8 0 21 13 23 14 7 6 34 3 13 1 37
8 12 14 47 7 52 1 48 13 53 5 16 3 5 6 52 0 56 2 5 9 22 10 5 12 20 4 57 11 22
10 ... |
50 | 15 | J0:
M6:118 M13:86 M10:122 M7:260 M5:148 M2:71 M3:172 M12:197 M4:229 M14:218 M1:83 M8:57 M11:64 M9:83 M0:247
J1:
M0:237 M13:230 M4:117 M14:164 M7:248 M2:124 M12:184 M8:236 M10:224 M6:183 M9:16 M5:42 M1:123 M11:157 M3:123
J2:
M9:195 M8:188 M12:48 M5:22 M10:106 M1:146 M14:111 M11:186 M7:174 M3:220 M0:195 M6:148 M4:232 M... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J1: 237 J15: 130 J40: 165 J9: 239 J10: 71 J11: 181 J16: 257 J44: 171 J34: 238 J47: 247 J39: 41 J4: 107 J5: 213 J13: 68 J27: 171 J28: 156 J7: 73 J8: 73 J24: 127 J43: 195 J49: 37 J33: 237 J6: 251 J14: 66 J23: 108 J37: 99 J38: 185 J42: 258 J3: 183 J36: 142 J46: 182 J17: 189 J22: 235 J2: 195 J35: 43 J48: 129 J29: 151 J... | J0:
M6:118 M13:86 M10:122 M7:260 M5:148 M2:71 M3:172 M12:197 M4:229 M14:218 M1:83 M8:57 M11:64 M9:83 M0:247
J1:
M0:237 M13:230 M4:117 M14:164 M7:248 M2:124 M12:184 M8:236 M10:224 M6:183 M9:16 M5:42 M1:123 M11:157 M3:123
J2:
M9:195 M8:188 M12:48 M5:22 M10:106 M1:146 M14:111 M11:186 M7:174 M3:220 M0:195 M6:148 M4:232 M... | Solution:
J15-M0: 0+130 -> 130,J12-M2: 0+8 -> 8,J24-M3: 0+55 -> 55,J14-M4: 0+31 -> 31,J35-M5: 0+87 -> 87,J28-M6: 0+61 -> 61,J4-M7: 0+54 -> 54,J9-M8: 0+22 -> 22,J33-M9: 0+191 -> 191,J11-M10: 0+32 -> 32,J46-M11: 0+116 -> 116,J30-M12: 0+72 -> 72,J34-M13: 0+37 -> 37,J37-M14: 0+85 -> 85,J17-M2: 8+202 -> 210,J42-M8: 22+113 -... | 50x15_754.jsp | 50 15
6 118 13 86 10 122 7 260 5 148 2 71 3 172 12 197 4 229 14 218 1 83 8 57 11 64 9 83 0 247
0 237 13 230 4 117 14 164 7 248 2 124 12 184 8 236 10 224 6 183 9 16 5 42 1 123 11 157 3 123
9 195 8 188 12 48 5 22 10 106 1 146 14 111 11 186 7 174 3 220 0 195 6 148 4 232 2 192 13 222
10 129 1 67 14 51 13 57 12 132 3 90 5 9... |
40 | 40 | J0:
M28:287 M7:154 M12:188 M35:64 M5:260 M39:258 M10:97 M9:71 M0:262 M11:226 M20:155 M19:269 M16:23 M2:76 M38:105 M26:243 M36:220 M33:270 M31:231 M4:9 M18:158 M17:229 M6:259 M37:243 M3:103 M15:79 M27:80 M34:42 M32:101 M22:13 M24:22 M8:158 M14:16 M25:98 M1:166 M23:45 M21:87 M30:102 M29:102 M13:129
J1:
M8:269 M11:250 M3... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J11: 88 J12: 183 J17: 194 J28: 213 J34: 184 J25: 10 J0: 262 J13: 136 J14: 130 J36: 207 J19: 95 J21: 27 J31: 277 J37: 19 J3: 227 J8: 94 J33: 41 J9: 126 J20: 280 J32: 105 J18: 251 J26: 285 J2: 206 J30: 272 J38: 167 J10: 175 J23: 239 J5: 44 J7: 217 J24: 155 J6: 76 J29: 80 J4: 164 J16: 132 J22: 126 J39: 132 J15: 81 J27... | J0:
M28:287 M7:154 M12:188 M35:64 M5:260 M39:258 M10:97 M9:71 M0:262 M11:226 M20:155 M19:269 M16:23 M2:76 M38:105 M26:243 M36:220 M33:270 M31:231 M4:9 M18:158 M17:229 M6:259 M37:243 M3:103 M15:79 M27:80 M34:42 M32:101 M22:13 M24:22 M8:158 M14:16 M25:98 M1:166 M23:45 M21:87 M30:102 M29:102 M13:129
J1:
M8:269 M11:250 M3... | Solution:
J11-M0: 0+88 -> 88,J16-M2: 0+109 -> 109,J25-M3: 0+174 -> 174,J33-M4: 0+23 -> 23,J17-M5: 0+129 -> 129,J24-M6: 0+79 -> 79,J32-M7: 0+268 -> 268,J31-M8: 0+222 -> 222,J2-M9: 0+251 -> 251,J15-M10: 0+182 -> 182,J38-M11: 0+273 -> 273,J4-M14: 0+8 -> 8,J9-M17: 0+62 -> 62,J26-M20: 0+79 -> 79,J34-M22: 0+30 -> 30,J39-M23:... | 40x40_1659.jsp | 40 40
28 287 7 154 12 188 35 64 5 260 39 258 10 97 9 71 0 262 11 226 20 155 19 269 16 23 2 76 38 105 26 243 36 220 33 270 31 231 4 9 18 158 17 229 6 259 37 243 3 103 15 79 27 80 34 42 32 101 22 13 24 22 8 158 14 16 25 98 1 166 23 45 21 87 30 102 29 102 13 129
8 269 11 250 33 16 4 25 39 287 37 98 24 11 20 79 3 188 35 26... |
40 | 15 | J0:
M5:15 M9:7 M8:12 M0:10 M13:5 M7:12 M2:12 M3:6 M12:13 M1:12 M11:11 M4:5 M14:5 M6:10 M10:6
J1:
M12:10 M3:16 M14:16 M13:11 M9:8 M11:10 M7:8 M8:7 M4:6 M0:5 M10:6 M6:8 M1:8 M2:15 M5:11
J2:
M2:9 M1:6 M4:14 M9:6 M11:13 M3:16 M14:6 M7:6 M8:16 M5:13 M0:7 M13:14 M12:9 M10:11 M6:16
J3:
M12:6 M4:5 M13:5 M14:6 M0:6 M8:16 M2:... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 10 J7: 5 J12: 11 J30: 16 J18: 5 J39: 14 J10: 10 J28: 8 J35: 10 J0: 10 J13: 12 J38: 6 J3: 6 J19: 14 J26: 5 J27: 7 J34: 16 J8: 5 J11: 5 J25: 15 J31: 13 J33: 10 J16: 14 J21: 5 J22: 11 J1: 5 J14: 14 J17: 10 J24: 9 J2: 7 J6: 9 J15: 11 J36: 13 J9: 9 J29: 15 J32: 7 J4: 13 J20: 10 J23: 13 J37: 10
M1:
J21: 9 J24: 10 J2... | J0:
M5:15 M9:7 M8:12 M0:10 M13:5 M7:12 M2:12 M3:6 M12:13 M1:12 M11:11 M4:5 M14:5 M6:10 M10:6
J1:
M12:10 M3:16 M14:16 M13:11 M9:8 M11:10 M7:8 M8:7 M4:6 M0:5 M10:6 M6:8 M1:8 M2:15 M5:11
J2:
M2:9 M1:6 M4:14 M9:6 M11:13 M3:16 M14:6 M7:6 M8:16 M5:13 M0:7 M13:14 M12:9 M10:11 M6:16
J3:
M12:6 M4:5 M13:5 M14:6 M0:6 M8:16 M2:... | Solution:
J7-M0: 0+5 -> 5,J21-M1: 0+9 -> 9,J2-M2: 0+9 -> 9,J36-M4: 0+5 -> 5,J25-M5: 0+7 -> 7,J13-M6: 0+5 -> 5,J39-M7: 0+7 -> 7,J17-M8: 0+16 -> 16,J35-M9: 0+9 -> 9,J6-M10: 0+7 -> 7,J22-M11: 0+5 -> 5,J3-M12: 0+6 -> 6,J26-M13: 0+5 -> 5,J8-M14: 0+6 -> 6,J5-M0: 5+10 -> 15,J10-M4: 5+16 -> 21,J31-M6: 5+7 -> 12,J23-M11: 5+5 ->... | 40x15_497.jsp | 40 15
5 15 9 7 8 12 0 10 13 5 7 12 2 12 3 6 12 13 1 12 11 11 4 5 14 5 6 10 10 6
12 10 3 16 14 16 13 11 9 8 11 10 7 8 8 7 4 6 0 5 10 6 6 8 1 8 2 15 5 11
2 9 1 6 4 14 9 6 11 13 3 16 14 6 7 6 8 16 5 13 0 7 13 14 12 9 10 11 6 16
12 6 4 5 13 5 14 6 0 6 8 16 2 10 11 12 6 13 9 9 10 15 5 12 3 7 1 14 7 5
5 10 2 7 13 5 3 14 1 11... |
30 | 30 | J0:
M13:18 M17:50 M2:137 M3:115 M29:120 M5:163 M14:145 M4:59 M18:109 M7:21 M0:111 M25:29 M21:18 M11:39 M26:78 M1:62 M23:34 M24:67 M20:69 M19:85 M27:49 M6:31 M8:12 M22:158 M15:155 M10:22 M9:162 M28:79 M12:99 M16:36
J1:
M13:47 M19:134 M15:123 M7:108 M10:110 M22:153 M17:133 M0:91 M11:94 M26:162 M24:70 M3:114 M14:155 M28:... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 176 J22: 23 J3: 192 J23: 140 J12: 94 J18: 14 J1: 91 J10: 126 J0: 111 J14: 119 J9: 94 J13: 149 J17: 124 J29: 173 J4: 194 J6: 155 J7: 92 J24: 149 J25: 167 J26: 167 J5: 152 J8: 32 J11: 14 J16: 76 J19: 65 J21: 95 J20: 84 J27: 187 J15: 132 J28: 164
M1:
J13: 137 J2: 113 J18: 113 J12: 131 J27: 11 J17: 24 J5: 83 J7: 1... | J0:
M13:18 M17:50 M2:137 M3:115 M29:120 M5:163 M14:145 M4:59 M18:109 M7:21 M0:111 M25:29 M21:18 M11:39 M26:78 M1:62 M23:34 M24:67 M20:69 M19:85 M27:49 M6:31 M8:12 M22:158 M15:155 M10:22 M9:162 M28:79 M12:99 M16:36
J1:
M13:47 M19:134 M15:123 M7:108 M10:110 M22:153 M17:133 M0:91 M11:94 M26:162 M24:70 M3:114 M14:155 M28:... | Solution:
J11-M2: 0+190 -> 190,J26-M3: 0+113 -> 113,J10-M5: 0+68 -> 68,J12-M6: 0+143 -> 143,J20-M7: 0+37 -> 37,J6-M11: 0+76 -> 76,J29-M12: 0+97 -> 97,J0-M13: 0+18 -> 18,J16-M14: 0+35 -> 35,J17-M17: 0+111 -> 111,J24-M18: 0+87 -> 87,J28-M20: 0+79 -> 79,J3-M21: 0+165 -> 165,J15-M22: 0+5 -> 5,J27-M23: 0+44 -> 44,J2-M24: 0+... | 30x30_418.jsp | 30 30
13 18 17 50 2 137 3 115 29 120 5 163 14 145 4 59 18 109 7 21 0 111 25 29 21 18 11 39 26 78 1 62 23 34 24 67 20 69 19 85 27 49 6 31 8 12 22 158 15 155 10 22 9 162 28 79 12 99 16 36
13 47 19 134 15 123 7 108 10 110 22 153 17 133 0 91 11 94 26 162 24 70 3 114 14 155 28 191 8 179 25 154 1 12 23 170 6 85 4 130 21 106 ... |
50 | 15 | J0:
M12:168 M6:186 M14:17 M1:54 M0:93 M10:24 M11:96 M3:181 M13:67 M9:87 M5:133 M8:156 M7:172 M4:33 M2:62
J1:
M13:136 M12:81 M14:106 M0:158 M1:99 M7:72 M10:167 M2:191 M8:172 M3:27 M4:57 M5:22 M6:116 M11:74 M9:93
J2:
M8:161 M4:66 M3:91 M7:105 M10:112 M9:88 M13:59 M1:12 M2:65 M14:6 M0:163 M12:149 M6:77 M5:75 M11:15
J3:... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 178 J24: 90 J43: 27 J30: 104 J7: 140 J21: 174 J45: 19 J1: 158 J17: 46 J31: 104 J46: 163 J0: 93 J28: 85 J39: 33 J40: 16 J41: 15 J8: 46 J20: 188 J15: 76 J19: 127 J27: 114 J12: 108 J14: 64 J37: 170 J44: 173 J18: 28 J22: 195 J33: 123 J47: 182 J26: 191 J35: 195 J2: 163 J4: 176 J9: 90 J16: 141 J34: 107 J49: 29 J6: 17... | J0:
M12:168 M6:186 M14:17 M1:54 M0:93 M10:24 M11:96 M3:181 M13:67 M9:87 M5:133 M8:156 M7:172 M4:33 M2:62
J1:
M13:136 M12:81 M14:106 M0:158 M1:99 M7:72 M10:167 M2:191 M8:172 M3:27 M4:57 M5:22 M6:116 M11:74 M9:93
J2:
M8:161 M4:66 M3:91 M7:105 M10:112 M9:88 M13:59 M1:12 M2:65 M14:6 M0:163 M12:149 M6:77 M5:75 M11:15
J3:... | Solution:
J43-M0: 0+27 -> 27,J31-M1: 0+46 -> 46,J22-M2: 0+6 -> 6,J7-M3: 0+80 -> 80,J10-M4: 0+203 -> 203,J23-M6: 0+14 -> 14,J9-M7: 0+85 -> 85,J29-M8: 0+77 -> 77,J28-M9: 0+65 -> 65,J17-M10: 0+55 -> 55,J19-M11: 0+17 -> 17,J32-M12: 0+11 -> 11,J34-M13: 0+128 -> 128,J25-M14: 0+106 -> 106,J41-M2: 6+16 -> 22,J22-M12: 11+45 -> ... | 50x15_184.jsp | 50 15
12 168 6 186 14 17 1 54 0 93 10 24 11 96 3 181 13 67 9 87 5 133 8 156 7 172 4 33 2 62
13 136 12 81 14 106 0 158 1 99 7 72 10 167 2 191 8 172 3 27 4 57 5 22 6 116 11 74 9 93
8 161 4 66 3 91 7 105 10 112 9 88 13 59 1 12 2 65 14 6 0 163 12 149 6 77 5 75 11 15
0 178 14 61 12 22 7 86 10 115 3 201 11 175 6 205 13 33 4 ... |
30 | 15 | J0:
M8:14 M12:34 M5:7 M3:7 M4:9 M0:10 M7:27 M14:22 M13:5 M1:13 M2:25 M11:6 M9:36 M10:24 M6:33
J1:
M1:31 M5:9 M12:35 M14:29 M8:18 M0:32 M7:17 M3:37 M10:25 M13:35 M11:19 M2:18 M4:26 M9:30 M6:13
J2:
M1:32 M4:19 M8:22 M7:35 M0:37 M6:38 M13:27 M14:31 M9:13 M3:27 M11:22 M10:16 M12:26 M2:21 M5:19
J3:
M0:9 M4:24 M2:38 M7:36... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 9 J10: 8 J14: 28 J16: 37 J23: 35 J5: 36 J7: 17 J13: 21 J6: 6 J9: 24 J19: 38 J2: 37 J20: 26 J0: 10 J1: 32 J21: 8 J17: 7 J4: 11 J11: 24 J25: 16 J26: 10 J8: 33 J15: 28 J18: 30 J22: 14 J29: 36 J12: 28 J24: 34 J27: 12 J28: 12
M1:
J1: 31 J2: 32 J9: 12 J12: 26 J11: 30 J21: 16 J23: 27 J3: 6 J13: 23 J14: 31 J15: 6 J17:... | J0:
M8:14 M12:34 M5:7 M3:7 M4:9 M0:10 M7:27 M14:22 M13:5 M1:13 M2:25 M11:6 M9:36 M10:24 M6:33
J1:
M1:31 M5:9 M12:35 M14:29 M8:18 M0:32 M7:17 M3:37 M10:25 M13:35 M11:19 M2:18 M4:26 M9:30 M6:13
J2:
M1:32 M4:19 M8:22 M7:35 M0:37 M6:38 M13:27 M14:31 M9:13 M3:27 M11:22 M10:16 M12:26 M2:21 M5:19
J3:
M0:9 M4:24 M2:38 M7:36... | Solution:
J10-M0: 0+8 -> 8,J9-M1: 0+12 -> 12,J27-M2: 0+14 -> 14,J29-M3: 0+11 -> 11,J4-M4: 0+22 -> 22,J7-M5: 0+7 -> 7,J13-M6: 0+26 -> 26,J19-M7: 0+9 -> 9,J0-M8: 0+14 -> 14,J20-M9: 0+23 -> 23,J24-M11: 0+30 -> 30,J18-M12: 0+13 -> 13,J8-M13: 0+5 -> 5,J8-M10: 5+34 -> 39,J6-M13: 5+16 -> 21,J5-M5: 7+32 -> 39,J3-M0: 8+9 -> 17,... | 30x15_509.jsp | 30 15
8 14 12 34 5 7 3 7 4 9 0 10 7 27 14 22 13 5 1 13 2 25 11 6 9 36 10 24 6 33
1 31 5 9 12 35 14 29 8 18 0 32 7 17 3 37 10 25 13 35 11 19 2 18 4 26 9 30 6 13
1 32 4 19 8 22 7 35 0 37 6 38 13 27 14 31 9 13 3 27 11 22 10 16 12 26 2 21 5 19
0 9 4 24 2 38 7 36 1 6 6 19 10 31 14 24 9 31 11 27 5 31 13 16 12 7 8 33 3 27
4 2... |
30 | 20 | J0:
M5:114 M15:54 M8:132 M10:79 M3:102 M14:78 M12:116 M19:44 M17:56 M0:156 M4:28 M13:30 M9:126 M16:49 M1:84 M11:151 M6:56 M2:15 M7:110 M18:148
J1:
M13:17 M18:137 M3:116 M5:140 M8:145 M9:75 M4:97 M15:28 M19:8 M1:102 M0:122 M14:54 M17:66 M6:121 M16:17 M7:22 M2:67 M11:73 M12:151 M10:48
J2:
M4:162 M17:161 M1:115 M10:130 ... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J10: 68 J18: 129 J12: 73 J5: 118 J13: 66 J25: 46 J2: 154 J16: 35 J20: 65 J0: 156 J14: 92 J1: 122 J4: 8 J28: 56 J3: 44 J24: 7 J21: 78 J26: 47 J8: 107 J23: 87 J29: 122 J22: 91 J27: 15 J6: 157 J9: 102 J11: 110 J15: 89 J7: 105 J17: 11 J19: 123
M1:
J3: 31 J7: 130 J2: 115 J8: 59 J13: 115 J22: 86 J5: 8 J28: 104 J23: 135 ... | J0:
M5:114 M15:54 M8:132 M10:79 M3:102 M14:78 M12:116 M19:44 M17:56 M0:156 M4:28 M13:30 M9:126 M16:49 M1:84 M11:151 M6:56 M2:15 M7:110 M18:148
J1:
M13:17 M18:137 M3:116 M5:140 M8:145 M9:75 M4:97 M15:28 M19:8 M1:102 M0:122 M14:54 M17:66 M6:121 M16:17 M7:22 M2:67 M11:73 M12:151 M10:48
J2:
M4:162 M17:161 M1:115 M10:130 ... | Solution:
J10-M0: 0+68 -> 68,J3-M1: 0+31 -> 31,J23-M3: 0+124 -> 124,J2-M4: 0+162 -> 162,J0-M5: 0+114 -> 114,J6-M8: 0+106 -> 106,J12-M9: 0+18 -> 18,J5-M10: 0+72 -> 72,J19-M11: 0+19 -> 19,J20-M12: 0+116 -> 116,J1-M13: 0+17 -> 17,J22-M14: 0+21 -> 21,J11-M15: 0+67 -> 67,J27-M16: 0+28 -> 28,J15-M17: 0+30 -> 30,J26-M19: 0+24... | 30x20_1598.jsp | 30 20
5 114 15 54 8 132 10 79 3 102 14 78 12 116 19 44 17 56 0 156 4 28 13 30 9 126 16 49 1 84 11 151 6 56 2 15 7 110 18 148
13 17 18 137 3 116 5 140 8 145 9 75 4 97 15 28 19 8 1 102 0 122 14 54 17 66 6 121 16 17 7 22 2 67 11 73 12 151 10 48
4 162 17 161 1 115 10 130 18 145 8 100 3 25 0 154 9 125 7 87 13 29 19 106 12 1... |
50 | 20 | J0:
M5:17 M13:31 M15:33 M18:22 M16:9 M2:22 M0:32 M8:26 M11:12 M9:35 M4:53 M7:23 M14:24 M10:35 M6:40 M1:19 M3:18 M12:31 M19:9 M17:22
J1:
M5:33 M6:37 M2:10 M15:32 M9:33 M13:23 M0:45 M17:23 M10:44 M1:53 M16:14 M12:51 M18:44 M3:19 M11:14 M14:19 M8:42 M7:35 M4:36 M19:13
J2:
M9:21 M8:13 M15:18 M10:27 M6:28 M1:44 M17:7 M13:... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 37 J13: 41 J49: 7 J6: 19 J44: 39 J10: 46 J36: 41 J41: 11 J46: 13 J33: 11 J43: 50 J0: 32 J1: 45 J12: 45 J27: 52 J16: 14 J24: 34 J29: 19 J14: 21 J7: 52 J23: 10 J45: 17 J47: 27 J17: 23 J31: 18 J38: 44 J22: 5 J35: 13 J39: 32 J42: 8 J48: 21 J5: 37 J21: 7 J25: 28 J28: 42 J30: 18 J2: 20 J4: 43 J8: 44 J15: 45 J18: 23 J... | J0:
M5:17 M13:31 M15:33 M18:22 M16:9 M2:22 M0:32 M8:26 M11:12 M9:35 M4:53 M7:23 M14:24 M10:35 M6:40 M1:19 M3:18 M12:31 M19:9 M17:22
J1:
M5:33 M6:37 M2:10 M15:32 M9:33 M13:23 M0:45 M17:23 M10:44 M1:53 M16:14 M12:51 M18:44 M3:19 M11:14 M14:19 M8:42 M7:35 M4:36 M19:13
J2:
M9:21 M8:13 M15:18 M10:27 M6:28 M1:44 M17:7 M13:... | Solution:
J27-M1: 0+7 -> 7,J34-M2: 0+15 -> 15,J45-M3: 0+24 -> 24,J8-M4: 0+8 -> 8,J12-M5: 0+12 -> 12,J39-M6: 0+18 -> 18,J5-M7: 0+13 -> 13,J23-M9: 0+6 -> 6,J4-M10: 0+7 -> 7,J18-M11: 0+9 -> 9,J13-M12: 0+13 -> 13,J43-M13: 0+11 -> 11,J15-M14: 0+46 -> 46,J49-M15: 0+13 -> 13,J10-M16: 0+17 -> 17,J31-M17: 0+21 -> 21,J44-M18: 0+... | 50x20_361.jsp | 50 20
5 17 13 31 15 33 18 22 16 9 2 22 0 32 8 26 11 12 9 35 4 53 7 23 14 24 10 35 6 40 1 19 3 18 12 31 19 9 17 22
5 33 6 37 2 10 15 32 9 33 13 23 0 45 17 23 10 44 1 53 16 14 12 51 18 44 3 19 11 14 14 19 8 42 7 35 4 36 19 13
9 21 8 13 15 18 10 27 6 28 1 44 17 7 13 19 11 44 7 8 12 44 18 13 14 22 0 20 3 40 4 35 19 9 2 16 ... |
100 | 50 | J0:
M46:25 M13:31 M20:92 M27:59 M25:94 M2:55 M5:31 M17:74 M9:14 M0:53 M6:85 M30:85 M49:63 M28:14 M31:45 M12:21 M41:96 M38:42 M34:95 M42:34 M11:67 M14:88 M45:64 M32:117 M43:101 M33:47 M19:94 M3:23 M7:112 M47:71 M21:53 M23:104 M37:46 M24:89 M16:30 M36:99 M1:96 M29:108 M4:8 M10:11 M18:76 M26:96 M39:97 M22:27 M8:66 M15:52 ... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J40: 34 J43: 69 J60: 122 J91: 108 J66: 34 J32: 114 J96: 13 J15: 69 J68: 50 J74: 106 J78: 47 J86: 20 J72: 22 J47: 78 J0: 53 J22: 113 J36: 46 J42: 35 J90: 61 J17: 42 J67: 71 J80: 102 J35: 47 J8: 55 J50: 16 J9: 100 J13: 12 J45: 32 J46: 70 J54: 102 J56: 105 J58: 53 J81: 92 J85: 101 J18: 65 J82: 90 J65: 61 J83: 25 J88: ... | J0:
M46:25 M13:31 M20:92 M27:59 M25:94 M2:55 M5:31 M17:74 M9:14 M0:53 M6:85 M30:85 M49:63 M28:14 M31:45 M12:21 M41:96 M38:42 M34:95 M42:34 M11:67 M14:88 M45:64 M32:117 M43:101 M33:47 M19:94 M3:23 M7:112 M47:71 M21:53 M23:104 M37:46 M24:89 M16:30 M36:99 M1:96 M29:108 M4:8 M10:11 M18:76 M26:96 M39:97 M22:27 M8:66 M15:52 ... | Solution:
J40-M0: 0+34 -> 34,J38-M1: 0+33 -> 33,J42-M3: 0+11 -> 11,J54-M4: 0+22 -> 22,J8-M5: 0+112 -> 112,J24-M6: 0+48 -> 48,J44-M7: 0+81 -> 81,J49-M10: 0+62 -> 62,J65-M11: 0+59 -> 59,J50-M12: 0+10 -> 10,J12-M13: 0+5 -> 5,J27-M14: 0+14 -> 14,J68-M15: 0+24 -> 24,J79-M16: 0+70 -> 70,J67-M17: 0+108 -> 108,J88-M18: 0+9 -> ... | 100x50_747.jsp | 100 50
46 25 13 31 20 92 27 59 25 94 2 55 5 31 17 74 9 14 0 53 6 85 30 85 49 63 28 14 31 45 12 21 41 96 38 42 34 95 42 34 11 67 14 88 45 64 32 117 43 101 33 47 19 94 3 23 7 112 47 71 21 53 23 104 37 46 24 89 16 30 36 99 1 96 29 108 4 8 10 11 18 76 26 96 39 97 22 27 8 66 15 52 40 40 35 44 44 51 48 15
48 17 42 120 24 67 ... |
30 | 30 | J0:
M12:134 M8:76 M27:25 M24:293 M3:121 M19:126 M29:79 M25:132 M17:194 M23:73 M6:37 M1:96 M21:192 M16:21 M18:291 M22:268 M2:230 M7:40 M15:213 M11:223 M0:281 M14:219 M10:267 M13:93 M5:137 M9:132 M20:78 M28:240 M4:297 M26:96
J1:
M19:234 M22:238 M29:159 M4:14 M20:215 M12:150 M15:44 M27:296 M17:236 M0:269 M5:22 M14:232 M1... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J10: 75 J15: 242 J24: 10 J16: 123 J5: 228 J21: 231 J11: 160 J26: 47 J1: 269 J7: 63 J22: 6 J19: 114 J29: 53 J9: 87 J20: 237 J28: 284 J0: 281 J4: 42 J17: 232 J8: 107 J18: 211 J23: 95 J3: 247 J12: 230 J14: 9 J2: 94 J25: 83 J6: 161 J13: 13 J27: 206
M1:
J12: 259 J18: 61 J11: 253 J20: 228 J4: 17 J6: 5 J17: 276 J15: 103 ... | J0:
M12:134 M8:76 M27:25 M24:293 M3:121 M19:126 M29:79 M25:132 M17:194 M23:73 M6:37 M1:96 M21:192 M16:21 M18:291 M22:268 M2:230 M7:40 M15:213 M11:223 M0:281 M14:219 M10:267 M13:93 M5:137 M9:132 M20:78 M28:240 M4:297 M26:96
J1:
M19:234 M22:238 M29:159 M4:14 M20:215 M12:150 M15:44 M27:296 M17:236 M0:269 M5:22 M14:232 M1... | Solution:
J10-M0: 0+75 -> 75,J18-M1: 0+61 -> 61,J24-M2: 0+66 -> 66,J19-M3: 0+7 -> 7,J26-M4: 0+95 -> 95,J4-M5: 0+78 -> 78,J17-M7: 0+168 -> 168,J22-M8: 0+11 -> 11,J21-M10: 0+236 -> 236,J5-M12: 0+13 -> 13,J29-M14: 0+230 -> 230,J28-M15: 0+285 -> 285,J9-M16: 0+155 -> 155,J8-M17: 0+235 -> 235,J1-M19: 0+234 -> 234,J14-M20: 0+... | 30x30_2098.jsp | 30 30
12 134 8 76 27 25 24 293 3 121 19 126 29 79 25 132 17 194 23 73 6 37 1 96 21 192 16 21 18 291 22 268 2 230 7 40 15 213 11 223 0 281 14 219 10 267 13 93 5 137 9 132 20 78 28 240 4 297 26 96
19 234 22 238 29 159 4 14 20 215 12 150 15 44 27 296 17 236 0 269 5 22 14 232 16 227 24 200 1 87 23 250 2 100 13 60 11 102 21... |
40 | 40 | J0:
M20:23 M7:28 M3:15 M5:5 M24:30 M25:35 M31:14 M32:30 M30:19 M22:24 M36:32 M18:13 M14:12 M0:17 M34:12 M33:5 M19:18 M12:33 M23:21 M37:19 M29:5 M17:26 M35:23 M39:32 M27:16 M38:28 M26:17 M8:22 M6:20 M11:25 M16:20 M15:29 M21:21 M4:23 M10:11 M9:29 M1:17 M2:26 M13:18 M28:28
J1:
M0:26 M27:6 M9:22 M4:26 M33:20 M1:20 M14:29 ... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J1: 26 J12: 34 J18: 23 J36: 20 J19: 7 J23: 15 J32: 35 J38: 14 J4: 5 J15: 25 J37: 28 J13: 26 J25: 5 J29: 24 J0: 17 J9: 18 J26: 10 J35: 32 J2: 26 J21: 32 J3: 25 J27: 13 J34: 22 J8: 28 J16: 23 J30: 10 J17: 32 J20: 25 J10: 5 J6: 22 J14: 11 J22: 13 J5: 15 J24: 13 J39: 22 J33: 8 J28: 25 J31: 25 J7: 15 J11: 24
M1:
J30: 2... | J0:
M20:23 M7:28 M3:15 M5:5 M24:30 M25:35 M31:14 M32:30 M30:19 M22:24 M36:32 M18:13 M14:12 M0:17 M34:12 M33:5 M19:18 M12:33 M23:21 M37:19 M29:5 M17:26 M35:23 M39:32 M27:16 M38:28 M26:17 M8:22 M6:20 M11:25 M16:20 M15:29 M21:21 M4:23 M10:11 M9:29 M1:17 M2:26 M13:18 M28:28
J1:
M0:26 M27:6 M9:22 M4:26 M33:20 M1:20 M14:29 ... | Solution:
J1-M0: 0+26 -> 26,J30-M1: 0+25 -> 25,J13-M2: 0+30 -> 30,J19-M4: 0+18 -> 18,J29-M5: 0+33 -> 33,J34-M6: 0+9 -> 9,J26-M7: 0+11 -> 11,J21-M9: 0+14 -> 14,J8-M12: 0+7 -> 7,J20-M13: 0+21 -> 21,J25-M15: 0+8 -> 8,J7-M16: 0+11 -> 11,J22-M17: 0+15 -> 15,J35-M18: 0+26 -> 26,J0-M20: 0+23 -> 23,J3-M21: 0+7 -> 7,J32-M22: 0+... | 40x40_1083.jsp | 40 40
20 23 7 28 3 15 5 5 24 30 25 35 31 14 32 30 30 19 22 24 36 32 18 13 14 12 0 17 34 12 33 5 19 18 12 33 23 21 37 19 29 5 17 26 35 23 39 32 27 16 38 28 26 17 8 22 6 20 11 25 16 20 15 29 21 21 4 23 10 11 9 29 1 17 2 26 13 18 28 28
0 26 27 6 9 22 4 26 33 20 1 20 14 29 30 18 21 11 22 22 32 9 20 35 10 12 39 16 2 25 6 28... |
50 | 20 | J0:
M4:19 M15:11 M1:33 M9:187 M17:32 M5:62 M16:8 M7:91 M11:180 M12:86 M8:64 M19:15 M3:93 M18:21 M6:16 M10:141 M2:193 M13:208 M14:60 M0:17
J1:
M1:154 M7:83 M19:94 M11:166 M10:24 M8:177 M4:80 M9:7 M13:52 M17:209 M2:163 M16:217 M0:159 M15:45 M12:184 M6:33 M3:32 M18:137 M5:174 M14:95
J2:
M11:80 M18:190 M2:74 M17:221 M0:1... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J22: 100 J30: 97 J28: 170 J43: 32 J18: 156 J35: 97 J2: 181 J42: 29 J48: 163 J9: 83 J11: 19 J13: 224 J14: 5 J31: 190 J34: 169 J36: 79 J41: 184 J21: 33 J26: 191 J49: 72 J16: 104 J20: 131 J25: 23 J33: 124 J44: 200 J46: 116 J15: 91 J37: 170 J1: 159 J6: 117 J8: 117 J17: 213 J5: 226 J47: 35 J39: 54 J12: 62 J40: 18 J4: 10... | J0:
M4:19 M15:11 M1:33 M9:187 M17:32 M5:62 M16:8 M7:91 M11:180 M12:86 M8:64 M19:15 M3:93 M18:21 M6:16 M10:141 M2:193 M13:208 M14:60 M0:17
J1:
M1:154 M7:83 M19:94 M11:166 M10:24 M8:177 M4:80 M9:7 M13:52 M17:209 M2:163 M16:217 M0:159 M15:45 M12:184 M6:33 M3:32 M18:137 M5:174 M14:95
J2:
M11:80 M18:190 M2:74 M17:221 M0:1... | Solution:
J22-M0: 0+100 -> 100,J7-M1: 0+20 -> 20,J33-M2: 0+71 -> 71,J34-M3: 0+44 -> 44,J0-M4: 0+19 -> 19,J38-M5: 0+152 -> 152,J19-M6: 0+72 -> 72,J6-M7: 0+6 -> 6,J23-M8: 0+170 -> 170,J31-M9: 0+42 -> 42,J24-M10: 0+19 -> 19,J10-M11: 0+68 -> 68,J16-M12: 0+113 -> 113,J28-M13: 0+91 -> 91,J41-M14: 0+67 -> 67,J25-M15: 0+27 -> ... | 50x20_319.jsp | 50 20
4 19 15 11 1 33 9 187 17 32 5 62 16 8 7 91 11 180 12 86 8 64 19 15 3 93 18 21 6 16 10 141 2 193 13 208 14 60 0 17
1 154 7 83 19 94 11 166 10 24 8 177 4 80 9 7 13 52 17 209 2 163 16 217 0 159 15 45 12 184 6 33 3 32 18 137 5 174 14 95
11 80 18 190 2 74 17 221 0 181 5 84 7 138 1 170 14 203 16 146 10 170 3 77 6 111 9... |
50 | 20 | J0:
M11:38 M4:39 M6:56 M5:51 M12:47 M8:36 M2:49 M10:6 M0:19 M19:52 M14:20 M15:59 M13:19 M18:58 M3:18 M16:45 M17:41 M9:57 M1:26 M7:48
J1:
M17:52 M4:12 M16:52 M0:11 M14:18 M18:56 M15:26 M13:10 M12:50 M10:56 M2:46 M5:33 M19:60 M11:39 M9:17 M8:15 M6:23 M3:54 M7:43 M1:14
J2:
M13:36 M0:16 M1:61 M6:30 M12:6 M2:18 M3:53 M18:... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J34: 58 J41: 44 J47: 57 J2: 16 J31: 32 J11: 49 J20: 36 J21: 38 J1: 11 J6: 49 J15: 35 J27: 25 J30: 17 J3: 27 J5: 45 J16: 19 J23: 6 J33: 53 J37: 9 J43: 57 J46: 20 J39: 49 J0: 19 J8: 20 J13: 16 J29: 56 J22: 52 J4: 26 J26: 33 J7: 17 J24: 36 J44: 57 J25: 23 J32: 57 J36: 15 J38: 6 J45: 19 J48: 16 J14: 37 J19: 46 J28: 60 ... | J0:
M11:38 M4:39 M6:56 M5:51 M12:47 M8:36 M2:49 M10:6 M0:19 M19:52 M14:20 M15:59 M13:19 M18:58 M3:18 M16:45 M17:41 M9:57 M1:26 M7:48
J1:
M17:52 M4:12 M16:52 M0:11 M14:18 M18:56 M15:26 M13:10 M12:50 M10:56 M2:46 M5:33 M19:60 M11:39 M9:17 M8:15 M6:23 M3:54 M7:43 M1:14
J2:
M13:36 M0:16 M1:61 M6:30 M12:6 M2:18 M3:53 M18:... | Solution:
J41-M0: 0+44 -> 44,J20-M1: 0+26 -> 26,J13-M2: 0+6 -> 6,J37-M4: 0+13 -> 13,J21-M5: 0+41 -> 41,J28-M6: 0+26 -> 26,J22-M7: 0+35 -> 35,J32-M8: 0+43 -> 43,J15-M9: 0+31 -> 31,J14-M10: 0+37 -> 37,J0-M11: 0+38 -> 38,J46-M12: 0+29 -> 29,J4-M13: 0+18 -> 18,J11-M14: 0+9 -> 9,J16-M15: 0+40 -> 40,J12-M17: 0+28 -> 28,J43-M... | 50x20_127.jsp | 50 20
11 38 4 39 6 56 5 51 12 47 8 36 2 49 10 6 0 19 19 52 14 20 15 59 13 19 18 58 3 18 16 45 17 41 9 57 1 26 7 48
17 52 4 12 16 52 0 11 14 18 18 56 15 26 13 10 12 50 10 56 2 46 5 33 19 60 11 39 9 17 8 15 6 23 3 54 7 43 1 14
13 36 0 16 1 61 6 30 12 6 2 18 3 53 18 20 14 11 11 37 7 18 10 37 16 26 4 14 9 36 8 23 5 21 17 1... |
40 | 40 | J0:
M24:112 M23:16 M37:91 M25:169 M19:143 M14:237 M22:43 M7:127 M11:35 M20:16 M21:219 M29:41 M0:145 M38:180 M15:95 M36:32 M3:7 M18:184 M39:13 M10:25 M26:84 M8:29 M6:231 M31:158 M30:83 M17:31 M1:149 M5:73 M16:115 M32:223 M33:213 M28:133 M35:94 M12:123 M13:143 M9:131 M27:119 M34:8 M2:180 M4:164
J1:
M27:239 M28:118 M23:3... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J21: 15 J5: 43 J11: 177 J27: 80 J1: 78 J26: 108 J20: 188 J34: 8 J36: 119 J0: 145 J19: 246 J25: 212 J38: 77 J12: 216 J16: 97 J33: 106 J35: 41 J6: 190 J10: 7 J29: 216 J30: 34 J8: 227 J37: 183 J23: 40 J2: 158 J7: 169 J24: 198 J18: 182 J28: 46 J17: 133 J31: 198 J3: 70 J9: 168 J39: 233 J13: 65 J14: 103 J15: 211 J32: 238... | J0:
M24:112 M23:16 M37:91 M25:169 M19:143 M14:237 M22:43 M7:127 M11:35 M20:16 M21:219 M29:41 M0:145 M38:180 M15:95 M36:32 M3:7 M18:184 M39:13 M10:25 M26:84 M8:29 M6:231 M31:158 M30:83 M17:31 M1:149 M5:73 M16:115 M32:223 M33:213 M28:133 M35:94 M12:123 M13:143 M9:131 M27:119 M34:8 M2:180 M4:164
J1:
M27:239 M28:118 M23:3... | Solution:
J30-M1: 0+150 -> 150,J11-M2: 0+245 -> 245,J2-M3: 0+72 -> 72,J35-M4: 0+217 -> 217,J18-M5: 0+194 -> 194,J17-M6: 0+206 -> 206,J22-M9: 0+12 -> 12,J12-M10: 0+12 -> 12,J23-M12: 0+150 -> 150,J21-M14: 0+53 -> 53,J19-M16: 0+50 -> 50,J33-M19: 0+32 -> 32,J26-M20: 0+71 -> 71,J10-M21: 0+73 -> 73,J36-M22: 0+139 -> 139,J15-... | 40x40_1459.jsp | 40 40
24 112 23 16 37 91 25 169 19 143 14 237 22 43 7 127 11 35 20 16 21 219 29 41 0 145 38 180 15 95 36 32 3 7 18 184 39 13 10 25 26 84 8 29 6 231 31 158 30 83 17 31 1 149 5 73 16 115 32 223 33 213 28 133 35 94 12 123 13 143 9 131 27 119 34 8 2 180 4 164
27 239 28 118 23 31 19 45 25 248 0 78 21 67 16 237 1 6 5 6 15 20... |
30 | 15 | J0:
M9:91 M0:35 M10:50 M5:131 M7:5 M11:25 M13:22 M1:11 M4:117 M2:95 M8:139 M12:69 M3:62 M14:93 M6:30
J1:
M13:78 M4:29 M2:70 M1:74 M8:105 M14:98 M11:74 M9:60 M0:56 M7:44 M12:91 M10:137 M6:67 M3:109 M5:121
J2:
M1:93 M14:127 M3:12 M5:44 M6:139 M9:6 M2:84 M0:22 M11:61 M12:126 M8:144 M4:22 M7:38 M13:129 M10:87
J3:
M11:12... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J14: 28 J21: 115 J0: 35 J3: 81 J12: 131 J13: 37 J20: 29 J27: 64 J28: 130 J18: 36 J6: 14 J19: 29 J24: 68 J16: 45 J2: 22 J26: 130 J1: 56 J5: 76 J8: 21 J10: 123 J11: 101 J23: 66 J9: 143 J15: 20 J17: 16 J22: 62 J29: 27 J4: 118 J7: 49 J25: 44
M1:
J2: 93 J10: 47 J23: 140 J4: 72 J8: 54 J24: 46 J3: 119 J7: 112 J16: 21 J17... | J0:
M9:91 M0:35 M10:50 M5:131 M7:5 M11:25 M13:22 M1:11 M4:117 M2:95 M8:139 M12:69 M3:62 M14:93 M6:30
J1:
M13:78 M4:29 M2:70 M1:74 M8:105 M14:98 M11:74 M9:60 M0:56 M7:44 M12:91 M10:137 M6:67 M3:109 M5:121
J2:
M1:93 M14:127 M3:12 M5:44 M6:139 M9:6 M2:84 M0:22 M11:61 M12:126 M8:144 M4:22 M7:38 M13:129 M10:87
J3:
M11:12... | Solution:
J14-M0: 0+28 -> 28,J11-M2: 0+62 -> 62,J7-M4: 0+7 -> 7,J9-M5: 0+112 -> 112,J4-M6: 0+26 -> 26,J24-M7: 0+131 -> 131,J5-M8: 0+15 -> 15,J18-M9: 0+7 -> 7,J15-M10: 0+24 -> 24,J8-M11: 0+14 -> 14,J13-M13: 0+26 -> 26,J6-M14: 0+102 -> 102,J22-M4: 7+14 -> 21,J0-M9: 7+91 -> 98,J8-M1: 14+54 -> 68,J7-M8: 15+55 -> 70,J27-M4:... | 30x15_602.jsp | 30 15
9 91 0 35 10 50 5 131 7 5 11 25 13 22 1 11 4 117 2 95 8 139 12 69 3 62 14 93 6 30
13 78 4 29 2 70 1 74 8 105 14 98 11 74 9 60 0 56 7 44 12 91 10 137 6 67 3 109 5 121
1 93 14 127 3 12 5 44 6 139 9 6 2 84 0 22 11 61 12 126 8 144 4 22 7 38 13 129 10 87
11 123 0 81 1 119 8 106 3 72 5 33 12 33 14 63 13 41 10 26 2 121 ... |
30 | 20 | J0:
M9:66 M7:41 M13:78 M16:100 M17:93 M3:12 M11:69 M14:77 M18:30 M19:27 M5:86 M12:89 M6:33 M15:99 M8:53 M4:83 M2:73 M10:13 M1:96 M0:71
J1:
M11:16 M0:61 M16:6 M13:76 M12:83 M10:51 M1:65 M19:85 M2:92 M9:58 M5:14 M8:54 M17:97 M14:54 M7:13 M6:45 M3:13 M18:5 M15:50 M4:106
J2:
M2:71 M13:45 M16:28 M4:52 M14:73 M10:100 M15:6... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J16: 21 J24: 70 J1: 61 J6: 51 J11: 37 J10: 26 J14: 90 J18: 14 J17: 97 J3: 45 J5: 59 J20: 47 J28: 101 J22: 22 J26: 70 J15: 66 J4: 51 J12: 64 J21: 30 J13: 61 J9: 78 J19: 71 J29: 50 J23: 33 J8: 90 J25: 51 J2: 105 J27: 27 J7: 88 J0: 71
M1:
J8: 71 J29: 89 J27: 23 J12: 62 J9: 78 J15: 48 J6: 50 J1: 65 J7: 63 J19: 98 J26:... | J0:
M9:66 M7:41 M13:78 M16:100 M17:93 M3:12 M11:69 M14:77 M18:30 M19:27 M5:86 M12:89 M6:33 M15:99 M8:53 M4:83 M2:73 M10:13 M1:96 M0:71
J1:
M11:16 M0:61 M16:6 M13:76 M12:83 M10:51 M1:65 M19:85 M2:92 M9:58 M5:14 M8:54 M17:97 M14:54 M7:13 M6:45 M3:13 M18:5 M15:50 M4:106
J2:
M2:71 M13:45 M16:28 M4:52 M14:73 M10:100 M15:6... | Solution:
J16-M0: 0+21 -> 21,J8-M1: 0+71 -> 71,J20-M2: 0+27 -> 27,J19-M4: 0+60 -> 60,J9-M5: 0+98 -> 98,J17-M7: 0+81 -> 81,J4-M8: 0+72 -> 72,J18-M9: 0+52 -> 52,J5-M10: 0+40 -> 40,J1-M11: 0+16 -> 16,J10-M12: 0+57 -> 57,J13-M13: 0+20 -> 20,J12-M14: 0+29 -> 29,J23-M16: 0+89 -> 89,J6-M17: 0+31 -> 31,J2-M2: 27+71 -> 98,J20-M... | 30x20_2029.jsp | 30 20
9 66 7 41 13 78 16 100 17 93 3 12 11 69 14 77 18 30 19 27 5 86 12 89 6 33 15 99 8 53 4 83 2 73 10 13 1 96 0 71
11 16 0 61 16 6 13 76 12 83 10 51 1 65 19 85 2 92 9 58 5 14 8 54 17 97 14 54 7 13 6 45 3 13 18 5 15 50 4 106
2 71 13 45 16 28 4 52 14 73 10 100 15 60 3 111 19 11 11 9 1 66 7 19 5 92 6 105 17 106 18 96 9 ... |
50 | 20 | J0:
M0:70 M16:139 M2:131 M19:151 M17:41 M4:64 M15:67 M11:101 M9:11 M13:102 M12:68 M6:84 M8:23 M10:112 M1:26 M5:33 M3:138 M18:123 M7:62 M14:137
J1:
M16:98 M2:169 M19:56 M15:40 M3:96 M7:81 M18:75 M17:164 M5:117 M8:128 M1:166 M6:138 M9:24 M12:71 M11:64 M14:157 M13:157 M10:9 M4:69 M0:98
J2:
M14:136 M15:67 M0:127 M7:80 M1... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 70 J32: 10 J25: 91 J37: 121 J39: 7 J43: 85 J2: 127 J9: 32 J21: 16 J4: 91 J10: 9 J15: 112 J16: 154 J22: 118 J7: 136 J31: 76 J35: 150 J36: 63 J6: 58 J34: 92 J40: 144 J38: 31 J45: 53 J28: 26 J3: 95 J23: 166 J27: 168 J29: 59 J48: 94 J42: 19 J11: 136 J12: 62 J19: 144 J33: 59 J44: 124 J5: 168 J14: 63 J49: 136 J30: 12... | J0:
M0:70 M16:139 M2:131 M19:151 M17:41 M4:64 M15:67 M11:101 M9:11 M13:102 M12:68 M6:84 M8:23 M10:112 M1:26 M5:33 M3:138 M18:123 M7:62 M14:137
J1:
M16:98 M2:169 M19:56 M15:40 M3:96 M7:81 M18:75 M17:164 M5:117 M8:128 M1:166 M6:138 M9:24 M12:71 M11:64 M14:157 M13:157 M10:9 M4:69 M0:98
J2:
M14:136 M15:67 M0:127 M7:80 M1... | Solution:
J32-M0: 0+10 -> 10,J29-M1: 0+42 -> 42,J49-M3: 0+82 -> 82,J5-M4: 0+124 -> 124,J19-M5: 0+63 -> 63,J34-M6: 0+19 -> 19,J15-M7: 0+54 -> 54,J44-M8: 0+24 -> 24,J35-M9: 0+20 -> 20,J21-M10: 0+19 -> 19,J27-M11: 0+57 -> 57,J42-M12: 0+12 -> 12,J10-M13: 0+31 -> 31,J31-M14: 0+15 -> 15,J41-M16: 0+24 -> 24,J28-M17: 0+98 -> 9... | 50x20_887.jsp | 50 20
0 70 16 139 2 131 19 151 17 41 4 64 15 67 11 101 9 11 13 102 12 68 6 84 8 23 10 112 1 26 5 33 3 138 18 123 7 62 14 137
16 98 2 169 19 56 15 40 3 96 7 81 18 75 17 164 5 117 8 128 1 166 6 138 9 24 12 71 11 64 14 157 13 157 10 9 4 69 0 98
14 136 15 67 0 127 7 80 19 167 8 25 13 70 17 18 9 58 5 57 6 75 3 49 16 138 12 ... |
30 | 15 | J0:
M5:102 M14:232 M2:70 M3:133 M11:69 M7:144 M0:164 M12:69 M1:26 M10:54 M8:181 M13:47 M6:5 M9:121 M4:87
J1:
M2:179 M12:189 M6:37 M9:164 M8:72 M5:243 M3:102 M11:10 M4:154 M10:69 M0:212 M13:215 M14:124 M7:64 M1:236
J2:
M14:166 M12:141 M5:16 M6:239 M11:101 M1:93 M7:84 M4:108 M3:116 M0:193 M2:36 M10:216 M13:81 M8:143 M9... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J9: 227 J10: 194 J27: 236 J17: 229 J18: 14 J19: 239 J23: 155 J11: 57 J24: 226 J3: 104 J22: 10 J29: 146 J0: 164 J8: 45 J12: 89 J15: 202 J16: 35 J21: 72 J2: 193 J26: 246 J28: 229 J1: 212 J5: 66 J6: 74 J7: 153 J14: 221 J20: 67 J13: 246 J25: 107 J4: 115
M1:
J14: 64 J8: 72 J9: 110 J16: 76 J24: 7 J28: 155 J25: 10 J3: 40... | J0:
M5:102 M14:232 M2:70 M3:133 M11:69 M7:144 M0:164 M12:69 M1:26 M10:54 M8:181 M13:47 M6:5 M9:121 M4:87
J1:
M2:179 M12:189 M6:37 M9:164 M8:72 M5:243 M3:102 M11:10 M4:154 M10:69 M0:212 M13:215 M14:124 M7:64 M1:236
J2:
M14:166 M12:141 M5:16 M6:239 M11:101 M1:93 M7:84 M4:108 M3:116 M0:193 M2:36 M10:216 M13:81 M8:143 M9... | Solution:
J9-M0: 0+227 -> 227,J14-M1: 0+64 -> 64,J1-M2: 0+179 -> 179,J12-M3: 0+54 -> 54,J3-M4: 0+24 -> 24,J22-M5: 0+80 -> 80,J4-M8: 0+57 -> 57,J11-M9: 0+232 -> 232,J24-M10: 0+6 -> 6,J19-M11: 0+21 -> 21,J20-M12: 0+83 -> 83,J5-M13: 0+161 -> 161,J2-M14: 0+166 -> 166,J6-M10: 6+219 -> 225,J25-M11: 21+95 -> 116,J18-M4: 24+14... | 30x15_329.jsp | 30 15
5 102 14 232 2 70 3 133 11 69 7 144 0 164 12 69 1 26 10 54 8 181 13 47 6 5 9 121 4 87
2 179 12 189 6 37 9 164 8 72 5 243 3 102 11 10 4 154 10 69 0 212 13 215 14 124 7 64 1 236
14 166 12 141 5 16 6 239 11 101 1 93 7 84 4 108 3 116 0 193 2 36 10 216 13 81 8 143 9 57
4 24 6 29 14 230 1 40 3 106 0 104 12 236 13 209 1... |
40 | 40 | J0:
M36:16 M4:12 M7:25 M6:7 M38:7 M21:6 M28:7 M19:17 M0:11 M39:20 M35:22 M30:6 M10:12 M16:6 M34:14 M32:6 M2:14 M24:12 M5:15 M37:16 M12:20 M31:12 M29:24 M22:6 M8:25 M1:15 M15:23 M20:13 M25:16 M3:11 M23:20 M27:16 M9:14 M26:23 M17:19 M14:17 M13:7 M11:24 M18:7 M33:11
J1:
M24:23 M27:8 M34:17 M26:23 M15:12 M19:11 M31:15 M20... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 10 J15: 17 J19: 7 J24: 7 J29: 12 J6: 5 J3: 7 J16: 24 J28: 20 J0: 11 J26: 25 J38: 23 J33: 19 J27: 14 J1: 9 J4: 17 J12: 19 J10: 5 J34: 10 J13: 7 J30: 12 J37: 9 J5: 8 J22: 9 J32: 16 J18: 12 J2: 9 J39: 5 J23: 22 J9: 10 J31: 23 J35: 6 J14: 19 J11: 11 J25: 16 J21: 13 J36: 12 J8: 14 J17: 5 J20: 21
M1:
J37: 7 J17: 22 ... | J0:
M36:16 M4:12 M7:25 M6:7 M38:7 M21:6 M28:7 M19:17 M0:11 M39:20 M35:22 M30:6 M10:12 M16:6 M34:14 M32:6 M2:14 M24:12 M5:15 M37:16 M12:20 M31:12 M29:24 M22:6 M8:25 M1:15 M15:23 M20:13 M25:16 M3:11 M23:20 M27:16 M9:14 M26:23 M17:19 M14:17 M13:7 M11:24 M18:7 M33:11
J1:
M24:23 M27:8 M34:17 M26:23 M15:12 M19:11 M31:15 M20... | Solution:
J7-M0: 0+10 -> 10,J37-M2: 0+21 -> 21,J35-M3: 0+9 -> 9,J39-M4: 0+23 -> 23,J3-M6: 0+18 -> 18,J15-M7: 0+5 -> 5,J2-M9: 0+19 -> 19,J6-M10: 0+14 -> 14,J19-M11: 0+11 -> 11,J14-M12: 0+5 -> 5,J10-M14: 0+20 -> 20,J30-M15: 0+12 -> 12,J32-M18: 0+7 -> 7,J18-M19: 0+9 -> 9,J26-M20: 0+9 -> 9,J22-M21: 0+12 -> 12,J8-M22: 0+19 ... | 40x40_1069.jsp | 40 40
36 16 4 12 7 25 6 7 38 7 21 6 28 7 19 17 0 11 39 20 35 22 30 6 10 12 16 6 34 14 32 6 2 14 24 12 5 15 37 16 12 20 31 12 29 24 22 6 8 25 1 15 15 23 20 13 25 16 3 11 23 20 27 16 9 14 26 23 17 19 14 17 13 7 11 24 18 7 33 11
24 23 27 8 34 17 26 23 15 12 19 11 31 15 20 5 14 14 9 5 28 21 1 24 30 16 13 13 5 23 6 20 0 9 2... |
100 | 20 | J0:
M3:59 M14:50 M4:82 M2:32 M18:63 M17:64 M12:76 M6:89 M8:49 M9:52 M7:52 M0:77 M5:5 M10:47 M16:76 M1:48 M15:28 M19:59 M11:93 M13:15
J1:
M11:68 M15:13 M12:72 M5:84 M14:43 M7:71 M18:78 M0:34 M3:24 M8:14 M6:43 M2:46 M19:67 M16:72 M4:90 M13:64 M1:60 M10:11 M17:62 M9:49
J2:
M2:59 M9:37 M12:54 M16:68 M7:67 M11:54 M18:9 M5... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J4: 23 J10: 43 J34: 44 J62: 70 J64: 33 J19: 20 J27: 66 J61: 91 J73: 93 J75: 25 J82: 18 J90: 24 J96: 83 J26: 24 J35: 61 J50: 53 J70: 35 J7: 85 J29: 63 J41: 82 J77: 93 J88: 27 J18: 65 J46: 69 J76: 16 J17: 46 J72: 42 J87: 65 J16: 93 J31: 69 J55: 25 J1: 34 J5: 30 J11: 8 J21: 93 J65: 26 J91: 33 J94: 82 J6: 69 J13: 43 J4... | J0:
M3:59 M14:50 M4:82 M2:32 M18:63 M17:64 M12:76 M6:89 M8:49 M9:52 M7:52 M0:77 M5:5 M10:47 M16:76 M1:48 M15:28 M19:59 M11:93 M13:15
J1:
M11:68 M15:13 M12:72 M5:84 M14:43 M7:71 M18:78 M0:34 M3:24 M8:14 M6:43 M2:46 M19:67 M16:72 M4:90 M13:64 M1:60 M10:11 M17:62 M9:49
J2:
M2:59 M9:37 M12:54 M16:68 M7:67 M11:54 M18:9 M5... | Solution:
J4-M0: 0+23 -> 23,J49-M1: 0+6 -> 6,J19-M2: 0+57 -> 57,J91-M3: 0+9 -> 9,J18-M4: 0+5 -> 5,J20-M5: 0+12 -> 12,J48-M6: 0+67 -> 67,J12-M7: 0+9 -> 9,J30-M8: 0+6 -> 6,J47-M9: 0+28 -> 28,J14-M10: 0+26 -> 26,J16-M11: 0+48 -> 48,J7-M12: 0+21 -> 21,J60-M13: 0+14 -> 14,J26-M14: 0+36 -> 36,J68-M15: 0+21 -> 21,J6-M16: 0+5 ... | 100x20_634.jsp | 100 20
3 59 14 50 4 82 2 32 18 63 17 64 12 76 6 89 8 49 9 52 7 52 0 77 5 5 10 47 16 76 1 48 15 28 19 59 11 93 13 15
11 68 15 13 12 72 5 84 14 43 7 71 18 78 0 34 3 24 8 14 6 43 2 46 19 67 16 72 4 90 13 64 1 60 10 11 17 62 9 49
2 59 9 37 12 54 16 68 7 67 11 54 18 9 5 16 13 60 8 22 17 52 15 65 6 20 19 88 0 81 1 65 3 56 4 ... |
100 | 20 | J0:
M4:133 M14:48 M2:51 M0:150 M10:25 M11:90 M9:104 M19:144 M16:119 M12:56 M3:159 M5:96 M1:38 M18:59 M17:122 M8:133 M13:149 M6:156 M7:121 M15:132
J1:
M11:22 M2:133 M8:149 M17:75 M5:87 M10:46 M15:129 M19:152 M7:95 M16:160 M18:60 M6:11 M1:103 M4:96 M9:65 M14:133 M13:63 M12:134 M3:161 M0:108
J2:
M18:20 M15:20 M16:55 M11... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 28 J25: 61 J47: 48 J3: 58 J27: 116 J84: 43 J97: 139 J15: 85 J19: 146 J23: 130 J49: 86 J0: 150 J18: 90 J24: 107 J42: 69 J7: 163 J10: 156 J17: 133 J40: 83 J53: 123 J54: 77 J61: 57 J43: 43 J44: 155 J55: 13 J64: 66 J68: 70 J96: 153 J56: 65 J59: 110 J89: 78 J93: 69 J95: 70 J98: 84 J34: 94 J37: 139 J46: 6 J77: 31 J94... | J0:
M4:133 M14:48 M2:51 M0:150 M10:25 M11:90 M9:104 M19:144 M16:119 M12:56 M3:159 M5:96 M1:38 M18:59 M17:122 M8:133 M13:149 M6:156 M7:121 M15:132
J1:
M11:22 M2:133 M8:149 M17:75 M5:87 M10:46 M15:129 M19:152 M7:95 M16:160 M18:60 M6:11 M1:103 M4:96 M9:65 M14:133 M13:63 M12:134 M3:161 M0:108
J2:
M18:20 M15:20 M16:55 M11... | Solution:
J5-M0: 0+28 -> 28,J17-M1: 0+38 -> 38,J20-M2: 0+14 -> 14,J21-M3: 0+18 -> 18,J29-M4: 0+16 -> 16,J82-M5: 0+70 -> 70,J62-M6: 0+30 -> 30,J57-M7: 0+5 -> 5,J49-M8: 0+9 -> 9,J37-M9: 0+10 -> 10,J54-M10: 0+9 -> 9,J30-M11: 0+7 -> 7,J85-M12: 0+6 -> 6,J32-M13: 0+45 -> 45,J26-M14: 0+31 -> 31,J98-M15: 0+17 -> 17,J89-M16: 0+... | 100x20_853.jsp | 100 20
4 133 14 48 2 51 0 150 10 25 11 90 9 104 19 144 16 119 12 56 3 159 5 96 1 38 18 59 17 122 8 133 13 149 6 156 7 121 15 132
11 22 2 133 8 149 17 75 5 87 10 46 15 129 19 152 7 95 16 160 18 60 6 11 1 103 4 96 9 65 14 133 13 63 12 134 3 161 0 108
18 20 15 20 16 55 11 100 12 31 5 25 17 152 6 80 1 68 3 64 19 143 14 56 ... |
50 | 15 | J0:
M7:68 M10:112 M14:69 M12:95 M13:89 M6:103 M8:51 M9:96 M4:28 M3:105 M5:11 M0:113 M1:37 M2:76 M11:31
J1:
M12:11 M9:104 M2:60 M7:59 M14:46 M11:55 M10:40 M8:12 M1:51 M3:63 M13:94 M4:43 M5:35 M6:85 M0:22
J2:
M7:40 M8:23 M3:81 M0:101 M11:11 M13:18 M14:57 M2:17 M4:51 M1:95 M9:63 M5:18 M12:64 M10:81 M6:60
J3:
M9:45 M8:7... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 5 J32: 98 J23: 45 J44: 110 J14: 113 J26: 32 J36: 83 J45: 47 J46: 70 J2: 101 J4: 32 J31: 76 J41: 62 J42: 35 J15: 63 J22: 108 J30: 16 J24: 73 J10: 104 J11: 63 J21: 27 J33: 70 J7: 63 J8: 35 J13: 78 J27: 36 J29: 102 J34: 16 J37: 91 J39: 100 J6: 64 J28: 50 J38: 26 J3: 114 J20: 31 J35: 69 J43: 56 J48: 34 J0: 113 J17:... | J0:
M7:68 M10:112 M14:69 M12:95 M13:89 M6:103 M8:51 M9:96 M4:28 M3:105 M5:11 M0:113 M1:37 M2:76 M11:31
J1:
M12:11 M9:104 M2:60 M7:59 M14:46 M11:55 M10:40 M8:12 M1:51 M3:63 M13:94 M4:43 M5:35 M6:85 M0:22
J2:
M7:40 M8:23 M3:81 M0:101 M11:11 M13:18 M14:57 M2:17 M4:51 M1:95 M9:63 M5:18 M12:64 M10:81 M6:60
J3:
M9:45 M8:7... | Solution:
J5-M0: 0+5 -> 5,J45-M1: 0+11 -> 11,J47-M2: 0+20 -> 20,J42-M3: 0+27 -> 27,J15-M4: 0+51 -> 51,J22-M5: 0+13 -> 13,J29-M6: 0+45 -> 45,J27-M7: 0+10 -> 10,J6-M8: 0+37 -> 37,J3-M9: 0+45 -> 45,J49-M10: 0+17 -> 17,J20-M11: 0+7 -> 7,J1-M12: 0+11 -> 11,J26-M13: 0+89 -> 89,J46-M14: 0+13 -> 13,J32-M0: 5+98 -> 103,J44-M11:... | 50x15_383.jsp | 50 15
7 68 10 112 14 69 12 95 13 89 6 103 8 51 9 96 4 28 3 105 5 11 0 113 1 37 2 76 11 31
12 11 9 104 2 60 7 59 14 46 11 55 10 40 8 12 1 51 3 63 13 94 4 43 5 35 6 85 0 22
7 40 8 23 3 81 0 101 11 11 13 18 14 57 2 17 4 51 1 95 9 63 5 18 12 64 10 81 6 60
9 45 8 7 7 40 14 34 11 65 6 25 2 80 4 37 3 70 0 114 1 56 10 36 13 49... |
40 | 20 | J0:
M2:10 M1:34 M18:97 M12:32 M0:40 M16:50 M6:60 M8:69 M10:79 M13:76 M19:28 M14:12 M9:15 M17:95 M11:20 M7:40 M15:93 M4:6 M5:58 M3:92
J1:
M16:39 M12:79 M13:51 M19:38 M7:46 M15:50 M8:79 M9:34 M1:11 M17:90 M0:57 M14:48 M2:59 M6:49 M11:95 M3:39 M5:27 M10:57 M18:88 M4:69
J2:
M2:23 M9:9 M17:98 M5:66 M10:71 M12:5 M11:33 M4:... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 97 J9: 44 J12: 16 J14: 11 J25: 7 J27: 98 J6: 31 J20: 105 J11: 103 J19: 44 J22: 104 J0: 40 J4: 100 J3: 90 J5: 79 J30: 26 J35: 87 J34: 81 J23: 94 J31: 27 J32: 27 J33: 44 J39: 18 J1: 57 J15: 88 J38: 100 J29: 9 J16: 48 J24: 42 J28: 83 J18: 37 J17: 56 J21: 5 J26: 33 J8: 72 J10: 43 J36: 86 J37: 84 J2: 51 J13: 57
M1:... | J0:
M2:10 M1:34 M18:97 M12:32 M0:40 M16:50 M6:60 M8:69 M10:79 M13:76 M19:28 M14:12 M9:15 M17:95 M11:20 M7:40 M15:93 M4:6 M5:58 M3:92
J1:
M16:39 M12:79 M13:51 M19:38 M7:46 M15:50 M8:79 M9:34 M1:11 M17:90 M0:57 M14:48 M2:59 M6:49 M11:95 M3:39 M5:27 M10:57 M18:88 M4:69
J2:
M2:23 M9:9 M17:98 M5:66 M10:71 M12:5 M11:33 M4:... | Solution:
J20-M1: 0+36 -> 36,J31-M2: 0+8 -> 8,J4-M4: 0+26 -> 26,J39-M5: 0+19 -> 19,J17-M6: 0+26 -> 26,J26-M7: 0+10 -> 10,J10-M8: 0+51 -> 51,J32-M9: 0+27 -> 27,J16-M10: 0+23 -> 23,J33-M11: 0+83 -> 83,J18-M12: 0+5 -> 5,J29-M13: 0+5 -> 5,J19-M14: 0+51 -> 51,J28-M15: 0+12 -> 12,J36-M16: 0+5 -> 5,J30-M17: 0+6 -> 6,J23-M18: ... | 40x20_504.jsp | 40 20
2 10 1 34 18 97 12 32 0 40 16 50 6 60 8 69 10 79 13 76 19 28 14 12 9 15 17 95 11 20 7 40 15 93 4 6 5 58 3 92
16 39 12 79 13 51 19 38 7 46 15 50 8 79 9 34 1 11 17 90 0 57 14 48 2 59 6 49 11 95 3 39 5 27 10 57 18 88 4 69
2 23 9 9 17 98 5 66 10 71 12 5 11 33 4 87 6 55 7 42 15 32 13 103 8 36 1 88 3 58 14 74 18 87 19 ... |
30 | 15 | J0:
M3:90 M10:106 M4:49 M11:90 M5:110 M12:119 M2:141 M9:113 M8:119 M14:136 M1:131 M13:85 M0:80 M7:104 M6:79
J1:
M8:98 M6:53 M13:34 M2:33 M10:114 M9:16 M5:114 M1:31 M14:5 M0:15 M7:122 M12:72 M4:77 M11:110 M3:140
J2:
M9:17 M5:18 M12:34 M11:96 M0:5 M7:65 M2:83 M14:115 M13:107 M4:6 M1:86 M6:60 M8:51 M10:70 M3:42
J3:
M5:... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J25: 86 J7: 23 J13: 61 J15: 6 J5: 82 J9: 11 J10: 58 J11: 74 J2: 5 J14: 94 J3: 107 J6: 25 J19: 11 J26: 43 J22: 114 J24: 86 J28: 117 J17: 74 J16: 134 J18: 123 J20: 130 J27: 128 J29: 87 J1: 15 J4: 152 J8: 42 J12: 21 J23: 79 J21: 22 J0: 80
M1:
J4: 17 J20: 153 J24: 110 J29: 111 J12: 69 J22: 134 J7: 77 J21: 151 J23: 84 ... | J0:
M3:90 M10:106 M4:49 M11:90 M5:110 M12:119 M2:141 M9:113 M8:119 M14:136 M1:131 M13:85 M0:80 M7:104 M6:79
J1:
M8:98 M6:53 M13:34 M2:33 M10:114 M9:16 M5:114 M1:31 M14:5 M0:15 M7:122 M12:72 M4:77 M11:110 M3:140
J2:
M9:17 M5:18 M12:34 M11:96 M0:5 M7:65 M2:83 M14:115 M13:107 M4:6 M1:86 M6:60 M8:51 M10:70 M3:42
J3:
M5:... | Solution:
J25-M0: 0+86 -> 86,J4-M1: 0+17 -> 17,J7-M2: 0+52 -> 52,J0-M3: 0+90 -> 90,J14-M4: 0+142 -> 142,J3-M5: 0+123 -> 123,J28-M6: 0+98 -> 98,J8-M7: 0+25 -> 25,J10-M8: 0+26 -> 26,J2-M9: 0+17 -> 17,J27-M11: 0+30 -> 30,J12-M12: 0+124 -> 124,J13-M13: 0+19 -> 19,J26-M14: 0+87 -> 87,J24-M1: 17+110 -> 127,J18-M9: 17+93 -> 1... | 30x15_57.jsp | 30 15
3 90 10 106 4 49 11 90 5 110 12 119 2 141 9 113 8 119 14 136 1 131 13 85 0 80 7 104 6 79
8 98 6 53 13 34 2 33 10 114 9 16 5 114 1 31 14 5 0 15 7 122 12 72 4 77 11 110 3 140
9 17 5 18 12 34 11 96 0 5 7 65 2 83 14 115 13 107 4 6 1 86 6 60 8 51 10 70 3 42
5 123 11 45 2 43 8 78 9 83 0 107 3 65 13 149 12 17 7 152 4 12... |
40 | 15 | J0:
M0:6 M10:11 M8:6 M4:5 M11:6 M3:10 M12:11 M6:7 M14:12 M2:7 M1:9 M5:12 M9:9 M13:5 M7:10
J1:
M6:8 M9:6 M3:5 M2:11 M7:8 M8:8 M11:9 M14:9 M1:6 M10:9 M12:7 M5:7 M13:11 M4:6 M0:9
J2:
M11:11 M8:12 M1:10 M2:12 M5:10 M9:6 M13:8 M14:11 M7:9 M10:10 M6:11 M0:6 M3:6 M12:5 M4:10
J3:
M8:12 M0:6 M9:5 M12:9 M3:6 M11:6 M6:10 M7:10... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J0: 6 J3: 6 J7: 12 J26: 5 J28: 6 J14: 5 J21: 10 J5: 11 J8: 9 J9: 10 J34: 6 J4: 7 J6: 6 J13: 5 J31: 5 J37: 5 J39: 10 J20: 5 J11: 5 J16: 10 J19: 8 J32: 9 J12: 9 J15: 11 J17: 6 J30: 5 J18: 12 J22: 12 J33: 7 J2: 6 J29: 5 J35: 11 J36: 9 J38: 12 J10: 9 J27: 7 J1: 9 J23: 8 J24: 8 J25: 7
M1:
J5: 10 J31: 12 J13: 11 J14: 7 ... | J0:
M0:6 M10:11 M8:6 M4:5 M11:6 M3:10 M12:11 M6:7 M14:12 M2:7 M1:9 M5:12 M9:9 M13:5 M7:10
J1:
M6:8 M9:6 M3:5 M2:11 M7:8 M8:8 M11:9 M14:9 M1:6 M10:9 M12:7 M5:7 M13:11 M4:6 M0:9
J2:
M11:11 M8:12 M1:10 M2:12 M5:10 M9:6 M13:8 M14:11 M7:9 M10:10 M6:11 M0:6 M3:6 M12:5 M4:10
J3:
M8:12 M0:6 M9:5 M12:9 M3:6 M11:6 M6:10 M7:10... | Solution:
J0-M0: 0+6 -> 6,J5-M1: 0+10 -> 10,J28-M2: 0+5 -> 5,J4-M3: 0+8 -> 8,J33-M4: 0+8 -> 8,J37-M5: 0+7 -> 7,J17-M6: 0+5 -> 5,J14-M7: 0+8 -> 8,J36-M8: 0+7 -> 7,J9-M9: 0+8 -> 8,J13-M10: 0+5 -> 5,J30-M11: 0+5 -> 5,J22-M12: 0+7 -> 7,J35-M13: 0+11 -> 11,J24-M14: 0+12 -> 12,J39-M2: 5+7 -> 12,J25-M6: 5+7 -> 12,J8-M10: 5+8 ... | 40x15_775.jsp | 40 15
0 6 10 11 8 6 4 5 11 6 3 10 12 11 6 7 14 12 2 7 1 9 5 12 9 9 13 5 7 10
6 8 9 6 3 5 2 11 7 8 8 8 11 9 14 9 1 6 10 9 12 7 5 7 13 11 4 6 0 9
11 11 8 12 1 10 2 12 5 10 9 6 13 8 14 11 7 9 10 10 6 11 0 6 3 6 12 5 4 10
8 12 0 6 9 5 12 9 3 6 11 6 6 10 7 10 14 9 2 8 1 5 13 11 4 8 10 10 5 6
3 8 7 5 1 9 9 5 13 6 0 7 14 7 6 ... |
40 | 20 | J0:
M3:8 M11:35 M7:12 M17:5 M16:22 M5:17 M18:34 M4:26 M10:19 M1:15 M12:27 M2:5 M13:8 M6:6 M9:24 M0:7 M14:5 M19:19 M15:6 M8:33
J1:
M14:30 M4:29 M12:32 M1:17 M3:11 M10:21 M7:29 M2:6 M9:7 M11:24 M16:16 M0:26 M18:28 M5:20 M13:34 M19:29 M6:15 M8:35 M17:6 M15:11
J2:
M14:9 M4:21 M12:34 M6:19 M15:34 M16:34 M1:22 M2:15 M7:24 ... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 15 J10: 19 J11: 12 J35: 27 J3: 28 J34: 33 J32: 34 J7: 20 J8: 19 J20: 24 J28: 29 J6: 18 J9: 5 J21: 5 J23: 13 J27: 15 J19: 6 J25: 28 J33: 10 J1: 26 J16: 5 J4: 24 J12: 21 J26: 22 J14: 24 J15: 6 J24: 12 J38: 35 J0: 7 J29: 26 J17: 33 J13: 33 J18: 35 J22: 25 J30: 6 J31: 8 J37: 8 J39: 10 J2: 29 J36: 7
M1:
J6: 31 J33:... | J0:
M3:8 M11:35 M7:12 M17:5 M16:22 M5:17 M18:34 M4:26 M10:19 M1:15 M12:27 M2:5 M13:8 M6:6 M9:24 M0:7 M14:5 M19:19 M15:6 M8:33
J1:
M14:30 M4:29 M12:32 M1:17 M3:11 M10:21 M7:29 M2:6 M9:7 M11:24 M16:16 M0:26 M18:28 M5:20 M13:34 M19:29 M6:15 M8:35 M17:6 M15:11
J2:
M14:9 M4:21 M12:34 M6:19 M15:34 M16:34 M1:22 M2:15 M7:24 ... | Solution:
J5-M0: 0+15 -> 15,J6-M1: 0+31 -> 31,J25-M2: 0+12 -> 12,J36-M3: 0+8 -> 8,J14-M5: 0+14 -> 14,J10-M6: 0+17 -> 17,J3-M7: 0+24 -> 24,J13-M8: 0+32 -> 32,J21-M9: 0+30 -> 30,J31-M10: 0+16 -> 16,J33-M11: 0+12 -> 12,J39-M12: 0+24 -> 24,J24-M13: 0+11 -> 11,J2-M14: 0+9 -> 9,J12-M15: 0+24 -> 24,J17-M17: 0+19 -> 19,J35-M18... | 40x20_1215.jsp | 40 20
3 8 11 35 7 12 17 5 16 22 5 17 18 34 4 26 10 19 1 15 12 27 2 5 13 8 6 6 9 24 0 7 14 5 19 19 15 6 8 33
14 30 4 29 12 32 1 17 3 11 10 21 7 29 2 6 9 7 11 24 16 16 0 26 18 28 5 20 13 34 19 29 6 15 8 35 17 6 15 11
14 9 4 21 12 34 6 19 15 34 16 34 1 22 2 15 7 24 10 16 19 26 18 20 3 21 17 25 13 34 11 30 5 16 8 34 9 25 0... |
30 | 30 | J0:
M26:80 M16:146 M18:44 M15:58 M14:158 M10:81 M5:108 M25:46 M8:122 M6:186 M21:96 M27:181 M17:63 M13:18 M3:8 M20:12 M2:171 M7:185 M24:171 M19:75 M4:127 M28:49 M1:96 M12:171 M0:20 M11:20 M22:52 M29:69 M9:173 M23:115
J1:
M22:26 M25:41 M29:92 M24:43 M21:180 M15:73 M13:47 M23:89 M3:106 M14:172 M0:91 M19:77 M4:184 M28:89 ... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J28: 119 J8: 61 J24: 69 J22: 54 J2: 117 J12: 13 J1: 91 J17: 26 J29: 187 J9: 33 J3: 23 J5: 153 J11: 135 J16: 80 J4: 85 J10: 65 J14: 64 J15: 48 J21: 12 J18: 12 J25: 111 J19: 107 J13: 89 J27: 163 J6: 166 J0: 20 J7: 115 J20: 110 J26: 180 J23: 6
M1:
J2: 87 J12: 51 J13: 63 J9: 32 J23: 13 J29: 11 J6: 26 J4: 56 J7: 19 J16... | J0:
M26:80 M16:146 M18:44 M15:58 M14:158 M10:81 M5:108 M25:46 M8:122 M6:186 M21:96 M27:181 M17:63 M13:18 M3:8 M20:12 M2:171 M7:185 M24:171 M19:75 M4:127 M28:49 M1:96 M12:171 M0:20 M11:20 M22:52 M29:69 M9:173 M23:115
J1:
M22:26 M25:41 M29:92 M24:43 M21:180 M15:73 M13:47 M23:89 M3:106 M14:172 M0:91 M19:77 M4:184 M28:89 ... | Solution:
J28-M0: 0+119 -> 119,J12-M1: 0+51 -> 51,J16-M2: 0+66 -> 66,J26-M6: 0+143 -> 143,J25-M7: 0+70 -> 70,J29-M8: 0+187 -> 187,J10-M9: 0+30 -> 30,J23-M11: 0+99 -> 99,J3-M13: 0+81 -> 81,J19-M14: 0+182 -> 182,J4-M17: 0+151 -> 151,J21-M18: 0+128 -> 128,J9-M19: 0+37 -> 37,J14-M20: 0+26 -> 26,J1-M22: 0+26 -> 26,J15-M23: ... | 30x30_1355.jsp | 30 30
26 80 16 146 18 44 15 58 14 158 10 81 5 108 25 46 8 122 6 186 21 96 27 181 17 63 13 18 3 8 20 12 2 171 7 185 24 171 19 75 4 127 28 49 1 96 12 171 0 20 11 20 22 52 29 69 9 173 23 115
22 26 25 41 29 92 24 43 21 180 15 73 13 47 23 89 3 106 14 172 0 91 19 77 4 184 28 89 18 107 6 82 8 100 2 161 26 155 12 38 20 95 1 49... |
100 | 20 | J0:
M19:40 M17:70 M18:54 M12:60 M3:68 M8:29 M13:31 M1:44 M2:42 M15:110 M6:132 M5:7 M4:136 M10:78 M11:52 M16:55 M7:91 M0:96 M14:16 M9:131
J1:
M5:24 M17:124 M9:42 M0:44 M8:8 M6:62 M3:76 M10:116 M4:128 M13:50 M12:9 M11:141 M19:141 M14:102 M16:77 M18:89 M15:98 M2:85 M1:19 M7:142
J2:
M13:88 M2:79 M8:133 M14:11 M1:125 M3:9... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 94 J60: 121 J72: 100 J5: 110 J10: 121 J27: 60 J31: 126 J89: 90 J92: 8 J11: 59 J23: 126 J42: 11 J50: 134 J54: 147 J59: 105 J1: 44 J26: 90 J37: 82 J57: 84 J73: 80 J81: 113 J99: 119 J7: 98 J32: 75 J49: 30 J51: 152 J85: 69 J87: 142 J95: 124 J70: 81 J98: 115 J15: 81 J62: 147 J82: 122 J94: 97 J9: 69 J13: 129 J91: 25 ... | J0:
M19:40 M17:70 M18:54 M12:60 M3:68 M8:29 M13:31 M1:44 M2:42 M15:110 M6:132 M5:7 M4:136 M10:78 M11:52 M16:55 M7:91 M0:96 M14:16 M9:131
J1:
M5:24 M17:124 M9:42 M0:44 M8:8 M6:62 M3:76 M10:116 M4:128 M13:50 M12:9 M11:141 M19:141 M14:102 M16:77 M18:89 M15:98 M2:85 M1:19 M7:142
J2:
M13:88 M2:79 M8:133 M14:11 M1:125 M3:9... | Solution:
J3-M0: 0+94 -> 94,J31-M1: 0+11 -> 11,J79-M2: 0+8 -> 8,J57-M3: 0+34 -> 34,J15-M4: 0+84 -> 84,J45-M5: 0+15 -> 15,J97-M6: 0+70 -> 70,J65-M7: 0+18 -> 18,J64-M8: 0+6 -> 6,J29-M9: 0+22 -> 22,J71-M10: 0+44 -> 44,J28-M11: 0+14 -> 14,J48-M12: 0+13 -> 13,J20-M13: 0+11 -> 11,J40-M14: 0+33 -> 33,J58-M15: 0+37 -> 37,J78-M... | 100x20_491.jsp | 100 20
19 40 17 70 18 54 12 60 3 68 8 29 13 31 1 44 2 42 15 110 6 132 5 7 4 136 10 78 11 52 16 55 7 91 0 96 14 16 9 131
5 24 17 124 9 42 0 44 8 8 6 62 3 76 10 116 4 128 13 50 12 9 11 141 19 141 14 102 16 77 18 89 15 98 2 85 1 19 7 142
13 88 2 79 8 133 14 11 1 125 3 93 11 130 5 71 19 79 7 47 16 117 15 101 4 13 10 74 9 1... |
40 | 40 | J0:
M24:6 M22:18 M27:24 M26:24 M5:20 M35:25 M10:19 M13:22 M3:14 M33:29 M1:10 M15:8 M25:12 M37:21 M39:21 M16:15 M7:21 M21:32 M34:13 M12:14 M20:15 M14:20 M17:22 M18:16 M8:8 M30:7 M28:19 M38:18 M4:24 M32:5 M29:26 M9:19 M6:12 M11:5 M31:25 M0:13 M36:11 M23:30 M2:27 M19:10
J1:
M1:17 M14:16 M2:22 M25:32 M4:33 M9:8 M8:20 M13:... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J13: 10 J5: 22 J11: 27 J19: 15 J29: 12 J10: 30 J12: 18 J37: 14 J3: 33 J9: 20 J14: 8 J35: 19 J7: 22 J27: 19 J32: 33 J21: 17 J38: 20 J33: 32 J4: 22 J30: 17 J6: 13 J15: 31 J26: 17 J2: 15 J28: 23 J18: 32 J8: 23 J22: 32 J36: 19 J1: 6 J17: 11 J23: 28 J25: 10 J16: 8 J31: 30 J0: 13 J20: 13 J24: 17 J39: 30 J34: 20
M1:
J1: ... | J0:
M24:6 M22:18 M27:24 M26:24 M5:20 M35:25 M10:19 M13:22 M3:14 M33:29 M1:10 M15:8 M25:12 M37:21 M39:21 M16:15 M7:21 M21:32 M34:13 M12:14 M20:15 M14:20 M17:22 M18:16 M8:8 M30:7 M28:19 M38:18 M4:24 M32:5 M29:26 M9:19 M6:12 M11:5 M31:25 M0:13 M36:11 M23:30 M2:27 M19:10
J1:
M1:17 M14:16 M2:22 M25:32 M4:33 M9:8 M8:20 M13:... | Solution:
J18-M1: 0+7 -> 7,J30-M2: 0+21 -> 21,J32-M4: 0+23 -> 23,J19-M5: 0+14 -> 14,J33-M6: 0+23 -> 23,J26-M7: 0+24 -> 24,J13-M11: 0+10 -> 10,J9-M12: 0+14 -> 14,J25-M13: 0+7 -> 7,J20-M15: 0+22 -> 22,J10-M18: 0+18 -> 18,J12-M20: 0+6 -> 6,J4-M21: 0+17 -> 17,J8-M23: 0+16 -> 16,J0-M24: 0+6 -> 6,J22-M25: 0+18 -> 18,J38-M27:... | 40x40_1996.jsp | 40 40
24 6 22 18 27 24 26 24 5 20 35 25 10 19 13 22 3 14 33 29 1 10 15 8 25 12 37 21 39 21 16 15 7 21 21 32 34 13 12 14 20 15 14 20 17 22 18 16 8 8 30 7 28 19 38 18 4 24 32 5 29 26 9 19 6 12 11 5 31 25 0 13 36 11 23 30 2 27 19 10
1 17 14 16 2 22 25 32 4 33 9 8 8 20 13 25 24 11 33 16 20 12 17 12 31 29 38 32 37 20 39 29 ... |
100 | 20 | J0:
M6:158 M14:209 M2:35 M4:180 M9:116 M10:192 M15:100 M7:36 M11:144 M1:200 M17:182 M0:61 M19:132 M5:15 M13:40 M8:18 M16:121 M3:182 M18:210 M12:98
J1:
M16:138 M10:113 M13:55 M18:215 M7:42 M3:111 M1:145 M11:115 M4:108 M17:140 M14:136 M0:21 M15:195 M12:190 M8:183 M6:23 M5:38 M9:133 M19:108 M2:142
J2:
M0:157 M16:140 M9:... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 157 J8: 129 J60: 116 J73: 153 J80: 123 J86: 62 J4: 172 J29: 140 J35: 98 J61: 175 J63: 23 J93: 81 J30: 108 J46: 123 J62: 164 J71: 27 J16: 29 J24: 18 J69: 123 J10: 155 J58: 32 J82: 30 J38: 212 J51: 33 J54: 30 J64: 120 J96: 8 J68: 34 J11: 128 J20: 194 J48: 33 J56: 76 J65: 58 J81: 188 J6: 128 J25: 83 J28: 8 J32: 53... | J0:
M6:158 M14:209 M2:35 M4:180 M9:116 M10:192 M15:100 M7:36 M11:144 M1:200 M17:182 M0:61 M19:132 M5:15 M13:40 M8:18 M16:121 M3:182 M18:210 M12:98
J1:
M16:138 M10:113 M13:55 M18:215 M7:42 M3:111 M1:145 M11:115 M4:108 M17:140 M14:136 M0:21 M15:195 M12:190 M8:183 M6:23 M5:38 M9:133 M19:108 M2:142
J2:
M0:157 M16:140 M9:... | Solution:
J86-M0: 0+62 -> 62,J20-M1: 0+8 -> 8,J99-M2: 0+7 -> 7,J50-M3: 0+17 -> 17,J83-M4: 0+13 -> 13,J69-M5: 0+51 -> 51,J63-M6: 0+8 -> 8,J40-M7: 0+25 -> 25,J52-M8: 0+11 -> 11,J59-M10: 0+71 -> 71,J95-M11: 0+60 -> 60,J84-M12: 0+50 -> 50,J71-M13: 0+47 -> 47,J29-M14: 0+17 -> 17,J75-M15: 0+26 -> 26,J43-M16: 0+56 -> 56,J58-M... | 100x20_1569.jsp | 100 20
6 158 14 209 2 35 4 180 9 116 10 192 15 100 7 36 11 144 1 200 17 182 0 61 19 132 5 15 13 40 8 18 16 121 3 182 18 210 12 98
16 138 10 113 13 55 18 215 7 42 3 111 1 145 11 115 4 108 17 140 14 136 0 21 15 195 12 190 8 183 6 23 5 38 9 133 19 108 2 142
0 157 16 140 9 30 5 16 7 72 1 164 13 104 15 164 6 196 12 50 2 172... |
30 | 30 | J0:
M28:124 M25:52 M27:20 M7:106 M10:100 M6:84 M11:102 M17:54 M18:107 M14:76 M5:14 M22:29 M26:69 M23:120 M15:21 M19:54 M4:64 M12:68 M2:71 M0:33 M24:61 M3:124 M16:70 M9:91 M20:79 M8:6 M13:105 M1:82 M21:18 M29:21
J1:
M21:7 M28:98 M25:101 M8:48 M19:76 M0:104 M12:61 M7:69 M29:44 M10:48 M15:103 M18:60 M20:15 M23:76 M24:10 ... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J8: 52 J29: 49 J22: 27 J1: 104 J3: 21 J11: 94 J19: 9 J17: 33 J20: 80 J16: 110 J13: 44 J9: 17 J2: 82 J4: 121 J28: 119 J12: 25 J14: 31 J21: 77 J0: 33 J27: 127 J25: 24 J5: 80 J23: 32 J24: 126 J15: 18 J6: 55 J26: 72 J7: 96 J10: 111 J18: 89
M1:
J4: 31 J25: 102 J10: 70 J28: 40 J29: 49 J6: 10 J16: 111 J12: 54 J8: 39 J9: ... | J0:
M28:124 M25:52 M27:20 M7:106 M10:100 M6:84 M11:102 M17:54 M18:107 M14:76 M5:14 M22:29 M26:69 M23:120 M15:21 M19:54 M4:64 M12:68 M2:71 M0:33 M24:61 M3:124 M16:70 M9:91 M20:79 M8:6 M13:105 M1:82 M21:18 M29:21
J1:
M21:7 M28:98 M25:101 M8:48 M19:76 M0:104 M12:61 M7:69 M29:44 M10:48 M15:103 M18:60 M20:15 M23:76 M24:10 ... | Solution:
J24-M2: 0+55 -> 55,J20-M3: 0+72 -> 72,J12-M4: 0+59 -> 59,J2-M5: 0+92 -> 92,J11-M8: 0+94 -> 94,J26-M9: 0+32 -> 32,J14-M10: 0+104 -> 104,J8-M13: 0+78 -> 78,J21-M14: 0+6 -> 6,J28-M16: 0+53 -> 53,J15-M18: 0+58 -> 58,J27-M19: 0+38 -> 38,J1-M21: 0+7 -> 7,J19-M22: 0+25 -> 25,J5-M23: 0+76 -> 76,J7-M24: 0+24 -> 24,J9-... | 30x30_1008.jsp | 30 30
28 124 25 52 27 20 7 106 10 100 6 84 11 102 17 54 18 107 14 76 5 14 22 29 26 69 23 120 15 21 19 54 4 64 12 68 2 71 0 33 24 61 3 124 16 70 9 91 20 79 8 6 13 105 1 82 21 18 29 21
21 7 28 98 25 101 8 48 19 76 0 104 12 61 7 69 29 44 10 48 15 103 18 60 20 15 23 76 24 10 26 98 27 88 13 43 5 115 6 77 11 107 4 22 22 28 2... |
50 | 15 | J0:
M9:76 M1:23 M11:145 M0:122 M8:16 M3:44 M6:58 M5:20 M7:92 M14:55 M12:100 M2:134 M10:63 M13:141 M4:125
J1:
M13:20 M6:110 M1:101 M10:151 M5:19 M0:80 M4:87 M3:121 M7:7 M12:120 M8:110 M2:117 M11:71 M14:93 M9:137
J2:
M0:19 M5:113 M8:146 M4:88 M7:111 M6:43 M12:39 M9:96 M10:156 M3:32 M2:94 M11:102 M1:130 M13:73 M14:50
J... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 19 J11: 101 J15: 28 J23: 57 J13: 74 J33: 16 J41: 67 J44: 106 J7: 98 J10: 37 J48: 87 J0: 122 J5: 19 J8: 153 J21: 92 J26: 27 J37: 108 J46: 113 J1: 80 J20: 131 J22: 27 J27: 123 J31: 39 J32: 96 J43: 71 J49: 132 J14: 38 J30: 95 J4: 17 J9: 57 J47: 16 J3: 106 J12: 89 J19: 157 J39: 70 J6: 30 J25: 88 J36: 101 J16: 116 J... | J0:
M9:76 M1:23 M11:145 M0:122 M8:16 M3:44 M6:58 M5:20 M7:92 M14:55 M12:100 M2:134 M10:63 M13:141 M4:125
J1:
M13:20 M6:110 M1:101 M10:151 M5:19 M0:80 M4:87 M3:121 M7:7 M12:120 M8:110 M2:117 M11:71 M14:93 M9:137
J2:
M0:19 M5:113 M8:146 M4:88 M7:111 M6:43 M12:39 M9:96 M10:156 M3:32 M2:94 M11:102 M1:130 M13:73 M14:50
J... | Solution:
J2-M0: 0+19 -> 19,J25-M1: 0+12 -> 12,J40-M3: 0+75 -> 75,J6-M4: 0+24 -> 24,J27-M5: 0+41 -> 41,J3-M6: 0+31 -> 31,J8-M7: 0+51 -> 51,J5-M8: 0+19 -> 19,J44-M9: 0+12 -> 12,J20-M10: 0+122 -> 122,J9-M11: 0+12 -> 12,J18-M12: 0+30 -> 30,J1-M13: 0+20 -> 20,J10-M14: 0+35 -> 35,J4-M1: 12+65 -> 77,J25-M2: 12+31 -> 43,J12-M... | 50x15_789.jsp | 50 15
9 76 1 23 11 145 0 122 8 16 3 44 6 58 5 20 7 92 14 55 12 100 2 134 10 63 13 141 4 125
13 20 6 110 1 101 10 151 5 19 0 80 4 87 3 121 7 7 12 120 8 110 2 117 11 71 14 93 9 137
0 19 5 113 8 146 4 88 7 111 6 43 12 39 9 96 10 156 3 32 2 94 11 102 1 130 13 73 14 50
6 31 14 126 4 58 11 42 8 7 13 151 2 16 1 32 10 72 0 106... |
30 | 30 | J0:
M5:181 M17:45 M24:127 M23:217 M13:183 M21:72 M27:209 M26:226 M9:251 M15:166 M10:65 M16:193 M14:134 M11:39 M4:221 M20:157 M8:18 M0:184 M3:39 M19:32 M29:50 M22:173 M25:203 M18:29 M12:82 M28:133 M2:197 M1:66 M6:132 M7:220
J1:
M9:195 M3:14 M17:244 M22:198 M29:244 M12:150 M19:148 M5:180 M16:78 M23:91 M24:5 M6:233 M8:22... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 187 J19: 44 J7: 65 J21: 141 J28: 43 J15: 104 J12: 210 J13: 225 J18: 99 J2: 148 J5: 189 J8: 229 J14: 79 J27: 182 J0: 184 J23: 87 J17: 114 J4: 111 J11: 134 J10: 88 J22: 181 J16: 149 J20: 183 J25: 127 J29: 97 J1: 201 J9: 5 J26: 174 J6: 230 J24: 189
M1:
J2: 141 J7: 71 J20: 43 J11: 152 J10: 95 J4: 9 J5: 27 J26: 73 ... | J0:
M5:181 M17:45 M24:127 M23:217 M13:183 M21:72 M27:209 M26:226 M9:251 M15:166 M10:65 M16:193 M14:134 M11:39 M4:221 M20:157 M8:18 M0:184 M3:39 M19:32 M29:50 M22:173 M25:203 M18:29 M12:82 M28:133 M2:197 M1:66 M6:132 M7:220
J1:
M9:195 M3:14 M17:244 M22:198 M29:244 M12:150 M19:148 M5:180 M16:78 M23:91 M24:5 M6:233 M8:22... | Solution:
J7-M1: 0+71 -> 71,J24-M2: 0+71 -> 71,J15-M4: 0+94 -> 94,J0-M5: 0+181 -> 181,J22-M7: 0+40 -> 40,J20-M8: 0+32 -> 32,J14-M9: 0+67 -> 67,J3-M10: 0+65 -> 65,J5-M14: 0+213 -> 213,J9-M16: 0+121 -> 121,J25-M17: 0+94 -> 94,J23-M20: 0+82 -> 82,J10-M21: 0+203 -> 203,J29-M23: 0+108 -> 108,J4-M24: 0+238 -> 238,J6-M25: 0+4... | 30x30_2372.jsp | 30 30
5 181 17 45 24 127 23 217 13 183 21 72 27 209 26 226 9 251 15 166 10 65 16 193 14 134 11 39 4 221 20 157 8 18 0 184 3 39 19 32 29 50 22 173 25 203 18 29 12 82 28 133 2 197 1 66 6 132 7 220
9 195 3 14 17 244 22 198 29 244 12 150 19 148 5 180 16 78 23 91 24 5 6 233 8 228 20 66 11 116 15 220 13 94 21 198 1 245 7 138... |
50 | 20 | J0:
M4:57 M17:16 M6:83 M3:37 M5:47 M12:74 M18:89 M0:95 M15:40 M16:13 M10:86 M1:62 M9:76 M19:44 M2:9 M8:88 M7:22 M11:41 M13:11 M14:81
J1:
M9:89 M2:26 M17:31 M15:26 M14:77 M12:40 M19:91 M1:25 M5:78 M18:23 M13:55 M0:90 M11:87 M7:63 M4:82 M6:15 M3:114 M8:49 M10:90 M16:83
J2:
M1:41 M14:71 M5:72 M13:82 M2:86 M12:38 M7:69 M... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J31: 12 J27: 89 J37: 78 J43: 77 J3: 87 J8: 24 J15: 9 J40: 65 J42: 7 J49: 33 J5: 34 J33: 66 J36: 46 J48: 36 J16: 34 J18: 7 J29: 43 J35: 41 J21: 59 J34: 40 J41: 69 J0: 95 J20: 43 J17: 19 J14: 9 J1: 90 J7: 17 J22: 42 J4: 46 J19: 20 J12: 72 J30: 61 J44: 26 J13: 37 J24: 23 J26: 43 J23: 32 J28: 63 J38: 45 J45: 42 J10: 11... | J0:
M4:57 M17:16 M6:83 M3:37 M5:47 M12:74 M18:89 M0:95 M15:40 M16:13 M10:86 M1:62 M9:76 M19:44 M2:9 M8:88 M7:22 M11:41 M13:11 M14:81
J1:
M9:89 M2:26 M17:31 M15:26 M14:77 M12:40 M19:91 M1:25 M5:78 M18:23 M13:55 M0:90 M11:87 M7:63 M4:82 M6:15 M3:114 M8:49 M10:90 M16:83
J2:
M1:41 M14:71 M5:72 M13:82 M2:86 M12:38 M7:69 M... | Solution:
J31-M0: 0+12 -> 12,J33-M1: 0+6 -> 6,J32-M2: 0+53 -> 53,J23-M3: 0+40 -> 40,J25-M4: 0+23 -> 23,J34-M5: 0+38 -> 38,J45-M6: 0+13 -> 13,J5-M7: 0+8 -> 8,J7-M8: 0+71 -> 71,J1-M9: 0+89 -> 89,J19-M11: 0+48 -> 48,J15-M12: 0+50 -> 50,J10-M13: 0+30 -> 30,J49-M14: 0+75 -> 75,J21-M15: 0+53 -> 53,J8-M16: 0+103 -> 103,J35-M1... | 50x20_678.jsp | 50 20
4 57 17 16 6 83 3 37 5 47 12 74 18 89 0 95 15 40 16 13 10 86 1 62 9 76 19 44 2 9 8 88 7 22 11 41 13 11 14 81
9 89 2 26 17 31 15 26 14 77 12 40 19 91 1 25 5 78 18 23 13 55 0 90 11 87 7 63 4 82 6 15 3 114 8 49 10 90 16 83
1 41 14 71 5 72 13 82 2 86 12 38 7 69 10 13 18 31 6 50 16 105 3 15 17 45 9 111 8 15 11 58 19 5... |
100 | 20 | J0:
M9:59 M11:181 M1:8 M0:18 M13:125 M16:86 M17:47 M8:13 M10:148 M2:123 M12:203 M4:204 M5:87 M14:169 M19:170 M18:127 M3:6 M6:23 M15:199 M7:104
J1:
M8:103 M6:118 M13:107 M2:154 M10:105 M19:95 M4:99 M18:202 M9:44 M1:49 M17:68 M14:22 M3:98 M5:110 M12:182 M11:114 M16:93 M0:183 M15:103 M7:196
J2:
M4:23 M0:150 M16:117 M17:... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J49: 117 J54: 189 J68: 177 J71: 6 J92: 74 J96: 165 J2: 150 J3: 5 J10: 155 J12: 46 J94: 166 J11: 115 J51: 159 J90: 132 J0: 18 J17: 192 J25: 11 J37: 139 J62: 190 J72: 78 J86: 100 J87: 105 J26: 87 J38: 203 J46: 67 J30: 57 J34: 101 J73: 134 J79: 94 J97: 5 J14: 78 J65: 70 J67: 72 J22: 111 J32: 27 J35: 191 J43: 54 J47: 3... | J0:
M9:59 M11:181 M1:8 M0:18 M13:125 M16:86 M17:47 M8:13 M10:148 M2:123 M12:203 M4:204 M5:87 M14:169 M19:170 M18:127 M3:6 M6:23 M15:199 M7:104
J1:
M8:103 M6:118 M13:107 M2:154 M10:105 M19:95 M4:99 M18:202 M9:44 M1:49 M17:68 M14:22 M3:98 M5:110 M12:182 M11:114 M16:93 M0:183 M15:103 M7:196
J2:
M4:23 M0:150 M16:117 M17:... | Solution:
J71-M0: 0+6 -> 6,J95-M1: 0+14 -> 14,J52-M2: 0+21 -> 21,J13-M3: 0+73 -> 73,J79-M4: 0+10 -> 10,J38-M5: 0+17 -> 17,J57-M6: 0+98 -> 98,J70-M7: 0+143 -> 143,J19-M8: 0+40 -> 40,J0-M9: 0+59 -> 59,J3-M10: 0+10 -> 10,J58-M11: 0+86 -> 86,J73-M12: 0+86 -> 86,J65-M13: 0+13 -> 13,J20-M14: 0+46 -> 46,J60-M15: 0+8 -> 8,J75-... | 100x20_456.jsp | 100 20
9 59 11 181 1 8 0 18 13 125 16 86 17 47 8 13 10 148 2 123 12 203 4 204 5 87 14 169 19 170 18 127 3 6 6 23 15 199 7 104
8 103 6 118 13 107 2 154 10 105 19 95 4 99 18 202 9 44 1 49 17 68 14 22 3 98 5 110 12 182 11 114 16 93 0 183 15 103 7 196
4 23 0 150 16 117 17 165 7 77 9 86 11 124 3 120 5 149 12 141 18 90 1 128... |
50 | 20 | J0:
M15:36 M4:104 M1:17 M13:111 M7:194 M9:200 M16:66 M3:176 M14:27 M19:100 M2:42 M10:192 M12:159 M17:160 M18:188 M5:97 M8:209 M0:202 M11:60 M6:166
J1:
M17:44 M7:119 M11:195 M14:63 M5:28 M4:47 M15:50 M16:58 M8:67 M12:162 M9:172 M10:121 M0:41 M2:193 M13:50 M1:49 M6:7 M3:142 M19:172 M18:79
J2:
M11:83 M1:179 M2:205 M19:1... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J40: 129 J46: 105 J14: 12 J27: 184 J39: 11 J47: 128 J24: 59 J25: 140 J8: 85 J10: 182 J44: 170 J3: 100 J18: 60 J35: 210 J41: 118 J5: 184 J2: 20 J15: 32 J28: 65 J7: 189 J11: 108 J20: 208 J38: 26 J48: 54 J26: 166 J1: 41 J30: 121 J43: 119 J6: 146 J17: 82 J36: 48 J9: 187 J19: 124 J22: 193 J33: 54 J37: 57 J4: 8 J13: 6 J3... | J0:
M15:36 M4:104 M1:17 M13:111 M7:194 M9:200 M16:66 M3:176 M14:27 M19:100 M2:42 M10:192 M12:159 M17:160 M18:188 M5:97 M8:209 M0:202 M11:60 M6:166
J1:
M17:44 M7:119 M11:195 M14:63 M5:28 M4:47 M15:50 M16:58 M8:67 M12:162 M9:172 M10:121 M0:41 M2:193 M13:50 M1:49 M6:7 M3:142 M19:172 M18:79
J2:
M11:83 M1:179 M2:205 M19:1... | Solution:
J3-M2: 0+96 -> 96,J17-M3: 0+12 -> 12,J37-M4: 0+37 -> 37,J13-M5: 0+56 -> 56,J23-M6: 0+72 -> 72,J34-M7: 0+132 -> 132,J21-M8: 0+24 -> 24,J38-M9: 0+21 -> 21,J27-M10: 0+120 -> 120,J2-M11: 0+83 -> 83,J28-M12: 0+148 -> 148,J8-M13: 0+18 -> 18,J45-M14: 0+200 -> 200,J0-M15: 0+36 -> 36,J47-M16: 0+30 -> 30,J33-M17: 0+31 ... | 50x20_99.jsp | 50 20
15 36 4 104 1 17 13 111 7 194 9 200 16 66 3 176 14 27 19 100 2 42 10 192 12 159 17 160 18 188 5 97 8 209 0 202 11 60 6 166
17 44 7 119 11 195 14 63 5 28 4 47 15 50 16 58 8 67 12 162 9 172 10 121 0 41 2 193 13 50 1 49 6 7 3 142 19 172 18 79
11 83 1 179 2 205 19 170 5 155 4 196 10 34 15 41 7 168 0 20 8 97 18 142 3 ... |
50 | 15 | J0:
M12:159 M14:91 M10:25 M6:42 M13:154 M7:67 M1:14 M9:62 M5:16 M0:65 M8:109 M11:40 M3:123 M2:65 M4:111
J1:
M13:77 M12:142 M2:13 M10:11 M9:162 M6:79 M0:21 M11:88 M1:112 M7:65 M3:122 M4:158 M8:123 M14:121 M5:129
J2:
M7:53 M3:49 M13:151 M8:55 M2:93 M14:10 M6:142 M11:59 M12:29 M9:138 M0:123 M10:76 M1:159 M4:110 M5:76
J... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J12: 12 J46: 147 J4: 17 J11: 29 J13: 11 J16: 62 J34: 143 J36: 134 J43: 107 J8: 70 J10: 122 J47: 13 J3: 101 J17: 83 J23: 139 J25: 67 J30: 10 J31: 140 J1: 21 J19: 14 J15: 135 J20: 143 J35: 93 J38: 124 J42: 138 J44: 81 J5: 109 J7: 103 J28: 79 J40: 111 J41: 65 J49: 132 J0: 65 J24: 98 J29: 124 J45: 56 J2: 123 J6: 7 J32:... | J0:
M12:159 M14:91 M10:25 M6:42 M13:154 M7:67 M1:14 M9:62 M5:16 M0:65 M8:109 M11:40 M3:123 M2:65 M4:111
J1:
M13:77 M12:142 M2:13 M10:11 M9:162 M6:79 M0:21 M11:88 M1:112 M7:65 M3:122 M4:158 M8:123 M14:121 M5:129
J2:
M7:53 M3:49 M13:151 M8:55 M2:93 M14:10 M6:142 M11:59 M12:29 M9:138 M0:123 M10:76 M1:159 M4:110 M5:76
J... | Solution:
J12-M0: 0+12 -> 12,J31-M1: 0+78 -> 78,J8-M3: 0+16 -> 16,J36-M4: 0+18 -> 18,J11-M5: 0+66 -> 66,J35-M6: 0+48 -> 48,J30-M7: 0+31 -> 31,J20-M8: 0+82 -> 82,J10-M9: 0+16 -> 16,J43-M10: 0+58 -> 58,J47-M11: 0+17 -> 17,J29-M12: 0+140 -> 140,J16-M13: 0+32 -> 32,J3-M14: 0+73 -> 73,J46-M0: 12+147 -> 159,J37-M3: 16+16 -> ... | 50x15_774.jsp | 50 15
12 159 14 91 10 25 6 42 13 154 7 67 1 14 9 62 5 16 0 65 8 109 11 40 3 123 2 65 4 111
13 77 12 142 2 13 10 11 9 162 6 79 0 21 11 88 1 112 7 65 3 122 4 158 8 123 14 121 5 129
7 53 3 49 13 151 8 55 2 93 14 10 6 142 11 59 12 29 9 138 0 123 10 76 1 159 4 110 5 76
14 73 10 7 8 123 0 101 5 25 2 118 11 5 4 60 6 71 3 46 1... |
50 | 20 | J0:
M14:17 M3:140 M10:220 M17:111 M2:174 M19:222 M5:63 M9:107 M4:39 M8:67 M11:155 M0:10 M1:26 M15:60 M18:232 M7:109 M13:5 M16:152 M12:223 M6:48
J1:
M1:165 M12:73 M16:33 M13:34 M9:35 M11:263 M14:255 M10:159 M6:65 M4:111 M7:7 M8:224 M18:269 M5:54 M0:204 M2:135 M17:163 M19:86 M15:96 M3:172
J2:
M7:53 M9:47 M6:153 M19:31 ... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J23: 142 J25: 24 J37: 35 J43: 126 J17: 75 J21: 62 J3: 134 J35: 221 J39: 9 J45: 245 J2: 260 J8: 214 J33: 25 J11: 105 J36: 239 J42: 11 J28: 66 J34: 70 J4: 67 J19: 27 J41: 74 J5: 102 J7: 203 J24: 39 J0: 10 J20: 272 J13: 152 J14: 136 J27: 181 J40: 18 J46: 188 J6: 190 J15: 180 J1: 204 J10: 53 J26: 111 J31: 57 J38: 109 J... | J0:
M14:17 M3:140 M10:220 M17:111 M2:174 M19:222 M5:63 M9:107 M4:39 M8:67 M11:155 M0:10 M1:26 M15:60 M18:232 M7:109 M13:5 M16:152 M12:223 M6:48
J1:
M1:165 M12:73 M16:33 M13:34 M9:35 M11:263 M14:255 M10:159 M6:65 M4:111 M7:7 M8:224 M18:269 M5:54 M0:204 M2:135 M17:163 M19:86 M15:96 M3:172
J2:
M7:53 M9:47 M6:153 M19:31 ... | Solution:
J25-M0: 0+24 -> 24,J19-M1: 0+98 -> 98,J40-M2: 0+249 -> 249,J13-M3: 0+16 -> 16,J11-M4: 0+98 -> 98,J17-M5: 0+119 -> 119,J36-M6: 0+26 -> 26,J2-M7: 0+53 -> 53,J4-M8: 0+88 -> 88,J34-M9: 0+78 -> 78,J21-M11: 0+65 -> 65,J44-M12: 0+15 -> 15,J39-M13: 0+52 -> 52,J0-M14: 0+17 -> 17,J32-M15: 0+236 -> 236,J12-M16: 0+31 -> ... | 50x20_607.jsp | 50 20
14 17 3 140 10 220 17 111 2 174 19 222 5 63 9 107 4 39 8 67 11 155 0 10 1 26 15 60 18 232 7 109 13 5 16 152 12 223 6 48
1 165 12 73 16 33 13 34 9 35 11 263 14 255 10 159 6 65 4 111 7 7 8 224 18 269 5 54 0 204 2 135 17 163 19 86 15 96 3 172
7 53 9 47 6 153 19 31 0 260 8 240 11 244 13 27 17 7 5 23 3 116 4 58 12 249... |
40 | 15 | J0:
M12:54 M10:245 M9:120 M3:224 M14:17 M11:174 M5:239 M6:182 M8:113 M1:108 M7:143 M13:89 M4:233 M0:119 M2:37
J1:
M8:20 M0:14 M9:206 M6:252 M12:74 M4:52 M11:31 M3:36 M5:201 M10:26 M13:69 M1:37 M14:133 M7:63 M2:255
J2:
M1:12 M8:114 M9:179 M6:64 M4:30 M2:232 M3:174 M10:14 M0:240 M7:39 M5:49 M12:107 M14:110 M11:47 M13:3... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J8: 256 J9: 73 J15: 232 J22: 21 J23: 158 J38: 243 J1: 14 J10: 43 J21: 161 J35: 30 J18: 186 J16: 188 J19: 172 J17: 148 J25: 160 J26: 79 J29: 78 J33: 138 J3: 133 J4: 134 J6: 88 J24: 82 J14: 215 J39: 156 J2: 240 J7: 192 J11: 166 J34: 205 J5: 215 J12: 235 J37: 134 J36: 54 J30: 232 J0: 119 J13: 77 J28: 53 J20: 169 J27: ... | J0:
M12:54 M10:245 M9:120 M3:224 M14:17 M11:174 M5:239 M6:182 M8:113 M1:108 M7:143 M13:89 M4:233 M0:119 M2:37
J1:
M8:20 M0:14 M9:206 M6:252 M12:74 M4:52 M11:31 M3:36 M5:201 M10:26 M13:69 M1:37 M14:133 M7:63 M2:255
J2:
M1:12 M8:114 M9:179 M6:64 M4:30 M2:232 M3:174 M10:14 M0:240 M7:39 M5:49 M12:107 M14:110 M11:47 M13:3... | Solution:
J22-M0: 0+21 -> 21,J2-M1: 0+12 -> 12,J14-M2: 0+168 -> 168,J25-M3: 0+19 -> 19,J29-M4: 0+33 -> 33,J17-M5: 0+44 -> 44,J27-M6: 0+19 -> 19,J35-M7: 0+68 -> 68,J1-M8: 0+20 -> 20,J4-M9: 0+61 -> 61,J3-M10: 0+20 -> 20,J28-M11: 0+144 -> 144,J0-M12: 0+54 -> 54,J32-M13: 0+114 -> 114,J30-M14: 0+57 -> 57,J24-M1: 12+215 -> 2... | 40x15_478.jsp | 40 15
12 54 10 245 9 120 3 224 14 17 11 174 5 239 6 182 8 113 1 108 7 143 13 89 4 233 0 119 2 37
8 20 0 14 9 206 6 252 12 74 4 52 11 31 3 36 5 201 10 26 13 69 1 37 14 133 7 63 2 255
1 12 8 114 9 179 6 64 4 30 2 232 3 174 10 14 0 240 7 39 5 49 12 107 14 110 11 47 13 38
10 20 1 191 13 8 5 208 2 246 0 133 14 117 6 125 8 6... |
100 | 50 | J0:
M4:130 M17:30 M23:171 M6:171 M24:162 M46:193 M36:133 M14:60 M27:67 M19:131 M21:63 M32:165 M0:82 M44:123 M43:64 M16:83 M31:78 M42:127 M40:102 M22:171 M25:25 M18:187 M13:34 M11:170 M34:86 M45:169 M3:55 M7:68 M15:115 M41:103 M37:189 M10:178 M48:29 M49:49 M26:44 M5:91 M28:90 M33:183 M1:111 M12:115 M35:151 M30:175 M29:1... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J83: 119 J44: 72 J36: 33 J65: 97 J73: 174 J14: 27 J1: 66 J13: 119 J48: 86 J50: 120 J76: 80 J94: 171 J55: 124 J84: 11 J9: 187 J11: 32 J68: 68 J37: 106 J77: 186 J64: 7 J74: 106 J0: 82 J32: 157 J6: 169 J54: 127 J46: 98 J85: 67 J88: 14 J93: 38 J3: 16 J31: 32 J63: 115 J21: 78 J24: 154 J45: 34 J89: 13 J41: 55 J90: 187 J2... | J0:
M4:130 M17:30 M23:171 M6:171 M24:162 M46:193 M36:133 M14:60 M27:67 M19:131 M21:63 M32:165 M0:82 M44:123 M43:64 M16:83 M31:78 M42:127 M40:102 M22:171 M25:25 M18:187 M13:34 M11:170 M34:86 M45:169 M3:55 M7:68 M15:115 M41:103 M37:189 M10:178 M48:29 M49:49 M26:44 M5:91 M28:90 M33:183 M1:111 M12:115 M35:151 M30:175 M29:1... | Solution:
J83-M0: 0+119 -> 119,J49-M1: 0+26 -> 26,J46-M2: 0+41 -> 41,J63-M3: 0+46 -> 46,J67-M4: 0+69 -> 69,J25-M5: 0+128 -> 128,J88-M6: 0+162 -> 162,J39-M7: 0+7 -> 7,J94-M8: 0+117 -> 117,J47-M9: 0+90 -> 90,J22-M11: 0+183 -> 183,J4-M12: 0+12 -> 12,J1-M13: 0+8 -> 8,J64-M14: 0+42 -> 42,J41-M15: 0+60 -> 60,J77-M16: 0+84 ->... | 100x50_3275.jsp | 100 50
4 130 17 30 23 171 6 171 24 162 46 193 36 133 14 60 27 67 19 131 21 63 32 165 0 82 44 123 43 64 16 83 31 78 42 127 40 102 22 171 25 25 18 187 13 34 11 170 34 86 45 169 3 55 7 68 15 115 41 103 37 189 10 178 48 29 49 49 26 44 5 91 28 90 33 183 1 111 12 115 35 151 30 175 29 158 2 140 8 169 38 42 47 65 20 155 9 28 3... |
100 | 20 | J0:
M14:102 M11:33 M6:159 M0:40 M9:207 M19:15 M7:96 M1:156 M16:169 M5:271 M13:172 M18:27 M2:244 M12:97 M8:257 M4:214 M15:108 M3:179 M10:228 M17:271
J1:
M2:160 M16:255 M11:63 M3:30 M4:31 M12:256 M1:28 M0:39 M9:142 M7:140 M14:104 M10:271 M17:73 M18:46 M6:85 M13:49 M15:43 M19:138 M8:253 M5:174
J2:
M13:151 M7:262 M10:240... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J55: 79 J75: 78 J23: 186 J26: 32 J62: 258 J71: 162 J72: 164 J96: 276 J30: 255 J36: 180 J57: 161 J61: 35 J83: 84 J0: 40 J40: 23 J74: 166 J13: 75 J15: 84 J47: 213 J48: 90 J49: 183 J91: 116 J3: 246 J21: 213 J29: 75 J39: 91 J80: 32 J89: 87 J90: 131 J2: 219 J20: 131 J27: 121 J33: 189 J34: 152 J1: 39 J9: 174 J16: 80 J38:... | J0:
M14:102 M11:33 M6:159 M0:40 M9:207 M19:15 M7:96 M1:156 M16:169 M5:271 M13:172 M18:27 M2:244 M12:97 M8:257 M4:214 M15:108 M3:179 M10:228 M17:271
J1:
M2:160 M16:255 M11:63 M3:30 M4:31 M12:256 M1:28 M0:39 M9:142 M7:140 M14:104 M10:271 M17:73 M18:46 M6:85 M13:49 M15:43 M19:138 M8:253 M5:174
J2:
M13:151 M7:262 M10:240... | Solution:
J75-M0: 0+78 -> 78,J62-M1: 0+39 -> 39,J73-M2: 0+94 -> 94,J23-M3: 0+43 -> 43,J98-M4: 0+26 -> 26,J40-M5: 0+25 -> 25,J79-M6: 0+63 -> 63,J70-M7: 0+62 -> 62,J64-M8: 0+27 -> 27,J18-M9: 0+139 -> 139,J20-M10: 0+62 -> 62,J10-M11: 0+140 -> 140,J11-M12: 0+27 -> 27,J57-M13: 0+27 -> 27,J80-M14: 0+32 -> 32,J90-M15: 0+10 ->... | 100x20_326.jsp | 100 20
14 102 11 33 6 159 0 40 9 207 19 15 7 96 1 156 16 169 5 271 13 172 18 27 2 244 12 97 8 257 4 214 15 108 3 179 10 228 17 271
2 160 16 255 11 63 3 30 4 31 12 256 1 28 0 39 9 142 7 140 14 104 10 271 17 73 18 46 6 85 13 49 15 43 19 138 8 253 5 174
13 151 7 262 10 240 4 263 18 239 16 100 0 219 19 21 5 96 3 32 9 152 1... |
100 | 20 | J0:
M19:208 M14:30 M2:73 M9:89 M12:27 M0:25 M13:109 M1:71 M6:58 M5:82 M15:42 M16:109 M7:47 M10:124 M8:202 M3:117 M11:29 M17:169 M4:24 M18:105
J1:
M9:50 M5:40 M4:6 M1:156 M15:131 M6:12 M19:210 M2:150 M0:161 M14:26 M16:112 M17:144 M8:147 M18:25 M12:135 M11:195 M10:43 M13:95 M3:115 M7:84
J2:
M0:92 M3:92 M15:159 M18:123 ... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 92 J48: 17 J59: 68 J82: 178 J12: 120 J16: 188 J21: 196 J65: 203 J92: 198 J25: 178 J45: 99 J56: 137 J58: 141 J71: 184 J86: 145 J13: 77 J77: 10 J18: 31 J30: 187 J31: 69 J51: 29 J70: 38 J80: 92 J0: 25 J28: 68 J42: 139 J52: 93 J53: 27 J63: 111 J81: 141 J87: 51 J8: 183 J39: 117 J79: 124 J47: 160 J60: 181 J72: 137 J8... | J0:
M19:208 M14:30 M2:73 M9:89 M12:27 M0:25 M13:109 M1:71 M6:58 M5:82 M15:42 M16:109 M7:47 M10:124 M8:202 M3:117 M11:29 M17:169 M4:24 M18:105
J1:
M9:50 M5:40 M4:6 M1:156 M15:131 M6:12 M19:210 M2:150 M0:161 M14:26 M16:112 M17:144 M8:147 M18:25 M12:135 M11:195 M10:43 M13:95 M3:115 M7:84
J2:
M0:92 M3:92 M15:159 M18:123 ... | Solution:
J48-M0: 0+17 -> 17,J17-M1: 0+24 -> 24,J76-M2: 0+6 -> 6,J75-M3: 0+11 -> 11,J3-M4: 0+20 -> 20,J13-M5: 0+23 -> 23,J63-M6: 0+21 -> 21,J5-M7: 0+137 -> 137,J33-M8: 0+24 -> 24,J15-M9: 0+34 -> 34,J23-M10: 0+28 -> 28,J28-M11: 0+50 -> 50,J10-M12: 0+9 -> 9,J8-M13: 0+20 -> 20,J30-M14: 0+28 -> 28,J57-M15: 0+50 -> 50,J86-M... | 100x20_460.jsp | 100 20
19 208 14 30 2 73 9 89 12 27 0 25 13 109 1 71 6 58 5 82 15 42 16 109 7 47 10 124 8 202 3 117 11 29 17 169 4 24 18 105
9 50 5 40 4 6 1 156 15 131 6 12 19 210 2 150 0 161 14 26 16 112 17 144 8 147 18 25 12 135 11 195 10 43 13 95 3 115 7 84
0 92 3 92 15 159 18 123 16 38 2 54 8 157 19 182 6 15 4 145 14 165 11 155 13... |
30 | 20 | J0:
M16:160 M1:109 M5:23 M19:149 M4:150 M14:145 M10:70 M15:179 M7:101 M13:163 M11:99 M0:215 M8:142 M3:218 M18:211 M2:75 M6:201 M9:42 M17:29 M12:58
J1:
M10:64 M19:115 M7:17 M18:70 M4:188 M12:102 M0:44 M5:78 M17:79 M1:41 M14:203 M8:180 M9:175 M13:146 M3:38 M2:218 M6:7 M15:122 M11:38 M16:191
J2:
M7:148 M10:201 M12:38 M1... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J18: 75 J23: 183 J20: 129 J6: 7 J8: 78 J26: 185 J2: 15 J4: 12 J10: 175 J21: 35 J28: 92 J1: 44 J29: 38 J16: 156 J24: 216 J7: 77 J12: 27 J27: 41 J0: 215 J5: 31 J15: 193 J22: 152 J9: 215 J13: 49 J3: 71 J14: 19 J11: 19 J25: 28 J19: 167 J17: 159
M1:
J26: 43 J0: 109 J17: 154 J24: 140 J27: 118 J6: 94 J19: 137 J28: 97 J23... | J0:
M16:160 M1:109 M5:23 M19:149 M4:150 M14:145 M10:70 M15:179 M7:101 M13:163 M11:99 M0:215 M8:142 M3:218 M18:211 M2:75 M6:201 M9:42 M17:29 M12:58
J1:
M10:64 M19:115 M7:17 M18:70 M4:188 M12:102 M0:44 M5:78 M17:79 M1:41 M14:203 M8:180 M9:175 M13:146 M3:38 M2:218 M6:7 M15:122 M11:38 M16:191
J2:
M7:148 M10:201 M12:38 M1... | Solution:
J18-M0: 0+75 -> 75,J26-M1: 0+43 -> 43,J7-M2: 0+26 -> 26,J8-M3: 0+150 -> 150,J24-M4: 0+71 -> 71,J3-M6: 0+48 -> 48,J23-M7: 0+44 -> 44,J29-M8: 0+50 -> 50,J4-M9: 0+20 -> 20,J1-M10: 0+64 -> 64,J14-M12: 0+151 -> 151,J19-M14: 0+74 -> 74,J28-M15: 0+65 -> 65,J0-M16: 0+160 -> 160,J16-M19: 0+33 -> 33,J25-M9: 20+69 -> 89... | 30x20_1397.jsp | 30 20
16 160 1 109 5 23 19 149 4 150 14 145 10 70 15 179 7 101 13 163 11 99 0 215 8 142 3 218 18 211 2 75 6 201 9 42 17 29 12 58
10 64 19 115 7 17 18 70 4 188 12 102 0 44 5 78 17 79 1 41 14 203 8 180 9 175 13 146 3 38 2 218 6 7 15 122 11 38 16 191
7 148 10 201 12 38 13 52 0 15 19 141 18 206 14 28 11 94 6 49 9 17 2 100 ... |
50 | 15 | J0:
M9:35 M1:38 M0:56 M14:48 M12:61 M2:49 M11:60 M7:9 M10:14 M13:47 M8:47 M3:57 M4:61 M5:45 M6:37
J1:
M6:58 M0:11 M3:44 M9:22 M2:35 M13:11 M7:28 M1:42 M10:44 M11:56 M12:51 M4:60 M14:13 M8:6 M5:44
J2:
M5:51 M13:54 M12:23 M3:25 M10:52 M4:17 M0:28 M8:54 M1:51 M14:56 M11:14 M2:58 M9:10 M7:16 M6:27
J3:
M9:25 M7:41 M8:31 ... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J31: 17 J1: 11 J6: 33 J9: 26 J11: 47 J26: 5 J45: 23 J0: 56 J43: 15 J33: 48 J34: 45 J38: 47 J48: 19 J20: 33 J21: 29 J40: 61 J14: 6 J15: 48 J16: 22 J17: 23 J37: 36 J2: 28 J10: 25 J13: 26 J22: 51 J25: 17 J29: 49 J7: 10 J30: 24 J32: 5 J42: 11 J49: 52 J8: 60 J12: 35 J44: 33 J5: 20 J19: 38 J28: 32 J36: 33 J47: 44 J23: 21... | J0:
M9:35 M1:38 M0:56 M14:48 M12:61 M2:49 M11:60 M7:9 M10:14 M13:47 M8:47 M3:57 M4:61 M5:45 M6:37
J1:
M6:58 M0:11 M3:44 M9:22 M2:35 M13:11 M7:28 M1:42 M10:44 M11:56 M12:51 M4:60 M14:13 M8:6 M5:44
J2:
M5:51 M13:54 M12:23 M3:25 M10:52 M4:17 M0:28 M8:54 M1:51 M14:56 M11:14 M2:58 M9:10 M7:16 M6:27
J3:
M9:25 M7:41 M8:31 ... | Solution:
J31-M0: 0+17 -> 17,J40-M1: 0+15 -> 15,J45-M2: 0+18 -> 18,J12-M3: 0+15 -> 15,J8-M4: 0+39 -> 39,J11-M5: 0+5 -> 5,J10-M6: 0+38 -> 38,J37-M7: 0+5 -> 5,J46-M8: 0+14 -> 14,J16-M9: 0+17 -> 17,J32-M10: 0+5 -> 5,J48-M11: 0+10 -> 10,J30-M12: 0+21 -> 21,J15-M13: 0+17 -> 17,J47-M14: 0+5 -> 5,J7-M5: 5+13 -> 18,J25-M7: 5+6... | 50x15_177.jsp | 50 15
9 35 1 38 0 56 14 48 12 61 2 49 11 60 7 9 10 14 13 47 8 47 3 57 4 61 5 45 6 37
6 58 0 11 3 44 9 22 2 35 13 11 7 28 1 42 10 44 11 56 12 51 4 60 14 13 8 6 5 44
5 51 13 54 12 23 3 25 10 52 4 17 0 28 8 54 1 51 14 56 11 14 2 58 9 10 7 16 6 27
9 25 7 41 8 31 3 35 13 29 11 27 4 39 2 47 5 32 6 5 14 52 1 58 0 14 12 44 10 ... |
100 | 50 | J0:
M37:9 M40:7 M32:10 M1:8 M31:17 M41:13 M5:6 M4:15 M43:21 M23:22 M12:9 M27:14 M28:22 M13:6 M30:17 M16:17 M26:10 M9:22 M19:15 M0:15 M45:12 M48:7 M47:20 M24:17 M46:18 M18:10 M17:8 M21:15 M14:16 M6:17 M39:22 M11:18 M49:15 M3:13 M20:14 M34:22 M25:5 M29:13 M35:19 M7:5 M15:5 M22:14 M38:19 M33:19 M42:7 M2:17 M36:12 M10:8 M8... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J22: 14 J47: 14 J60: 7 J17: 11 J95: 5 J14: 15 J43: 20 J45: 6 J81: 21 J84: 16 J5: 7 J13: 5 J54: 22 J49: 20 J21: 17 J36: 10 J57: 16 J62: 21 J74: 16 J76: 11 J28: 6 J99: 10 J58: 7 J73: 17 J91: 18 J15: 9 J72: 12 J83: 18 J3: 14 J51: 21 J71: 9 J78: 5 J24: 18 J90: 7 J46: 16 J67: 18 J55: 21 J56: 13 J0: 15 J6: 14 J30: 6 J98:... | J0:
M37:9 M40:7 M32:10 M1:8 M31:17 M41:13 M5:6 M4:15 M43:21 M23:22 M12:9 M27:14 M28:22 M13:6 M30:17 M16:17 M26:10 M9:22 M19:15 M0:15 M45:12 M48:7 M47:20 M24:17 M46:18 M18:10 M17:8 M21:15 M14:16 M6:17 M39:22 M11:18 M49:15 M3:13 M20:14 M34:22 M25:5 M29:13 M35:19 M7:5 M15:5 M22:14 M38:19 M33:19 M42:7 M2:17 M36:12 M10:8 M8... | Solution:
J60-M0: 0+7 -> 7,J40-M1: 0+8 -> 8,J34-M2: 0+9 -> 9,J79-M3: 0+10 -> 10,J12-M5: 0+13 -> 13,J75-M6: 0+17 -> 17,J66-M7: 0+6 -> 6,J7-M8: 0+7 -> 7,J85-M9: 0+6 -> 6,J25-M10: 0+8 -> 8,J94-M12: 0+8 -> 8,J17-M13: 0+5 -> 5,J97-M14: 0+11 -> 11,J96-M15: 0+6 -> 6,J50-M16: 0+17 -> 17,J63-M17: 0+11 -> 11,J70-M18: 0+14 -> 14,... | 100x50_3138.jsp | 100 50
37 9 40 7 32 10 1 8 31 17 41 13 5 6 4 15 43 21 23 22 12 9 27 14 28 22 13 6 30 17 16 17 26 10 9 22 19 15 0 15 45 12 48 7 47 20 24 17 46 18 18 10 17 8 21 15 14 16 6 17 39 22 11 18 49 15 3 13 20 14 34 22 25 5 29 13 35 19 7 5 15 5 22 14 38 19 33 19 42 7 2 17 36 12 10 8 8 17 44 7
21 8 3 11 31 17 1 6 10 9 15 9 14 19 4... |
40 | 20 | J0:
M11:140 M10:61 M19:65 M5:170 M15:23 M8:265 M17:104 M14:256 M6:102 M12:5 M16:101 M7:262 M13:23 M3:292 M18:74 M1:262 M2:144 M9:112 M4:206 M0:173
J1:
M6:34 M2:127 M16:158 M17:218 M4:32 M5:214 M0:111 M14:170 M10:189 M9:209 M13:64 M8:28 M12:5 M15:212 M19:176 M1:103 M11:112 M3:205 M18:45 M7:104
J2:
M8:69 M0:51 M12:246 ... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J9: 259 J2: 51 J11: 194 J14: 134 J13: 8 J18: 221 J26: 74 J32: 271 J39: 156 J20: 114 J29: 56 J23: 285 J34: 169 J1: 111 J7: 10 J15: 54 J25: 80 J31: 114 J36: 78 J16: 242 J22: 229 J30: 265 J21: 136 J5: 201 J8: 91 J27: 290 J38: 28 J3: 181 J24: 138 J37: 15 J12: 227 J17: 135 J28: 87 J33: 128 J35: 45 J6: 293 J10: 135 J0: 1... | J0:
M11:140 M10:61 M19:65 M5:170 M15:23 M8:265 M17:104 M14:256 M6:102 M12:5 M16:101 M7:262 M13:23 M3:292 M18:74 M1:262 M2:144 M9:112 M4:206 M0:173
J1:
M6:34 M2:127 M16:158 M17:218 M4:32 M5:214 M0:111 M14:170 M10:189 M9:209 M13:64 M8:28 M12:5 M15:212 M19:176 M1:103 M11:112 M3:205 M18:45 M7:104
J2:
M8:69 M0:51 M12:246 ... | Solution:
J9-M0: 0+259 -> 259,J33-M1: 0+90 -> 90,J29-M2: 0+7 -> 7,J34-M3: 0+151 -> 151,J26-M4: 0+115 -> 115,J4-M5: 0+162 -> 162,J37-M6: 0+51 -> 51,J6-M7: 0+10 -> 10,J2-M8: 0+69 -> 69,J35-M9: 0+293 -> 293,J36-M10: 0+86 -> 86,J22-M11: 0+134 -> 134,J7-M12: 0+150 -> 150,J20-M13: 0+104 -> 104,J24-M14: 0+226 -> 226,J39-M15: ... | 40x20_608.jsp | 40 20
11 140 10 61 19 65 5 170 15 23 8 265 17 104 14 256 6 102 12 5 16 101 7 262 13 23 3 292 18 74 1 262 2 144 9 112 4 206 0 173
6 34 2 127 16 158 17 218 4 32 5 214 0 111 14 170 10 189 9 209 13 64 8 28 12 5 15 212 19 176 1 103 11 112 3 205 18 45 7 104
8 69 0 51 12 246 10 245 16 253 2 186 1 239 18 142 13 71 9 135 19 61 ... |
30 | 15 | J0:
M9:62 M5:45 M11:53 M6:78 M4:37 M7:102 M0:68 M8:30 M1:95 M14:102 M2:121 M10:33 M13:33 M3:62 M12:15
J1:
M4:50 M2:70 M7:114 M3:7 M11:76 M9:40 M8:92 M5:40 M13:53 M1:13 M6:97 M12:141 M10:10 M0:128 M14:49
J2:
M11:113 M3:82 M5:5 M7:61 M12:8 M10:41 M14:131 M13:142 M0:111 M1:14 M2:125 M4:37 M6:117 M8:63 M9:132
J3:
M4:127... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J8: 39 J24: 139 J29: 6 J5: 41 J18: 68 J9: 103 J13: 100 J14: 46 J19: 63 J26: 118 J0: 68 J16: 93 J21: 32 J11: 124 J2: 111 J15: 41 J22: 53 J25: 61 J10: 84 J17: 61 J27: 93 J3: 77 J7: 121 J28: 28 J23: 103 J6: 132 J1: 128 J4: 93 J20: 138 J12: 85
M1:
J14: 39 J10: 31 J20: 56 J6: 106 J12: 95 J27: 123 J11: 7 J29: 10 J16: 48... | J0:
M9:62 M5:45 M11:53 M6:78 M4:37 M7:102 M0:68 M8:30 M1:95 M14:102 M2:121 M10:33 M13:33 M3:62 M12:15
J1:
M4:50 M2:70 M7:114 M3:7 M11:76 M9:40 M8:92 M5:40 M13:53 M1:13 M6:97 M12:141 M10:10 M0:128 M14:49
J2:
M11:113 M3:82 M5:5 M7:61 M12:8 M10:41 M14:131 M13:142 M0:111 M1:14 M2:125 M4:37 M6:117 M8:63 M9:132
J3:
M4:127... | Solution:
J29-M0: 0+6 -> 6,J14-M1: 0+39 -> 39,J4-M2: 0+84 -> 84,J16-M4: 0+23 -> 23,J27-M5: 0+112 -> 112,J28-M6: 0+93 -> 93,J13-M7: 0+65 -> 65,J0-M9: 0+62 -> 62,J18-M10: 0+36 -> 36,J2-M11: 0+113 -> 113,J23-M12: 0+22 -> 22,J11-M13: 0+36 -> 36,J5-M14: 0+54 -> 54,J8-M0: 6+39 -> 45,J29-M8: 6+8 -> 14,J19-M12: 22+117 -> 139,J... | 30x15_382.jsp | 30 15
9 62 5 45 11 53 6 78 4 37 7 102 0 68 8 30 1 95 14 102 2 121 10 33 13 33 3 62 12 15
4 50 2 70 7 114 3 7 11 76 9 40 8 92 5 40 13 53 1 13 6 97 12 141 10 10 0 128 14 49
11 113 3 82 5 5 7 61 12 8 10 41 14 131 13 142 0 111 1 14 2 125 4 37 6 117 8 63 9 132
4 127 11 94 3 71 9 141 14 15 13 21 10 77 6 60 2 89 8 140 0 77 5 ... |
100 | 20 | J0:
M8:99 M14:78 M10:44 M11:25 M13:38 M3:17 M18:117 M9:134 M0:110 M16:124 M2:126 M6:150 M12:119 M5:81 M4:139 M1:88 M19:30 M17:57 M15:128 M7:136
J1:
M1:100 M11:150 M5:164 M10:6 M6:15 M12:167 M4:111 M14:58 M7:6 M9:117 M15:150 M8:44 M0:11 M3:25 M18:74 M16:125 M2:57 M19:142 M13:118 M17:113
J2:
M6:178 M9:115 M10:77 M17:34... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J15: 153 J16: 155 J21: 110 J47: 40 J57: 98 J80: 113 J82: 141 J94: 99 J22: 111 J36: 64 J44: 18 J52: 37 J60: 12 J69: 76 J86: 142 J30: 66 J54: 34 J55: 74 J64: 135 J92: 27 J12: 31 J46: 156 J68: 41 J8: 5 J25: 107 J77: 77 J98: 74 J2: 142 J11: 16 J66: 80 J91: 65 J9: 101 J14: 175 J42: 9 J49: 73 J56: 160 J65: 26 J70: 50 J78... | J0:
M8:99 M14:78 M10:44 M11:25 M13:38 M3:17 M18:117 M9:134 M0:110 M16:124 M2:126 M6:150 M12:119 M5:81 M4:139 M1:88 M19:30 M17:57 M15:128 M7:136
J1:
M1:100 M11:150 M5:164 M10:6 M6:15 M12:167 M4:111 M14:58 M7:6 M9:117 M15:150 M8:44 M0:11 M3:25 M18:74 M16:125 M2:57 M19:142 M13:118 M17:113
J2:
M6:178 M9:115 M10:77 M17:34... | Solution:
J47-M0: 0+40 -> 40,J33-M1: 0+29 -> 29,J86-M2: 0+118 -> 118,J97-M3: 0+39 -> 39,J27-M4: 0+102 -> 102,J5-M5: 0+10 -> 10,J29-M6: 0+20 -> 20,J93-M7: 0+42 -> 42,J17-M8: 0+24 -> 24,J12-M9: 0+118 -> 118,J35-M10: 0+173 -> 173,J87-M11: 0+6 -> 6,J78-M12: 0+53 -> 53,J51-M13: 0+14 -> 14,J58-M14: 0+15 -> 15,J70-M15: 0+16 -... | 100x20_1631.jsp | 100 20
8 99 14 78 10 44 11 25 13 38 3 17 18 117 9 134 0 110 16 124 2 126 6 150 12 119 5 81 4 139 1 88 19 30 17 57 15 128 7 136
1 100 11 150 5 164 10 6 6 15 12 167 4 111 14 58 7 6 9 117 15 150 8 44 0 11 3 25 18 74 16 125 2 57 19 142 13 118 17 113
6 178 9 115 10 77 17 34 12 134 0 142 4 39 14 101 7 155 16 154 5 60 18 109 ... |
30 | 15 | J0:
M14:225 M1:179 M5:31 M2:43 M4:102 M12:141 M0:121 M8:199 M10:152 M7:62 M6:37 M9:209 M13:132 M3:219 M11:100
J1:
M9:23 M3:126 M6:252 M7:107 M10:24 M1:105 M14:76 M12:114 M13:145 M2:108 M5:207 M11:178 M4:181 M8:94 M0:132
J2:
M5:149 M0:104 M11:33 M14:109 M9:177 M13:191 M6:150 M3:221 M2:17 M12:164 M10:233 M8:208 M1:255 ... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J11: 245 J18: 93 J2: 104 J17: 57 J21: 33 J22: 232 J19: 116 J3: 53 J7: 246 J24: 5 J29: 72 J0: 121 J9: 149 J12: 57 J8: 106 J20: 176 J27: 104 J10: 76 J23: 142 J6: 134 J4: 97 J5: 145 J13: 127 J15: 237 J28: 192 J14: 79 J16: 155 J1: 132 J25: 107 J26: 86
M1:
J9: 57 J21: 103 J0: 179 J10: 199 J14: 43 J22: 115 J25: 190 J6: ... | J0:
M14:225 M1:179 M5:31 M2:43 M4:102 M12:141 M0:121 M8:199 M10:152 M7:62 M6:37 M9:209 M13:132 M3:219 M11:100
J1:
M9:23 M3:126 M6:252 M7:107 M10:24 M1:105 M14:76 M12:114 M13:145 M2:108 M5:207 M11:178 M4:181 M8:94 M0:132
J2:
M5:149 M0:104 M11:33 M14:109 M9:177 M13:191 M6:150 M3:221 M2:17 M12:164 M10:233 M8:208 M1:255 ... | Solution:
J18-M0: 0+93 -> 93,J9-M1: 0+57 -> 57,J5-M2: 0+221 -> 221,J19-M3: 0+121 -> 121,J12-M4: 0+93 -> 93,J2-M5: 0+149 -> 149,J26-M6: 0+129 -> 129,J10-M8: 0+40 -> 40,J29-M9: 0+22 -> 22,J28-M10: 0+129 -> 129,J7-M11: 0+64 -> 64,J20-M12: 0+127 -> 127,J24-M13: 0+66 -> 66,J0-M14: 0+225 -> 225,J1-M9: 22+23 -> 45,J29-M8: 40+... | 30x15_142.jsp | 30 15
14 225 1 179 5 31 2 43 4 102 12 141 0 121 8 199 10 152 7 62 6 37 9 209 13 132 3 219 11 100
9 23 3 126 6 252 7 107 10 24 1 105 14 76 12 114 13 145 2 108 5 207 11 178 4 181 8 94 0 132
5 149 0 104 11 33 14 109 9 177 13 191 6 150 3 221 2 17 12 164 10 233 8 208 1 255 7 126 4 219
13 110 7 45 12 73 2 124 3 233 0 53 6 15... |
100 | 20 | J0:
M13:87 M2:198 M1:138 M6:85 M3:150 M11:150 M8:104 M9:158 M16:129 M17:111 M0:24 M5:55 M15:184 M4:194 M14:42 M18:148 M7:7 M12:65 M10:200 M19:134
J1:
M3:68 M14:81 M0:85 M18:120 M4:95 M11:70 M16:203 M2:168 M8:109 M15:18 M19:33 M10:83 M7:210 M1:61 M9:128 M6:18 M13:18 M17:132 M12:189 M5:142
J2:
M17:55 M9:174 M12:141 M10... | Optimize schedule for 100 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 166 J14: 79 J70: 189 J97: 128 J40: 198 J51: 17 J57: 163 J67: 95 J72: 41 J88: 197 J99: 175 J1: 85 J8: 130 J13: 177 J17: 171 J23: 110 J78: 85 J46: 184 J48: 45 J75: 95 J95: 130 J96: 55 J9: 185 J29: 34 J61: 175 J91: 105 J25: 59 J32: 176 J59: 43 J87: 7 J18: 80 J43: 178 J65: 38 J76: 104 J28: 101 J34: 209 J50: 96 J52:... | J0:
M13:87 M2:198 M1:138 M6:85 M3:150 M11:150 M8:104 M9:158 M16:129 M17:111 M0:24 M5:55 M15:184 M4:194 M14:42 M18:148 M7:7 M12:65 M10:200 M19:134
J1:
M3:68 M14:81 M0:85 M18:120 M4:95 M11:70 M16:203 M2:168 M8:109 M15:18 M19:33 M10:83 M7:210 M1:61 M9:128 M6:18 M13:18 M17:132 M12:189 M5:142
J2:
M17:55 M9:174 M12:141 M10... | Solution:
J14-M0: 0+79 -> 79,J26-M1: 0+7 -> 7,J36-M2: 0+137 -> 137,J88-M3: 0+27 -> 27,J73-M4: 0+17 -> 17,J34-M5: 0+5 -> 5,J30-M6: 0+58 -> 58,J33-M7: 0+8 -> 8,J61-M8: 0+14 -> 14,J99-M10: 0+18 -> 18,J18-M11: 0+15 -> 15,J24-M12: 0+28 -> 28,J0-M13: 0+87 -> 87,J62-M14: 0+53 -> 53,J77-M15: 0+7 -> 7,J15-M16: 0+48 -> 48,J3-M17... | 100x20_414.jsp | 100 20
13 87 2 198 1 138 6 85 3 150 11 150 8 104 9 158 16 129 17 111 0 24 5 55 15 184 4 194 14 42 18 148 7 7 12 65 10 200 19 134
3 68 14 81 0 85 18 120 4 95 11 70 16 203 2 168 8 109 15 18 19 33 10 83 7 210 1 61 9 128 6 18 13 18 17 132 12 189 5 142
17 55 9 174 12 141 10 87 15 60 2 111 7 137 1 74 19 116 13 39 18 33 11 18... |
40 | 20 | J0:
M1:111 M18:129 M7:108 M6:74 M0:41 M14:124 M19:46 M13:127 M5:120 M15:5 M3:44 M10:63 M2:6 M4:22 M9:107 M11:125 M17:30 M8:43 M12:116 M16:10
J1:
M13:75 M15:36 M1:92 M16:83 M11:111 M10:14 M6:29 M17:39 M0:103 M3:13 M9:93 M14:65 M5:78 M4:54 M7:32 M12:110 M19:30 M18:119 M8:126 M2:139
J2:
M3:34 M4:7 M13:7 M9:44 M0:35 M8:1... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J23: 109 J24: 39 J9: 20 J12: 53 J18: 106 J5: 73 J8: 113 J20: 114 J32: 88 J0: 41 J2: 35 J29: 17 J33: 28 J28: 46 J4: 10 J15: 81 J19: 20 J30: 44 J38: 123 J1: 103 J11: 42 J22: 14 J13: 139 J16: 140 J37: 37 J10: 59 J3: 31 J31: 132 J36: 14 J17: 53 J26: 30 J25: 90 J35: 62 J6: 140 J21: 78 J34: 126 J14: 103 J7: 81 J27: 129 J... | J0:
M1:111 M18:129 M7:108 M6:74 M0:41 M14:124 M19:46 M13:127 M5:120 M15:5 M3:44 M10:63 M2:6 M4:22 M9:107 M11:125 M17:30 M8:43 M12:116 M16:10
J1:
M13:75 M15:36 M1:92 M16:83 M11:111 M10:14 M6:29 M17:39 M0:103 M3:13 M9:93 M14:65 M5:78 M4:54 M7:32 M12:110 M19:30 M18:119 M8:126 M2:139
J2:
M3:34 M4:7 M13:7 M9:44 M0:35 M8:1... | Solution:
J24-M0: 0+39 -> 39,J17-M1: 0+11 -> 11,J37-M2: 0+42 -> 42,J33-M3: 0+7 -> 7,J4-M4: 0+123 -> 123,J9-M5: 0+64 -> 64,J31-M6: 0+47 -> 47,J27-M7: 0+37 -> 37,J26-M8: 0+88 -> 88,J29-M9: 0+69 -> 69,J36-M10: 0+39 -> 39,J35-M12: 0+86 -> 86,J1-M13: 0+75 -> 75,J15-M15: 0+6 -> 6,J11-M17: 0+72 -> 72,J12-M18: 0+46 -> 46,J7-M1... | 40x20_1598.jsp | 40 20
1 111 18 129 7 108 6 74 0 41 14 124 19 46 13 127 5 120 15 5 3 44 10 63 2 6 4 22 9 107 11 125 17 30 8 43 12 116 16 10
13 75 15 36 1 92 16 83 11 111 10 14 6 29 17 39 0 103 3 13 9 93 14 65 5 78 4 54 7 32 12 110 19 30 18 119 8 126 2 139
3 34 4 7 13 7 9 44 0 35 8 13 12 53 16 68 6 73 14 22 2 7 1 30 15 78 19 124 17 18 7... |
30 | 30 | J0:
M26:172 M19:97 M24:168 M9:202 M17:125 M13:212 M18:232 M14:28 M3:142 M4:228 M22:74 M29:130 M8:63 M5:245 M25:247 M6:252 M28:22 M2:42 M20:187 M0:74 M23:213 M27:26 M10:243 M15:24 M16:204 M21:119 M11:83 M1:34 M12:13 M7:29
J1:
M19:146 M9:100 M24:49 M29:167 M1:205 M15:121 M0:239 M16:22 M6:106 M21:38 M5:253 M17:235 M18:23... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 93 J4: 113 J27: 243 J28: 15 J3: 9 J10: 177 J16: 163 J19: 80 J1: 239 J6: 124 J25: 118 J9: 177 J29: 220 J23: 116 J26: 176 J21: 164 J5: 81 J14: 9 J15: 55 J20: 99 J12: 149 J0: 74 J24: 183 J8: 172 J2: 6 J22: 59 J17: 192 J18: 121 J11: 116 J13: 215
M1:
J6: 61 J11: 170 J14: 13 J20: 195 J18: 198 J1: 205 J4: 203 J23: 24... | J0:
M26:172 M19:97 M24:168 M9:202 M17:125 M13:212 M18:232 M14:28 M3:142 M4:228 M22:74 M29:130 M8:63 M5:245 M25:247 M6:252 M28:22 M2:42 M20:187 M0:74 M23:213 M27:26 M10:243 M15:24 M16:204 M21:119 M11:83 M1:34 M12:13 M7:29
J1:
M19:146 M9:100 M24:49 M29:167 M1:205 M15:121 M0:239 M16:22 M6:106 M21:38 M5:253 M17:235 M18:23... | Solution:
J18-M2: 0+137 -> 137,J4-M3: 0+229 -> 229,J21-M7: 0+39 -> 39,J29-M8: 0+242 -> 242,J22-M9: 0+36 -> 36,J10-M11: 0+39 -> 39,J3-M13: 0+63 -> 63,J16-M15: 0+146 -> 146,J14-M16: 0+114 -> 114,J7-M17: 0+18 -> 18,J28-M18: 0+96 -> 96,J1-M19: 0+146 -> 146,J2-M20: 0+110 -> 110,J15-M22: 0+228 -> 228,J11-M24: 0+130 -> 130,J2... | 30x30_1885.jsp | 30 30
26 172 19 97 24 168 9 202 17 125 13 212 18 232 14 28 3 142 4 228 22 74 29 130 8 63 5 245 25 247 6 252 28 22 2 42 20 187 0 74 23 213 27 26 10 243 15 24 16 204 21 119 11 83 1 34 12 13 7 29
19 146 9 100 24 49 29 167 1 205 15 121 0 239 16 22 6 106 21 38 5 253 17 235 18 237 2 186 28 93 3 206 25 130 20 143 22 176 10 12... |
50 | 15 | J0:
M3:125 M14:225 M2:154 M4:221 M9:223 M5:170 M7:22 M13:167 M12:161 M0:166 M10:149 M11:56 M8:100 M6:185 M1:111
J1:
M3:223 M11:59 M0:141 M7:54 M1:58 M9:220 M8:108 M4:181 M13:120 M10:63 M2:26 M14:233 M6:35 M5:187 M12:53
J2:
M14:107 M3:175 M7:123 M12:152 M5:53 M11:16 M6:20 M4:132 M1:194 M10:73 M2:151 M0:136 M8:118 M13:... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J9: 175 J12: 126 J18: 43 J1: 141 J15: 81 J16: 159 J19: 147 J5: 76 J6: 238 J30: 54 J32: 113 J44: 86 J8: 151 J23: 213 J28: 166 J43: 77 J45: 119 J11: 71 J20: 209 J47: 184 J48: 5 J37: 51 J46: 72 J13: 100 J14: 166 J24: 113 J27: 30 J36: 26 J38: 126 J41: 78 J10: 119 J26: 102 J39: 199 J0: 166 J17: 183 J25: 152 J35: 124 J2:... | J0:
M3:125 M14:225 M2:154 M4:221 M9:223 M5:170 M7:22 M13:167 M12:161 M0:166 M10:149 M11:56 M8:100 M6:185 M1:111
J1:
M3:223 M11:59 M0:141 M7:54 M1:58 M9:220 M8:108 M4:181 M13:120 M10:63 M2:26 M14:233 M6:35 M5:187 M12:53
J2:
M14:107 M3:175 M7:123 M12:152 M5:53 M11:16 M6:20 M4:132 M1:194 M10:73 M2:151 M0:136 M8:118 M13:... | Solution:
J9-M0: 0+175 -> 175,J36-M1: 0+33 -> 33,J32-M2: 0+65 -> 65,J41-M3: 0+5 -> 5,J25-M4: 0+40 -> 40,J29-M5: 0+130 -> 130,J40-M6: 0+27 -> 27,J19-M7: 0+174 -> 174,J21-M8: 0+39 -> 39,J17-M9: 0+7 -> 7,J14-M10: 0+185 -> 185,J22-M11: 0+6 -> 6,J10-M12: 0+117 -> 117,J45-M13: 0+40 -> 40,J39-M14: 0+52 -> 52,J26-M3: 5+33 -> 3... | 50x15_914.jsp | 50 15
3 125 14 225 2 154 4 221 9 223 5 170 7 22 13 167 12 161 0 166 10 149 11 56 8 100 6 185 1 111
3 223 11 59 0 141 7 54 1 58 9 220 8 108 4 181 13 120 10 63 2 26 14 233 6 35 5 187 12 53
14 107 3 175 7 123 12 152 5 53 11 16 6 20 4 132 1 194 10 73 2 151 0 136 8 118 13 199 9 75
5 160 2 67 11 223 10 191 8 208 9 195 14 50 ... |
50 | 15 | J0:
M2:87 M10:9 M12:122 M11:222 M6:106 M1:161 M14:241 M4:203 M5:41 M8:111 M0:114 M9:146 M3:189 M13:104 M7:114
J1:
M6:159 M13:120 M1:170 M14:40 M4:124 M9:10 M3:159 M10:123 M8:28 M12:26 M5:35 M0:89 M11:222 M7:10 M2:159
J2:
M12:100 M14:263 M10:247 M11:156 M2:28 M3:138 M7:113 M13:174 M0:114 M5:189 M1:217 M9:54 M4:67 M8:1... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J10: 236 J6: 65 J7: 108 J43: 153 J3: 27 J17: 164 J18: 241 J44: 10 J8: 37 J11: 67 J22: 221 J39: 61 J25: 150 J19: 267 J24: 41 J29: 146 J48: 169 J27: 236 J12: 115 J14: 241 J15: 86 J26: 205 J28: 83 J31: 252 J2: 114 J5: 11 J20: 165 J30: 89 J41: 51 J0: 114 J4: 215 J9: 107 J16: 11 J21: 215 J42: 245 J1: 89 J13: 237 J32: 58... | J0:
M2:87 M10:9 M12:122 M11:222 M6:106 M1:161 M14:241 M4:203 M5:41 M8:111 M0:114 M9:146 M3:189 M13:104 M7:114
J1:
M6:159 M13:120 M1:170 M14:40 M4:124 M9:10 M3:159 M10:123 M8:28 M12:26 M5:35 M0:89 M11:222 M7:10 M2:159
J2:
M12:100 M14:263 M10:247 M11:156 M2:28 M3:138 M7:113 M13:174 M0:114 M5:189 M1:217 M9:54 M4:67 M8:1... | Solution:
J10-M0: 0+236 -> 236,J15-M1: 0+65 -> 65,J0-M2: 0+87 -> 87,J33-M3: 0+114 -> 114,J3-M4: 0+75 -> 75,J43-M5: 0+134 -> 134,J6-M6: 0+68 -> 68,J45-M7: 0+148 -> 148,J19-M8: 0+76 -> 76,J46-M9: 0+157 -> 157,J40-M10: 0+150 -> 150,J18-M11: 0+268 -> 268,J12-M12: 0+106 -> 106,J16-M13: 0+113 -> 113,J23-M14: 0+111 -> 111,J37... | 50x15_561.jsp | 50 15
2 87 10 9 12 122 11 222 6 106 1 161 14 241 4 203 5 41 8 111 0 114 9 146 3 189 13 104 7 114
6 159 13 120 1 170 14 40 4 124 9 10 3 159 10 123 8 28 12 26 5 35 0 89 11 222 7 10 2 159
12 100 14 263 10 247 11 156 2 28 3 138 7 113 13 174 0 114 5 189 1 217 9 54 4 67 8 192 6 199
4 75 2 198 0 27 9 61 5 87 6 263 3 206 14 97... |
30 | 20 | J0:
M6:99 M12:247 M5:157 M11:225 M0:183 M8:89 M19:282 M15:94 M16:213 M13:24 M14:135 M7:25 M2:12 M18:5 M3:217 M17:125 M10:153 M1:22 M9:95 M4:259
J1:
M17:228 M6:134 M18:190 M12:123 M11:204 M7:108 M2:129 M1:61 M13:83 M16:199 M10:131 M19:70 M5:21 M9:120 M8:214 M4:64 M14:119 M0:158 M3:164 M15:174
J2:
M10:114 M3:134 M13:50... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 187 J5: 27 J11: 45 J15: 17 J10: 190 J0: 183 J2: 275 J16: 174 J29: 166 J18: 130 J4: 156 J6: 258 J25: 181 J27: 11 J9: 205 J21: 145 J28: 256 J8: 152 J17: 166 J13: 242 J22: 46 J24: 163 J26: 187 J1: 158 J3: 128 J12: 122 J20: 241 J19: 163 J23: 157 J14: 108
M1:
J11: 244 J20: 19 J23: 271 J26: 38 J4: 158 J12: 162 J3: 9... | J0:
M6:99 M12:247 M5:157 M11:225 M0:183 M8:89 M19:282 M15:94 M16:213 M13:24 M14:135 M7:25 M2:12 M18:5 M3:217 M17:125 M10:153 M1:22 M9:95 M4:259
J1:
M17:228 M6:134 M18:190 M12:123 M11:204 M7:108 M2:129 M1:61 M13:83 M16:199 M10:131 M19:70 M5:21 M9:120 M8:214 M4:64 M14:119 M0:158 M3:164 M15:174
J2:
M10:114 M3:134 M13:50... | Solution:
J7-M0: 0+187 -> 187,J13-M2: 0+8 -> 8,J15-M4: 0+10 -> 10,J3-M5: 0+111 -> 111,J0-M6: 0+99 -> 99,J19-M10: 0+32 -> 32,J24-M11: 0+174 -> 174,J26-M12: 0+96 -> 96,J8-M13: 0+77 -> 77,J17-M15: 0+263 -> 263,J14-M16: 0+25 -> 25,J29-M17: 0+63 -> 63,J9-M18: 0+10 -> 10,J21-M2: 8+102 -> 110,J13-M14: 8+67 -> 75,J18-M18: 10+2... | 30x20_423.jsp | 30 20
6 99 12 247 5 157 11 225 0 183 8 89 19 282 15 94 16 213 13 24 14 135 7 25 2 12 18 5 3 217 17 125 10 153 1 22 9 95 4 259
17 228 6 134 18 190 12 123 11 204 7 108 2 129 1 61 13 83 16 199 10 131 19 70 5 21 9 120 8 214 4 64 14 119 0 158 3 164 15 174
10 114 3 134 13 50 16 25 0 275 15 107 8 14 5 36 19 180 4 27 9 50 18 2... |
30 | 15 | J0:
M3:63 M5:63 M4:15 M8:112 M0:60 M9:11 M6:10 M1:84 M12:122 M7:119 M10:76 M11:121 M13:124 M2:65 M14:55
J1:
M12:123 M2:82 M10:141 M5:36 M13:60 M9:111 M3:28 M1:94 M6:18 M0:127 M14:136 M4:7 M7:96 M8:86 M11:141
J2:
M14:34 M10:44 M9:55 M7:99 M2:101 M11:81 M3:138 M5:18 M0:30 M12:127 M8:111 M6:62 M1:82 M4:54 M13:22
J3:
M3... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J17: 136 J27: 13 J29: 16 J16: 43 J18: 98 J19: 21 J21: 70 J26: 94 J28: 6 J14: 103 J24: 81 J0: 60 J12: 33 J23: 17 J25: 7 J5: 55 J20: 61 J2: 30 J1: 127 J7: 13 J10: 89 J6: 98 J13: 113 J3: 43 J11: 32 J15: 113 J4: 99 J8: 81 J9: 39 J22: 124
M1:
J3: 125 J13: 69 J10: 44 J11: 69 J18: 26 J19: 31 J7: 84 J20: 75 J6: 61 J17: 22... | J0:
M3:63 M5:63 M4:15 M8:112 M0:60 M9:11 M6:10 M1:84 M12:122 M7:119 M10:76 M11:121 M13:124 M2:65 M14:55
J1:
M12:123 M2:82 M10:141 M5:36 M13:60 M9:111 M3:28 M1:94 M6:18 M0:127 M14:136 M4:7 M7:96 M8:86 M11:141
J2:
M14:34 M10:44 M9:55 M7:99 M2:101 M11:81 M3:138 M5:18 M0:30 M12:127 M8:111 M6:62 M1:82 M4:54 M13:22
J3:
M3... | Solution:
J8-M2: 0+70 -> 70,J0-M3: 0+63 -> 63,J16-M5: 0+11 -> 11,J19-M7: 0+88 -> 88,J29-M8: 0+85 -> 85,J26-M9: 0+87 -> 87,J25-M10: 0+29 -> 29,J9-M11: 0+36 -> 36,J23-M12: 0+27 -> 27,J7-M13: 0+70 -> 70,J2-M14: 0+34 -> 34,J23-M6: 27+86 -> 113,J14-M12: 27+90 -> 117,J17-M10: 29+64 -> 93,J27-M14: 34+45 -> 79,J25-M11: 36+77 -... | 30x15_106.jsp | 30 15
3 63 5 63 4 15 8 112 0 60 9 11 6 10 1 84 12 122 7 119 10 76 11 121 13 124 2 65 14 55
12 123 2 82 10 141 5 36 13 60 9 111 3 28 1 94 6 18 0 127 14 136 4 7 7 96 8 86 11 141
14 34 10 44 9 55 7 99 2 101 11 81 3 138 5 18 0 30 12 127 8 111 6 62 1 82 4 54 13 22
3 71 13 106 1 125 10 63 7 5 14 124 2 20 8 7 9 15 4 71 5 36 0... |
100 | 50 | J0:
M46:46 M12:217 M19:248 M41:147 M9:25 M21:172 M5:231 M11:9 M34:26 M22:21 M43:10 M28:245 M17:20 M39:146 M44:150 M6:231 M16:115 M31:141 M29:122 M27:251 M37:125 M18:111 M38:106 M47:184 M15:48 M48:176 M32:211 M8:147 M45:227 M35:188 M7:69 M3:129 M14:205 M0:132 M26:184 M36:23 M25:121 M4:129 M33:154 M24:34 M42:167 M23:15 M... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J6: 66 J38: 68 J51: 88 J77: 246 J86: 141 J26: 88 J29: 230 J37: 16 J65: 55 J67: 207 J84: 64 J30: 8 J71: 12 J53: 112 J76: 8 J39: 101 J89: 14 J95: 70 J97: 172 J9: 85 J47: 249 J50: 58 J78: 132 J90: 24 J12: 35 J40: 205 J62: 212 J63: 63 J92: 88 J46: 233 J70: 48 J28: 159 J45: 168 J61: 186 J80: 219 J94: 163 J52: 56 J35: 20... | J0:
M46:46 M12:217 M19:248 M41:147 M9:25 M21:172 M5:231 M11:9 M34:26 M22:21 M43:10 M28:245 M17:20 M39:146 M44:150 M6:231 M16:115 M31:141 M29:122 M27:251 M37:125 M18:111 M38:106 M47:184 M15:48 M48:176 M32:211 M8:147 M45:227 M35:188 M7:69 M3:129 M14:205 M0:132 M26:184 M36:23 M25:121 M4:129 M33:154 M24:34 M42:167 M23:15 M... | Solution:
J6-M0: 0+66 -> 66,J23-M1: 0+168 -> 168,J72-M3: 0+151 -> 151,J37-M4: 0+29 -> 29,J70-M5: 0+213 -> 213,J20-M6: 0+153 -> 153,J40-M7: 0+46 -> 46,J39-M8: 0+73 -> 73,J41-M9: 0+11 -> 11,J55-M10: 0+18 -> 18,J90-M11: 0+64 -> 64,J32-M12: 0+34 -> 34,J57-M13: 0+119 -> 119,J80-M14: 0+131 -> 131,J42-M15: 0+82 -> 82,J88-M16:... | 100x50_2793.jsp | 100 50
46 46 12 217 19 248 41 147 9 25 21 172 5 231 11 9 34 26 22 21 43 10 28 245 17 20 39 146 44 150 6 231 16 115 31 141 29 122 27 251 37 125 18 111 38 106 47 184 15 48 48 176 32 211 8 147 45 227 35 188 7 69 3 129 14 205 0 132 26 184 36 23 25 121 4 129 33 154 24 34 42 167 23 15 13 68 40 101 20 117 30 46 49 38 10 110 2... |
30 | 30 | J0:
M10:142 M24:136 M13:37 M5:37 M11:11 M28:23 M29:33 M18:19 M19:156 M6:103 M12:160 M8:27 M2:62 M9:127 M27:149 M25:115 M3:9 M23:148 M7:10 M0:85 M16:96 M14:168 M1:154 M15:151 M21:119 M4:197 M26:156 M22:16 M20:89 M17:64
J1:
M11:6 M29:177 M1:19 M6:35 M9:118 M20:134 M21:125 M14:91 M28:172 M23:22 M15:52 M18:83 M25:17 M26:6... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J23: 87 J19: 191 J22: 59 J7: 131 J20: 64 J21: 59 J4: 172 J12: 191 J15: 138 J24: 133 J14: 69 J25: 38 J6: 61 J28: 142 J18: 154 J27: 90 J16: 180 J0: 85 J3: 11 J13: 46 J29: 36 J2: 159 J11: 170 J5: 104 J9: 114 J17: 76 J8: 163 J10: 128 J1: 157 J26: 64
M1:
J6: 179 J1: 19 J10: 143 J28: 14 J23: 49 J18: 87 J11: 67 J29: 194 ... | J0:
M10:142 M24:136 M13:37 M5:37 M11:11 M28:23 M29:33 M18:19 M19:156 M6:103 M12:160 M8:27 M2:62 M9:127 M27:149 M25:115 M3:9 M23:148 M7:10 M0:85 M16:96 M14:168 M1:154 M15:151 M21:119 M4:197 M26:156 M22:16 M20:89 M17:64
J1:
M11:6 M29:177 M1:19 M6:35 M9:118 M20:134 M21:125 M14:91 M28:172 M23:22 M15:52 M18:83 M25:17 M26:6... | Solution:
J23-M0: 0+87 -> 87,J11-M3: 0+109 -> 109,J16-M4: 0+101 -> 101,J29-M5: 0+121 -> 121,J28-M6: 0+81 -> 81,J13-M7: 0+23 -> 23,J27-M8: 0+151 -> 151,J17-M10: 0+20 -> 20,J1-M11: 0+6 -> 6,J24-M14: 0+175 -> 175,J14-M18: 0+142 -> 142,J3-M20: 0+86 -> 86,J8-M21: 0+186 -> 186,J15-M23: 0+121 -> 121,J4-M24: 0+62 -> 62,J10-M26... | 30x30_918.jsp | 30 30
10 142 24 136 13 37 5 37 11 11 28 23 29 33 18 19 19 156 6 103 12 160 8 27 2 62 9 127 27 149 25 115 3 9 23 148 7 10 0 85 16 96 14 168 1 154 15 151 21 119 4 197 26 156 22 16 20 89 17 64
11 6 29 177 1 19 6 35 9 118 20 134 21 125 14 91 28 172 23 22 15 52 18 83 25 17 26 67 13 177 2 134 12 68 19 168 10 48 16 166 27 80 ... |
50 | 15 | J0:
M3:96 M13:89 M12:146 M7:77 M9:111 M1:169 M0:177 M10:139 M14:98 M5:98 M6:105 M11:137 M4:100 M8:155 M2:119
J1:
M2:78 M6:99 M8:63 M5:150 M11:177 M9:163 M14:157 M13:115 M1:88 M7:135 M12:146 M3:125 M4:113 M0:36 M10:159
J2:
M3:50 M7:178 M14:60 M4:187 M8:11 M12:104 M10:68 M9:123 M13:106 M11:105 M0:84 M1:70 M2:113 M6:113... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J24: 70 J45: 93 J4: 17 J25: 115 J33: 61 J37: 159 J48: 49 J5: 61 J6: 89 J28: 194 J16: 5 J20: 169 J47: 37 J11: 91 J15: 118 J27: 103 J13: 74 J14: 13 J17: 152 J19: 146 J31: 70 J32: 155 J40: 5 J44: 197 J49: 12 J0: 177 J7: 12 J21: 95 J22: 25 J34: 67 J38: 82 J39: 195 J3: 92 J46: 63 J10: 152 J8: 77 J9: 66 J35: 111 J2: 84 J... | J0:
M3:96 M13:89 M12:146 M7:77 M9:111 M1:169 M0:177 M10:139 M14:98 M5:98 M6:105 M11:137 M4:100 M8:155 M2:119
J1:
M2:78 M6:99 M8:63 M5:150 M11:177 M9:163 M14:157 M13:115 M1:88 M7:135 M12:146 M3:125 M4:113 M0:36 M10:159
J2:
M3:50 M7:178 M14:60 M4:187 M8:11 M12:104 M10:68 M9:123 M13:106 M11:105 M0:84 M1:70 M2:113 M6:113... | Solution:
J24-M0: 0+70 -> 70,J40-M1: 0+62 -> 62,J14-M2: 0+74 -> 74,J33-M3: 0+18 -> 18,J48-M4: 0+17 -> 17,J13-M5: 0+166 -> 166,J16-M6: 0+63 -> 63,J37-M7: 0+96 -> 96,J29-M8: 0+7 -> 7,J38-M9: 0+65 -> 65,J49-M10: 0+90 -> 90,J23-M11: 0+6 -> 6,J7-M12: 0+100 -> 100,J26-M13: 0+97 -> 97,J9-M14: 0+5 -> 5,J15-M14: 5+95 -> 100,J11... | 50x15_863.jsp | 50 15
3 96 13 89 12 146 7 77 9 111 1 169 0 177 10 139 14 98 5 98 6 105 11 137 4 100 8 155 2 119
2 78 6 99 8 63 5 150 11 177 9 163 14 157 13 115 1 88 7 135 12 146 3 125 4 113 0 36 10 159
3 50 7 178 14 60 4 187 8 11 12 104 10 68 9 123 13 106 11 105 0 84 1 70 2 113 6 113 5 22
9 74 13 111 6 175 4 74 8 127 2 52 7 194 0 92 1... |
40 | 40 | J0:
M15:56 M32:174 M24:50 M22:56 M35:199 M27:21 M18:5 M5:150 M20:73 M25:59 M0:210 M2:99 M37:163 M4:226 M9:24 M17:229 M39:144 M14:41 M11:5 M13:162 M16:89 M12:39 M1:162 M31:20 M29:145 M10:167 M23:124 M38:150 M26:78 M36:198 M34:52 M3:66 M19:228 M30:138 M21:129 M28:109 M8:14 M6:125 M33:172 M7:86
J1:
M11:107 M22:95 M36:116... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 110 J11: 108 J29: 109 J30: 224 J9: 109 J3: 209 J21: 157 J27: 119 J7: 229 J18: 53 J39: 102 J0: 210 J13: 207 J24: 103 J38: 71 J2: 63 J37: 34 J12: 21 J23: 186 J22: 156 J34: 56 J35: 96 J33: 54 J4: 165 J6: 86 J8: 87 J19: 121 J31: 122 J36: 102 J14: 229 J20: 181 J10: 47 J32: 45 J16: 6 J25: 128 J26: 229 J15: 28 J28: 19... | J0:
M15:56 M32:174 M24:50 M22:56 M35:199 M27:21 M18:5 M5:150 M20:73 M25:59 M0:210 M2:99 M37:163 M4:226 M9:24 M17:229 M39:144 M14:41 M11:5 M13:162 M16:89 M12:39 M1:162 M31:20 M29:145 M10:167 M23:124 M38:150 M26:78 M36:198 M34:52 M3:66 M19:228 M30:138 M21:129 M28:109 M8:14 M6:125 M33:172 M7:86
J1:
M11:107 M22:95 M36:116... | Solution:
J5-M0: 0+110 -> 110,J10-M1: 0+220 -> 220,J35-M2: 0+61 -> 61,J28-M4: 0+44 -> 44,J31-M5: 0+104 -> 104,J19-M6: 0+42 -> 42,J23-M7: 0+96 -> 96,J4-M8: 0+225 -> 225,J26-M9: 0+68 -> 68,J11-M10: 0+56 -> 56,J1-M11: 0+107 -> 107,J30-M15: 0+35 -> 35,J33-M17: 0+46 -> 46,J39-M19: 0+118 -> 118,J2-M20: 0+20 -> 20,J6-M21: 0+1... | 40x40_851.jsp | 40 40
15 56 32 174 24 50 22 56 35 199 27 21 18 5 5 150 20 73 25 59 0 210 2 99 37 163 4 226 9 24 17 229 39 144 14 41 11 5 13 162 16 89 12 39 1 162 31 20 29 145 10 167 23 124 38 150 26 78 36 198 34 52 3 66 19 228 30 138 21 129 28 109 8 14 6 125 33 172 7 86
11 107 22 95 36 116 33 213 15 171 31 87 28 176 5 98 26 97 6 160 1... |
100 | 50 | J0:
M48:41 M3:9 M46:19 M2:24 M29:60 M18:64 M38:63 M21:38 M15:30 M7:7 M49:36 M35:80 M9:78 M22:51 M43:15 M32:13 M44:81 M25:21 M39:63 M28:56 M16:44 M47:52 M24:60 M19:69 M27:19 M1:48 M42:60 M26:69 M14:45 M0:16 M13:51 M37:11 M20:56 M5:66 M30:68 M40:54 M12:58 M17:83 M8:33 M31:15 M34:49 M45:84 M23:7 M33:30 M4:29 M11:46 M10:65... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J4: 79 J9: 13 J77: 57 J78: 42 J11: 47 J21: 38 J10: 67 J61: 76 J85: 38 J65: 23 J96: 45 J87: 23 J72: 14 J13: 67 J32: 62 J40: 41 J2: 73 J18: 51 J67: 80 J52: 63 J89: 22 J27: 83 J57: 78 J70: 87 J55: 51 J83: 46 J36: 86 J90: 27 J6: 70 J3: 84 J48: 24 J73: 76 J76: 56 J23: 28 J33: 68 J22: 29 J42: 76 J81: 79 J91: 36 J39: 28 J... | J0:
M48:41 M3:9 M46:19 M2:24 M29:60 M18:64 M38:63 M21:38 M15:30 M7:7 M49:36 M35:80 M9:78 M22:51 M43:15 M32:13 M44:81 M25:21 M39:63 M28:56 M16:44 M47:52 M24:60 M19:69 M27:19 M1:48 M42:60 M26:69 M14:45 M0:16 M13:51 M37:11 M20:56 M5:66 M30:68 M40:54 M12:58 M17:83 M8:33 M31:15 M34:49 M45:84 M23:7 M33:30 M4:29 M11:46 M10:65... | Solution:
J9-M0: 0+13 -> 13,J63-M2: 0+19 -> 19,J48-M3: 0+38 -> 38,J51-M4: 0+73 -> 73,J54-M7: 0+25 -> 25,J26-M8: 0+30 -> 30,J79-M9: 0+52 -> 52,J45-M10: 0+26 -> 26,J73-M11: 0+13 -> 13,J66-M12: 0+36 -> 36,J69-M15: 0+9 -> 9,J81-M16: 0+5 -> 5,J36-M17: 0+30 -> 30,J38-M19: 0+24 -> 24,J6-M20: 0+11 -> 11,J39-M21: 0+42 -> 42,J65... | 100x50_1452.jsp | 100 50
48 41 3 9 46 19 2 24 29 60 18 64 38 63 21 38 15 30 7 7 49 36 35 80 9 78 22 51 43 15 32 13 44 81 25 21 39 63 28 56 16 44 47 52 24 60 19 69 27 19 1 48 42 60 26 69 14 45 0 16 13 51 37 11 20 56 5 66 30 68 40 54 12 58 17 83 8 33 31 15 34 49 45 84 23 7 33 30 4 29 11 46 10 65 41 25 36 50 6 41
48 26 7 19 35 61 25 18 15 ... |
30 | 15 | J0:
M8:44 M12:31 M13:8 M9:17 M10:31 M6:39 M1:46 M11:22 M2:17 M0:8 M7:6 M3:69 M4:64 M5:25 M14:47
J1:
M10:28 M7:10 M4:33 M12:62 M14:60 M9:59 M8:45 M6:15 M1:30 M5:29 M11:66 M13:42 M0:22 M2:15 M3:9
J2:
M5:35 M1:15 M11:20 M2:53 M14:31 M7:68 M10:51 M13:65 M4:23 M12:53 M8:32 M9:15 M6:72 M0:21 M3:11
J3:
M9:63 M12:11 M4:53 M... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J22: 36 J25: 55 J27: 39 J29: 51 J26: 57 J3: 57 J9: 69 J19: 33 J21: 25 J7: 26 J15: 45 J16: 9 J5: 17 J11: 36 J24: 52 J28: 18 J8: 26 J10: 37 J12: 55 J17: 68 J0: 8 J20: 56 J4: 48 J1: 22 J13: 10 J2: 21 J14: 68 J18: 73 J23: 29 J6: 70
M1:
J5: 46 J8: 52 J11: 30 J24: 57 J2: 15 J10: 5 J19: 75 J20: 5 J4: 47 J15: 52 J16: 31 J... | J0:
M8:44 M12:31 M13:8 M9:17 M10:31 M6:39 M1:46 M11:22 M2:17 M0:8 M7:6 M3:69 M4:64 M5:25 M14:47
J1:
M10:28 M7:10 M4:33 M12:62 M14:60 M9:59 M8:45 M6:15 M1:30 M5:29 M11:66 M13:42 M0:22 M2:15 M3:9
J2:
M5:35 M1:15 M11:20 M2:53 M14:31 M7:68 M10:51 M13:65 M4:23 M12:53 M8:32 M9:15 M6:72 M0:21 M3:11
J3:
M9:63 M12:11 M4:53 M... | Solution:
J22-M0: 0+36 -> 36,J11-M1: 0+30 -> 30,J12-M4: 0+34 -> 34,J2-M5: 0+35 -> 35,J17-M6: 0+31 -> 31,J10-M7: 0+54 -> 54,J6-M8: 0+12 -> 12,J3-M9: 0+63 -> 63,J20-M10: 0+18 -> 18,J21-M12: 0+65 -> 65,J7-M13: 0+34 -> 34,J23-M14: 0+26 -> 26,J14-M8: 12+37 -> 49,J1-M10: 18+28 -> 46,J6-M14: 26+6 -> 32,J20-M1: 30+5 -> 35,J11-... | 30x15_38.jsp | 30 15
8 44 12 31 13 8 9 17 10 31 6 39 1 46 11 22 2 17 0 8 7 6 3 69 4 64 5 25 14 47
10 28 7 10 4 33 12 62 14 60 9 59 8 45 6 15 1 30 5 29 11 66 13 42 0 22 2 15 3 9
5 35 1 15 11 20 2 53 14 31 7 68 10 51 13 65 4 23 12 53 8 32 9 15 6 72 0 21 3 11
9 63 12 11 4 53 0 57 1 19 6 49 14 41 7 66 5 75 3 50 13 19 11 60 8 16 10 21 2 1... |
40 | 20 | J0:
M15:135 M16:59 M6:7 M7:63 M11:83 M3:138 M19:21 M17:150 M2:87 M1:107 M14:133 M8:102 M12:83 M13:14 M18:100 M5:108 M10:10 M4:41 M9:118 M0:154
J1:
M5:56 M19:90 M1:139 M6:41 M11:108 M9:59 M14:124 M12:51 M0:92 M15:86 M18:133 M2:73 M7:38 M4:51 M17:157 M13:132 M16:114 M3:7 M8:6 M10:122
J2:
M10:37 M6:83 M12:117 M1:48 M18:... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J17: 139 J32: 143 J4: 77 J21: 73 J29: 9 J19: 6 J28: 135 J30: 130 J37: 19 J31: 13 J14: 153 J22: 135 J24: 129 J23: 90 J1: 92 J6: 91 J7: 64 J8: 28 J34: 9 J38: 36 J39: 55 J13: 159 J9: 131 J18: 73 J26: 51 J27: 120 J33: 46 J3: 163 J10: 121 J16: 105 J5: 92 J15: 138 J35: 66 J2: 5 J11: 115 J12: 108 J25: 11 J36: 11 J20: 52 J... | J0:
M15:135 M16:59 M6:7 M7:63 M11:83 M3:138 M19:21 M17:150 M2:87 M1:107 M14:133 M8:102 M12:83 M13:14 M18:100 M5:108 M10:10 M4:41 M9:118 M0:154
J1:
M5:56 M19:90 M1:139 M6:41 M11:108 M9:59 M14:124 M12:51 M0:92 M15:86 M18:133 M2:73 M7:38 M4:51 M17:157 M13:132 M16:114 M3:7 M8:6 M10:122
J2:
M10:37 M6:83 M12:117 M1:48 M18:... | Solution:
J17-M0: 0+139 -> 139,J20-M1: 0+20 -> 20,J9-M2: 0+151 -> 151,J6-M3: 0+54 -> 54,J34-M4: 0+59 -> 59,J1-M5: 0+56 -> 56,J26-M6: 0+70 -> 70,J28-M7: 0+59 -> 59,J16-M8: 0+10 -> 10,J27-M9: 0+39 -> 39,J14-M10: 0+7 -> 7,J11-M12: 0+50 -> 50,J36-M13: 0+62 -> 62,J37-M15: 0+103 -> 103,J12-M16: 0+70 -> 70,J19-M17: 0+45 -> 45... | 40x20_1814.jsp | 40 20
15 135 16 59 6 7 7 63 11 83 3 138 19 21 17 150 2 87 1 107 14 133 8 102 12 83 13 14 18 100 5 108 10 10 4 41 9 118 0 154
5 56 19 90 1 139 6 41 11 108 9 59 14 124 12 51 0 92 15 86 18 133 2 73 7 38 4 51 17 157 13 132 16 114 3 7 8 6 10 122
10 37 6 83 12 117 1 48 18 146 2 152 11 91 7 10 16 68 5 11 17 161 3 12 9 46 8 11... |
50 | 15 | J0:
M3:155 M12:143 M4:203 M10:144 M8:69 M9:270 M0:231 M2:264 M6:213 M5:57 M13:77 M1:88 M7:27 M14:191 M11:14
J1:
M12:144 M1:238 M4:54 M7:253 M3:18 M9:92 M5:6 M8:137 M13:106 M0:110 M14:207 M2:227 M11:46 M10:228 M6:148
J2:
M2:90 M10:125 M4:95 M7:209 M3:268 M1:212 M9:115 M11:190 M12:146 M5:285 M14:184 M13:292 M6:245 M0:2... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J6: 237 J12: 40 J16: 292 J18: 76 J26: 191 J23: 127 J29: 184 J5: 52 J8: 27 J0: 231 J9: 284 J10: 27 J24: 144 J31: 191 J34: 16 J39: 238 J43: 273 J11: 248 J15: 17 J25: 254 J37: 51 J40: 62 J33: 180 J38: 260 J1: 110 J22: 183 J28: 217 J35: 182 J46: 108 J3: 72 J48: 120 J14: 22 J21: 126 J47: 276 J4: 89 J19: 14 J20: 46 J30: ... | J0:
M3:155 M12:143 M4:203 M10:144 M8:69 M9:270 M0:231 M2:264 M6:213 M5:57 M13:77 M1:88 M7:27 M14:191 M11:14
J1:
M12:144 M1:238 M4:54 M7:253 M3:18 M9:92 M5:6 M8:137 M13:106 M0:110 M14:207 M2:227 M11:46 M10:228 M6:148
J2:
M2:90 M10:125 M4:95 M7:209 M3:268 M1:212 M9:115 M11:190 M12:146 M5:285 M14:184 M13:292 M6:245 M0:2... | Solution:
J12-M0: 0+40 -> 40,J7-M1: 0+66 -> 66,J2-M2: 0+90 -> 90,J0-M3: 0+155 -> 155,J11-M4: 0+26 -> 26,J19-M5: 0+72 -> 72,J18-M6: 0+77 -> 77,J36-M7: 0+114 -> 114,J42-M8: 0+58 -> 58,J47-M9: 0+94 -> 94,J4-M10: 0+25 -> 25,J3-M11: 0+42 -> 42,J48-M12: 0+71 -> 71,J34-M13: 0+18 -> 18,J10-M14: 0+163 -> 163,J5-M13: 18+23 -> 41... | 50x15_246.jsp | 50 15
3 155 12 143 4 203 10 144 8 69 9 270 0 231 2 264 6 213 5 57 13 77 1 88 7 27 14 191 11 14
12 144 1 238 4 54 7 253 3 18 9 92 5 6 8 137 13 106 0 110 14 207 2 227 11 46 10 228 6 148
2 90 10 125 4 95 7 209 3 268 1 212 9 115 11 190 12 146 5 285 14 184 13 292 6 245 0 260 8 167
11 42 3 39 5 116 13 21 1 170 7 231 14 95 8 ... |
40 | 15 | J0:
M2:135 M0:100 M1:20 M7:131 M8:108 M5:100 M10:111 M12:12 M3:91 M11:94 M4:49 M9:137 M6:134 M13:31 M14:109
J1:
M7:5 M6:37 M9:18 M14:134 M0:95 M4:37 M2:50 M13:25 M3:154 M1:19 M5:27 M12:74 M8:19 M10:122 M11:33
J2:
M1:34 M0:19 M4:74 M10:118 M7:81 M8:9 M2:69 M13:61 M3:110 M12:69 M9:125 M14:118 M6:105 M11:60 M5:158
J3:
... | Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J9: 19 J11: 147 J18: 83 J26: 56 J0: 100 J2: 19 J3: 63 J31: 43 J22: 48 J7: 76 J20: 27 J21: 22 J32: 24 J38: 79 J1: 95 J10: 78 J23: 54 J39: 10 J4: 142 J34: 21 J16: 8 J35: 47 J36: 10 J27: 77 J33: 20 J14: 31 J25: 25 J19: 117 J37: 19 J12: 117 J13: 137 J15: 101 J28: 62 J30: 93 J17: 18 J24: 51 J29: 20 J5: 31 J6: 57 J8: 39 ... | J0:
M2:135 M0:100 M1:20 M7:131 M8:108 M5:100 M10:111 M12:12 M3:91 M11:94 M4:49 M9:137 M6:134 M13:31 M14:109
J1:
M7:5 M6:37 M9:18 M14:134 M0:95 M4:37 M2:50 M13:25 M3:154 M1:19 M5:27 M12:74 M8:19 M10:122 M11:33
J2:
M1:34 M0:19 M4:74 M10:118 M7:81 M8:9 M2:69 M13:61 M3:110 M12:69 M9:125 M14:118 M6:105 M11:60 M5:158
J3:
... | Solution:
J9-M0: 0+19 -> 19,J2-M1: 0+34 -> 34,J0-M2: 0+135 -> 135,J20-M3: 0+7 -> 7,J3-M4: 0+6 -> 6,J22-M5: 0+37 -> 37,J12-M6: 0+85 -> 85,J1-M7: 0+5 -> 5,J30-M9: 0+67 -> 67,J32-M10: 0+16 -> 16,J4-M11: 0+81 -> 81,J14-M12: 0+14 -> 14,J38-M13: 0+31 -> 31,J37-M7: 5+46 -> 51,J27-M4: 6+94 -> 100,J35-M3: 7+44 -> 51,J14-M8: 14+... | 40x15_83.jsp | 40 15
2 135 0 100 1 20 7 131 8 108 5 100 10 111 12 12 3 91 11 94 4 49 9 137 6 134 13 31 14 109
7 5 6 37 9 18 14 134 0 95 4 37 2 50 13 25 3 154 1 19 5 27 12 74 8 19 10 122 11 33
1 34 0 19 4 74 10 118 7 81 8 9 2 69 13 61 3 110 12 69 9 125 14 118 6 105 11 60 5 158
4 6 0 63 5 67 2 116 9 10 11 123 10 29 13 71 1 46 8 8 7 5 1... |
30 | 20 | J0:
M19:197 M14:137 M7:6 M9:170 M18:121 M10:35 M8:218 M3:106 M5:121 M13:147 M6:80 M17:15 M15:154 M2:216 M11:231 M12:79 M4:222 M1:188 M16:162 M0:44
J1:
M6:57 M15:48 M4:152 M10:171 M7:196 M18:162 M14:90 M5:154 M12:105 M2:6 M8:175 M11:135 M19:231 M9:63 M0:69 M1:21 M3:8 M16:88 M13:36 M17:64
J2:
M4:77 M1:72 M14:118 M9:37 ... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J7: 31 J17: 55 J10: 123 J3: 173 J19: 192 J29: 145 J18: 41 J22: 122 J28: 86 J2: 192 J9: 104 J13: 44 J5: 142 J16: 220 J20: 235 J11: 196 J23: 81 J1: 69 J24: 77 J25: 118 J14: 115 J8: 172 J15: 232 J6: 206 J12: 211 J4: 28 J26: 187 J27: 83 J0: 44 J21: 52
M1:
J16: 87 J24: 90 J2: 72 J29: 185 J3: 5 J13: 225 J14: 193 J20: 13... | J0:
M19:197 M14:137 M7:6 M9:170 M18:121 M10:35 M8:218 M3:106 M5:121 M13:147 M6:80 M17:15 M15:154 M2:216 M11:231 M12:79 M4:222 M1:188 M16:162 M0:44
J1:
M6:57 M15:48 M4:152 M10:171 M7:196 M18:162 M14:90 M5:154 M12:105 M2:6 M8:175 M11:135 M19:231 M9:63 M0:69 M1:21 M3:8 M16:88 M13:36 M17:64
J2:
M4:77 M1:72 M14:118 M9:37 ... | Solution:
J7-M0: 0+31 -> 31,J16-M1: 0+87 -> 87,J25-M2: 0+230 -> 230,J9-M3: 0+46 -> 46,J2-M4: 0+77 -> 77,J18-M5: 0+7 -> 7,J1-M6: 0+57 -> 57,J27-M7: 0+147 -> 147,J6-M10: 0+126 -> 126,J14-M11: 0+35 -> 35,J29-M12: 0+102 -> 102,J21-M13: 0+63 -> 63,J13-M16: 0+19 -> 19,J3-M17: 0+169 -> 169,J23-M18: 0+52 -> 52,J4-M19: 0+50 -> ... | 30x20_1198.jsp | 30 20
19 197 14 137 7 6 9 170 18 121 10 35 8 218 3 106 5 121 13 147 6 80 17 15 15 154 2 216 11 231 12 79 4 222 1 188 16 162 0 44
6 57 15 48 4 152 10 171 7 196 18 162 14 90 5 154 12 105 2 6 8 175 11 135 19 231 9 63 0 69 1 21 3 8 16 88 13 36 17 64
4 77 1 72 14 118 9 37 10 79 6 194 13 149 15 40 0 192 16 198 11 127 8 53 18... |
30 | 20 | J0:
M13:98 M2:155 M17:96 M10:44 M4:13 M9:108 M1:122 M16:75 M19:11 M6:63 M0:87 M18:126 M15:13 M12:111 M3:63 M14:172 M5:160 M8:72 M11:122 M7:115
J1:
M1:79 M18:91 M12:11 M15:117 M5:170 M16:60 M9:153 M14:62 M11:141 M2:35 M0:38 M8:35 M4:145 M19:35 M3:75 M6:99 M13:122 M7:69 M10:17 M17:14
J2:
M19:63 M3:80 M15:173 M11:142 M4... | Optimize schedule for 30 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J11: 157 J21: 77 J9: 173 J13: 109 J14: 98 J17: 59 J26: 22 J27: 84 J12: 65 J18: 60 J19: 83 J25: 44 J23: 137 J4: 152 J24: 162 J0: 87 J1: 38 J10: 8 J20: 159 J3: 153 J6: 159 J28: 137 J15: 168 J16: 174 J22: 20 J2: 170 J5: 144 J7: 18 J29: 59 J8: 179
M1:
J1: 79 J9: 112 J10: 64 J20: 19 J8: 33 J19: 82 J16: 164 J29: 160 J22... | J0:
M13:98 M2:155 M17:96 M10:44 M4:13 M9:108 M1:122 M16:75 M19:11 M6:63 M0:87 M18:126 M15:13 M12:111 M3:63 M14:172 M5:160 M8:72 M11:122 M7:115
J1:
M1:79 M18:91 M12:11 M15:117 M5:170 M16:60 M9:153 M14:62 M11:141 M2:35 M0:38 M8:35 M4:145 M19:35 M3:75 M6:99 M13:122 M7:69 M10:17 M17:14
J2:
M19:63 M3:80 M15:173 M11:142 M4... | Solution:
J11-M0: 0+157 -> 157,J10-M1: 0+64 -> 64,J3-M3: 0+72 -> 72,J5-M4: 0+20 -> 20,J15-M6: 0+149 -> 149,J12-M7: 0+12 -> 12,J27-M8: 0+22 -> 22,J23-M9: 0+82 -> 82,J8-M10: 0+58 -> 58,J18-M11: 0+41 -> 41,J26-M12: 0+19 -> 19,J0-M13: 0+98 -> 98,J7-M15: 0+31 -> 31,J25-M16: 0+82 -> 82,J24-M18: 0+5 -> 5,J2-M19: 0+63 -> 63,J2... | 30x20_1636.jsp | 30 20
13 98 2 155 17 96 10 44 4 13 9 108 1 122 16 75 19 11 6 63 0 87 18 126 15 13 12 111 3 63 14 172 5 160 8 72 11 122 7 115
1 79 18 91 12 11 15 117 5 170 16 60 9 153 14 62 11 141 2 35 0 38 8 35 4 145 19 35 3 75 6 99 13 122 7 69 10 17 17 14
19 63 3 80 15 173 11 142 4 101 7 111 13 167 8 115 12 98 6 120 10 177 5 14 17 70... |
40 | 20 | J0:
M13:21 M15:51 M10:76 M1:24 M19:16 M7:17 M18:53 M5:63 M17:27 M9:47 M16:46 M4:84 M12:10 M11:31 M14:54 M6:26 M0:71 M8:26 M2:10 M3:74
J1:
M7:61 M18:83 M12:56 M11:53 M19:20 M15:51 M6:68 M13:11 M9:70 M14:32 M16:12 M8:60 M4:14 M1:8 M17:74 M5:43 M10:20 M3:5 M0:28 M2:29
J2:
M11:19 M5:62 M9:32 M7:32 M16:51 M10:38 M13:54 M0... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J27: 34 J31: 18 J14: 46 J18: 57 J28: 84 J29: 68 J3: 23 J7: 61 J15: 49 J24: 12 J30: 76 J10: 8 J12: 45 J13: 73 J35: 57 J2: 86 J25: 32 J37: 12 J4: 38 J11: 73 J16: 36 J33: 81 J38: 6 J9: 74 J22: 84 J23: 8 J32: 25 J34: 47 J6: 25 J17: 15 J39: 69 J0: 71 J5: 75 J26: 77 J36: 79 J19: 24 J1: 28 J8: 53 J20: 57 J21: 73
M1:
J10:... | J0:
M13:21 M15:51 M10:76 M1:24 M19:16 M7:17 M18:53 M5:63 M17:27 M9:47 M16:46 M4:84 M12:10 M11:31 M14:54 M6:26 M0:71 M8:26 M2:10 M3:74
J1:
M7:61 M18:83 M12:56 M11:53 M19:20 M15:51 M6:68 M13:11 M9:70 M14:32 M16:12 M8:60 M4:14 M1:8 M17:74 M5:43 M10:20 M3:5 M0:28 M2:29
J2:
M11:19 M5:62 M9:32 M7:32 M16:51 M10:38 M13:54 M0... | Solution:
J31-M0: 0+18 -> 18,J10-M1: 0+63 -> 63,J11-M3: 0+18 -> 18,J19-M4: 0+39 -> 39,J7-M5: 0+47 -> 47,J14-M6: 0+29 -> 29,J28-M7: 0+54 -> 54,J32-M8: 0+71 -> 71,J4-M9: 0+82 -> 82,J30-M10: 0+15 -> 15,J37-M11: 0+5 -> 5,J39-M12: 0+27 -> 27,J0-M13: 0+21 -> 21,J22-M15: 0+41 -> 41,J15-M16: 0+79 -> 79,J36-M17: 0+20 -> 20,J25-... | 40x20_655.jsp | 40 20
13 21 15 51 10 76 1 24 19 16 7 17 18 53 5 63 17 27 9 47 16 46 4 84 12 10 11 31 14 54 6 26 0 71 8 26 2 10 3 74
7 61 18 83 12 56 11 53 19 20 15 51 6 68 13 11 9 70 14 32 16 12 8 60 4 14 1 8 17 74 5 43 10 20 3 5 0 28 2 29
11 19 5 62 9 32 7 32 16 51 10 38 13 54 0 86 8 64 4 14 15 8 6 86 2 31 17 11 1 15 18 59 12 46 14 1... |
40 | 40 | J0:
M13:138 M31:105 M27:14 M17:73 M2:113 M15:43 M24:90 M0:71 M32:132 M3:15 M7:166 M28:36 M39:150 M9:5 M10:129 M22:153 M21:129 M8:45 M23:75 M5:36 M11:18 M33:178 M30:74 M12:148 M1:33 M19:45 M26:16 M38:91 M37:7 M34:28 M14:148 M16:18 M36:149 M20:66 M4:32 M25:33 M29:42 M6:133 M18:86 M35:33
J1:
M15:72 M22:72 M14:15 M4:107 M... | Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J8: 110 J9: 82 J39: 6 J32: 108 J36: 140 J0: 71 J3: 102 J24: 62 J18: 88 J29: 93 J37: 5 J13: 107 J17: 19 J14: 85 J31: 133 J10: 131 J26: 117 J4: 99 J23: 80 J35: 71 J21: 98 J15: 35 J25: 16 J33: 44 J22: 179 J1: 102 J2: 97 J6: 173 J16: 62 J38: 19 J28: 63 J27: 11 J12: 18 J30: 152 J7: 138 J19: 16 J11: 138 J34: 20 J5: 110 J... | J0:
M13:138 M31:105 M27:14 M17:73 M2:113 M15:43 M24:90 M0:71 M32:132 M3:15 M7:166 M28:36 M39:150 M9:5 M10:129 M22:153 M21:129 M8:45 M23:75 M5:36 M11:18 M33:178 M30:74 M12:148 M1:33 M19:45 M26:16 M38:91 M37:7 M34:28 M14:148 M16:18 M36:149 M20:66 M4:32 M25:33 M29:42 M6:133 M18:86 M35:33
J1:
M15:72 M22:72 M14:15 M4:107 M... | Solution:
J8-M0: 0+110 -> 110,J31-M2: 0+33 -> 33,J27-M3: 0+122 -> 122,J33-M5: 0+6 -> 6,J29-M6: 0+18 -> 18,J3-M7: 0+18 -> 18,J39-M9: 0+169 -> 169,J20-M11: 0+85 -> 85,J36-M13: 0+48 -> 48,J38-M14: 0+115 -> 115,J1-M15: 0+72 -> 72,J10-M17: 0+97 -> 97,J11-M18: 0+24 -> 24,J25-M20: 0+127 -> 127,J34-M24: 0+110 -> 110,J4-M25: 0+... | 40x40_85.jsp | 40 40
13 138 31 105 27 14 17 73 2 113 15 43 24 90 0 71 32 132 3 15 7 166 28 36 39 150 9 5 10 129 22 153 21 129 8 45 23 75 5 36 11 18 33 178 30 74 12 148 1 33 19 45 26 16 38 91 37 7 34 28 14 148 16 18 36 149 20 66 4 32 25 33 29 42 6 133 18 86 35 33
15 72 22 72 14 15 4 107 8 183 39 148 20 122 5 129 2 174 9 57 19 60 28 71... |
50 | 20 | J0:
M2:112 M11:50 M5:72 M9:106 M8:56 M7:43 M1:77 M3:26 M6:79 M13:31 M16:85 M12:54 M15:33 M19:111 M0:83 M4:54 M17:51 M14:51 M10:47 M18:100
J1:
M6:103 M9:66 M19:90 M12:77 M8:50 M16:10 M14:75 M0:72 M4:34 M5:19 M13:25 M1:50 M11:22 M7:25 M18:53 M17:106 M3:33 M2:31 M15:25 M10:26
J2:
M9:87 M14:89 M19:9 M15:38 M2:13 M13:12 M... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J3: 84 J4: 61 J12: 47 J28: 48 J34: 43 J48: 25 J49: 31 J18: 8 J37: 28 J15: 103 J46: 11 J44: 67 J13: 83 J16: 49 J2: 102 J21: 22 J42: 23 J1: 72 J23: 14 J41: 23 J47: 47 J7: 55 J14: 49 J17: 75 J19: 12 J20: 90 J24: 6 J8: 21 J35: 96 J39: 50 J43: 75 J45: 94 J30: 101 J38: 109 J11: 47 J36: 97 J10: 50 J0: 83 J9: 10 J40: 62 J5... | J0:
M2:112 M11:50 M5:72 M9:106 M8:56 M7:43 M1:77 M3:26 M6:79 M13:31 M16:85 M12:54 M15:33 M19:111 M0:83 M4:54 M17:51 M14:51 M10:47 M18:100
J1:
M6:103 M9:66 M19:90 M12:77 M8:50 M16:10 M14:75 M0:72 M4:34 M5:19 M13:25 M1:50 M11:22 M7:25 M18:53 M17:106 M3:33 M2:31 M15:25 M10:26
J2:
M9:87 M14:89 M19:9 M15:38 M2:13 M13:12 M... | Solution:
J12-M2: 0+24 -> 24,J27-M3: 0+64 -> 64,J17-M4: 0+12 -> 12,J35-M5: 0+55 -> 55,J42-M6: 0+22 -> 22,J7-M7: 0+28 -> 28,J8-M8: 0+6 -> 6,J9-M9: 0+8 -> 8,J40-M10: 0+32 -> 32,J6-M11: 0+21 -> 21,J31-M13: 0+46 -> 46,J38-M14: 0+30 -> 30,J11-M15: 0+26 -> 26,J49-M16: 0+9 -> 9,J20-M17: 0+67 -> 67,J24-M18: 0+19 -> 19,J43-M19:... | 50x20_935.jsp | 50 20
2 112 11 50 5 72 9 106 8 56 7 43 1 77 3 26 6 79 13 31 16 85 12 54 15 33 19 111 0 83 4 54 17 51 14 51 10 47 18 100
6 103 9 66 19 90 12 77 8 50 16 10 14 75 0 72 4 34 5 19 13 25 1 50 11 22 7 25 18 53 17 106 3 33 2 31 15 25 10 26
9 87 14 89 19 9 15 38 2 13 13 12 0 102 1 107 17 78 6 104 12 28 5 78 18 29 11 76 16 18 3 ... |
50 | 15 | J0:
M7:60 M12:69 M9:64 M2:8 M5:45 M1:49 M3:43 M0:8 M8:76 M13:36 M11:23 M6:29 M10:15 M4:37 M14:65
J1:
M8:24 M0:47 M4:51 M6:23 M10:42 M9:73 M13:39 M14:44 M1:49 M2:5 M7:29 M12:8 M3:68 M5:42 M11:11
J2:
M2:61 M10:54 M11:21 M13:29 M5:36 M12:23 M1:70 M9:80 M14:60 M6:71 M0:78 M7:16 M3:69 M4:12 M8:14
J3:
M9:22 M12:50 M1:44 M... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J6: 42 J15: 9 J1: 47 J21: 16 J33: 69 J17: 35 J20: 36 J28: 36 J3: 60 J8: 18 J9: 66 J14: 17 J36: 7 J49: 27 J10: 80 J29: 33 J42: 40 J48: 76 J7: 68 J23: 7 J30: 30 J34: 59 J38: 23 J4: 47 J26: 12 J27: 29 J44: 12 J0: 8 J31: 70 J32: 67 J41: 33 J47: 41 J11: 36 J24: 73 J25: 27 J40: 35 J2: 78 J16: 58 J12: 29 J13: 21 J19: 30 J... | J0:
M7:60 M12:69 M9:64 M2:8 M5:45 M1:49 M3:43 M0:8 M8:76 M13:36 M11:23 M6:29 M10:15 M4:37 M14:65
J1:
M8:24 M0:47 M4:51 M6:23 M10:42 M9:73 M13:39 M14:44 M1:49 M2:5 M7:29 M12:8 M3:68 M5:42 M11:11
J2:
M2:61 M10:54 M11:21 M13:29 M5:36 M12:23 M1:70 M9:80 M14:60 M6:71 M0:78 M7:16 M3:69 M4:12 M8:14
J3:
M9:22 M12:50 M1:44 M... | Solution:
J15-M0: 0+9 -> 9,J27-M1: 0+5 -> 5,J8-M2: 0+8 -> 8,J36-M3: 0+11 -> 11,J42-M4: 0+75 -> 75,J12-M5: 0+48 -> 48,J35-M6: 0+46 -> 46,J47-M7: 0+37 -> 37,J41-M8: 0+12 -> 12,J3-M9: 0+22 -> 22,J31-M10: 0+36 -> 36,J22-M11: 0+29 -> 29,J17-M12: 0+7 -> 7,J24-M13: 0+9 -> 9,J40-M14: 0+13 -> 13,J33-M1: 5+10 -> 15,J25-M12: 7+13... | 50x15_534.jsp | 50 15
7 60 12 69 9 64 2 8 5 45 1 49 3 43 0 8 8 76 13 36 11 23 6 29 10 15 4 37 14 65
8 24 0 47 4 51 6 23 10 42 9 73 13 39 14 44 1 49 2 5 7 29 12 8 3 68 5 42 11 11
2 61 10 54 11 21 13 29 5 36 12 23 1 70 9 80 14 60 6 71 0 78 7 16 3 69 4 12 8 14
9 22 12 50 1 44 0 60 7 60 6 51 11 16 14 11 13 68 8 23 3 37 5 59 2 42 4 28 10 2... |
100 | 50 | J0:
M48:116 M40:41 M38:90 M21:124 M47:103 M20:180 M25:204 M13:12 M14:95 M49:127 M10:148 M4:136 M0:102 M15:78 M44:167 M35:178 M23:42 M43:129 M1:207 M45:43 M28:169 M39:169 M12:26 M11:56 M32:125 M36:172 M17:99 M41:171 M26:113 M3:168 M6:185 M30:158 M2:114 M34:174 M18:96 M8:158 M5:68 M46:99 M29:27 M31:85 M22:88 M33:90 M27:9... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J51: 52 J78: 161 J75: 207 J76: 137 J97: 122 J28: 87 J53: 54 J4: 58 J35: 116 J62: 175 J89: 63 J98: 71 J5: 191 J9: 138 J36: 90 J45: 6 J59: 29 J67: 146 J15: 53 J26: 201 J90: 186 J17: 183 J13: 74 J32: 153 J38: 89 J58: 121 J86: 175 J48: 39 J50: 142 J94: 150 J0: 102 J8: 190 J10: 194 J23: 11 J25: 209 J91: 68 J92: 40 J16: ... | J0:
M48:116 M40:41 M38:90 M21:124 M47:103 M20:180 M25:204 M13:12 M14:95 M49:127 M10:148 M4:136 M0:102 M15:78 M44:167 M35:178 M23:42 M43:129 M1:207 M45:43 M28:169 M39:169 M12:26 M11:56 M32:125 M36:172 M17:99 M41:171 M26:113 M3:168 M6:185 M30:158 M2:114 M34:174 M18:96 M8:158 M5:68 M46:99 M29:27 M31:85 M22:88 M33:90 M27:9... | Solution:
J51-M0: 0+52 -> 52,J55-M1: 0+9 -> 9,J16-M2: 0+22 -> 22,J48-M4: 0+125 -> 125,J66-M5: 0+58 -> 58,J59-M6: 0+52 -> 52,J18-M7: 0+78 -> 78,J54-M8: 0+76 -> 76,J94-M9: 0+41 -> 41,J79-M10: 0+18 -> 18,J84-M11: 0+37 -> 37,J32-M12: 0+100 -> 100,J69-M13: 0+103 -> 103,J24-M14: 0+6 -> 6,J26-M15: 0+88 -> 88,J6-M16: 0+53 -> 5... | 100x50_1945.jsp | 100 50
48 116 40 41 38 90 21 124 47 103 20 180 25 204 13 12 14 95 49 127 10 148 4 136 0 102 15 78 44 167 35 178 23 42 43 129 1 207 45 43 28 169 39 169 12 26 11 56 32 125 36 172 17 99 41 171 26 113 3 168 6 185 30 158 2 114 34 174 18 96 8 158 5 68 46 99 29 27 31 85 22 88 33 90 27 97 37 107 9 151 16 161 7 64 24 187 42 127... |
40 | 20 | J0:
M18:22 M14:60 M19:23 M11:33 M17:12 M15:27 M8:16 M3:52 M12:56 M2:45 M4:22 M0:72 M9:31 M5:33 M13:35 M16:74 M7:21 M10:25 M6:61 M1:66
J1:
M4:32 M0:21 M8:61 M2:20 M14:69 M10:47 M5:73 M9:7 M16:75 M13:32 M17:23 M15:14 M6:13 M1:54 M7:12 M11:68 M12:40 M19:65 M18:9 M3:56
J2:
M4:31 M5:8 M10:67 M12:45 M8:46 M11:73 M9:35 M3:5... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J1: 21 J7: 9 J21: 72 J31: 58 J30: 21 J17: 16 J18: 14 J35: 12 J13: 16 J20: 27 J9: 9 J12: 29 J36: 60 J32: 46 J5: 41 J11: 5 J8: 36 J0: 72 J14: 73 J24: 26 J29: 29 J10: 33 J26: 69 J28: 43 J6: 15 J19: 45 J25: 50 J34: 5 J37: 65 J4: 51 J15: 48 J33: 27 J16: 71 J22: 64 J38: 50 J39: 16 J2: 51 J3: 19 J23: 53 J27: 60
M1:
J39: ... | J0:
M18:22 M14:60 M19:23 M11:33 M17:12 M15:27 M8:16 M3:52 M12:56 M2:45 M4:22 M0:72 M9:31 M5:33 M13:35 M16:74 M7:21 M10:25 M6:61 M1:66
J1:
M4:32 M0:21 M8:61 M2:20 M14:69 M10:47 M5:73 M9:7 M16:75 M13:32 M17:23 M15:14 M6:13 M1:54 M7:12 M11:68 M12:40 M19:65 M18:9 M3:56
J2:
M4:31 M5:8 M10:67 M12:45 M8:46 M11:73 M9:35 M3:5... | Solution:
J39-M1: 0+66 -> 66,J21-M2: 0+5 -> 5,J34-M3: 0+12 -> 12,J6-M4: 0+5 -> 5,J19-M5: 0+21 -> 21,J25-M6: 0+36 -> 36,J4-M7: 0+11 -> 11,J5-M8: 0+48 -> 48,J37-M9: 0+9 -> 9,J14-M10: 0+10 -> 10,J12-M12: 0+21 -> 21,J23-M13: 0+13 -> 13,J28-M14: 0+10 -> 10,J18-M15: 0+39 -> 39,J33-M16: 0+10 -> 10,J27-M17: 0+31 -> 31,J26-M18:... | 40x20_360.jsp | 40 20
18 22 14 60 19 23 11 33 17 12 15 27 8 16 3 52 12 56 2 45 4 22 0 72 9 31 5 33 13 35 16 74 7 21 10 25 6 61 1 66
4 32 0 21 8 61 2 20 14 69 10 47 5 73 9 7 16 75 13 32 17 23 15 14 6 13 1 54 7 12 11 68 12 40 19 65 18 9 3 56
4 31 5 8 10 67 12 45 8 46 11 73 9 35 3 56 13 16 19 68 15 10 1 37 17 14 6 18 16 28 18 39 7 63 0 5... |
30 | 30 | J0:
M12:14 M0:38 M16:26 M10:12 M7:25 M13:36 M20:38 M9:29 M5:21 M29:23 M11:26 M6:37 M15:18 M19:25 M27:19 M1:14 M21:16 M28:16 M22:27 M25:19 M24:16 M18:5 M23:9 M17:33 M14:25 M8:26 M26:32 M2:35 M3:36 M4:5
J1:
M27:30 M2:13 M20:8 M16:24 M25:36 M6:16 M21:38 M10:15 M23:13 M18:13 M7:21 M24:7 M26:24 M28:38 M15:10 M0:10 M12:28 M... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J21: 38 J0: 38 J25: 21 J28: 10 J8: 29 J12: 32 J2: 38 J3: 32 J11: 8 J24: 19 J26: 15 J29: 12 J17: 15 J18: 17 J27: 20 J22: 13 J1: 10 J20: 6 J23: 23 J15: 30 J19: 14 J16: 12 J10: 21 J5: 24 J7: 37 J9: 30 J13: 36 J14: 26 J4: 25 J6: 19
M1:
J10: 18 J16: 38 J28: 7 J21: 10 J12: 29 J13: 21 J25: 30 J11: 19 J5: 29 J6: 6 J7: 24 ... | J0:
M12:14 M0:38 M16:26 M10:12 M7:25 M13:36 M20:38 M9:29 M5:21 M29:23 M11:26 M6:37 M15:18 M19:25 M27:19 M1:14 M21:16 M28:16 M22:27 M25:19 M24:16 M18:5 M23:9 M17:33 M14:25 M8:26 M26:32 M2:35 M3:36 M4:5
J1:
M27:30 M2:13 M20:8 M16:24 M25:36 M6:16 M21:38 M10:15 M23:13 M18:13 M7:21 M24:7 M26:24 M28:38 M15:10 M0:10 M12:28 M... | Solution:
J21-M0: 0+38 -> 38,J10-M1: 0+18 -> 18,J12-M2: 0+24 -> 24,J22-M3: 0+23 -> 23,J27-M4: 0+23 -> 23,J28-M5: 0+21 -> 21,J3-M6: 0+27 -> 27,J26-M7: 0+19 -> 19,J0-M12: 0+14 -> 14,J20-M16: 0+26 -> 26,J9-M17: 0+19 -> 19,J5-M20: 0+13 -> 13,J23-M21: 0+35 -> 35,J14-M22: 0+26 -> 26,J25-M23: 0+5 -> 5,J8-M24: 0+5 -> 5,J29-M25... | 30x30_2118.jsp | 30 30
12 14 0 38 16 26 10 12 7 25 13 36 20 38 9 29 5 21 29 23 11 26 6 37 15 18 19 25 27 19 1 14 21 16 28 16 22 27 25 19 24 16 18 5 23 9 17 33 14 25 8 26 26 32 2 35 3 36 4 5
27 30 2 13 20 8 16 24 25 36 6 16 21 38 10 15 23 13 18 13 7 21 24 7 26 24 28 38 15 10 0 10 12 28 1 24 4 37 13 26 9 15 17 30 22 13 5 11 29 36 19 22 1... |
30 | 30 | J0:
M7:45 M17:51 M11:22 M26:29 M0:50 M20:29 M5:8 M16:30 M14:14 M13:25 M1:57 M4:34 M27:41 M8:34 M9:15 M28:56 M29:20 M6:15 M2:32 M12:53 M18:36 M10:14 M19:5 M3:35 M22:18 M21:7 M24:28 M23:46 M25:10 M15:61
J1:
M21:48 M17:30 M26:51 M4:16 M14:5 M15:57 M25:37 M22:57 M20:38 M12:16 M0:11 M11:41 M6:12 M10:37 M19:52 M7:50 M8:45 M... | Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J18: 24 J3: 18 J8: 29 J11: 11 J16: 44 J27: 16 J14: 12 J20: 25 J0: 50 J2: 33 J29: 61 J10: 45 J23: 38 J7: 36 J19: 11 J21: 41 J24: 57 J9: 36 J22: 58 J1: 11 J17: 19 J25: 53 J4: 10 J15: 41 J12: 5 J26: 5 J13: 34 J5: 21 J28: 10 J6: 44
M1:
J12: 61 J19: 32 J27: 17 J15: 58 J21: 13 J10: 41 J28: 57 J22: 8 J2: 30 J8: 58 J25: 5... | J0:
M7:45 M17:51 M11:22 M26:29 M0:50 M20:29 M5:8 M16:30 M14:14 M13:25 M1:57 M4:34 M27:41 M8:34 M9:15 M28:56 M29:20 M6:15 M2:32 M12:53 M18:36 M10:14 M19:5 M3:35 M22:18 M21:7 M24:28 M23:46 M25:10 M15:61
J1:
M21:48 M17:30 M26:51 M4:16 M14:5 M15:57 M25:37 M22:57 M20:38 M12:16 M0:11 M11:41 M6:12 M10:37 M19:52 M7:50 M8:45 M... | Solution:
J27-M1: 0+17 -> 17,J17-M3: 0+6 -> 6,J13-M4: 0+42 -> 42,J6-M5: 0+23 -> 23,J9-M7: 0+7 -> 7,J21-M8: 0+7 -> 7,J11-M9: 0+59 -> 59,J16-M10: 0+20 -> 20,J25-M11: 0+22 -> 22,J5-M12: 0+5 -> 5,J8-M13: 0+8 -> 8,J2-M14: 0+30 -> 30,J4-M16: 0+23 -> 23,J26-M18: 0+42 -> 42,J7-M20: 0+37 -> 37,J1-M21: 0+48 -> 48,J20-M29: 0+54 -... | 30x30_1988.jsp | 30 30
7 45 17 51 11 22 26 29 0 50 20 29 5 8 16 30 14 14 13 25 1 57 4 34 27 41 8 34 9 15 28 56 29 20 6 15 2 32 12 53 18 36 10 14 19 5 3 35 22 18 21 7 24 28 23 46 25 10 15 61
21 48 17 30 26 51 4 16 14 5 15 57 25 37 22 57 20 38 12 16 0 11 11 41 6 12 10 37 19 52 7 50 8 45 28 14 3 26 29 31 18 35 5 26 23 10 24 28 1 5 16 54 1... |
50 | 20 | J0:
M1:16 M5:49 M7:48 M15:47 M8:47 M3:49 M10:31 M19:36 M16:31 M17:7 M4:24 M18:9 M12:39 M6:21 M0:31 M11:42 M9:15 M14:34 M13:29 M2:20
J1:
M18:13 M11:49 M2:12 M12:17 M3:26 M7:50 M13:35 M14:32 M4:38 M1:36 M15:47 M16:38 M8:7 M0:17 M9:26 M6:43 M10:11 M19:50 M5:8 M17:47
J2:
M12:22 M0:29 M11:14 M13:8 M7:40 M8:28 M9:22 M14:30... | Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J2: 29 J4: 24 J6: 28 J42: 10 J14: 38 J24: 13 J46: 12 J48: 29 J5: 27 J7: 29 J10: 33 J25: 22 J34: 7 J35: 32 J37: 17 J12: 43 J22: 24 J36: 20 J19: 51 J11: 44 J16: 45 J26: 50 J40: 15 J41: 39 J8: 22 J18: 49 J23: 37 J33: 40 J44: 41 J49: 19 J1: 17 J20: 17 J28: 29 J0: 31 J3: 20 J17: 12 J30: 45 J47: 17 J43: 47 J9: 9 J13: 11 ... | J0:
M1:16 M5:49 M7:48 M15:47 M8:47 M3:49 M10:31 M19:36 M16:31 M17:7 M4:24 M18:9 M12:39 M6:21 M0:31 M11:42 M9:15 M14:34 M13:29 M2:20
J1:
M18:13 M11:49 M2:12 M12:17 M3:26 M7:50 M13:35 M14:32 M4:38 M1:36 M15:47 M16:38 M8:7 M0:17 M9:26 M6:43 M10:11 M19:50 M5:8 M17:47
J2:
M12:22 M0:29 M11:14 M13:8 M7:40 M8:28 M9:22 M14:30... | Solution:
J0-M1: 0+16 -> 16,J32-M2: 0+24 -> 24,J31-M3: 0+18 -> 18,J25-M4: 0+7 -> 7,J33-M5: 0+11 -> 11,J28-M6: 0+40 -> 40,J13-M7: 0+36 -> 36,J21-M8: 0+32 -> 32,J15-M9: 0+32 -> 32,J4-M10: 0+12 -> 12,J27-M11: 0+14 -> 14,J2-M12: 0+22 -> 22,J30-M13: 0+36 -> 36,J3-M14: 0+30 -> 30,J41-M15: 0+9 -> 9,J12-M17: 0+15 -> 15,J1-M18:... | 50x20_509.jsp | 50 20
1 16 5 49 7 48 15 47 8 47 3 49 10 31 19 36 16 31 17 7 4 24 18 9 12 39 6 21 0 31 11 42 9 15 14 34 13 29 2 20
18 13 11 49 2 12 12 17 3 26 7 50 13 35 14 32 4 38 1 36 15 47 16 38 8 7 0 17 9 26 6 43 10 11 19 50 5 8 17 47
12 22 0 29 11 14 13 8 7 40 8 28 9 22 14 30 2 31 3 47 18 43 10 50 4 23 6 50 15 45 1 11 5 50 19 28 1... |
30 | 15 | J0:
M1:102 M14:37 M7:24 M8:13 M12:11 M11:69 M9:97 M5:87 M4:58 M6:7 M2:132 M13:141 M3:65 M0:39 M10:104
J1:
M10:105 M4:151 M7:9 M14:77 M6:44 M13:43 M2:54 M1:116 M0:17 M5:180 M8:125 M9:49 M3:102 M11:136 M12:41
J2:
M12:90 M0:46 M4:85 M11:64 M3:108 M2:143 M1:21 M13:78 M7:71 M8:99 M9:49 M6:109 M5:76 M14:157 M10:185
J3:
M4... | Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J5: 92 J2: 46 J11: 130 J16: 24 J21: 121 J14: 28 J26: 32 J29: 163 J4: 69 J9: 196 J17: 181 J28: 79 J27: 18 J1: 17 J3: 161 J20: 189 J12: 160 J18: 42 J22: 140 J6: 139 J7: 128 J10: 152 J13: 64 J15: 116 J24: 37 J25: 179 J0: 39 J19: 197 J8: 93 J23: 59
M1:
J0: 102 J28: 133 J4: 10 J10: 156 J13: 39 J15: 121 J22: 27 J25: 171... | J0:
M1:102 M14:37 M7:24 M8:13 M12:11 M11:69 M9:97 M5:87 M4:58 M6:7 M2:132 M13:141 M3:65 M0:39 M10:104
J1:
M10:105 M4:151 M7:9 M14:77 M6:44 M13:43 M2:54 M1:116 M0:17 M5:180 M8:125 M9:49 M3:102 M11:136 M12:41
J2:
M12:90 M0:46 M4:85 M11:64 M3:108 M2:143 M1:21 M13:78 M7:71 M8:99 M9:49 M6:109 M5:76 M14:157 M10:185
J3:
M4... | Solution:
J5-M0: 0+92 -> 92,J0-M1: 0+102 -> 102,J20-M2: 0+90 -> 90,J24-M3: 0+33 -> 33,J19-M4: 0+50 -> 50,J6-M5: 0+53 -> 53,J9-M6: 0+162 -> 162,J27-M7: 0+30 -> 30,J8-M8: 0+157 -> 157,J1-M10: 0+105 -> 105,J16-M11: 0+92 -> 92,J18-M12: 0+43 -> 43,J17-M14: 0+169 -> 169,J4-M7: 30+82 -> 112,J27-M12: 43+39 -> 82,J24-M4: 50+18 ... | 30x15_824.jsp | 30 15
1 102 14 37 7 24 8 13 12 11 11 69 9 97 5 87 4 58 6 7 2 132 13 141 3 65 0 39 10 104
10 105 4 151 7 9 14 77 6 44 13 43 2 54 1 116 0 17 5 180 8 125 9 49 3 102 11 136 12 41
12 90 0 46 4 85 11 64 3 108 2 143 1 21 13 78 7 71 8 99 9 49 6 109 5 76 14 157 10 185
4 170 9 182 7 185 8 47 6 160 10 18 5 11 14 32 0 161 2 26 11 ... |
50 | 15 | J0:
M5:21 M12:20 M3:18 M13:10 M14:9 M0:18 M7:21 M4:16 M10:10 M2:17 M8:12 M11:20 M1:19 M9:15 M6:16
J1:
M14:19 M1:20 M2:11 M7:19 M4:18 M10:6 M5:8 M12:17 M3:9 M9:14 M6:8 M11:6 M8:15 M13:17 M0:16
J2:
M5:21 M14:19 M12:7 M10:10 M13:14 M7:20 M1:18 M2:20 M8:16 M6:5 M4:21 M11:7 M0:10 M9:11 M3:6
J3:
M8:10 M5:18 M1:6 M14:6 M3:... | Optimize schedule for 50 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J11: 10 J22: 19 J32: 8 J39: 21 J10: 7 J14: 18 J16: 14 J49: 14 J26: 17 J34: 10 J18: 18 J40: 16 J45: 13 J0: 18 J3: 12 J17: 7 J23: 13 J47: 7 J42: 16 J48: 20 J28: 5 J46: 19 J4: 15 J6: 6 J43: 19 J5: 14 J27: 21 J31: 10 J35: 20 J41: 13 J8: 5 J13: 7 J21: 17 J25: 17 J30: 18 J38: 6 J7: 9 J20: 13 J29: 14 J36: 5 J2: 10 J9: 19 ... | J0:
M5:21 M12:20 M3:18 M13:10 M14:9 M0:18 M7:21 M4:16 M10:10 M2:17 M8:12 M11:20 M1:19 M9:15 M6:16
J1:
M14:19 M1:20 M2:11 M7:19 M4:18 M10:6 M5:8 M12:17 M3:9 M9:14 M6:8 M11:6 M8:15 M13:17 M0:16
J2:
M5:21 M14:19 M12:7 M10:10 M13:14 M7:20 M1:18 M2:20 M8:16 M6:5 M4:21 M11:7 M0:10 M9:11 M3:6
J3:
M8:10 M5:18 M1:6 M14:6 M3:... | Solution:
J32-M0: 0+8 -> 8,J26-M1: 0+16 -> 16,J47-M2: 0+5 -> 5,J40-M3: 0+9 -> 9,J4-M4: 0+7 -> 7,J42-M5: 0+12 -> 12,J28-M6: 0+12 -> 12,J20-M7: 0+12 -> 12,J3-M8: 0+10 -> 10,J49-M9: 0+8 -> 8,J5-M10: 0+6 -> 6,J17-M11: 0+17 -> 17,J21-M12: 0+17 -> 17,J43-M13: 0+8 -> 8,J30-M14: 0+7 -> 7,J27-M2: 5+11 -> 16,J35-M10: 6+12 -> 18,... | 50x15_838.jsp | 50 15
5 21 12 20 3 18 13 10 14 9 0 18 7 21 4 16 10 10 2 17 8 12 11 20 1 19 9 15 6 16
14 19 1 20 2 11 7 19 4 18 10 6 5 8 12 17 3 9 9 14 6 8 11 6 8 15 13 17 0 16
5 21 14 19 12 7 10 10 13 14 7 20 1 18 2 20 8 16 6 5 4 21 11 7 0 10 9 11 3 6
8 10 5 18 1 6 14 6 3 14 0 12 9 12 13 15 6 10 10 10 7 8 2 12 11 20 12 17 4 17
4 7 7 1... |
40 | 20 | J0:
M19:12 M12:90 M1:7 M5:139 M6:29 M18:61 M0:108 M7:109 M14:110 M4:150 M2:38 M3:103 M9:21 M16:133 M15:131 M13:92 M17:120 M8:29 M10:134 M11:160
J1:
M2:84 M11:164 M0:147 M7:80 M13:64 M4:86 M9:135 M1:85 M19:164 M3:87 M12:122 M17:66 M8:156 M6:63 M16:169 M5:166 M18:14 M10:92 M15:141 M14:70
J2:
M4:6 M15:154 M3:169 M10:47 ... | Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J9: 161 J29: 60 J1: 147 J8: 67 J13: 112 J25: 171 J38: 41 J0: 108 J14: 79 J24: 75 J27: 148 J2: 34 J6: 73 J10: 9 J26: 89 J32: 125 J34: 128 J39: 88 J28: 21 J37: 61 J17: 81 J30: 165 J31: 111 J35: 116 J11: 31 J12: 142 J33: 81 J4: 6 J5: 137 J3: 108 J20: 92 J21: 151 J22: 150 J23: 170 J7: 50 J15: 48 J18: 131 J16: 21 J19: 1... | J0:
M19:12 M12:90 M1:7 M5:139 M6:29 M18:61 M0:108 M7:109 M14:110 M4:150 M2:38 M3:103 M9:21 M16:133 M15:131 M13:92 M17:120 M8:29 M10:134 M11:160
J1:
M2:84 M11:164 M0:147 M7:80 M13:64 M4:86 M9:135 M1:85 M19:164 M3:87 M12:122 M17:66 M8:156 M6:63 M16:169 M5:166 M18:14 M10:92 M15:141 M14:70
J2:
M4:6 M15:154 M3:169 M10:47 ... | Solution:
J29-M0: 0+60 -> 60,J15-M1: 0+22 -> 22,J30-M2: 0+21 -> 21,J19-M3: 0+82 -> 82,J2-M4: 0+6 -> 6,J35-M6: 0+55 -> 55,J37-M7: 0+5 -> 5,J11-M8: 0+34 -> 34,J25-M10: 0+135 -> 135,J31-M11: 0+31 -> 31,J17-M12: 0+22 -> 22,J12-M13: 0+102 -> 102,J38-M14: 0+19 -> 19,J4-M15: 0+169 -> 169,J14-M17: 0+20 -> 20,J20-M18: 0+23 -> 2... | 40x20_1934.jsp | 40 20
19 12 12 90 1 7 5 139 6 29 18 61 0 108 7 109 14 110 4 150 2 38 3 103 9 21 16 133 15 131 13 92 17 120 8 29 10 134 11 160
2 84 11 164 0 147 7 80 13 64 4 86 9 135 1 85 19 164 3 87 12 122 17 66 8 156 6 63 16 169 5 166 18 14 10 92 15 141 14 70
4 6 15 154 3 169 10 47 16 117 5 33 6 40 8 164 0 34 11 13 9 108 7 101 13 149... |
100 | 50 | J0:
M7:37 M29:78 M20:18 M27:91 M17:36 M30:78 M46:35 M18:86 M24:8 M40:72 M0:83 M4:5 M33:38 M37:99 M41:47 M32:84 M2:71 M5:37 M36:19 M44:65 M48:10 M28:56 M13:32 M23:26 M42:47 M39:34 M25:19 M10:77 M11:27 M45:44 M3:53 M1:88 M16:42 M19:76 M14:63 M43:18 M31:93 M35:33 M15:29 M26:38 M49:31 M8:31 M12:83 M34:28 M21:22 M38:22 M6:3... | Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespan. The makespan is the completion time of the last operation in the schedule. Each M can process only one J at a time, and once started, J cannot be interrupted.
| M0:
J73: 30 J75: 39 J80: 77 J99: 71 J52: 65 J18: 40 J28: 28 J79: 71 J6: 16 J70: 6 J93: 49 J32: 77 J42: 46 J51: 11 J55: 61 J64: 91 J27: 75 J39: 91 J94: 17 J16: 66 J68: 66 J26: 83 J76: 47 J10: 40 J0: 83 J72: 25 J19: 73 J40: 10 J46: 61 J56: 65 J5: 81 J45: 34 J12: 5 J41: 23 J58: 36 J82: 80 J88: 40 J90: 38 J33: 84 J78: 25 J... | J0:
M7:37 M29:78 M20:18 M27:91 M17:36 M30:78 M46:35 M18:86 M24:8 M40:72 M0:83 M4:5 M33:38 M37:99 M41:47 M32:84 M2:71 M5:37 M36:19 M44:65 M48:10 M28:56 M13:32 M23:26 M42:47 M39:34 M25:19 M10:77 M11:27 M45:44 M3:53 M1:88 M16:42 M19:76 M14:63 M43:18 M31:93 M35:33 M15:29 M26:38 M49:31 M8:31 M12:83 M34:28 M21:22 M38:22 M6:3... | Solution:
J73-M0: 0+30 -> 30,J32-M1: 0+24 -> 24,J65-M3: 0+12 -> 12,J13-M4: 0+70 -> 70,J6-M5: 0+59 -> 59,J78-M6: 0+26 -> 26,J3-M7: 0+21 -> 21,J89-M9: 0+27 -> 27,J72-M10: 0+22 -> 22,J17-M11: 0+55 -> 55,J84-M12: 0+16 -> 16,J48-M13: 0+65 -> 65,J42-M14: 0+78 -> 78,J33-M15: 0+10 -> 10,J38-M16: 0+67 -> 67,J46-M17: 0+70 -> 70,... | 100x50_1519.jsp | 100 50
7 37 29 78 20 18 27 91 17 36 30 78 46 35 18 86 24 8 40 72 0 83 4 5 33 38 37 99 41 47 32 84 2 71 5 37 36 19 44 65 48 10 28 56 13 32 23 26 42 47 39 34 25 19 10 77 11 27 45 44 3 53 1 88 16 42 19 76 14 63 43 18 31 93 35 33 15 29 26 38 49 31 8 31 12 83 34 28 21 22 38 22 6 32 22 62 9 45 47 49
37 43 11 88 4 95 17 100 4... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.