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 ⌀ |
|---|---|---|---|---|---|---|---|---|
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 2 d... | null | 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... | null | Solution:
Job 2 Operation 0 on Machine 0 : 0 + 110 -> 110
Job 0 Operation 0 on Machine 2 : 0 + 75 -> 75
Job 1 Operation 0 on Machine 3 : 0 + 103 -> 103
Job 3 Operation 0 on Machine 2 : 75 + 92 -> 167
Job 1 Operation 1 on Machine 1 : 103 + 110 -> 213
Job 0 Operation 1 on Machine 0 : 110 + 84 -> 194
Job 3 O... | null | |
5 | 5 | Optimize schedule for 5 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 2 d... | null | Optimize schedule for 5 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 2 Operation 1 dura... | null | Solution:
Job 3 Operation 0 on Machine 1 : 0 + 277 -> 277
Job 0 Operation 0 on Machine 2 : 0 + 7 -> 7
Job 4 Operation 0 on Machine 3 : 0 + 188 -> 188
Job 2 Operation 0 on Machine 4 : 0 + 41 -> 41
Job 2 Operation 1 on Machine 0 : 41 + 173 -> 214
Job 1 Operation 0 on Machine 4 : 41 + 323 -> 364
Job 2 Operat... | null | |
4 | 3 | Optimize schedule for 4 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 1 d... | null | Optimize schedule for 4 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... | null | Solution:
Job 3 Operation 0 on Machine 0 : 0 + 46 -> 46
Job 0 Operation 0 on Machine 1 : 0 + 166 -> 166
Job 2 Operation 0 on Machine 2 : 0 + 154 -> 154
Job 3 Operation 1 on Machine 2 : 154 + 61 -> 215
Job 0 Operation 1 on Machine 0 : 166 + 110 -> 276
Job 1 Operation 0 on Machine 1 : 166 + 272 -> 438
Job 0... | null | |
7 | 6 | Optimize schedule for 7 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 5 d... | null | Optimize schedule for 7 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 5 Operation 0 dura... | null | Solution:
Job 5 Operation 0 on Machine 0 : 0 + 16 -> 16
Job 2 Operation 0 on Machine 1 : 0 + 34 -> 34
Job 1 Operation 0 on Machine 2 : 0 + 34 -> 34
Job 3 Operation 0 on Machine 4 : 0 + 33 -> 33
Job 0 Operation 0 on Machine 5 : 0 + 34 -> 34
Job 5 Operation 1 on Machine 3 : 16 + 48 -> 64
Job 0 Operation 1 o... | null | |
15 | 15 | Optimize schedule for 15 Jobs across 15 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 9... | null | Optimize schedule for 15 Jobs across 15 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 du... | null | Solution:
Job 12 Operation 0 on Machine 0 : 0 + 356 -> 356
Job 13 Operation 0 on Machine 1 : 0 + 235 -> 235
Job 9 Operation 0 on Machine 2 : 0 + 406 -> 406
Job 5 Operation 0 on Machine 4 : 0 + 45 -> 45
Job 7 Operation 0 on Machine 5 : 0 + 122 -> 122
Job 6 Operation 0 on Machine 9 : 0 + 51 -> 51
Job 1 Oper... | null | |
4 | 3 | Optimize schedule for 4 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 d... | null | Optimize schedule for 4 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 dura... | null | Solution:
Job 2 Operation 0 on Machine 0 : 0 + 30 -> 30
Job 0 Operation 0 on Machine 0 : 30 + 340 -> 370
Job 2 Operation 1 on Machine 1 : 30 + 235 -> 265
Job 3 Operation 0 on Machine 1 : 265 + 383 -> 648
Job 2 Operation 2 on Machine 2 : 265 + 347 -> 612
Job 1 Operation 0 on Machine 0 : 370 + 351 -> 721
Jo... | null | |
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 1 d... | null | 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 1 Operation 2 dura... | null | Solution:
Job 1 Operation 0 on Machine 1 : 0 + 21 -> 21
Job 3 Operation 0 on Machine 3 : 0 + 91 -> 91
Job 0 Operation 0 on Machine 1 : 21 + 138 -> 159
Job 1 Operation 1 on Machine 3 : 91 + 137 -> 228
Job 3 Operation 1 on Machine 1 : 159 + 80 -> 239
Job 0 Operation 1 on Machine 2 : 159 + 88 -> 247
Job 1 Op... | null | |
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 2 d... | null | 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 0 Operation 2 dura... | null | Solution:
Job 3 Operation 0 on Machine 1 : 0 + 45 -> 45
Job 0 Operation 0 on Machine 2 : 0 + 292 -> 292
Job 5 Operation 0 on Machine 3 : 0 + 294 -> 294
Job 3 Operation 1 on Machine 4 : 45 + 256 -> 301
Job 5 Operation 1 on Machine 1 : 294 + 12 -> 306
Job 3 Operation 2 on Machine 2 : 301 + 415 -> 716
Job 4 ... | null | |
2 | 2 | Optimize schedule for 2 Jobs across 2 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 d... | null | Optimize schedule for 2 Jobs across 2 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 dura... | null | Solution:
Job 0 Operation 0 on Machine 0 : 0 + 356 -> 356
Job 1 Operation 0 on Machine 1 : 0 + 331 -> 331
Job 1 Operation 1 on Machine 0 : 356 + 322 -> 678
Job 0 Operation 1 on Machine 1 : 356 + 254 -> 610
Makespan: 678.0, as it is the maximum end completion time of Operation 1 | null | |
7 | 2 | Optimize schedule for 7 Jobs across 2 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 d... | null | Optimize schedule for 7 Jobs across 2 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 dura... | null | Solution:
Job 6 Operation 0 on Machine 0 : 0 + 39 -> 39
Job 3 Operation 0 on Machine 0 : 39 + 234 -> 273
Job 6 Operation 1 on Machine 1 : 39 + 94 -> 133
Job 2 Operation 0 on Machine 0 : 273 + 313 -> 586
Job 3 Operation 1 on Machine 1 : 273 + 123 -> 396
Job 5 Operation 0 on Machine 1 : 396 + 280 -> 676
Job... | null | |
20 | 15 | Optimize schedule for 20 Jobs across 15 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... | null | Optimize schedule for 20 Jobs across 15 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 du... | null | Solution:
Job 5 Operation 0 on Machine 0 : 0 + 89 -> 89
Job 9 Operation 0 on Machine 1 : 0 + 51 -> 51
Job 8 Operation 0 on Machine 2 : 0 + 7 -> 7
Job 0 Operation 0 on Machine 3 : 0 + 137 -> 137
Job 4 Operation 0 on Machine 4 : 0 + 53 -> 53
Job 6 Operation 0 on Machine 6 : 0 + 178 -> 178
Job 7 Operation 0 ... | null | |
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 1 d... | null | 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 1 Operation 1 dura... | null | Solution:
Job 0 Operation 0 on Machine 1 : 0 + 121 -> 121
Job 5 Operation 0 on Machine 3 : 0 + 304 -> 304
Job 1 Operation 0 on Machine 4 : 0 + 41 -> 41
Job 1 Operation 1 on Machine 0 : 41 + 278 -> 319
Job 3 Operation 0 on Machine 4 : 41 + 236 -> 277
Job 0 Operation 1 on Machine 2 : 121 + 52 -> 173
Job 5 O... | null | |
3 | 2 | Optimize schedule for 3 Jobs across 2 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 d... | null | Optimize schedule for 3 Jobs across 2 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 dura... | null | Solution:
Job 0 Operation 0 on Machine 0 : 0 + 198 -> 198
Job 2 Operation 0 on Machine 1 : 0 + 3 -> 3
Job 1 Operation 0 on Machine 0 : 198 + 277 -> 475
Job 0 Operation 1 on Machine 1 : 198 + 274 -> 472
Job 2 Operation 1 on Machine 0 : 475 + 178 -> 653
Job 1 Operation 1 on Machine 1 : 475 + 278 -> 753
Make... | null | |
5 | 4 | Optimize schedule for 5 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 2 d... | null | Optimize schedule for 5 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 4 Operation 0 dura... | null | Solution:
Job 4 Operation 0 on Machine 0 : 0 + 249 -> 249
Job 2 Operation 0 on Machine 1 : 0 + 198 -> 198
Job 0 Operation 0 on Machine 2 : 0 + 142 -> 142
Job 1 Operation 0 on Machine 2 : 142 + 138 -> 280
Job 0 Operation 1 on Machine 3 : 142 + 47 -> 189
Job 0 Operation 2 on Machine 0 : 249 + 166 -> 415
Job... | null | |
9 | 3 | Optimize schedule for 9 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... | null | Optimize schedule for 9 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 5 Operation 0 dura... | null | Solution:
Job 7 Operation 0 on Machine 0 : 0 + 213 -> 213
Job 0 Operation 0 on Machine 2 : 0 + 67 -> 67
Job 0 Operation 1 on Machine 1 : 67 + 12 -> 79
Job 3 Operation 0 on Machine 2 : 67 + 118 -> 185
Job 4 Operation 0 on Machine 1 : 79 + 220 -> 299
Job 5 Operation 0 on Machine 0 : 213 + 105 -> 318
Job 7 O... | null | |
4 | 2 | Optimize schedule for 4 Jobs across 2 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 d... | null | Optimize schedule for 4 Jobs across 2 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 dura... | null | Solution:
Job 1 Operation 0 on Machine 0 : 0 + 95 -> 95
Job 3 Operation 0 on Machine 0 : 95 + 116 -> 211
Job 1 Operation 1 on Machine 1 : 95 + 122 -> 217
Job 0 Operation 0 on Machine 0 : 211 + 137 -> 348
Job 3 Operation 1 on Machine 1 : 217 + 94 -> 311
Job 2 Operation 0 on Machine 0 : 348 + 111 -> 459
Job... | null | |
8 | 2 | Optimize schedule for 8 Jobs across 2 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... | null | Optimize schedule for 8 Jobs across 2 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... | null | Solution:
Job 3 Operation 0 on Machine 0 : 0 + 205 -> 205
Job 7 Operation 0 on Machine 1 : 0 + 16 -> 16
Job 1 Operation 0 on Machine 1 : 16 + 345 -> 361
Job 7 Operation 1 on Machine 0 : 205 + 29 -> 234
Job 6 Operation 0 on Machine 0 : 234 + 45 -> 279
Job 1 Operation 1 on Machine 0 : 361 + 74 -> 435
Job 2 ... | null | |
10 | 9 | Optimize schedule for 10 Jobs across 9 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 8 ... | null | Optimize schedule for 10 Jobs across 9 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 8 Operation 0 dur... | null | Solution:
Job 8 Operation 0 on Machine 0 : 0 + 28 -> 28
Job 5 Operation 0 on Machine 3 : 0 + 228 -> 228
Job 7 Operation 0 on Machine 4 : 0 + 228 -> 228
Job 3 Operation 0 on Machine 7 : 0 + 69 -> 69
Job 1 Operation 0 on Machine 8 : 0 + 58 -> 58
Job 8 Operation 1 on Machine 5 : 28 + 5 -> 33
Job 6 Operation ... | null | |
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 1 d... | null | 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 1 Operation 0 dura... | null | Solution:
Job 1 Operation 0 on Machine 0 : 0 + 127 -> 127
Job 3 Operation 0 on Machine 1 : 0 + 12 -> 12
Job 0 Operation 0 on Machine 1 : 12 + 118 -> 130
Job 3 Operation 1 on Machine 2 : 12 + 385 -> 397
Job 5 Operation 0 on Machine 0 : 127 + 359 -> 486
Job 2 Operation 0 on Machine 1 : 130 + 308 -> 438
Job ... | null | |
7 | 2 | Optimize schedule for 7 Jobs across 2 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 d... | null | Optimize schedule for 7 Jobs across 2 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 dura... | null | Solution:
Job 4 Operation 0 on Machine 0 : 0 + 31 -> 31
Job 6 Operation 0 on Machine 1 : 0 + 1 -> 1
Job 2 Operation 0 on Machine 1 : 1 + 176 -> 177
Job 1 Operation 0 on Machine 0 : 31 + 51 -> 82
Job 0 Operation 0 on Machine 0 : 82 + 71 -> 153
Job 5 Operation 0 on Machine 0 : 153 + 149 -> 302
Job 1 Operati... | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.