Dataset Viewer
Auto-converted to Parquet Duplicate
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:\nM13: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(...TRUNCATED)
"Optimize schedule for 50 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ4: 83 J5: 107 J11: 148 J44: 173 J49: 78 J20: 133 J6: 186 J22: 98 J48: 86 J2: 28 J18: 147 J29:(...TRUNCATED)
"J0:\nM13: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(...TRUNCATED)
"Solution:\nJ49-M0: 0+78 -> 78,J31-M1: 0+25 -> 25,J13-M2: 0+32 -> 32,J6-M3: 0+118 -> 118,J14-M4: 0+1(...TRUNCATED)
50x20_564.jsp
"50 20\n13 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(...TRUNCATED)
30
15
"J0:\nM0: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 (...TRUNCATED)
"Optimize schedule for 30 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ0: 159 J7: 68 J14: 191 J17: 132 J2: 134 J12: 101 J19: 6 J28: 72 J18: 25 J10: 128 J22: 58 J23:(...TRUNCATED)
"J0:\nM0: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 (...TRUNCATED)
"Solution:\nJ7-M0: 0+68 -> 68,J9-M2: 0+68 -> 68,J15-M3: 0+139 -> 139,J28-M4: 0+136 -> 136,J17-M5: 0+(...TRUNCATED)
30x15_231.jsp
"30 15\n0 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\n4 13(...TRUNCATED)
40
15
"J0:\nM8: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 \nJ(...TRUNCATED)
"Optimize schedule for 40 Jobs (denoted as J) across 15 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ2: 34 J5: 28 J32: 5 J38: 27 J9: 15 J16: 13 J22: 25 J24: 31 J13: 15 J20: 18 J11: 33 J31: 36 J3(...TRUNCATED)
"J0:\nM8: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 \nJ(...TRUNCATED)
"Solution:\nJ32-M0: 0+5 -> 5,J15-M1: 0+18 -> 18,J28-M3: 0+16 -> 16,J9-M4: 0+23 -> 23,J39-M5: 0+5 -> (...TRUNCATED)
40x15_792.jsp
"40 15\n8 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\n13 5 6 6 8 19 9(...TRUNCATED)
40
40
"J0:\nM22: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(...TRUNCATED)
"Optimize schedule for 40 Jobs (denoted as J) across 40 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ32: 75 J10: 22 J0: 55 J24: 32 J7: 61 J5: 96 J11: 80 J26: 8 J21: 95 J19: 96 J20: 79 J23: 8 J31(...TRUNCATED)
"J0:\nM22: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(...TRUNCATED)
"Solution:\nJ38-M3: 0+13 -> 13,J18-M4: 0+14 -> 14,J27-M7: 0+83 -> 83,J35-M10: 0+11 -> 11,J25-M12: 0+(...TRUNCATED)
40x40_1508.jsp
"40 40\n22 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 (...TRUNCATED)
30
30
"J0:\nM0: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:(...TRUNCATED)
"Optimize schedule for 30 Jobs (denoted as J) across 30 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ0: 69 J29: 93 J15: 92 J9: 77 J25: 29 J3: 74 J19: 67 J5: 73 J7: 92 J17: 37 J20: 92 J27: 82 J28(...TRUNCATED)
"J0:\nM0: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:(...TRUNCATED)
"Solution:\nJ0-M0: 0+69 -> 69,J4-M6: 0+52 -> 52,J16-M7: 0+11 -> 11,J27-M10: 0+90 -> 90,J18-M11: 0+56(...TRUNCATED)
30x30_2385.jsp
"30 30\n0 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 9(...TRUNCATED)
100
50
"J0:\nM31: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 (...TRUNCATED)
"Optimize schedule for 100 Jobs (denoted as J) across 50 Machines (denoted as M) to minimize makespa(...TRUNCATED)
"M0:\nJ58: 82 J28: 57 J31: 85 J49: 19 J70: 81 J65: 8 J11: 97 J19: 29 J27: 30 J33: 77 J2: 60 J42: 43 (...TRUNCATED)
"J0:\nM31: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 (...TRUNCATED)
"Solution:\nJ58-M0: 0+82 -> 82,J36-M1: 0+18 -> 18,J10-M2: 0+19 -> 19,J61-M3: 0+44 -> 44,J62-M4: 0+63(...TRUNCATED)
100x50_81.jsp
"100 50\n31 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(...TRUNCATED)
40
20
"J0:\nM3: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(...TRUNCATED)
"Optimize schedule for 40 Jobs (denoted as J) across 20 Machines (denoted as M) to minimize makespan(...TRUNCATED)
"M0:\nJ3: 205 J32: 27 J14: 247 J25: 215 J4: 186 J6: 230 J19: 209 J24: 150 J7: 150 J11: 53 J16: 130 J(...TRUNCATED)
"J0:\nM3: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(...TRUNCATED)
"Solution:\nJ32-M0: 0+27 -> 27,J34-M1: 0+29 -> 29,J20-M2: 0+8 -> 8,J26-M3: 0+102 -> 102,J39-M4: 0+85(...TRUNCATED)
40x20_569.jsp
"40 20\n3 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(...TRUNCATED)
End of preview. Expand in Data Studio

No dataset card yet

Downloads last month
24