instance_id int64 0 60k | num_jobs int64 6 20 | num_machines int64 2 5 | solve_time float64 0.38 2.12 | instruction stringclasses 1
value | input stringlengths 824 22.1k | output stringlengths 72 187 |
|---|---|---|---|---|---|---|
0 | 12 | 2 | 0.6817 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=18, M1=73
Job 1: M0=98, M1=9
Job 2: M0=33, M1=16
Job 3: M0=64, M1=98
Job 4: M0=58, M1=61
Job 5: M0=84, M1=49
Job 6: M0=27, M1=13
Job 7: M0=63, M1=4
Job 8: M0=50, M1=56
Job 9: M0=78, M1=98
Job 10: M0=99, M1=1
Job 11: M0=90, M1=58
=== ... | Solution:
M0: Job2 → Job0 → Job4 → Job3 → Job8
M1: Job1 → Job5 → Job7 → Job6 → Job9 → Job11 → Job10
Makespan: 308.0 |
1 | 11 | 3 | 0.629 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 11 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=8, M1=12, M2=11
Job 1: M0=47, M1=22, M2=95
Job 2: M0=86, M1=40, M2=33
Job 3: M0=78, M1=28, M2=78
Job 4: M0=5, M1=75, M2=88
Job 5: M0=21, M1=56, M2=82
Job 6: M0=51, M1=93, M2=66
Job 7: M0=48, M1=70, M2=57
Job 8: M0=65, M1=35, M2=5
Job ... | Solution:
M0: Job4 → Job9 → Job6
M1: Job3 → Job1 → Job0 → Job5 → Job2
M2: Job7 → Job8 → Job10
Makespan: 179.0 |
2 | 17 | 4 | 1.7802 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 17 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=31, M1=76, M2=70, M3=17
Job 1: M0=48, M1=78, M2=61, M3=81
Job 2: M0=75, M1=9, M2=78, M3=2
Job 3: M0=61, M1=34, M2=71, M3=30
Job 4: M0=25, M1=92, M2=61, M3=70
Job 5: M0=71, M1=61, M2=51, M3=82
Job 6: M0=20, M1=30, M2=82, M3=20
Job 7: M... | Solution:
M0: Job1 → Job10 → Job4 → Job6
M1: Job7 → Job8 → Job14 → Job3 → Job2 → Job9
M2: Job15 → Job13 → Job5
M3: Job0 → Job16 → Job11 → Job12
Makespan: 170.0 |
3 | 9 | 3 | 0.533 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 9 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=31, M1=39, M2=14
Job 1: M0=93, M1=51, M2=62
Job 2: M0=20, M1=12, M2=9
Job 3: M0=3, M1=52, M2=71
Job 4: M0=38, M1=98, M2=8
Job 5: M0=29, M1=67, M2=69
Job 6: M0=47, M1=36, M2=23
Job 7: M0=14, M1=34, M2=28
Job 8: M0=4, M1=83, M2=34
=== S... | Solution:
M0: Job8 → Job6 → Job5
M1: Job3 → Job7
M2: Job2 → Job4 → Job1 → Job0
Makespan: 129.0 |
4 | 19 | 2 | 1.0318 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 19 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=80, M1=33
Job 1: M0=95, M1=46
Job 2: M0=89, M1=95
Job 3: M0=84, M1=68
Job 4: M0=4, M1=60
Job 5: M0=32, M1=84
Job 6: M0=7, M1=21
Job 7: M0=15, M1=48
Job 8: M0=61, M1=32
Job 9: M0=49, M1=70
Job 10: M0=14, M1=74
Job 11: M0=32, M1=2
Job 1... | Solution:
M0: Job2 → Job9 → Job7 → Job18 → Job17 → Job4 → Job8 → Job5 → Job14 → Job6
M1: Job15 → Job16 → Job0 → Job12 → Job1 → Job10 → Job11 → Job3 → Job13
Makespan: 455.0 |
5 | 11 | 4 | 1.1805 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 11 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=74, M1=11, M2=63, M3=98
Job 1: M0=34, M1=5, M2=1, M3=19
Job 2: M0=85, M1=76, M2=61, M3=98
Job 3: M0=95, M1=48, M2=41, M3=99
Job 4: M0=3, M1=35, M2=63, M3=26
Job 5: M0=94, M1=53, M2=69, M3=70
Job 6: M0=88, M1=13, M2=25, M3=73
Job 7: M0... | Solution:
M0: Job4 → Job0 → Job10
M1: Job5 → Job3
M2: Job1 → Job2 → Job6
M3: Job8 → Job7 → Job9
Makespan: 148.0 |
6 | 15 | 2 | 0.8311 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 15 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=42, M1=20
Job 1: M0=51, M1=84
Job 2: M0=7, M1=10
Job 3: M0=69, M1=13
Job 4: M0=47, M1=75
Job 5: M0=8, M1=65
Job 6: M0=28, M1=5
Job 7: M0=12, M1=56
Job 8: M0=54, M1=9
Job 9: M0=31, M1=12
Job 10: M0=71, M1=55
Job 11: M0=8, M1=73
Job 12:... | Solution:
M0: Job11 → Job12 → Job1 → Job13 → Job8 → Job5 → Job4
M1: Job3 → Job10 → Job14 → Job7 → Job6 → Job9 → Job0 → Job2
Makespan: 320.0 |
7 | 16 | 2 | 0.8827 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 16 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=30, M1=48
Job 1: M0=49, M1=17
Job 2: M0=25, M1=91
Job 3: M0=6, M1=11
Job 4: M0=18, M1=32
Job 5: M0=65, M1=27
Job 6: M0=52, M1=83
Job 7: M0=4, M1=59
Job 8: M0=63, M1=59
Job 9: M0=50, M1=64
Job 10: M0=74, M1=25
Job 11: M0=52, M1=12
Job ... | Solution:
M0: Job2 → Job6 → Job0 → Job9 → Job7 → Job8 → Job4
M1: Job5 → Job15 → Job10 → Job1 → Job13 → Job11 → Job12 → Job14 → Job3
Makespan: 341.0 |
8 | 6 | 4 | 0.6858 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=60, M1=79, M2=48, M3=35
Job 1: M0=18, M1=24, M2=87, M3=1
Job 2: M0=44, M1=65, M2=60, M3=78
Job 3: M0=11, M1=43, M2=71, M3=79
Job 4: M0=90, M1=6, M2=94, M3=49
Job 5: M0=22, M1=91, M2=58, M3=93
=== Setup Times ===
[Machine 0]
J0→J1=55, ... | Solution:
M0: Job5 → Job3
M1: Job2
M2: Job0
M3: Job1 → Job4
Makespan: 65.0 |
9 | 13 | 3 | 0.7348 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 13 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=74, M1=5, M2=55
Job 1: M0=62, M1=74, M2=2
Job 2: M0=27, M1=60, M2=63
Job 3: M0=36, M1=84, M2=21
Job 4: M0=5, M1=67, M2=63
Job 5: M0=42, M1=10, M2=32
Job 6: M0=96, M1=47, M2=6
Job 7: M0=54, M1=18, M2=78
Job 8: M0=46, M1=49, M2=54
Job 9... | Solution:
M0: Job11 → Job12 → Job4 → Job9
M1: Job0 → Job5 → Job10 → Job7
M2: Job3 → Job2 → Job1 → Job8 → Job6
Makespan: 193.0 |
10 | 7 | 3 | 0.432 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 7 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=58, M1=72, M2=60
Job 1: M0=58, M1=66, M2=76
Job 2: M0=25, M1=24, M2=66
Job 3: M0=61, M1=81, M2=79
Job 4: M0=24, M1=13, M2=58
Job 5: M0=39, M1=19, M2=12
Job 6: M0=69, M1=89, M2=82
=== Setup Times ===
[Machine 0]
J0→J1=6, J0→J2=77, J0→J... | Solution:
M0: Job1 → Job6
M1: Job0 → Job3
M2: Job4 → Job2 → Job5
Makespan: 169.0 |
11 | 10 | 4 | 1.0793 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=61, M1=35, M2=85, M3=68
Job 1: M0=86, M1=45, M2=19, M3=49
Job 2: M0=2, M1=48, M2=62, M3=36
Job 3: M0=83, M1=59, M2=89, M3=77
Job 4: M0=30, M1=72, M2=1, M3=85
Job 5: M0=80, M1=19, M2=57, M3=48
Job 6: M0=21, M1=44, M2=27, M3=8
Job 7: M0... | Solution:
M0: Job2 → Job3
M1: Job9 → Job0 → Job6
M2: Job7 → Job5 → Job4
M3: Job8 → Job1
Makespan: 108.0 |
12 | 13 | 2 | 0.7308 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 13 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=34, M1=38
Job 1: M0=88, M1=88
Job 2: M0=24, M1=84
Job 3: M0=30, M1=86
Job 4: M0=19, M1=29
Job 5: M0=83, M1=94
Job 6: M0=24, M1=17
Job 7: M0=10, M1=69
Job 8: M0=28, M1=96
Job 9: M0=38, M1=4
Job 10: M0=56, M1=17
Job 11: M0=88, M1=78
Job... | Solution:
M0: Job8 → Job3 → Job12 → Job5 → Job7 → Job6 → Job2
M1: Job10 → Job0 → Job9 → Job1 → Job11 → Job4
Makespan: 348.0 |
13 | 14 | 2 | 0.782 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 14 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=14, M1=79
Job 1: M0=90, M1=97
Job 2: M0=84, M1=68
Job 3: M0=32, M1=35
Job 4: M0=95, M1=33
Job 5: M0=38, M1=94
Job 6: M0=10, M1=85
Job 7: M0=58, M1=39
Job 8: M0=60, M1=88
Job 9: M0=51, M1=51
Job 10: M0=16, M1=34
Job 11: M0=29, M1=41
Jo... | Solution:
M0: Job3 → Job1 → Job6 → Job9 → Job12 → Job0 → Job10 → Job5
M1: Job4 → Job7 → Job8 → Job2 → Job11 → Job13
Makespan: 390.0 |
14 | 8 | 4 | 0.8818 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=27, M1=2, M2=67, M3=95
Job 1: M0=5, M1=21, M2=31, M3=3
Job 2: M0=8, M1=88, M2=19, M3=89
Job 3: M0=48, M1=31, M2=15, M3=44
Job 4: M0=60, M1=91, M2=46, M3=36
Job 5: M0=51, M1=34, M2=45, M3=30
Job 6: M0=27, M1=46, M2=41, M3=29
Job 7: M0=4... | Solution:
M0: Job0 → Job7 → Job1
M1: Job5 → Job3
M2: Job2
M3: Job4 → Job6
Makespan: 93.0 |
15 | 20 | 2 | 1.0821 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 20 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=47, M1=61
Job 1: M0=62, M1=37
Job 2: M0=54, M1=30
Job 3: M0=58, M1=1
Job 4: M0=53, M1=85
Job 5: M0=92, M1=34
Job 6: M0=31, M1=82
Job 7: M0=29, M1=2
Job 8: M0=38, M1=39
Job 9: M0=43, M1=86
Job 10: M0=19, M1=96
Job 11: M0=78, M1=40
Job ... | Solution:
M0: Job6 → Job9 → Job14 → Job15 → Job17 → Job12 → Job0 → Job4 → Job10
M1: Job8 → Job5 → Job16 → Job13 → Job2 → Job18 → Job1 → Job11 → Job7 → Job19 → Job3
Makespan: 458.0 |
16 | 15 | 2 | 0.8338 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 15 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=67, M1=54
Job 1: M0=39, M1=47
Job 2: M0=38, M1=23
Job 3: M0=99, M1=91
Job 4: M0=91, M1=70
Job 5: M0=85, M1=36
Job 6: M0=15, M1=4
Job 7: M0=32, M1=50
Job 8: M0=96, M1=54
Job 9: M0=33, M1=65
Job 10: M0=41, M1=82
Job 11: M0=88, M1=93
Job... | Solution:
M0: Job11 → Job3 → Job7 → Job12 → Job9 → Job6 → Job10
M1: Job2 → Job13 → Job14 → Job8 → Job4 → Job1 → Job5 → Job0
Makespan: 418.0 |
17 | 6 | 2 | 0.3853 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=24, M1=16
Job 1: M0=85, M1=58
Job 2: M0=43, M1=31
Job 3: M0=26, M1=63
Job 4: M0=81, M1=64
Job 5: M0=24, M1=62
=== Setup Times ===
[Machine 0]
J0→J1=38, J0→J2=59, J0→J3=114, J0→J4=34, J0→J5=26
J1→J0=33, J1→J2=116, J1→J3=89, J1→J4=16, J... | Solution:
M0: Job0 → Job4 → Job2
M1: Job1 → Job5 → Job3
Makespan: 208.0 |
18 | 6 | 2 | 0.4064 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=87, M1=6
Job 1: M0=67, M1=16
Job 2: M0=66, M1=26
Job 3: M0=51, M1=45
Job 4: M0=68, M1=38
Job 5: M0=75, M1=19
=== Setup Times ===
[Machine 0]
J0→J1=77, J0→J2=34, J0→J3=14, J0→J4=34, J0→J5=53
J1→J0=42, J1→J2=124, J1→J3=35, J1→J4=107, J1... | Solution:
M0: Job4 → Job1
M1: Job5 → Job2 → Job0 → Job3
Makespan: 170.0 |
19 | 9 | 2 | 0.527 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 9 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=93, M1=88
Job 1: M0=99, M1=20
Job 2: M0=34, M1=87
Job 3: M0=82, M1=13
Job 4: M0=42, M1=74
Job 5: M0=22, M1=4
Job 6: M0=53, M1=53
Job 7: M0=10, M1=14
Job 8: M0=17, M1=41
=== Setup Times ===
[Machine 0]
J0→J1=61, J0→J2=122, J0→J3=75, J0... | Solution:
M0: Job4 → Job6 → Job2 → Job7
M1: Job8 → Job5 → Job3 → Job1 → Job0
Makespan: 209.0 |
20 | 17 | 2 | 0.9273 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 17 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=22, M1=54
Job 1: M0=89, M1=54
Job 2: M0=82, M1=37
Job 3: M0=62, M1=28
Job 4: M0=61, M1=66
Job 5: M0=24, M1=65
Job 6: M0=68, M1=31
Job 7: M0=1, M1=2
Job 8: M0=48, M1=75
Job 9: M0=55, M1=9
Job 10: M0=19, M1=97
Job 11: M0=30, M1=30
Job 1... | Solution:
M0: Job10 → Job13 → Job5 → Job8 → Job15 → Job7 → Job4 → Job16
M1: Job12 → Job6 → Job0 → Job3 → Job9 → Job11 → Job14 → Job1 → Job2
Makespan: 403.0 |
21 | 8 | 2 | 0.482 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=18, M1=32
Job 1: M0=4, M1=79
Job 2: M0=58, M1=24
Job 3: M0=90, M1=16
Job 4: M0=95, M1=84
Job 5: M0=45, M1=11
Job 6: M0=30, M1=35
Job 7: M0=7, M1=41
=== Setup Times ===
[Machine 0]
J0→J1=77, J0→J2=23, J0→J3=120, J0→J4=71, J0→J5=88, J0→... | Solution:
M0: Job1 → Job4 → Job7 → Job6
M1: Job5 → Job0 → Job2 → Job3
Makespan: 193.0 |
22 | 12 | 5 | 1.2775 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=38, M1=11, M2=3, M3=76, M4=40
Job 1: M0=55, M1=49, M2=68, M3=46, M4=17
Job 2: M0=93, M1=25, M2=35, M3=57, M4=2
Job 3: M0=29, M1=80, M2=59, M3=4, M4=14
Job 4: M0=11, M1=91, M2=64, M3=54, M4=3
Job 5: M0=66, M1=81, M2=94, M3=56, M4=46
Jo... | Solution:
M0: Job10 → Job1 → Job4
M1: Job9
M2: Job0 → Job7 → Job2
M3: Job3 → Job5 → Job6
M4: Job11 → Job8
Makespan: 93.0 |
23 | 13 | 2 | 0.7293 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 13 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=92, M1=50
Job 1: M0=75, M1=24
Job 2: M0=28, M1=22
Job 3: M0=25, M1=22
Job 4: M0=86, M1=88
Job 5: M0=12, M1=91
Job 6: M0=97, M1=20
Job 7: M0=91, M1=37
Job 8: M0=93, M1=99
Job 9: M0=2, M1=57
Job 10: M0=60, M1=93
Job 11: M0=82, M1=15
Job... | Solution:
M0: Job3 → Job12 → Job9 → Job5 → Job2 → Job4 → Job10
M1: Job1 → Job7 → Job8 → Job11 → Job0 → Job6
Makespan: 346.0 |
24 | 10 | 3 | 0.5806 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=49, M1=99, M2=2
Job 1: M0=28, M1=40, M2=82
Job 2: M0=61, M1=6, M2=97
Job 3: M0=33, M1=5, M2=40
Job 4: M0=73, M1=55, M2=13
Job 5: M0=76, M1=16, M2=74
Job 6: M0=88, M1=94, M2=26
Job 7: M0=66, M1=80, M2=41
Job 8: M0=24, M1=71, M2=46
Job ... | Solution:
M0: Job8 → Job1 → Job9
M1: Job5 → Job2 → Job3
M2: Job4 → Job0 → Job7 → Job6
Makespan: 144.0 |
25 | 12 | 3 | 0.6782 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=96, M1=26, M2=85
Job 1: M0=27, M1=56, M2=77
Job 2: M0=70, M1=8, M2=17
Job 3: M0=98, M1=62, M2=6
Job 4: M0=94, M1=88, M2=80
Job 5: M0=65, M1=22, M2=82
Job 6: M0=55, M1=32, M2=96
Job 7: M0=53, M1=92, M2=26
Job 8: M0=89, M1=4, M2=86
Job ... | Solution:
M0: Job6 → Job10 → Job7
M1: Job5 → Job2 → Job9 → Job0 → Job8 → Job11
M2: Job1 → Job4 → Job3
Makespan: 172.0 |
26 | 8 | 5 | 0.88 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=84, M1=62, M2=90, M3=36, M4=37
Job 1: M0=26, M1=10, M2=9, M3=33, M4=70
Job 2: M0=43, M1=33, M2=48, M3=52, M4=24
Job 3: M0=32, M1=31, M2=63, M3=10, M4=94
Job 4: M0=82, M1=74, M2=84, M3=11, M4=79
Job 5: M0=55, M1=54, M2=95, M3=7, M4=85
J... | Solution:
M0: Job5
M1: Job7 → Job1
M2: Job3 → Job6
M3: Job4 → Job0
M4: Job2
Makespan: 74.0 |
27 | 7 | 2 | 0.4306 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 7 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=15, M1=96
Job 1: M0=17, M1=70
Job 2: M0=77, M1=92
Job 3: M0=23, M1=29
Job 4: M0=17, M1=82
Job 5: M0=60, M1=98
Job 6: M0=54, M1=27
=== Setup Times ===
[Machine 0]
J0→J1=28, J0→J2=19, J0→J3=51, J0→J4=21, J0→J5=108, J0→J6=123
J1→J0=17, J... | Solution:
M0: Job3 → Job2 → Job1 → Job0 → Job4
M1: Job6 → Job5
Makespan: 213.0 |
28 | 15 | 2 | 0.8296 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 15 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=71, M1=10
Job 1: M0=45, M1=77
Job 2: M0=78, M1=37
Job 3: M0=12, M1=66
Job 4: M0=45, M1=51
Job 5: M0=54, M1=3
Job 6: M0=5, M1=14
Job 7: M0=57, M1=84
Job 8: M0=29, M1=45
Job 9: M0=11, M1=64
Job 10: M0=43, M1=78
Job 11: M0=70, M1=54
Job ... | Solution:
M0: Job9 → Job3 → Job8 → Job10 → Job6 → Job7 → Job14 → Job4
M1: Job5 → Job0 → Job12 → Job2 → Job13 → Job1 → Job11
Makespan: 327.0 |
29 | 14 | 5 | 1.5048 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 14 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=70, M1=38, M2=79, M3=4, M4=80
Job 1: M0=84, M1=27, M2=33, M3=7, M4=51
Job 2: M0=49, M1=83, M2=18, M3=11, M4=60
Job 3: M0=1, M1=67, M2=32, M3=4, M4=10
Job 4: M0=21, M1=77, M2=68, M3=52, M4=84
Job 5: M0=45, M1=69, M2=9, M3=52, M4=4
Job ... | Solution:
M0: Job2 → Job4
M1: Job12 → Job10
M2: Job1 → Job7 → Job8
M3: Job0 → Job6 → Job11 → Job3
M4: Job9 → Job13 → Job5
Makespan: 105.0 |
30 | 10 | 3 | 0.5841 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=2, M1=61, M2=15
Job 1: M0=98, M1=51, M2=19
Job 2: M0=88, M1=6, M2=18
Job 3: M0=15, M1=69, M2=30
Job 4: M0=92, M1=97, M2=18
Job 5: M0=19, M1=95, M2=5
Job 6: M0=85, M1=8, M2=18
Job 7: M0=30, M1=69, M2=94
Job 8: M0=58, M1=68, M2=53
Job 9... | Solution:
M0: Job7 → Job6 → Job0
M1: Job2 → Job3 → Job1
M2: Job9 → Job8 → Job5 → Job4
Makespan: 159.0 |
31 | 11 | 3 | 0.632 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 11 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=10, M1=28, M2=19
Job 1: M0=39, M1=90, M2=31
Job 2: M0=64, M1=4, M2=93
Job 3: M0=5, M1=13, M2=42
Job 4: M0=66, M1=43, M2=8
Job 5: M0=67, M1=89, M2=61
Job 6: M0=48, M1=77, M2=1
Job 7: M0=70, M1=97, M2=17
Job 8: M0=68, M1=2, M2=63
Job 9:... | Solution:
M0: Job0 → Job3 → Job5
M1: Job10 → Job4 → Job8 → Job2
M2: Job9 → Job1 → Job7 → Job6
Makespan: 112.0 |
32 | 15 | 3 | 0.8312 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 15 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=74, M1=22, M2=81
Job 1: M0=30, M1=36, M2=62
Job 2: M0=84, M1=69, M2=68
Job 3: M0=24, M1=84, M2=79
Job 4: M0=65, M1=42, M2=88
Job 5: M0=68, M1=62, M2=57
Job 6: M0=37, M1=87, M2=82
Job 7: M0=10, M1=39, M2=53
Job 8: M0=40, M1=67, M2=64
J... | Solution:
M0: Job13 → Job8 → Job11 → Job3 → Job6 → Job9
M1: Job4 → Job0 → Job1 → Job2 → Job14
M2: Job7 → Job5 → Job10 → Job12
Makespan: 251.0 |
33 | 17 | 3 | 0.9497 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 17 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=68, M1=46, M2=75
Job 1: M0=4, M1=30, M2=4
Job 2: M0=50, M1=47, M2=9
Job 3: M0=55, M1=40, M2=44
Job 4: M0=13, M1=75, M2=66
Job 5: M0=20, M1=13, M2=36
Job 6: M0=45, M1=79, M2=1
Job 7: M0=20, M1=97, M2=68
Job 8: M0=12, M1=8, M2=48
Job 9:... | Solution:
M0: Job4 → Job12 → Job7 → Job11 → Job5
M1: Job8 → Job13 → Job3 → Job16 → Job15 → Job10
M2: Job1 → Job9 → Job2 → Job0 → Job14 → Job6
Makespan: 238.0 |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 49