num_jobs int64 2 100 | num_machines int64 2 50 | prompt_jobs_first stringlengths 516 37.9k | instruction stringclasses 60
values | prompt_machines_first stringlengths 496 43.1k | input stringlengths 27 37.9k | output stringlengths 267 131k | path stringlengths 0 15 | matrix stringlengths 19 56.2k | size stringclasses 60
values | __index_level_0__ int64 0 130k |
|---|---|---|---|---|---|---|---|---|---|---|
6 | 6 | Optimize schedule for 6 Jobs across 6 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 1 d... | Optimize schedule for 6 Jobs (denoted as J) across 6 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. | Optimize schedule for 6 Jobs across 6 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 1 Operation 0 dura... | J0: M1:13 M5:119 M4:310 M2:39 M3:294 M0:145
J1: M0:56 M4:105 M2:270 M3:278 M5:165 M1:253
J2: M5:138 M1:45 M3:43 M0:264 M4:194 M2:313
J3: M3:40 M1:113 M5:176 M4:120 M2:63 M0:200
J4: M1:268 M0:268 M5:174 M2:302 M4:229 M3:218
J5: M4:190 M3:122 M1:34 M0:62 M5:188 M2:41 | Solution:
Job 1 Operation 0 on Machine 0 : 0 + 56 -> 56
Job 0 Operation 0 on Machine 1 : 0 + 13 -> 13
Job 3 Operation 0 on Machine 3 : 0 + 40 -> 40
Job 5 Operation 0 on Machine 4 : 0 + 190 -> 190
Job 2 Operation 0 on Machine 5 : 0 + 138 -> 138
Job 4 Operation 0 on Machine 1 : 13 + 268 -> 281
Job 0 Operati... | 6 6
1 13 5 119 4 310 2 39 3 294 0 145
0 56 4 105 2 270 3 278 5 165 1 253
5 138 1 45 3 43 0 264 4 194 2 313
3 40 1 113 5 176 4 120 2 63 0 200
1 268 0 268 5 174 2 302 4 229 3 218
4 190 3 122 1 34 0 62 5 188 2 41 | 6x6 | 64,801 | |
4 | 4 | Optimize schedule for 4 Jobs across 4 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 3 d... | Optimize schedule for 4 Jobs (denoted as J) across 4 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. | Optimize schedule for 4 Jobs across 4 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 2 Operation 0 dura... | J0: M3:108 M1:47 M0:77 M2:138
J1: M3:1 M1:14 M2:47 M0:136
J2: M0:78 M1:147 M3:28 M2:35
J3: M1:37 M3:149 M2:67 M0:108 | Solution:
Job 2 Operation 0 on Machine 0 : 0 + 78 -> 78
Job 3 Operation 0 on Machine 1 : 0 + 37 -> 37
Job 1 Operation 0 on Machine 3 : 0 + 1 -> 1
Job 0 Operation 0 on Machine 3 : 1 + 108 -> 109
Job 1 Operation 1 on Machine 1 : 37 + 14 -> 51
Job 1 Operation 2 on Machine 2 : 51 + 47 -> 98
Job 2 Operation 1 ... | 4 4
3 108 1 47 0 77 2 138
3 1 1 14 2 47 0 136
0 78 1 147 3 28 2 35
1 37 3 149 2 67 0 108 | 4x4 | 107,779 | |
6 | 3 | Optimize schedule for 6 Jobs across 3 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 2 d... | Optimize schedule for 6 Jobs (denoted as J) across 3 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. | Optimize schedule for 6 Jobs across 3 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 3 Operation 0 dura... | J0: M2:126 M1:57 M0:11
J1: M1:7 M2:81 M0:27
J2: M1:151 M0:41 M2:92
J3: M0:9 M1:153 M2:156
J4: M1:4 M0:9 M2:89
J5: M2:119 M0:159 M1:175 | Solution:
Job 3 Operation 0 on Machine 0 : 0 + 9 -> 9
Job 4 Operation 0 on Machine 1 : 0 + 4 -> 4
Job 5 Operation 0 on Machine 2 : 0 + 119 -> 119
Job 1 Operation 0 on Machine 1 : 4 + 7 -> 11
Job 4 Operation 1 on Machine 0 : 9 + 9 -> 18
Job 2 Operation 0 on Machine 1 : 11 + 151 -> 162
Job 5 Operation 1 on ... | 6 3
2 126 1 57 0 11
1 7 2 81 0 27
1 151 0 41 2 92
0 9 1 153 2 156
1 4 0 9 2 89
2 119 0 159 1 175 | 6x3 | 13,114 | |
10 | 8 | Optimize schedule for 10 Jobs across 8 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 1 ... | Optimize schedule for 10 Jobs (denoted as J) across 8 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. | Optimize schedule for 10 Jobs across 8 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 1 Operation 0 dur... | J0: M1:79 M0:91 M6:75 M5:189 M2:205 M7:76 M3:106 M4:184
J1: M0:133 M7:137 M5:14 M2:22 M3:82 M4:158 M6:90 M1:70
J2: M0:124 M5:125 M7:41 M1:126 M6:119 M2:33 M4:77 M3:61
J3: M1:126 M4:117 M7:114 M5:65 M2:26 M6:141 M3:31 M0:29
J4: M4:44 M3:192 M2:44 M0:60 M5:204 M6:32 M7:172 M1:135
J5: M4:194 M7:202 M6:100 M0:24 M5:39 M2:1... | Solution:
Job 2 Operation 0 on Machine 0 : 0 + 124 -> 124
Job 6 Operation 0 on Machine 1 : 0 + 173 -> 173
Job 4 Operation 0 on Machine 4 : 0 + 44 -> 44
Job 4 Operation 1 on Machine 3 : 44 + 192 -> 236
Job 8 Operation 0 on Machine 4 : 44 + 203 -> 247
Job 1 Operation 0 on Machine 0 : 124 + 133 -> 257
Job 2 ... | 10 8
1 79 0 91 6 75 5 189 2 205 7 76 3 106 4 184
0 133 7 137 5 14 2 22 3 82 4 158 6 90 1 70
0 124 5 125 7 41 1 126 6 119 2 33 4 77 3 61
1 126 4 117 7 114 5 65 2 26 6 141 3 31 0 29
4 44 3 192 2 44 0 60 5 204 6 32 7 172 1 135
4 194 7 202 6 100 0 24 5 39 2 188 3 201 1 38
1 173 5 163 2 162 0 128 6 118 3 118 4 124 7 106
4 1... | 10x8 | 46,544 | |
7 | 5 | Optimize schedule for 7 Jobs across 5 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 3 d... | Optimize schedule for 7 Jobs (denoted as J) across 5 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. | Optimize schedule for 7 Jobs across 5 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 5 Operation 0 dura... | J0: M3:190 M2:29 M4:409 M0:169 M1:119
J1: M4:223 M2:368 M0:308 M1:286 M3:250
J2: M2:251 M0:55 M3:330 M1:202 M4:349
J3: M2:64 M4:25 M3:253 M0:296 M1:276
J4: M4:220 M0:283 M2:78 M3:298 M1:121
J5: M0:149 M2:141 M4:280 M3:145 M1:114
J6: M4:7 M1:133 M2:441 M0:218 M3:434 | Solution:
Job 5 Operation 0 on Machine 0 : 0 + 149 -> 149
Job 3 Operation 0 on Machine 2 : 0 + 64 -> 64
Job 0 Operation 0 on Machine 3 : 0 + 190 -> 190
Job 1 Operation 0 on Machine 4 : 0 + 223 -> 223
Job 2 Operation 0 on Machine 2 : 64 + 251 -> 315
Job 3 Operation 1 on Machine 4 : 223 + 25 -> 248
Job 3 Op... | 7 5
3 190 2 29 4 409 0 169 1 119
4 223 2 368 0 308 1 286 3 250
2 251 0 55 3 330 1 202 4 349
2 64 4 25 3 253 0 296 1 276
4 220 0 283 2 78 3 298 1 121
0 149 2 141 4 280 3 145 1 114
4 7 1 133 2 441 0 218 3 434 | 7x5 | 80,620 | |
15 | 10 | Optimize schedule for 15 Jobs across 10 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 1... | Optimize schedule for 15 Jobs (denoted as J) across 10 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. | Optimize schedule for 15 Jobs across 10 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 9 Operation 1 du... | J0: M1:348 M5:110 M8:57 M7:155 M9:250 M3:98 M0:34 M6:90 M4:163 M2:450
J1: M5:170 M4:400 M1:229 M3:140 M0:331 M7:233 M8:321 M6:252 M9:313 M2:221
J2: M4:426 M1:352 M0:15 M7:115 M6:269 M5:153 M3:33 M2:189 M8:103 M9:37
J3: M8:79 M1:443 M6:30 M0:323 M9:45 M5:301 M2:376 M4:168 M7:108 M3:394
J4: M3:451 M8:434 M0:265 M6:84 M9:... | Solution:
Job 13 Operation 0 on Machine 1 : 0 + 109 -> 109
Job 4 Operation 0 on Machine 3 : 0 + 451 -> 451
Job 5 Operation 0 on Machine 4 : 0 + 46 -> 46
Job 1 Operation 0 on Machine 5 : 0 + 170 -> 170
Job 9 Operation 0 on Machine 6 : 0 + 47 -> 47
Job 3 Operation 0 on Machine 8 : 0 + 79 -> 79
Job 11 Operat... | 15 10
1 348 5 110 8 57 7 155 9 250 3 98 0 34 6 90 4 163 2 450
5 170 4 400 1 229 3 140 0 331 7 233 8 321 6 252 9 313 2 221
4 426 1 352 0 15 7 115 6 269 5 153 3 33 2 189 8 103 9 37
8 79 1 443 6 30 0 323 9 45 5 301 2 376 4 168 7 108 3 394
3 451 8 434 0 265 6 84 9 152 2 26 1 94 5 223 7 196 4 338
4 46 7 201 3 279 1 354 6 44... | 15x10 | 35,252 | |
10 | 7 | Optimize schedule for 10 Jobs across 7 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 2 ... | Optimize schedule for 10 Jobs (denoted as J) across 7 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. | Optimize schedule for 10 Jobs across 7 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 2 Operation 0 dur... | J0: M2:14 M3:29 M6:105 M1:82 M4:67 M5:36 M0:245
J1: M1:219 M5:204 M0:228 M2:212 M6:85 M4:131 M3:35
J2: M0:161 M2:159 M3:103 M6:176 M5:235 M1:99 M4:99
J3: M2:243 M1:231 M4:260 M3:57 M5:35 M6:188 M0:68
J4: M5:266 M4:47 M0:272 M1:117 M3:48 M2:169 M6:111
J5: M0:250 M3:167 M4:238 M2:126 M1:142 M6:195 M5:228
J6: M2:65 M0:209... | Solution:
Job 2 Operation 0 on Machine 0 : 0 + 161 -> 161
Job 0 Operation 0 on Machine 2 : 0 + 14 -> 14
Job 7 Operation 0 on Machine 4 : 0 + 258 -> 258
Job 8 Operation 0 on Machine 5 : 0 + 22 -> 22
Job 9 Operation 0 on Machine 6 : 0 + 50 -> 50
Job 0 Operation 1 on Machine 3 : 14 + 29 -> 43
Job 8 Operation... | 10 7
2 14 3 29 6 105 1 82 4 67 5 36 0 245
1 219 5 204 0 228 2 212 6 85 4 131 3 35
0 161 2 159 3 103 6 176 5 235 1 99 4 99
2 243 1 231 4 260 3 57 5 35 6 188 0 68
5 266 4 47 0 272 1 117 3 48 2 169 6 111
0 250 3 167 4 238 2 126 1 142 6 195 5 228
2 65 0 209 4 258 5 191 1 177 6 212 3 194
4 258 2 206 5 174 6 60 3 266 0 70 1 ... | 10x7 | 48,645 | |
15 | 10 | Optimize schedule for 15 Jobs across 10 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 3... | Optimize schedule for 15 Jobs (denoted as J) across 10 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. | Optimize schedule for 15 Jobs across 10 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 11 Operation 1 d... | J0: M3:134 M5:4 M6:69 M2:161 M1:27 M7:46 M8:33 M0:215 M9:284 M4:180
J1: M3:258 M1:229 M7:39 M6:200 M4:280 M9:4 M0:295 M2:65 M5:177 M8:216
J2: M6:4 M9:146 M8:195 M2:90 M3:112 M1:188 M4:253 M0:52 M5:22 M7:150
J3: M6:242 M3:314 M9:276 M0:12 M7:12 M5:279 M4:262 M8:213 M2:307 M1:329
J4: M8:315 M2:159 M0:277 M7:161 M6:63 M3:... | Solution:
Job 1 Operation 0 on Machine 3 : 0 + 258 -> 258
Job 6 Operation 0 on Machine 4 : 0 + 97 -> 97
Job 2 Operation 0 on Machine 6 : 0 + 4 -> 4
Job 12 Operation 0 on Machine 7 : 0 + 149 -> 149
Job 4 Operation 0 on Machine 8 : 0 + 315 -> 315
Job 14 Operation 0 on Machine 9 : 0 + 84 -> 84
Job 3 Operatio... | 15 10
3 134 5 4 6 69 2 161 1 27 7 46 8 33 0 215 9 284 4 180
3 258 1 229 7 39 6 200 4 280 9 4 0 295 2 65 5 177 8 216
6 4 9 146 8 195 2 90 3 112 1 188 4 253 0 52 5 22 7 150
6 242 3 314 9 276 0 12 7 12 5 279 4 262 8 213 2 307 1 329
8 315 2 159 0 277 7 161 6 63 3 148 5 253 4 303 1 260 9 351
9 305 5 214 3 174 6 340 0 167 8 ... | 15x10 | 98,002 | |
6 | 5 | Optimize schedule for 6 Jobs across 5 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 3 d... | Optimize schedule for 6 Jobs (denoted as J) across 5 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. | Optimize schedule for 6 Jobs across 5 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 1 Operation 1 dura... | J0: M3:10 M1:18 M2:6 M4:1 M0:11
J1: M3:2 M0:6 M4:3 M1:1 M2:16
J2: M1:2 M0:11 M3:6 M2:1 M4:8
J3: M4:16 M3:13 M2:1 M0:9 M1:20
J4: M1:2 M0:5 M2:16 M4:7 M3:15
J5: M2:6 M1:12 M0:5 M4:8 M3:1 | Solution:
Job 2 Operation 0 on Machine 1 : 0 + 2 -> 2
Job 5 Operation 0 on Machine 2 : 0 + 6 -> 6
Job 1 Operation 0 on Machine 3 : 0 + 2 -> 2
Job 3 Operation 0 on Machine 4 : 0 + 16 -> 16
Job 1 Operation 1 on Machine 0 : 2 + 6 -> 8
Job 4 Operation 0 on Machine 1 : 2 + 2 -> 4
Job 0 Operation 0 on Machine 3... | 6 5
3 10 1 18 2 6 4 1 0 11
3 2 0 6 4 3 1 1 2 16
1 2 0 11 3 6 2 1 4 8
4 16 3 13 2 1 0 9 1 20
1 2 0 5 2 16 4 7 3 15
2 6 1 12 0 5 4 8 3 1 | 6x5 | 54,339 | |
10 | 3 | Optimize schedule for 10 Jobs across 3 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Job 0 consists of the following Operations:
Operation 0 on Machine 0 ... | Optimize schedule for 10 Jobs (denoted as J) across 3 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. | Optimize schedule for 10 Jobs across 3 Machines to minimize makespan. Each job involves a series of Operations needing specific machines and times. Operations are processed in order, without interruption, on a single Machine at a time.
Problem:
Machine 0 is used for the following Operations:
Job 0 Operation 0 dur... | J0: M0:237 M1:324 M2:325
J1: M2:185 M1:257 M0:3
J2: M2:253 M0:97 M1:211
J3: M2:282 M1:205 M0:185
J4: M1:346 M0:217 M2:261
J5: M2:263 M0:229 M1:189
J6: M2:189 M0:292 M1:310
J7: M1:264 M2:73 M0:294
J8: M2:271 M1:169 M0:369
J9: M1:248 M0:3 M2:61 | Solution:
Job 0 Operation 0 on Machine 0 : 0 + 237 -> 237
Job 4 Operation 0 on Machine 1 : 0 + 346 -> 346
Job 1 Operation 0 on Machine 2 : 0 + 185 -> 185
Job 8 Operation 0 on Machine 2 : 185 + 271 -> 456
Job 4 Operation 1 on Machine 0 : 346 + 217 -> 563
Job 7 Operation 0 on Machine 1 : 346 + 264 -> 610
Jo... | 10 3
0 237 1 324 2 325
2 185 1 257 0 3
2 253 0 97 1 211
2 282 1 205 0 185
1 346 0 217 2 261
2 263 0 229 1 189
2 189 0 292 1 310
1 264 2 73 0 294
2 271 1 169 0 369
1 248 0 3 2 61 | 10x3 | 39,790 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 34