Datasets:

roxi88
/

JSSP_LLM

num_jobs int64 2 20	num_machines int64 2 20	prompt_machines_first stringlengths 496 17.2k	output stringlengths 267 22.1k
10	6	Optimize schedule for 10 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 4 Operation 0 dur...	Solution: Job 4 Operation 0 on Machine 0 : 0 + 1 -> 1 Job 6 Operation 0 on Machine 1 : 0 + 25 -> 25 Job 0 Operation 0 on Machine 2 : 0 + 10 -> 10 Job 1 Operation 0 on Machine 5 : 0 + 24 -> 24 Job 0 Operation 1 on Machine 4 : 10 + 17 -> 27 Job 5 Operation 0 on Machine 1 : 25 + 39 -> 64 Job 6 Operation 1 on...
6	4	Optimize schedule for 6 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 0 Operation 0 dura...	Solution: Job 0 Operation 0 on Machine 0 : 0 + 122 -> 122 Job 1 Operation 0 on Machine 1 : 0 + 110 -> 110 Job 4 Operation 0 on Machine 2 : 0 + 149 -> 149 Job 2 Operation 0 on Machine 3 : 0 + 130 -> 130 Job 0 Operation 1 on Machine 1 : 122 + 59 -> 181 Job 1 Operation 1 on Machine 3 : 130 + 56 -> 186 Job 3 ...
8	5	Optimize schedule for 8 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 0 dura...	Solution: Job 1 Operation 0 on Machine 0 : 0 + 339 -> 339 Job 6 Operation 0 on Machine 1 : 0 + 92 -> 92 Job 4 Operation 0 on Machine 2 : 0 + 28 -> 28 Job 2 Operation 0 on Machine 4 : 0 + 144 -> 144 Job 4 Operation 1 on Machine 3 : 28 + 304 -> 332 Job 2 Operation 1 on Machine 1 : 144 + 446 -> 590 Job 0 Ope...
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: Machine 0 is used for the following Operations: Job 13 Operation 0 d...	Solution: Job 13 Operation 0 on Machine 0 : 0 + 283 -> 283 Job 9 Operation 0 on Machine 1 : 0 + 85 -> 85 Job 10 Operation 0 on Machine 3 : 0 + 113 -> 113 Job 7 Operation 0 on Machine 6 : 0 + 325 -> 325 Job 5 Operation 0 on Machine 8 : 0 + 105 -> 105 Job 0 Operation 0 on Machine 9 : 0 + 427 -> 427 Job 12 O...
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: Machine 0 is used for the following Operations: Job 9 Operation 0 dur...	Solution: Job 9 Operation 0 on Machine 0 : 0 + 193 -> 193 Job 2 Operation 0 on Machine 1 : 0 + 38 -> 38 Job 7 Operation 0 on Machine 2 : 0 + 10 -> 10 Job 8 Operation 0 on Machine 3 : 0 + 81 -> 81 Job 6 Operation 0 on Machine 8 : 0 + 213 -> 213 Job 4 Operation 0 on Machine 2 : 10 + 152 -> 162 Job 7 Operati...
8	4	Optimize schedule for 8 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 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 39 -> 39 Job 4 Operation 0 on Machine 1 : 0 + 171 -> 171 Job 2 Operation 0 on Machine 2 : 0 + 278 -> 278 Job 5 Operation 0 on Machine 3 : 0 + 199 -> 199 Job 1 Operation 0 on Machine 0 : 39 + 159 -> 198 Job 6 Operation 0 on Machine 0 : 198 + 244 -> 442 Job 1 O...
7	7	Optimize schedule for 7 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 0 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 5 -> 5 Job 6 Operation 0 on Machine 3 : 0 + 70 -> 70 Job 1 Operation 0 on Machine 0 : 5 + 61 -> 66 Job 2 Operation 1 on Machine 4 : 5 + 71 -> 76 Job 0 Operation 0 on Machine 0 : 66 + 35 -> 101 Job 1 Operation 1 on Machine 5 : 66 + 62 -> 128 Job 6 Operation 1 ...
3	3	Optimize schedule for 3 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 2 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 55 -> 55 Job 0 Operation 0 on Machine 1 : 0 + 422 -> 422 Job 1 Operation 0 on Machine 2 : 0 + 320 -> 320 Job 1 Operation 1 on Machine 0 : 320 + 182 -> 502 Job 2 Operation 1 on Machine 1 : 422 + 128 -> 550 Job 0 Operation 1 on Machine 2 : 422 + 314 -> 736 Job ...
6	2	Optimize schedule for 6 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 1 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 10 -> 10 Job 5 Operation 0 on Machine 1 : 0 + 151 -> 151 Job 1 Operation 0 on Machine 0 : 10 + 48 -> 58 Job 4 Operation 0 on Machine 0 : 58 + 101 -> 159 Job 1 Operation 1 on Machine 1 : 151 + 199 -> 350 Job 5 Operation 1 on Machine 0 : 159 + 166 -> 325 Job 3 ...
9	4	Optimize schedule for 9 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 0 Operation 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 1 -> 1 Job 2 Operation 0 on Machine 1 : 0 + 3 -> 3 Job 1 Operation 0 on Machine 3 : 0 + 4 -> 4 Job 5 Operation 0 on Machine 0 : 1 + 1 -> 2 Job 3 Operation 1 on Machine 2 : 1 + 2 -> 3 Job 0 Operation 0 on Machine 0 : 2 + 2 -> 4 Job 5 Operation 1 on Machine 1 :...
9	2	Optimize schedule for 9 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...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 15 -> 15 Job 8 Operation 0 on Machine 1 : 0 + 15 -> 15 Job 6 Operation 0 on Machine 0 : 15 + 170 -> 185 Job 3 Operation 1 on Machine 1 : 15 + 158 -> 173 Job 4 Operation 0 on Machine 0 : 185 + 146 -> 331 Job 6 Operation 1 on Machine 1 : 185 + 10 -> 195 Job 1 O...
6	4	Optimize schedule for 6 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 0 Operation 2 dura...	Solution: Job 0 Operation 0 on Machine 1 : 0 + 110 -> 110 Job 1 Operation 0 on Machine 3 : 0 + 173 -> 173 Job 3 Operation 0 on Machine 1 : 110 + 144 -> 254 Job 1 Operation 1 on Machine 2 : 173 + 340 -> 513 Job 0 Operation 1 on Machine 3 : 173 + 104 -> 277 Job 2 Operation 0 on Machine 1 : 254 + 399 -> 653 ...
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: Machine 0 is used for the following Operations: Job 4 Operation 0 dur...	Solution: Job 8 Operation 0 on Machine 0 : 0 + 285 -> 285 Job 1 Operation 0 on Machine 3 : 0 + 344 -> 344 Job 7 Operation 0 on Machine 4 : 0 + 349 -> 349 Job 6 Operation 0 on Machine 5 : 0 + 161 -> 161 Job 0 Operation 0 on Machine 6 : 0 + 128 -> 128 Job 2 Operation 0 on Machine 7 : 0 + 155 -> 155 Job 0 Op...
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: Machine 0 is used for the following Operations: Job 3 Operation 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 47 -> 47 Job 0 Operation 0 on Machine 2 : 0 + 15 -> 15 Job 1 Operation 0 on Machine 3 : 0 + 48 -> 48 Job 2 Operation 0 on Machine 2 : 15 + 77 -> 92 Job 0 Operation 1 on Machine 0 : 47 + 83 -> 130 Job 1 Operation 1 on Machine 1 : 48 + 38 -> 86 Job 3 Operation ...
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: Machine 0 is used for the following Operations: Job 1 Operation 1 dura...	Solution: Job 6 Operation 0 on Machine 1 : 0 + 12 -> 12 Job 1 Operation 0 on Machine 2 : 0 + 17 -> 17 Job 5 Operation 0 on Machine 3 : 0 + 96 -> 96 Job 0 Operation 0 on Machine 4 : 0 + 130 -> 130 Job 3 Operation 0 on Machine 1 : 12 + 112 -> 124 Job 1 Operation 1 on Machine 0 : 17 + 100 -> 117 Job 2 Operat...
7	4	Optimize schedule for 7 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...	Solution: Job 4 Operation 0 on Machine 0 : 0 + 27 -> 27 Job 1 Operation 0 on Machine 1 : 0 + 6 -> 6 Job 3 Operation 0 on Machine 2 : 0 + 27 -> 27 Job 6 Operation 0 on Machine 0 : 27 + 6 -> 33 Job 3 Operation 1 on Machine 1 : 27 + 29 -> 56 Job 1 Operation 1 on Machine 2 : 27 + 29 -> 56 Job 4 Operation 1 on...
9	9	Optimize schedule for 9 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 0 Operation 0 dura...	Solution: Job 0 Operation 0 on Machine 0 : 0 + 27 -> 27 Job 6 Operation 0 on Machine 1 : 0 + 226 -> 226 Job 5 Operation 0 on Machine 3 : 0 + 122 -> 122 Job 8 Operation 0 on Machine 4 : 0 + 214 -> 214 Job 2 Operation 0 on Machine 6 : 0 + 249 -> 249 Job 1 Operation 0 on Machine 7 : 0 + 194 -> 194 Job 7 Oper...
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: Machine 0 is used for the following Operations: Job 2 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 55 -> 55 Job 0 Operation 0 on Machine 1 : 0 + 197 -> 197 Job 1 Operation 0 on Machine 2 : 0 + 31 -> 31 Job 4 Operation 0 on Machine 0 : 55 + 321 -> 376 Job 2 Operation 1 on Machine 2 : 55 + 15 -> 70 Job 3 Operation 0 on Machine 2 : 70 + 287 -> 357 Job 2 Opera...
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: Machine 0 is used for the following Operations: Job 1 Operation 0 dur...	Solution: Job 8 Operation 0 on Machine 0 : 0 + 254 -> 254 Job 6 Operation 0 on Machine 1 : 0 + 59 -> 59 Job 4 Operation 0 on Machine 6 : 0 + 104 -> 104 Job 0 Operation 0 on Machine 1 : 59 + 189 -> 248 Job 6 Operation 1 on Machine 3 : 59 + 239 -> 298 Job 4 Operation 1 on Machine 5 : 104 + 51 -> 155 Job 4 O...
8	3	Optimize schedule for 8 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...	Solution: Job 3 Operation 0 on Machine 1 : 0 + 301 -> 301 Job 0 Operation 0 on Machine 2 : 0 + 47 -> 47 Job 0 Operation 1 on Machine 0 : 47 + 86 -> 133 Job 2 Operation 0 on Machine 2 : 47 + 222 -> 269 Job 6 Operation 0 on Machine 0 : 133 + 106 -> 239 Job 1 Operation 0 on Machine 0 : 239 + 270 -> 509 Job 6...
9	6	Optimize schedule for 9 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 3 Operation 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 17 -> 17 Job 1 Operation 0 on Machine 2 : 0 + 81 -> 81 Job 6 Operation 0 on Machine 4 : 0 + 429 -> 429 Job 8 Operation 0 on Machine 0 : 17 + 80 -> 97 Job 3 Operation 1 on Machine 3 : 17 + 123 -> 140 Job 0 Operation 0 on Machine 2 : 81 + 196 -> 277 Job 3 Opera...
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: Machine 0 is used for the following Operations: Job 0 Operation 0 dura...	Solution: Job 4 Operation 0 on Machine 0 : 0 + 19 -> 19 Job 6 Operation 0 on Machine 0 : 19 + 21 -> 40 Job 4 Operation 1 on Machine 1 : 19 + 90 -> 109 Job 0 Operation 0 on Machine 0 : 40 + 66 -> 106 Job 2 Operation 0 on Machine 0 : 106 + 77 -> 183 Job 6 Operation 1 on Machine 1 : 109 + 194 -> 303 Job 3 Op...
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: Machine 0 is used for the following Operations: Job 2 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 43 -> 43 Job 0 Operation 0 on Machine 2 : 0 + 446 -> 446 Job 4 Operation 0 on Machine 3 : 0 + 325 -> 325 Job 6 Operation 0 on Machine 4 : 0 + 14 -> 14 Job 5 Operation 0 on Machine 0 : 43 + 424 -> 467 Job 2 Operation 1 on Machine 4 : 43 + 76 -> 119 Job 4 Opera...
8	5	Optimize schedule for 8 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 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 73 -> 73 Job 1 Operation 0 on Machine 1 : 0 + 21 -> 21 Job 5 Operation 0 on Machine 4 : 0 + 103 -> 103 Job 0 Operation 0 on Machine 1 : 21 + 120 -> 141 Job 1 Operation 1 on Machine 2 : 21 + 72 -> 93 Job 2 Operation 1 on Machine 3 : 73 + 80 -> 153 Job 5 Operat...
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: Machine 0 is used for the following Operations: Job 0 Operation 0 dura...	Solution: Job 1 Operation 0 on Machine 0 : 0 + 30 -> 30 Job 4 Operation 0 on Machine 1 : 0 + 61 -> 61 Job 3 Operation 0 on Machine 0 : 30 + 52 -> 82 Job 0 Operation 0 on Machine 0 : 82 + 44 -> 126 Job 3 Operation 1 on Machine 1 : 82 + 20 -> 102 Job 1 Operation 1 on Machine 1 : 102 + 73 -> 175 Job 2 Operat...
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: Machine 0 is used for the following Operations: Job 6 Operation 0 dur...	Solution: Job 6 Operation 0 on Machine 0 : 0 + 88 -> 88 Job 7 Operation 0 on Machine 2 : 0 + 131 -> 131 Job 5 Operation 0 on Machine 3 : 0 + 315 -> 315 Job 9 Operation 0 on Machine 4 : 0 + 125 -> 125 Job 3 Operation 0 on Machine 5 : 0 + 9 -> 9 Job 1 Operation 0 on Machine 6 : 0 + 313 -> 313 Job 2 Operatio...
5	2	Optimize schedule for 5 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 1 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 251 -> 251 Job 4 Operation 0 on Machine 1 : 0 + 130 -> 130 Job 0 Operation 0 on Machine 1 : 130 + 438 -> 568 Job 4 Operation 1 on Machine 0 : 251 + 167 -> 418 Job 3 Operation 0 on Machine 0 : 418 + 265 -> 683 Job 2 Operation 1 on Machine 1 : 568 + 52 -> 620 J...
10	2	Optimize schedule for 10 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 dur...	Solution: Job 7 Operation 0 on Machine 0 : 0 + 6 -> 6 Job 6 Operation 0 on Machine 1 : 0 + 151 -> 151 Job 9 Operation 0 on Machine 0 : 6 + 55 -> 61 Job 0 Operation 0 on Machine 0 : 61 + 85 -> 146 Job 6 Operation 1 on Machine 0 : 151 + 155 -> 306 Job 0 Operation 1 on Machine 1 : 151 + 149 -> 300 Job 9 Oper...
5	3	Optimize schedule for 5 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...	Solution: Job 0 Operation 0 on Machine 0 : 0 + 153 -> 153 Job 2 Operation 0 on Machine 1 : 0 + 40 -> 40 Job 3 Operation 0 on Machine 2 : 0 + 62 -> 62 Job 4 Operation 0 on Machine 1 : 40 + 122 -> 162 Job 2 Operation 1 on Machine 2 : 62 + 69 -> 131 Job 2 Operation 2 on Machine 0 : 153 + 50 -> 203 Job 0 Oper...
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: Machine 0 is used for the following Operations: Job 0 Operation 1 dura...	Solution: Job 1 Operation 0 on Machine 1 : 0 + 269 -> 269 Job 1 Operation 1 on Machine 0 : 269 + 332 -> 601 Job 0 Operation 0 on Machine 1 : 269 + 274 -> 543 Job 0 Operation 1 on Machine 0 : 601 + 314 -> 915 Makespan: 915.0, as it is the maximum end completion time of Operation 1
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: Machine 0 is used for the following Operations: Job 2 Operation 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 71 -> 71 Job 1 Operation 0 on Machine 4 : 0 + 106 -> 106 Job 0 Operation 0 on Machine 5 : 0 + 37 -> 37 Job 0 Operation 1 on Machine 2 : 37 + 256 -> 293 Job 2 Operation 0 on Machine 0 : 71 + 38 -> 109 Job 3 Operation 1 on Machine 3 : 71 + 30 -> 101 Job 5 Opera...
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: Machine 0 is used for the following Operations: Job 1 Operation 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 9 -> 9 Job 0 Operation 0 on Machine 1 : 0 + 113 -> 113 Job 4 Operation 0 on Machine 2 : 0 + 45 -> 45 Job 1 Operation 0 on Machine 0 : 9 + 69 -> 78 Job 2 Operation 0 on Machine 0 : 78 + 45 -> 123 Job 1 Operation 1 on Machine 1 : 113 + 94 -> 207 Job 0 Operation...
8	5	Optimize schedule for 8 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 0 dura...	Solution: Job 3 Operation 0 on Machine 0 : 0 + 91 -> 91 Job 5 Operation 0 on Machine 1 : 0 + 114 -> 114 Job 4 Operation 0 on Machine 2 : 0 + 68 -> 68 Job 0 Operation 0 on Machine 4 : 0 + 170 -> 170 Job 3 Operation 1 on Machine 3 : 91 + 17 -> 108 Job 5 Operation 1 on Machine 0 : 114 + 74 -> 188 Job 3 Opera...
10	4	Optimize schedule for 10 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 8 Operation 0 dur...	Solution: Job 8 Operation 0 on Machine 0 : 0 + 26 -> 26 Job 4 Operation 0 on Machine 1 : 0 + 14 -> 14 Job 0 Operation 0 on Machine 2 : 0 + 4 -> 4 Job 1 Operation 0 on Machine 3 : 0 + 20 -> 20 Job 2 Operation 0 on Machine 2 : 4 + 14 -> 18 Job 7 Operation 0 on Machine 1 : 14 + 14 -> 28 Job 9 Operation 0 on ...
9	7	Optimize schedule for 9 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 4 Operation 2 dura...	Solution: Job 4 Operation 0 on Machine 1 : 0 + 237 -> 237 Job 6 Operation 0 on Machine 3 : 0 + 387 -> 387 Job 2 Operation 0 on Machine 4 : 0 + 49 -> 49 Job 0 Operation 0 on Machine 5 : 0 + 360 -> 360 Job 3 Operation 0 on Machine 6 : 0 + 301 -> 301 Job 1 Operation 0 on Machine 1 : 237 + 63 -> 300 Job 4 Ope...
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: Machine 0 is used for the following Operations: Job 7 Operation 0 dur...	Solution: Job 7 Operation 0 on Machine 0 : 0 + 129 -> 129 Job 1 Operation 0 on Machine 2 : 0 + 293 -> 293 Job 8 Operation 0 on Machine 3 : 0 + 86 -> 86 Job 9 Operation 0 on Machine 4 : 0 + 146 -> 146 Job 4 Operation 0 on Machine 6 : 0 + 223 -> 223 Job 5 Operation 0 on Machine 7 : 0 + 370 -> 370 Job 6 Oper...
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: Machine 0 is used for the following Operations: Job 1 Operation 1 du...	Solution: Job 15 Operation 0 on Machine 2 : 0 + 46 -> 46 Job 5 Operation 0 on Machine 3 : 0 + 112 -> 112 Job 6 Operation 0 on Machine 4 : 0 + 71 -> 71 Job 7 Operation 0 on Machine 5 : 0 + 29 -> 29 Job 14 Operation 0 on Machine 9 : 0 + 118 -> 118 Job 18 Operation 0 on Machine 10 : 0 + 8 -> 8 Job 11 Operati...
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: Machine 0 is used for the following Operations: Job 2 Operation 0 dura...	Solution: Job 2 Operation 0 on Machine 0 : 0 + 90 -> 90 Job 0 Operation 0 on Machine 1 : 0 + 32 -> 32 Job 1 Operation 0 on Machine 3 : 0 + 20 -> 20 Job 4 Operation 0 on Machine 3 : 20 + 121 -> 141 Job 3 Operation 0 on Machine 1 : 32 + 38 -> 70 Job 2 Operation 1 on Machine 1 : 90 + 58 -> 148 Job 4 Operatio...
10	2	Optimize schedule for 10 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 dur...	Solution: Job 0 Operation 0 on Machine 0 : 0 + 82 -> 82 Job 2 Operation 0 on Machine 1 : 0 + 4 -> 4 Job 8 Operation 0 on Machine 1 : 4 + 17 -> 21 Job 9 Operation 0 on Machine 1 : 21 + 38 -> 59 Job 3 Operation 0 on Machine 0 : 82 + 62 -> 144 Job 0 Operation 1 on Machine 1 : 82 + 30 -> 112 Job 1 Operation 0...

End of preview. Expand in Data Studio

README.md exists but content is empty.

Downloads last month: 2