instance_id int64 0 47 | num_jobs int64 6 12 | num_machines int64 2 5 | solve_time float64 0.38 1.28 | instruction stringclasses 1
value | input stringlengths 480 2.88k | output stringlengths 73 123 |
|---|---|---|---|---|---|---|
0 | 6 | 2 | 0.4033 | 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=95, M1=52
Job 1: M0=39, M1=24
Job 2: M0=46, M1=88
Job 3: M0=53, M1=97
Job 4: M0=13, M1=61
Job 5: M0=37, M1=89
=== Setup Times ===
[Machine 0]
J0: [41,3,29,30,1]
J1: [12,3,39,7,14]
J2: [3,2,5,49,29]
J3: [3,24,29,21,15]
J4: [33,7,6,39,1... | Solution:
M0: Job4 → Job2 → Job1 → Job5
M1: Job0 → Job3
Makespan: 164.0 |
1 | 6 | 2 | 0.3924 | 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=80, M1=56
Job 1: M0=34, M1=13
Job 2: M0=12, M1=11
Job 3: M0=52, M1=10
Job 4: M0=27, M1=63
Job 5: M0=99, M1=85
=== Setup Times ===
[Machine 0]
J0: [9,21,44,28,29]
J1: [4,26,38,45,49]
J2: [20,8,30,1,28]
J3: [20,42,6,7,27]
J4: [3,39,30,9... | Solution:
M0: Job2 → Job4 → Job0
M1: Job3 → Job5 → Job1
Makespan: 133.0 |
2 | 6 | 2 | 0.3996 | 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=95, M1=15
Job 1: M0=37, M1=28
Job 2: M0=61, M1=27
Job 3: M0=13, M1=80
Job 4: M0=96, M1=41
Job 5: M0=21, M1=42
=== Setup Times ===
[Machine 0]
J0: [15,11,47,5,33]
J1: [44,37,11,23,10]
J2: [15,19,7,27,34]
J3: [49,38,35,12,25]
J4: [34,18... | Solution:
M0: Job1 → Job3 → Job5
M1: Job0 → Job4 → Job2
Makespan: 125.0 |
3 | 6 | 3 | 0.3843 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=93, M1=88, M2=28
Job 1: M0=75, M1=25, M2=59
Job 2: M0=38, M1=13, M2=85
Job 3: M0=59, M1=79, M2=91
Job 4: M0=62, M1=38, M2=38
Job 5: M0=24, M1=89, M2=69
=== Setup Times ===
[Machine 0]
J0: [9,36,13,24,11]
J1: [7,21,47,34,9]
J2: [47,48,... | Solution:
M0: Job5 → Job3
M1: Job1 → Job2
M2: Job4 → Job0
Makespan: 101.0 |
4 | 6 | 3 | 0.382 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=36, M1=92, M2=56
Job 1: M0=74, M1=47, M2=27
Job 2: M0=17, M1=74, M2=16
Job 3: M0=37, M1=24, M2=85
Job 4: M0=37, M1=42, M2=35
Job 5: M0=34, M1=39, M2=80
=== Setup Times ===
[Machine 0]
J0: [21,40,10,46,44]
J1: [6,24,37,19,15]
J2: [29,3... | Solution:
M0: Job2 → Job0
M1: Job3 → Job5
M2: Job1 → Job4
Makespan: 82.0 |
5 | 6 | 3 | 0.3823 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=19, M1=62, M2=51
Job 1: M0=62, M1=61, M2=21
Job 2: M0=99, M1=55, M2=31
Job 3: M0=98, M1=26, M2=50
Job 4: M0=13, M1=72, M2=11
Job 5: M0=16, M1=91, M2=67
=== Setup Times ===
[Machine 0]
J0: [24,9,48,43,1]
J1: [34,27,21,32,36]
J2: [15,47... | Solution:
M0: Job4 → Job0 → Job5
M1: Job2
M2: Job3 → Job1
Makespan: 89.0 |
6 | 6 | 4 | 0.6716 | 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=54, M1=99, M2=90, M3=91
Job 1: M0=37, M1=12, M2=68, M3=34
Job 2: M0=88, M1=51, M2=41, M3=33
Job 3: M0=37, M1=94, M2=29, M3=67
Job 4: M0=47, M1=51, M2=46, M3=21
Job 5: M0=94, M1=49, M2=53, M3=42
=== Setup Times ===
[Machine 0]
J0: [11,... | Solution:
M0: Job0
M1: Job5
M2: Job2 → Job3
M3: Job4 → Job1
Makespan: 81.0 |
7 | 6 | 4 | 0.6814 | 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=68, M1=100, M2=98, M3=30
Job 1: M0=81, M1=80, M2=44, M3=19
Job 2: M0=53, M1=82, M2=57, M3=97
Job 3: M0=91, M1=74, M2=28, M3=51
Job 4: M0=56, M1=18, M2=14, M3=63
Job 5: M0=41, M1=51, M2=98, M3=78
=== Setup Times ===
[Machine 0]
J0: [14... | Solution:
M0: Job2
M1: Job5
M2: Job4 → Job3
M3: Job0 → Job1
Makespan: 59.0 |
8 | 6 | 4 | 0.6645 | 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=70, M1=46, M2=65, M3=47
Job 1: M0=58, M1=15, M2=19, M3=41
Job 2: M0=15, M1=58, M2=73, M3=78
Job 3: M0=27, M1=67, M2=32, M3=51
Job 4: M0=47, M1=19, M2=33, M3=60
Job 5: M0=94, M1=58, M2=73, M3=35
=== Setup Times ===
[Machine 0]
J0: [20,... | Solution:
M0: Job2 → Job3
M1: Job0
M2: Job1 → Job4
M3: Job5
Makespan: 66.0 |
9 | 6 | 5 | 0.6836 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=68, M1=68, M2=16, M3=98, M4=51
Job 1: M0=61, M1=70, M2=10, M3=79, M4=77
Job 2: M0=30, M1=60, M2=78, M3=67, M4=100
Job 3: M0=35, M1=36, M2=94, M3=44, M4=23
Job 4: M0=51, M1=23, M2=58, M3=17, M4=54
Job 5: M0=86, M1=90, M2=61, M3=42, M4=3... | Solution:
M0: Job2
M1: Job3 → Job4
M2: Job1
M3: Job5
M4: Job0
Makespan: 66.0 |
10 | 6 | 5 | 0.6966 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=93, M1=80, M2=46, M3=63, M4=21
Job 1: M0=32, M1=71, M2=59, M3=71, M4=28
Job 2: M0=78, M1=52, M2=67, M3=55, M4=85
Job 3: M0=73, M1=27, M2=16, M3=25, M4=96
Job 4: M0=11, M1=12, M2=64, M3=89, M4=70
Job 5: M0=60, M1=49, M2=20, M3=97, M4=26... | Solution:
M0: Job1
M1: Job4 → Job3
M2: Job5
M3: Job2
M4: Job0
Makespan: 55.0 |
11 | 6 | 5 | 0.6835 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 6 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=63, M1=29, M2=39, M3=12, M4=17
Job 1: M0=95, M1=85, M2=27, M3=95, M4=92
Job 2: M0=55, M1=98, M2=54, M3=26, M4=47
Job 3: M0=77, M1=54, M2=24, M3=86, M4=30
Job 4: M0=93, M1=61, M2=87, M3=42, M4=77
Job 5: M0=99, M1=29, M2=56, M3=33, M4=63... | Solution:
M0: Job2
M1: Job4
M2: Job1
M3: Job0 → Job5
M4: Job3
Makespan: 61.0 |
12 | 8 | 2 | 0.4772 | 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=87, M1=74
Job 1: M0=27, M1=69
Job 2: M0=79, M1=58
Job 3: M0=91, M1=16
Job 4: M0=84, M1=97
Job 5: M0=31, M1=71
Job 6: M0=52, M1=28
Job 7: M0=46, M1=48
=== Setup Times ===
[Machine 0]
J0: [34,5,31,4,36,30,23]
J1: [19,22,45,38,47,18,48]
... | Solution:
M0: Job5 → Job7 → Job2 → Job1
M1: Job4 → Job6 → Job0 → Job3
Makespan: 238.0 |
13 | 8 | 2 | 0.4694 | 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=33, M1=92
Job 1: M0=77, M1=33
Job 2: M0=45, M1=84
Job 3: M0=28, M1=81
Job 4: M0=89, M1=36
Job 5: M0=24, M1=93
Job 6: M0=93, M1=69
Job 7: M0=69, M1=64
=== Setup Times ===
[Machine 0]
J0: [5,34,42,33,39,42,30]
J1: [5,3,37,10,23,21,46]
J... | Solution:
M0: Job0 → Job1 → Job2 → Job5 → Job3
M1: Job6 → Job7 → Job4
Makespan: 225.0 |
14 | 8 | 2 | 0.4829 | 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=94, M1=44
Job 1: M0=38, M1=22
Job 2: M0=82, M1=57
Job 3: M0=76, M1=83
Job 4: M0=22, M1=28
Job 5: M0=79, M1=72
Job 6: M0=92, M1=28
Job 7: M0=100, M1=36
=== Setup Times ===
[Machine 0]
J0: [10,6,18,26,22,18,27]
J1: [30,31,10,4,1,14,40]
... | Solution:
M0: Job1 → Job5 → Job3 → Job4
M1: Job2 → Job6 → Job0 → Job7
Makespan: 219.0 |
15 | 8 | 3 | 0.4692 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=75, M1=42, M2=79
Job 1: M0=20, M1=39, M2=80
Job 2: M0=19, M1=94, M2=25
Job 3: M0=21, M1=83, M2=30
Job 4: M0=89, M1=94, M2=29
Job 5: M0=93, M1=57, M2=86
Job 6: M0=90, M1=28, M2=13
Job 7: M0=16, M1=23, M2=19
=== Setup Times ===
[Machine... | Solution:
M0: Job1 → Job0
M1: Job7 → Job5
M2: Job4 → Job6 → Job3 → Job2
Makespan: 113.0 |
16 | 8 | 3 | 0.4824 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=45, M1=42, M2=81
Job 1: M0=43, M1=90, M2=72
Job 2: M0=62, M1=55, M2=50
Job 3: M0=88, M1=29, M2=77
Job 4: M0=52, M1=48, M2=22
Job 5: M0=87, M1=73, M2=48
Job 6: M0=21, M1=44, M2=23
Job 7: M0=14, M1=51, M2=73
=== Setup Times ===
[Machine... | Solution:
M0: Job5 → Job1
M1: Job7 → Job3 → Job0
M2: Job6 → Job2 → Job4
Makespan: 139.0 |
17 | 8 | 3 | 0.4784 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 8 Jobs, 3 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=40, M1=37, M2=35
Job 1: M0=23, M1=86, M2=79
Job 2: M0=90, M1=89, M2=24
Job 3: M0=68, M1=52, M2=80
Job 4: M0=41, M1=18, M2=97
Job 5: M0=88, M1=31, M2=67
Job 6: M0=96, M1=31, M2=18
Job 7: M0=73, M1=36, M2=95
=== Setup Times ===
[Machine... | Solution:
M0: Job1 → Job7
M1: Job5 → Job3 → Job4
M2: Job6 → Job2 → Job0
Makespan: 112.0 |
18 | 8 | 4 | 0.8706 | 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=37, M1=55, M2=89, M3=56
Job 1: M0=76, M1=51, M2=81, M3=14
Job 2: M0=99, M1=45, M2=29, M3=67
Job 3: M0=82, M1=14, M2=60, M3=26
Job 4: M0=97, M1=49, M2=79, M3=59
Job 5: M0=44, M1=71, M2=59, M3=61
Job 6: M0=28, M1=89, M2=63, M3=18
Job 7: ... | Solution:
M0: Job5 → Job7
M1: Job0 → Job3
M2: Job6 → Job2
M3: Job4 → Job1
Makespan: 98.0 |
19 | 8 | 4 | 0.8811 | 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=17, M1=71, M2=21, M3=60
Job 1: M0=54, M1=52, M2=29, M3=20
Job 2: M0=10, M1=83, M2=96, M3=61
Job 3: M0=81, M1=11, M2=43, M3=88
Job 4: M0=95, M1=32, M2=70, M3=92
Job 5: M0=83, M1=55, M2=66, M3=75
Job 6: M0=49, M1=86, M2=12, M3=49
Job 7: ... | Solution:
M0: Job2 → Job7
M1: Job3 → Job4
M2: Job1 → Job0 → Job6
M3: Job5
Makespan: 78.0 |
20 | 8 | 4 | 0.8666 | 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=69, M1=31, M2=41, M3=41
Job 1: M0=82, M1=100, M2=48, M3=62
Job 2: M0=27, M1=87, M2=22, M3=20
Job 3: M0=56, M1=12, M2=86, M3=81
Job 4: M0=59, M1=23, M2=86, M3=37
Job 5: M0=61, M1=18, M2=30, M3=98
Job 6: M0=19, M1=35, M2=92, M3=54
Job 7:... | Solution:
M0: Job4 → Job6
M1: Job3 → Job0
M2: Job5 → Job1
M3: Job2 → Job7
Makespan: 90.0 |
21 | 8 | 5 | 0.8817 | 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=24, M1=41, M2=39, M3=93, M4=38
Job 1: M0=40, M1=37, M2=88, M3=83, M4=42
Job 2: M0=33, M1=17, M2=86, M3=49, M4=10
Job 3: M0=100, M1=72, M2=83, M3=84, M4=88
Job 4: M0=59, M1=24, M2=53, M3=20, M4=97
Job 5: M0=79, M1=92, M2=97, M3=39, M4=4... | Solution:
M0: Job7 → Job1
M1: Job3
M2: Job6 → Job0
M3: Job4 → Job2
M4: Job5
Makespan: 80.0 |
22 | 8 | 5 | 0.8823 | 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=64, M1=95, M2=55, M3=49, M4=29
Job 1: M0=57, M1=63, M2=49, M3=57, M4=96
Job 2: M0=71, M1=39, M2=45, M3=65, M4=37
Job 3: M0=31, M1=62, M2=92, M3=98, M4=32
Job 4: M0=50, M1=91, M2=35, M3=13, M4=99
Job 5: M0=60, M1=63, M2=70, M3=31, M4=19... | Solution:
M0: Job7 → Job6
M1: Job2
M2: Job1
M3: Job4 → Job5
M4: Job3 → Job0
Makespan: 67.0 |
23 | 8 | 5 | 0.8904 | 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=67, M1=18, M2=79, M3=90, M4=50
Job 1: M0=76, M1=64, M2=31, M3=78, M4=49
Job 2: M0=49, M1=18, M2=46, M3=42, M4=24
Job 3: M0=38, M1=35, M2=96, M3=59, M4=14
Job 4: M0=48, M1=53, M2=53, M3=45, M4=23
Job 5: M0=49, M1=77, M2=78, M3=55, M4=50... | Solution:
M0: Job5
M1: Job0
M2: Job1
M3: Job7 → Job6
M4: Job3 → Job4 → Job2
Makespan: 68.0 |
24 | 10 | 2 | 0.5836 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=72, M1=40
Job 1: M0=86, M1=71
Job 2: M0=97, M1=35
Job 3: M0=10, M1=20
Job 4: M0=67, M1=57
Job 5: M0=97, M1=36
Job 6: M0=72, M1=82
Job 7: M0=32, M1=97
Job 8: M0=97, M1=48
Job 9: M0=79, M1=74
=== Setup Times ===
[Machine 0]
J0: [12,18,... | Solution:
M0: Job7 → Job4 → Job1 → Job6
M1: Job9 → Job3 → Job8 → Job0 → Job2 → Job5
Makespan: 314.0 |
25 | 10 | 2 | 0.5682 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=90, M1=57
Job 1: M0=34, M1=18
Job 2: M0=71, M1=96
Job 3: M0=93, M1=34
Job 4: M0=11, M1=22
Job 5: M0=50, M1=22
Job 6: M0=47, M1=64
Job 7: M0=55, M1=60
Job 8: M0=87, M1=75
Job 9: M0=18, M1=65
=== Setup Times ===
[Machine 0]
J0: [11,18,... | Solution:
M0: Job7 → Job8 → Job9 → Job2
M1: Job4 → Job6 → Job1 → Job0 → Job5 → Job3
Makespan: 253.0 |
26 | 10 | 2 | 0.5831 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 2 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=88, M1=72
Job 1: M0=32, M1=63
Job 2: M0=97, M1=23
Job 3: M0=69, M1=42
Job 4: M0=14, M1=88
Job 5: M0=86, M1=34
Job 6: M0=54, M1=50
Job 7: M0=50, M1=53
Job 8: M0=62, M1=85
Job 9: M0=52, M1=88
=== Setup Times ===
[Machine 0]
J0: [28,2,3... | Solution:
M0: Job1 → Job3 → Job8 → Job9 → Job4
M1: Job5 → Job7 → Job0 → Job6 → Job2
Makespan: 269.0 |
27 | 10 | 3 | 0.5708 | 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=18, M1=48, M2=57
Job 1: M0=36, M1=53, M2=17
Job 2: M0=16, M1=44, M2=38
Job 3: M0=82, M1=84, M2=70
Job 4: M0=32, M1=66, M2=59
Job 5: M0=34, M1=47, M2=54
Job 6: M0=38, M1=93, M2=88
Job 7: M0=70, M1=22, M2=39
Job 8: M0=16, M1=70, M2=60
J... | Solution:
M0: Job8 → Job4 → Job0 → Job6
M1: Job3 → Job9 → Job7
M2: Job1 → Job5 → Job2
Makespan: 154.0 |
28 | 10 | 3 | 0.5952 | 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=37, M1=95, M2=30
Job 1: M0=84, M1=87, M2=56
Job 2: M0=48, M1=57, M2=26
Job 3: M0=66, M1=84, M2=83
Job 4: M0=94, M1=62, M2=85
Job 5: M0=91, M1=69, M2=58
Job 6: M0=14, M1=56, M2=43
Job 7: M0=60, M1=15, M2=26
Job 8: M0=15, M1=37, M2=83
J... | Solution:
M0: Job0 → Job3 → Job8 → Job6
M1: Job4 → Job1
M2: Job2 → Job9 → Job5 → Job7
Makespan: 162.0 |
29 | 10 | 3 | 0.5847 | 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=27, M1=58, M2=53
Job 1: M0=43, M1=70, M2=40
Job 2: M0=29, M1=55, M2=43
Job 3: M0=55, M1=83, M2=65
Job 4: M0=29, M1=85, M2=26
Job 5: M0=10, M1=18, M2=77
Job 6: M0=59, M1=12, M2=97
Job 7: M0=62, M1=16, M2=90
Job 8: M0=36, M1=86, M2=32
J... | Solution:
M0: Job5 → Job0 → Job3
M1: Job9 → Job2 → Job7 → Job6
M2: Job1 → Job8 → Job4
Makespan: 135.0 |
30 | 10 | 4 | 1.0654 | 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=54, M1=17, M2=46, M3=29
Job 1: M0=49, M1=41, M2=46, M3=40
Job 2: M0=48, M1=40, M2=76, M3=63
Job 3: M0=33, M1=90, M2=92, M3=98
Job 4: M0=22, M1=68, M2=61, M3=67
Job 5: M0=39, M1=29, M2=83, M3=73
Job 6: M0=45, M1=95, M2=10, M3=47
Job 7:... | Solution:
M0: Job2 → Job3
M1: Job7 → Job0 → Job8 → Job5
M2: Job6 → Job4
M3: Job9 → Job1
Makespan: 94.0 |
31 | 10 | 4 | 1.0667 | 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=11, M1=22, M2=31, M3=71
Job 1: M0=49, M1=43, M2=16, M3=61
Job 2: M0=67, M1=50, M2=36, M3=13
Job 3: M0=68, M1=21, M2=14, M3=26
Job 4: M0=21, M1=93, M2=45, M3=48
Job 5: M0=19, M1=14, M2=53, M3=64
Job 6: M0=41, M1=62, M2=24, M3=52
Job 7:... | Solution:
M0: Job0 → Job4 → Job7
M1: Job5 → Job9 → Job1
M2: Job2 → Job6
M3: Job8 → Job3
Makespan: 82.0 |
32 | 10 | 4 | 1.0661 | 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=14, M1=87, M2=88, M3=42
Job 1: M0=85, M1=33, M2=94, M3=14
Job 2: M0=23, M1=65, M2=21, M3=45
Job 3: M0=33, M1=27, M2=36, M3=54
Job 4: M0=71, M1=71, M2=56, M3=67
Job 5: M0=15, M1=83, M2=94, M3=13
Job 6: M0=59, M1=96, M2=94, M3=22
Job 7:... | Solution:
M0: Job0 → Job4
M1: Job3 → Job8 → Job9
M2: Job2 → Job7
M3: Job6 → Job5 → Job1
Makespan: 106.0 |
33 | 10 | 5 | 1.0839 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=99, M1=90, M2=39, M3=41, M4=98
Job 1: M0=56, M1=31, M2=71, M3=28, M4=67
Job 2: M0=32, M1=41, M2=11, M3=97, M4=21
Job 3: M0=48, M1=30, M2=47, M3=36, M4=15
Job 4: M0=90, M1=67, M2=95, M3=60, M4=68
Job 5: M0=18, M1=11, M2=40, M3=63, M4=5... | Solution:
M0: Job6 → Job8
M1: Job9 → Job5 → Job7
M2: Job2 → Job0
M3: Job1 → Job3
M4: Job4
Makespan: 71.0 |
34 | 10 | 5 | 1.0824 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=98, M1=24, M2=52, M3=81, M4=80
Job 1: M0=16, M1=66, M2=48, M3=18, M4=45
Job 2: M0=69, M1=25, M2=92, M3=34, M4=12
Job 3: M0=99, M1=86, M2=99, M3=98, M4=86
Job 4: M0=17, M1=60, M2=64, M3=98, M4=99
Job 5: M0=59, M1=59, M2=42, M3=46, M4=7... | Solution:
M0: Job1 → Job6 → Job4
M1: Job0 → Job5
M2: Job7 → Job9
M3: Job3
M4: Job2 → Job8
Makespan: 98.0 |
35 | 10 | 5 | 1.0845 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 10 Jobs, 5 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=82, M1=73, M2=13, M3=44, M4=44
Job 1: M0=98, M1=22, M2=54, M3=18, M4=74
Job 2: M0=99, M1=67, M2=77, M3=61, M4=22
Job 3: M0=60, M1=67, M2=24, M3=53, M4=11
Job 4: M0=14, M1=74, M2=83, M3=76, M4=35
Job 5: M0=79, M1=99, M2=40, M3=40, M4=9... | Solution:
M0: Job8 → Job4
M1: Job1
M2: Job9 → Job0
M3: Job5 → Job7
M4: Job6 → Job2 → Job3
Makespan: 65.0 |
36 | 12 | 2 | 0.6868 | 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=92, M1=47
Job 1: M0=86, M1=25
Job 2: M0=91, M1=61
Job 3: M0=93, M1=52
Job 4: M0=44, M1=25
Job 5: M0=40, M1=80
Job 6: M0=53, M1=90
Job 7: M0=34, M1=99
Job 8: M0=19, M1=50
Job 9: M0=17, M1=22
Job 10: M0=80, M1=63
Job 11: M0=10, M1=47
=... | Solution:
M0: Job7 → Job3 → Job6 → Job11 → Job5 → Job8
M1: Job1 → Job10 → Job2 → Job0 → Job9 → Job4
Makespan: 284.0 |
37 | 12 | 2 | 0.6831 | 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=49, M1=37
Job 1: M0=62, M1=32
Job 2: M0=22, M1=90
Job 3: M0=67, M1=20
Job 4: M0=11, M1=70
Job 5: M0=97, M1=72
Job 6: M0=93, M1=69
Job 7: M0=94, M1=37
Job 8: M0=72, M1=49
Job 9: M0=38, M1=90
Job 10: M0=34, M1=26
Job 11: M0=49, M1=12
=... | Solution:
M0: Job0 → Job9 → Job10 → Job2 → Job4 → Job8
M1: Job6 → Job5 → Job7 → Job1 → Job11 → Job3
Makespan: 281.0 |
38 | 12 | 2 | 0.6821 | 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=26, M1=87
Job 1: M0=69, M1=77
Job 2: M0=33, M1=12
Job 3: M0=69, M1=64
Job 4: M0=23, M1=59
Job 5: M0=65, M1=83
Job 6: M0=32, M1=68
Job 7: M0=46, M1=17
Job 8: M0=15, M1=89
Job 9: M0=40, M1=11
Job 10: M0=89, M1=45
Job 11: M0=41, M1=45
=... | Solution:
M0: Job6 → Job5 → Job8 → Job4 → Job3 → Job0
M1: Job2 → Job10 → Job7 → Job1 → Job9 → Job11
Makespan: 262.0 |
39 | 12 | 3 | 0.6673 | 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=66, M1=24, M2=99
Job 1: M0=49, M1=31, M2=98
Job 2: M0=34, M1=75, M2=99
Job 3: M0=84, M1=83, M2=78
Job 4: M0=89, M1=60, M2=58
Job 5: M0=88, M1=83, M2=69
Job 6: M0=72, M1=76, M2=90
Job 7: M0=39, M1=45, M2=22
Job 8: M0=68, M1=32, M2=66
J... | Solution:
M0: Job10 → Job2 → Job9 → Job6
M1: Job0 → Job8 → Job3 → Job1
M2: Job7 → Job4 → Job5 → Job11
Makespan: 205.0 |
40 | 12 | 3 | 0.6831 | 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=63, M1=32, M2=27
Job 1: M0=48, M1=19, M2=37
Job 2: M0=86, M1=27, M2=24
Job 3: M0=87, M1=86, M2=42
Job 4: M0=81, M1=72, M2=23
Job 5: M0=99, M1=29, M2=15
Job 6: M0=88, M1=30, M2=22
Job 7: M0=74, M1=89, M2=86
Job 8: M0=97, M1=55, M2=22
J... | Solution:
M0: Job0 → Job7 → Job9
M1: Job11 → Job2 → Job6 → Job1
M2: Job8 → Job3 → Job4 → Job5 → Job10
Makespan: 178.0 |
41 | 12 | 3 | 0.6832 | 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=35, M1=70, M2=81
Job 1: M0=67, M1=55, M2=48
Job 2: M0=26, M1=79, M2=66
Job 3: M0=33, M1=77, M2=13
Job 4: M0=23, M1=84, M2=11
Job 5: M0=82, M1=53, M2=34
Job 6: M0=67, M1=16, M2=57
Job 7: M0=52, M1=58, M2=48
Job 8: M0=75, M1=22, M2=52
J... | Solution:
M0: Job2 → Job10 → Job0 → Job1
M1: Job6 → Job8 → Job9
M2: Job3 → Job7 → Job11 → Job4 → Job5
Makespan: 168.0 |
42 | 12 | 4 | 1.2804 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=62, M1=30, M2=95, M3=77
Job 1: M0=25, M1=37, M2=80, M3=76
Job 2: M0=97, M1=12, M2=80, M3=18
Job 3: M0=90, M1=41, M2=61, M3=67
Job 4: M0=85, M1=79, M2=22, M3=68
Job 5: M0=91, M1=38, M2=85, M3=58
Job 6: M0=14, M1=99, M2=10, M3=49
Job 7:... | Solution:
M0: Job0 → Job6 → Job1
M1: Job5 → Job11 → Job7
M2: Job3 → Job4 → Job9
M3: Job2 → Job8 → Job10
Makespan: 125.0 |
43 | 12 | 4 | 1.2686 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=24, M1=29, M2=99, M3=27
Job 1: M0=20, M1=15, M2=57, M3=35
Job 2: M0=92, M1=35, M2=54, M3=92
Job 3: M0=45, M1=59, M2=38, M3=93
Job 4: M0=39, M1=30, M2=92, M3=41
Job 5: M0=67, M1=75, M2=63, M3=12
Job 6: M0=95, M1=62, M2=65, M3=36
Job 7:... | Solution:
M0: Job1 → Job8 → Job0
M1: Job10 → Job4 → Job11
M2: Job3 → Job9 → Job2
M3: Job5 → Job6 → Job7
Makespan: 129.0 |
44 | 12 | 4 | 1.2813 | Solve the Parallel Machine Scheduling Problem (PMSP) to minimize makespan, considering sequence-dependent setup times. | PMSP with 12 Jobs, 4 Machines. Minimize Makespan.
=== Processing Times ===
Job 0: M0=11, M1=93, M2=91, M3=62
Job 1: M0=80, M1=79, M2=72, M3=22
Job 2: M0=59, M1=37, M2=76, M3=79
Job 3: M0=35, M1=98, M2=58, M3=39
Job 4: M0=57, M1=99, M2=81, M3=16
Job 5: M0=61, M1=97, M2=16, M3=17
Job 6: M0=13, M1=94, M2=50, M3=16
Job 7:... | Solution:
M0: Job3 → Job10 → Job0
M1: Job9 → Job8 → Job2
M2: Job5 → Job7
M3: Job4 → Job6 → Job11 → Job1
Makespan: 130.0 |
45 | 12 | 5 | 1.2707 | 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=56, M1=83, M2=62, M3=60, M4=96
Job 1: M0=88, M1=33, M2=83, M3=12, M4=33
Job 2: M0=20, M1=98, M2=79, M3=92, M4=28
Job 3: M0=73, M1=32, M2=64, M3=38, M4=26
Job 4: M0=51, M1=34, M2=19, M3=38, M4=30
Job 5: M0=70, M1=68, M2=96, M3=95, M4=1... | Solution:
M0: Job0
M1: Job4 → Job11 → Job7
M2: Job8 → Job6
M3: Job10 → Job1 → Job9
M4: Job5 → Job3 → Job2
Makespan: 77.0 |
46 | 12 | 5 | 1.2815 | 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=45, M1=13, M2=36, M3=43, M4=50
Job 1: M0=99, M1=83, M2=90, M3=41, M4=89
Job 2: M0=70, M1=76, M2=48, M3=75, M4=95
Job 3: M0=64, M1=17, M2=70, M3=87, M4=81
Job 4: M0=10, M1=63, M2=51, M3=30, M4=44
Job 5: M0=28, M1=81, M2=63, M3=58, M4=5... | Solution:
M0: Job7 → Job10 → Job4
M1: Job9 → Job3 → Job11
M2: Job2 → Job6
M3: Job1 → Job5
M4: Job0 → Job8
Makespan: 109.0 |
47 | 12 | 5 | 1.2534 | 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=86, M1=82, M2=82, M3=90, M4=71
Job 1: M0=71, M1=39, M2=57, M3=50, M4=70
Job 2: M0=50, M1=22, M2=96, M3=70, M4=87
Job 3: M0=57, M1=25, M2=24, M3=63, M4=45
Job 4: M0=99, M1=76, M2=47, M3=84, M4=84
Job 5: M0=94, M1=47, M2=70, M3=85, M4=1... | Solution:
M0: Job2 → Job11
M1: Job9 → Job1 → Job3
M2: Job6 → Job4
M3: Job8 → Job10 → Job7
M4: Job5 → Job0
Makespan: 121.0 |
No dataset card yet
- Downloads last month
- 8