instance_id stringlengths 12 12 | source_index int64 0 5.34k | num_jobs int64 50 50 | num_machines int64 5 20 | total_steps int64 50 50 | step_idx int64 0 49 | state_json dict | state_text stringlengths 3.45k 23k | problem_context_text stringlengths 2.11k 7.55k | feasible_jobs listlengths 1 50 | feasible_action_codes listlengths 1 50 | action_code_to_job unknown | candidate_labels_in_order listlengths 1 50 | target_candidate_index int64 0 48 | target_candidate_label stringlengths 7 7 | num_feasible_actions int64 1 50 | is_trivial bool 2
classes | env_mode stringclasses 1
value | feature_schema_version stringclasses 1
value | target_job int64 0 49 | target_action_code stringlengths 7 7 | target_text stringlengths 7 7 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
train_000000 | 0 | 50 | 5 | 50 | 0 | {
"step_idx": 0,
"total_steps": 50,
"scheduled_ratio": 0,
"current_cmax": 0,
"total_remaining_work": 25458,
"unfinished_jobs_count": 50,
"unfinished_jobs_ratio": 1,
"machine_ready_min": 0,
"machine_ready_mean": 0,
"machine_ready_max": 0,
"machine_ready_std": 0,
"machine_remaining_load": [
51... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49
] | [
"<A1825>",
"<A0410>",
"<A4507>",
"<A4013>",
"<A3658>",
"<A2287>",
"<A1680>",
"<A8936>",
"<A1425>",
"<A9675>",
"<A6913>",
"<A0521>",
"<A0489>",
"<A1536>",
"<A3583>",
"<A3812>",
"<A8280>",
"<A9864>",
"<A0435>",
"<A9196>",
"<A3258>",
"<A8929>",
"<A6874>",
"<A3612>",
"<A7... | {
"<A1825>": 16,
"<A0410>": 9,
"<A4507>": 1,
"<A4013>": 48,
"<A3658>": 31,
"<A2287>": 15,
"<A1680>": 34,
"<A8936>": 13,
"<A1425>": 0,
"<A9675>": 26,
"<A6913>": 3,
"<A0521>": 27,
"<A0489>": 30,
"<A1536>": 32,
"<A3583>": 43,
"<A3812>": 44,
"<A8280>": 38,
"<A9864>": 25,
"<A0435>": 7,
... | [
"<A6202>",
"<A5882>",
"<A5636>",
"<A6913>",
"<A5575>",
"<A1425>",
"<A1680>",
"<A3258>",
"<A9892>",
"<A3812>",
"<A4553>",
"<A1585>",
"<A0107>",
"<A0521>",
"<A9196>",
"<A0410>",
"<A8936>",
"<A1292>",
"<A2548>",
"<A4013>",
"<A2616>",
"<A3612>",
"<A8929>",
"<A7360>",
"<A6... | 14 | <A9196> | 50 | false | dispatch | pfsp_step_policy_v1 | 35 | <A9196> | <A9196> |
train_000000 | 0 | 50 | 5 | 50 | 1 | {
"step_idx": 1,
"total_steps": 50,
"scheduled_ratio": 0.02,
"current_cmax": 458,
"total_remaining_work": 25000,
"unfinished_jobs_count": 49,
"unfinished_jobs_ratio": 0.98,
"machine_ready_min": 52,
"machine_ready_mean": 234.6,
"machine_ready_max": 458,
"machine_ready_std": 141.6850027349,
"machi... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49
] | [
"<A0632>",
"<A4688>",
"<A2359>",
"<A7579>",
"<A6061>",
"<A1578>",
"<A7426>",
"<A9811>",
"<A8164>",
"<A9978>",
"<A0314>",
"<A8423>",
"<A7085>",
"<A9448>",
"<A6101>",
"<A8962>",
"<A7112>",
"<A6455>",
"<A2887>",
"<A0946>",
"<A1759>",
"<A2041>",
"<A6159>",
"<A2515>",
"<A1... | {
"<A0632>": 36,
"<A4688>": 45,
"<A2359>": 14,
"<A7579>": 22,
"<A6061>": 7,
"<A1578>": 26,
"<A7426>": 0,
"<A9811>": 4,
"<A8164>": 37,
"<A9978>": 16,
"<A0314>": 25,
"<A8423>": 38,
"<A7085>": 24,
"<A9448>": 12,
"<A6101>": 43,
"<A8962>": 18,
"<A7112>": 39,
"<A6455>": 1,
"<A2887>": 13,... | [
"<A7426>",
"<A8127>",
"<A8557>",
"<A2109>",
"<A2980>",
"<A2359>",
"<A2515>",
"<A2887>",
"<A7112>",
"<A1263>",
"<A1007>",
"<A9785>",
"<A1689>",
"<A4853>",
"<A4688>",
"<A9424>",
"<A1003>",
"<A8396>",
"<A2041>",
"<A6176>",
"<A6455>",
"<A2632>",
"<A9491>",
"<A2716>",
"<A6... | 5 | <A2359> | 49 | false | dispatch | pfsp_step_policy_v1 | 14 | <A2359> | <A2359> |
train_000000 | 0 | 50 | 5 | 50 | 2 | {
"step_idx": 2,
"total_steps": 50,
"scheduled_ratio": 0.04,
"current_cmax": 520,
"total_remaining_work": 24557,
"unfinished_jobs_count": 48,
"unfinished_jobs_ratio": 0.96,
"machine_ready_min": 131,
"machine_ready_mean": 331.8,
"machine_ready_max": 520,
"machine_ready_std": 150.2057255899,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49
] | [
"<A6694>",
"<A8521>",
"<A8880>",
"<A1912>",
"<A2895>",
"<A6219>",
"<A3690>",
"<A4745>",
"<A0477>",
"<A3682>",
"<A9318>",
"<A0145>",
"<A1642>",
"<A2568>",
"<A8417>",
"<A4965>",
"<A6201>",
"<A9683>",
"<A6637>",
"<A5344>",
"<A5871>",
"<A1206>",
"<A5552>",
"<A4633>",
"<A2... | {
"<A6694>": 17,
"<A8521>": 32,
"<A8880>": 40,
"<A1912>": 28,
"<A2895>": 26,
"<A6219>": 4,
"<A3690>": 13,
"<A4745>": 10,
"<A0477>": 33,
"<A3682>": 27,
"<A9318>": 45,
"<A0145>": 16,
"<A1642>": 1,
"<A2568>": 37,
"<A8417>": 34,
"<A4965>": 3,
"<A6201>": 12,
"<A9683>": 6,
"<A6637>": 11,... | [
"<A7820>",
"<A9644>",
"<A8417>",
"<A3682>",
"<A6637>",
"<A0807>",
"<A1551>",
"<A4965>",
"<A3690>",
"<A8880>",
"<A7150>",
"<A9318>",
"<A1836>",
"<A4747>",
"<A5871>",
"<A0574>",
"<A4633>",
"<A4063>",
"<A4424>",
"<A2131>",
"<A0477>",
"<A6694>",
"<A0712>",
"<A1642>",
"<A1... | 3 | <A3682> | 48 | false | dispatch | pfsp_step_policy_v1 | 27 | <A3682> | <A3682> |
train_000000 | 0 | 50 | 5 | 50 | 3 | {
"step_idx": 3,
"total_steps": 50,
"scheduled_ratio": 0.06,
"current_cmax": 616,
"total_remaining_work": 24099,
"unfinished_jobs_count": 47,
"unfinished_jobs_ratio": 0.94,
"machine_ready_min": 197,
"machine_ready_mean": 431.2,
"machine_ready_max": 616,
"machine_ready_std": 155.0901673221,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
33,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49
] | [
"<A4455>",
"<A6844>",
"<A7996>",
"<A4222>",
"<A1342>",
"<A4968>",
"<A5550>",
"<A0354>",
"<A1186>",
"<A7935>",
"<A0181>",
"<A1882>",
"<A4651>",
"<A1929>",
"<A5097>",
"<A0586>",
"<A1092>",
"<A2213>",
"<A4450>",
"<A2526>",
"<A3458>",
"<A7019>",
"<A1229>",
"<A6687>",
"<A2... | {
"<A4455>": 7,
"<A6844>": 40,
"<A7996>": 8,
"<A4222>": 41,
"<A1342>": 3,
"<A4968>": 2,
"<A5550>": 34,
"<A0354>": 45,
"<A1186>": 11,
"<A7935>": 30,
"<A0181>": 6,
"<A1882>": 15,
"<A4651>": 4,
"<A1929>": 24,
"<A5097>": 26,
"<A0586>": 49,
"<A1092>": 44,
"<A2213>": 37,
"<A4450>": 10,
... | [
"<A2340>",
"<A5550>",
"<A1186>",
"<A5194>",
"<A5244>",
"<A1342>",
"<A0938>",
"<A3458>",
"<A0354>",
"<A1092>",
"<A6337>",
"<A0586>",
"<A6844>",
"<A8797>",
"<A0528>",
"<A2822>",
"<A4167>",
"<A4222>",
"<A1229>",
"<A5842>",
"<A7996>",
"<A6741>",
"<A1472>",
"<A6123>",
"<A5... | 7 | <A3458> | 47 | false | dispatch | pfsp_step_policy_v1 | 47 | <A3458> | <A3458> |
train_000000 | 0 | 50 | 5 | 50 | 4 | {
"step_idx": 4,
"total_steps": 50,
"scheduled_ratio": 0.08,
"current_cmax": 728,
"total_remaining_work": 23660,
"unfinished_jobs_count": 46,
"unfinished_jobs_ratio": 0.92,
"machine_ready_min": 289,
"machine_ready_mean": 530.6,
"machine_ready_max": 728,
"machine_ready_std": 158.5617860646,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
33,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A1252>",
"<A6554>",
"<A0655>",
"<A9644>",
"<A9616>",
"<A3745>",
"<A8450>",
"<A2490>",
"<A9564>",
"<A8816>",
"<A0528>",
"<A0498>",
"<A1130>",
"<A5245>",
"<A0893>",
"<A0506>",
"<A2219>",
"<A8990>",
"<A4839>",
"<A8647>",
"<A5402>",
"<A1523>",
"<A6521>",
"<A7844>",
"<A5... | {
"<A1252>": 43,
"<A6554>": 31,
"<A0655>": 30,
"<A9644>": 36,
"<A9616>": 45,
"<A3745>": 15,
"<A8450>": 1,
"<A2490>": 8,
"<A9564>": 41,
"<A8816>": 9,
"<A0528>": 29,
"<A0498>": 38,
"<A1130>": 49,
"<A5245>": 32,
"<A0893>": 44,
"<A0506>": 0,
"<A2219>": 34,
"<A8990>": 10,
"<A4839>": 3,
... | [
"<A0506>",
"<A2558>",
"<A2219>",
"<A1130>",
"<A5499>",
"<A7844>",
"<A4839>",
"<A9745>",
"<A2512>",
"<A5516>",
"<A9616>",
"<A7530>",
"<A9564>",
"<A0893>",
"<A1218>",
"<A3709>",
"<A1132>",
"<A6521>",
"<A2490>",
"<A7629>",
"<A8920>",
"<A5905>",
"<A5402>",
"<A7089>",
"<A8... | 20 | <A8920> | 46 | false | dispatch | pfsp_step_policy_v1 | 33 | <A8920> | <A8920> |
train_000000 | 0 | 50 | 5 | 50 | 5 | {
"step_idx": 5,
"total_steps": 50,
"scheduled_ratio": 0.1,
"current_cmax": 882,
"total_remaining_work": 23215,
"unfinished_jobs_count": 45,
"unfinished_jobs_ratio": 0.9,
"machine_ready_min": 356,
"machine_ready_mean": 628.2,
"machine_ready_max": 882,
"machine_ready_std": 181.8212308835,
"machin... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A5765>",
"<A1025>",
"<A7049>",
"<A9071>",
"<A7433>",
"<A9352>",
"<A5628>",
"<A4218>",
"<A8396>",
"<A6334>",
"<A6430>",
"<A0671>",
"<A6858>",
"<A0388>",
"<A1679>",
"<A0011>",
"<A4323>",
"<A7890>",
"<A8957>",
"<A0150>",
"<A5171>",
"<A9300>",
"<A7008>",
"<A3770>",
"<A3... | {
"<A5765>": 42,
"<A1025>": 44,
"<A7049>": 46,
"<A9071>": 5,
"<A7433>": 40,
"<A9352>": 0,
"<A5628>": 24,
"<A4218>": 2,
"<A8396>": 4,
"<A6334>": 20,
"<A6430>": 43,
"<A0671>": 3,
"<A6858>": 10,
"<A0388>": 21,
"<A1679>": 49,
"<A0011>": 29,
"<A4323>": 31,
"<A7890>": 12,
"<A8957>": 9,
... | [
"<A1025>",
"<A9352>",
"<A9300>",
"<A9071>",
"<A9139>",
"<A7049>",
"<A5884>",
"<A8421>",
"<A9191>",
"<A0671>",
"<A0579>",
"<A8574>",
"<A3770>",
"<A5791>",
"<A1679>",
"<A3966>",
"<A7433>",
"<A4218>",
"<A6334>",
"<A9423>",
"<A5945>",
"<A5171>",
"<A0545>",
"<A5602>",
"<A5... | 26 | <A3896> | 45 | false | dispatch | pfsp_step_policy_v1 | 8 | <A3896> | <A3896> |
train_000000 | 0 | 50 | 5 | 50 | 6 | {
"step_idx": 6,
"total_steps": 50,
"scheduled_ratio": 0.12,
"current_cmax": 998,
"total_remaining_work": 22757,
"unfinished_jobs_count": 44,
"unfinished_jobs_ratio": 0.88,
"machine_ready_min": 442,
"machine_ready_mean": 719.8,
"machine_ready_max": 998,
"machine_ready_std": 192.5215832056,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
9,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A8982>",
"<A5169>",
"<A2161>",
"<A9125>",
"<A8762>",
"<A4953>",
"<A8280>",
"<A3158>",
"<A7142>",
"<A2714>",
"<A2534>",
"<A1762>",
"<A8079>",
"<A3612>",
"<A3573>",
"<A8383>",
"<A9119>",
"<A8333>",
"<A2539>",
"<A7730>",
"<A3558>",
"<A0458>",
"<A1202>",
"<A6944>",
"<A1... | {
"<A8982>": 9,
"<A5169>": 29,
"<A2161>": 18,
"<A9125>": 39,
"<A8762>": 45,
"<A4953>": 30,
"<A8280>": 22,
"<A3158>": 16,
"<A7142>": 24,
"<A2714>": 5,
"<A2534>": 2,
"<A1762>": 32,
"<A8079>": 10,
"<A3612>": 41,
"<A3573>": 34,
"<A8383>": 48,
"<A9119>": 46,
"<A8333>": 26,
"<A2539>": 21... | [
"<A8174>",
"<A9119>",
"<A0458>",
"<A3573>",
"<A2714>",
"<A5774>",
"<A8762>",
"<A9125>",
"<A9358>",
"<A1202>",
"<A2672>",
"<A8383>",
"<A2161>",
"<A2111>",
"<A2265>",
"<A3558>",
"<A1041>",
"<A4342>",
"<A4456>",
"<A1554>",
"<A2534>",
"<A3909>",
"<A8280>",
"<A3612>",
"<A0... | 28 | <A8982> | 44 | false | dispatch | pfsp_step_policy_v1 | 9 | <A8982> | <A8982> |
train_000000 | 0 | 50 | 5 | 50 | 7 | {
"step_idx": 7,
"total_steps": 50,
"scheduled_ratio": 0.14,
"current_cmax": 1110,
"total_remaining_work": 22289,
"unfinished_jobs_count": 43,
"unfinished_jobs_ratio": 0.86,
"machine_ready_min": 564,
"machine_ready_mean": 813.4,
"machine_ready_max": 1110,
"machine_ready_std": 197.5546506666,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
10,
11,
12,
13,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A1096>",
"<A5642>",
"<A6771>",
"<A1811>",
"<A5301>",
"<A9083>",
"<A8377>",
"<A0814>",
"<A0735>",
"<A4521>",
"<A2529>",
"<A7452>",
"<A0744>",
"<A8948>",
"<A8263>",
"<A3591>",
"<A9873>",
"<A4686>",
"<A9394>",
"<A6082>",
"<A6555>",
"<A0500>",
"<A4076>",
"<A2261>",
"<A1... | {
"<A1096>": 10,
"<A5642>": 22,
"<A6771>": 46,
"<A1811>": 3,
"<A5301>": 5,
"<A9083>": 36,
"<A8377>": 29,
"<A0814>": 21,
"<A0735>": 48,
"<A4521>": 39,
"<A2529>": 7,
"<A7452>": 24,
"<A0744>": 4,
"<A8948>": 45,
"<A8263>": 15,
"<A3591>": 34,
"<A9873>": 18,
"<A4686>": 40,
"<A9394>": 12,... | [
"<A5351>",
"<A6771>",
"<A6531>",
"<A3591>",
"<A5301>",
"<A0500>",
"<A8948>",
"<A4521>",
"<A9761>",
"<A1811>",
"<A5218>",
"<A0735>",
"<A9873>",
"<A0858>",
"<A3380>",
"<A9228>",
"<A4179>",
"<A4076>",
"<A4398>",
"<A4686>",
"<A5872>",
"<A8918>",
"<A5642>",
"<A6935>",
"<A6... | 5 | <A0500> | 43 | false | dispatch | pfsp_step_policy_v1 | 13 | <A0500> | <A0500> |
train_000000 | 0 | 50 | 5 | 50 | 8 | {
"step_idx": 8,
"total_steps": 50,
"scheduled_ratio": 0.16,
"current_cmax": 1172,
"total_remaining_work": 21820,
"unfinished_jobs_count": 42,
"unfinished_jobs_ratio": 0.84,
"machine_ready_min": 673,
"machine_ready_mean": 912.4,
"machine_ready_max": 1172,
"machine_ready_std": 179.0202223214,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
10,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A8152>",
"<A4361>",
"<A5966>",
"<A3973>",
"<A7753>",
"<A5408>",
"<A1396>",
"<A8823>",
"<A5200>",
"<A3677>",
"<A9121>",
"<A1397>",
"<A2512>",
"<A5689>",
"<A1614>",
"<A5694>",
"<A5233>",
"<A3644>",
"<A3097>",
"<A1127>",
"<A5390>",
"<A9893>",
"<A9954>",
"<A7027>",
"<A1... | {
"<A8152>": 21,
"<A4361>": 40,
"<A5966>": 28,
"<A3973>": 5,
"<A7753>": 16,
"<A5408>": 23,
"<A1396>": 12,
"<A8823>": 3,
"<A5200>": 6,
"<A3677>": 26,
"<A9121>": 18,
"<A1397>": 1,
"<A2512>": 34,
"<A5689>": 24,
"<A1614>": 30,
"<A5694>": 42,
"<A5233>": 37,
"<A3644>": 48,
"<A3097>": 36,... | [
"<A9893>",
"<A9523>",
"<A2512>",
"<A3973>",
"<A3295>",
"<A4419>",
"<A7027>",
"<A3723>",
"<A8823>",
"<A2075>",
"<A9121>",
"<A9895>",
"<A5966>",
"<A1734>",
"<A4361>",
"<A1049>",
"<A3644>",
"<A5477>",
"<A0094>",
"<A7537>",
"<A1397>",
"<A1127>",
"<A1614>",
"<A4362>",
"<A5... | 14 | <A4361> | 42 | false | dispatch | pfsp_step_policy_v1 | 40 | <A4361> | <A4361> |
train_000000 | 0 | 50 | 5 | 50 | 9 | {
"step_idx": 9,
"total_steps": 50,
"scheduled_ratio": 0.18,
"current_cmax": 1270,
"total_remaining_work": 21349,
"unfinished_jobs_count": 41,
"unfinished_jobs_ratio": 0.82,
"machine_ready_min": 784,
"machine_ready_mean": 1006.6,
"machine_ready_max": 1270,
"machine_ready_std": 172.6332528802,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
10,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A3990>",
"<A8229>",
"<A9049>",
"<A2654>",
"<A4032>",
"<A3792>",
"<A9050>",
"<A4192>",
"<A6511>",
"<A8984>",
"<A7596>",
"<A8981>",
"<A8578>",
"<A5611>",
"<A9603>",
"<A5902>",
"<A6337>",
"<A4550>",
"<A6618>",
"<A0125>",
"<A1867>",
"<A0465>",
"<A8830>",
"<A4231>",
"<A0... | {
"<A3990>": 26,
"<A8229>": 11,
"<A9049>": 42,
"<A2654>": 2,
"<A4032>": 23,
"<A3792>": 44,
"<A9050>": 6,
"<A4192>": 39,
"<A6511>": 4,
"<A8984>": 30,
"<A7596>": 25,
"<A8981>": 48,
"<A8578>": 12,
"<A5611>": 10,
"<A9603>": 24,
"<A5902>": 41,
"<A6337>": 45,
"<A4550>": 46,
"<A6618>": 17... | [
"<A3792>",
"<A4550>",
"<A0125>",
"<A7358>",
"<A5690>",
"<A6337>",
"<A4192>",
"<A4231>",
"<A8830>",
"<A6618>",
"<A8981>",
"<A0534>",
"<A8229>",
"<A7179>",
"<A7828>",
"<A7596>",
"<A9050>",
"<A2654>",
"<A0465>",
"<A2911>",
"<A5902>",
"<A0993>",
"<A8984>",
"<A0210>",
"<A9... | 32 | <A5611> | 41 | false | dispatch | pfsp_step_policy_v1 | 10 | <A5611> | <A5611> |
train_000000 | 0 | 50 | 5 | 50 | 10 | {
"step_idx": 10,
"total_steps": 50,
"scheduled_ratio": 0.2,
"current_cmax": 1405,
"total_remaining_work": 20867,
"unfinished_jobs_count": 40,
"unfinished_jobs_ratio": 0.8,
"machine_ready_min": 879,
"machine_ready_mean": 1104.6,
"machine_ready_max": 1405,
"machine_ready_std": 186.8974050114,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
41,
42,
43,
44,
45,
46,
48,
49
] | [
"<A4397>",
"<A0894>",
"<A8399>",
"<A7928>",
"<A6079>",
"<A6666>",
"<A0558>",
"<A2299>",
"<A2608>",
"<A6767>",
"<A3001>",
"<A5671>",
"<A7202>",
"<A0019>",
"<A0561>",
"<A8916>",
"<A6344>",
"<A7176>",
"<A0182>",
"<A3888>",
"<A1137>",
"<A2606>",
"<A2791>",
"<A7895>",
"<A3... | {
"<A4397>": 26,
"<A0894>": 39,
"<A8399>": 30,
"<A7928>": 18,
"<A6079>": 45,
"<A6666>": 7,
"<A0558>": 48,
"<A2299>": 1,
"<A2608>": 32,
"<A6767>": 11,
"<A3001>": 17,
"<A5671>": 28,
"<A7202>": 23,
"<A0019>": 12,
"<A0561>": 15,
"<A8916>": 31,
"<A6344>": 2,
"<A7176>": 38,
"<A0182>": 3,... | [
"<A3888>",
"<A9435>",
"<A2013>",
"<A1493>",
"<A5997>",
"<A6079>",
"<A0894>",
"<A2606>",
"<A0182>",
"<A3001>",
"<A0558>",
"<A7928>",
"<A6767>",
"<A5671>",
"<A2332>",
"<A8916>",
"<A6472>",
"<A6816>",
"<A6344>",
"<A2791>",
"<A8909>",
"<A6197>",
"<A2299>",
"<A8399>",
"<A2... | 14 | <A2332> | 40 | false | dispatch | pfsp_step_policy_v1 | 49 | <A2332> | <A2332> |
train_000000 | 0 | 50 | 5 | 50 | 11 | {
"step_idx": 11,
"total_steps": 50,
"scheduled_ratio": 0.22,
"current_cmax": 1495,
"total_remaining_work": 20467,
"unfinished_jobs_count": 39,
"unfinished_jobs_ratio": 0.78,
"machine_ready_min": 942,
"machine_ready_mean": 1184.6,
"machine_ready_max": 1495,
"machine_ready_std": 194.0882273607,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
41,
42,
43,
44,
45,
46,
48
] | [
"<A3540>",
"<A7480>",
"<A8226>",
"<A7909>",
"<A8529>",
"<A5910>",
"<A7449>",
"<A0512>",
"<A0603>",
"<A2774>",
"<A5633>",
"<A2169>",
"<A4277>",
"<A0919>",
"<A2773>",
"<A0769>",
"<A5903>",
"<A3754>",
"<A7224>",
"<A3248>",
"<A3749>",
"<A2074>",
"<A2265>",
"<A5755>",
"<A8... | {
"<A3540>": 21,
"<A7480>": 0,
"<A8226>": 25,
"<A7909>": 6,
"<A8529>": 4,
"<A5910>": 46,
"<A7449>": 23,
"<A0512>": 16,
"<A0603>": 41,
"<A2774>": 39,
"<A5633>": 24,
"<A2169>": 34,
"<A4277>": 42,
"<A0919>": 29,
"<A2773>": 2,
"<A0769>": 18,
"<A5903>": 43,
"<A3754>": 31,
"<A7224>": 7,
... | [
"<A9061>",
"<A5910>",
"<A7480>",
"<A2169>",
"<A2511>",
"<A5215>",
"<A2774>",
"<A6343>",
"<A2544>",
"<A2265>",
"<A6607>",
"<A0769>",
"<A3248>",
"<A6760>",
"<A3754>",
"<A8226>",
"<A7909>",
"<A2773>",
"<A5755>",
"<A2074>",
"<A0603>",
"<A4561>",
"<A5445>",
"<A8382>",
"<A5... | 10 | <A6607> | 39 | false | dispatch | pfsp_step_policy_v1 | 48 | <A6607> | <A6607> |
train_000000 | 0 | 50 | 5 | 50 | 12 | {
"step_idx": 12,
"total_steps": 50,
"scheduled_ratio": 0.24,
"current_cmax": 1581,
"total_remaining_work": 19976,
"unfinished_jobs_count": 38,
"unfinished_jobs_ratio": 0.76,
"machine_ready_min": 1048,
"machine_ready_mean": 1287.2,
"machine_ready_max": 1581,
"machine_ready_std": 191.7043557147,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
41,
42,
43,
44,
45,
46
] | [
"<A2253>",
"<A7192>",
"<A9111>",
"<A4882>",
"<A7914>",
"<A7988>",
"<A6233>",
"<A3589>",
"<A7316>",
"<A5408>",
"<A9460>",
"<A6261>",
"<A3421>",
"<A3278>",
"<A0918>",
"<A8121>",
"<A8994>",
"<A7420>",
"<A9793>",
"<A1491>",
"<A8883>",
"<A5573>",
"<A8451>",
"<A4805>",
"<A6... | {
"<A2253>": 12,
"<A7192>": 4,
"<A9111>": 22,
"<A4882>": 44,
"<A7914>": 2,
"<A7988>": 3,
"<A6233>": 16,
"<A3589>": 21,
"<A7316>": 41,
"<A5408>": 42,
"<A9460>": 29,
"<A6261>": 31,
"<A3421>": 18,
"<A3278>": 36,
"<A0918>": 34,
"<A8121>": 43,
"<A8994>": 25,
"<A7420>": 39,
"<A9793>": 37... | [
"<A4882>",
"<A4279>",
"<A4355>",
"<A0918>",
"<A4805>",
"<A8913>",
"<A7420>",
"<A5934>",
"<A7988>",
"<A4476>",
"<A3421>",
"<A0608>",
"<A1586>",
"<A6261>",
"<A8994>",
"<A2334>",
"<A7914>",
"<A7173>",
"<A9111>",
"<A7316>",
"<A0208>",
"<A9612>",
"<A8451>",
"<A1491>",
"<A9... | 19 | <A7316> | 38 | false | dispatch | pfsp_step_policy_v1 | 41 | <A7316> | <A7316> |
train_000000 | 0 | 50 | 5 | 50 | 13 | {
"step_idx": 13,
"total_steps": 50,
"scheduled_ratio": 0.26,
"current_cmax": 1683,
"total_remaining_work": 19524,
"unfinished_jobs_count": 37,
"unfinished_jobs_ratio": 0.74,
"machine_ready_min": 1116,
"machine_ready_mean": 1377.6,
"machine_ready_max": 1683,
"machine_ready_std": 200.0995752119,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
42,
43,
44,
45,
46
] | [
"<A1481>",
"<A3216>",
"<A2458>",
"<A4960>",
"<A1306>",
"<A3011>",
"<A4947>",
"<A1451>",
"<A5762>",
"<A7733>",
"<A8857>",
"<A6314>",
"<A6356>",
"<A8250>",
"<A6648>",
"<A5214>",
"<A7027>",
"<A8753>",
"<A0665>",
"<A4215>",
"<A0673>",
"<A3779>",
"<A8405>",
"<A0239>",
"<A9... | {
"<A1481>": 3,
"<A3216>": 11,
"<A2458>": 4,
"<A4960>": 18,
"<A1306>": 43,
"<A3011>": 23,
"<A4947>": 20,
"<A1451>": 34,
"<A5762>": 1,
"<A7733>": 44,
"<A8857>": 21,
"<A6314>": 17,
"<A6356>": 36,
"<A8250>": 2,
"<A6648>": 37,
"<A5214>": 25,
"<A7027>": 39,
"<A8753>": 30,
"<A0665>": 28,... | [
"<A7733>",
"<A3797>",
"<A3197>",
"<A1451>",
"<A0239>",
"<A0860>",
"<A7027>",
"<A9345>",
"<A1481>",
"<A6314>",
"<A4960>",
"<A3216>",
"<A0665>",
"<A3779>",
"<A5214>",
"<A7016>",
"<A8250>",
"<A4947>",
"<A4215>",
"<A5762>",
"<A8753>",
"<A8225>",
"<A3363>",
"<A8405>",
"<A1... | 34 | <A8857> | 37 | false | dispatch | pfsp_step_policy_v1 | 21 | <A8857> | <A8857> |
train_000000 | 0 | 50 | 5 | 50 | 14 | {
"step_idx": 14,
"total_steps": 50,
"scheduled_ratio": 0.28,
"current_cmax": 1823,
"total_remaining_work": 19022,
"unfinished_jobs_count": 36,
"unfinished_jobs_ratio": 0.72,
"machine_ready_min": 1213,
"machine_ready_mean": 1478.4,
"machine_ready_max": 1823,
"machine_ready_std": 219.897794441,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
36,
37,
38,
39,
42,
43,
44,
45,
46
] | [
"<A9172>",
"<A0189>",
"<A7761>",
"<A8574>",
"<A4934>",
"<A8893>",
"<A6891>",
"<A3784>",
"<A1549>",
"<A6139>",
"<A1110>",
"<A5528>",
"<A4186>",
"<A9402>",
"<A3396>",
"<A0367>",
"<A9384>",
"<A3456>",
"<A0892>",
"<A9536>",
"<A9126>",
"<A2242>",
"<A6303>",
"<A0498>",
"<A2... | {
"<A9172>": 32,
"<A0189>": 22,
"<A7761>": 2,
"<A8574>": 11,
"<A4934>": 42,
"<A8893>": 19,
"<A6891>": 38,
"<A3784>": 36,
"<A1549>": 25,
"<A6139>": 45,
"<A1110>": 39,
"<A5528>": 15,
"<A4186>": 6,
"<A9402>": 7,
"<A3396>": 12,
"<A0367>": 3,
"<A9384>": 37,
"<A3456>": 34,
"<A0892>": 31,... | [
"<A3027>",
"<A3211>",
"<A0498>",
"<A3456>",
"<A9154>",
"<A6139>",
"<A1110>",
"<A8893>",
"<A0367>",
"<A3584>",
"<A6308>",
"<A8574>",
"<A6303>",
"<A0892>",
"<A1549>",
"<A4186>",
"<A7761>",
"<A3057>",
"<A0189>",
"<A9126>",
"<A4042>",
"<A9172>",
"<A9536>",
"<A2242>",
"<A3... | 33 | <A3784> | 36 | false | dispatch | pfsp_step_policy_v1 | 36 | <A3784> | <A3784> |
train_000000 | 0 | 50 | 5 | 50 | 15 | {
"step_idx": 15,
"total_steps": 50,
"scheduled_ratio": 0.3,
"current_cmax": 1962,
"total_remaining_work": 18432,
"unfinished_jobs_count": 35,
"unfinished_jobs_ratio": 0.7,
"machine_ready_min": 1264,
"machine_ready_mean": 1596.4,
"machine_ready_max": 1962,
"machine_ready_std": 241.5256508117,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
29,
30,
31,
32,
34,
37,
38,
39,
42,
43,
44,
45,
46
] | [
"<A0698>",
"<A6026>",
"<A9662>",
"<A9918>",
"<A0317>",
"<A3685>",
"<A8424>",
"<A5263>",
"<A7822>",
"<A4756>",
"<A7161>",
"<A6193>",
"<A0323>",
"<A2709>",
"<A8466>",
"<A9902>",
"<A6109>",
"<A6524>",
"<A1784>",
"<A9585>",
"<A7959>",
"<A8952>",
"<A4165>",
"<A2284>",
"<A9... | {
"<A0698>": 45,
"<A6026>": 3,
"<A9662>": 20,
"<A9918>": 4,
"<A0317>": 31,
"<A3685>": 24,
"<A8424>": 2,
"<A5263>": 15,
"<A7822>": 16,
"<A4756>": 22,
"<A7161>": 23,
"<A6193>": 39,
"<A0323>": 42,
"<A2709>": 5,
"<A8466>": 12,
"<A9902>": 1,
"<A6109>": 34,
"<A6524>": 32,
"<A1784>": 25,
... | [
"<A8372>",
"<A9115>",
"<A8952>",
"<A6109>",
"<A2709>",
"<A0698>",
"<A6193>",
"<A6988>",
"<A6026>",
"<A2285>",
"<A2284>",
"<A6232>",
"<A2336>",
"<A0317>",
"<A1784>",
"<A9262>",
"<A8424>",
"<A9662>",
"<A4756>",
"<A9902>",
"<A2897>",
"<A6524>",
"<A3685>",
"<A9585>",
"<A8... | 23 | <A9585> | 35 | false | dispatch | pfsp_step_policy_v1 | 29 | <A9585> | <A9585> |
train_000000 | 0 | 50 | 5 | 50 | 16 | {
"step_idx": 16,
"total_steps": 50,
"scheduled_ratio": 0.32,
"current_cmax": 2079,
"total_remaining_work": 17918,
"unfinished_jobs_count": 34,
"unfinished_jobs_ratio": 0.68,
"machine_ready_min": 1324,
"machine_ready_mean": 1699.2,
"machine_ready_max": 2079,
"machine_ready_std": 257.7141051631,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
32,
34,
37,
38,
39,
42,
43,
44,
45,
46
] | [
"<A9516>",
"<A3231>",
"<A3371>",
"<A3296>",
"<A0676>",
"<A3153>",
"<A7363>",
"<A6643>",
"<A5791>",
"<A4718>",
"<A4265>",
"<A7374>",
"<A6866>",
"<A4652>",
"<A9503>",
"<A1714>",
"<A0204>",
"<A8023>",
"<A3498>",
"<A7700>",
"<A1204>",
"<A7411>",
"<A9070>",
"<A6172>",
"<A6... | {
"<A9516>": 42,
"<A3231>": 23,
"<A3371>": 5,
"<A3296>": 1,
"<A0676>": 34,
"<A3153>": 43,
"<A7363>": 25,
"<A6643>": 24,
"<A5791>": 12,
"<A4718>": 16,
"<A4265>": 32,
"<A7374>": 26,
"<A6866>": 18,
"<A4652>": 37,
"<A9503>": 2,
"<A1714>": 17,
"<A0204>": 44,
"<A8023>": 28,
"<A3498>": 22... | [
"<A0204>",
"<A7700>",
"<A6172>",
"<A0676>",
"<A3371>",
"<A4946>",
"<A2207>",
"<A0568>",
"<A1204>",
"<A1714>",
"<A6866>",
"<A9070>",
"<A8023>",
"<A1014>",
"<A7363>",
"<A3022>",
"<A9503>",
"<A2822>",
"<A3498>",
"<A3296>",
"<A7411>",
"<A4265>",
"<A6643>",
"<A5791>",
"<A4... | 6 | <A2207> | 34 | false | dispatch | pfsp_step_policy_v1 | 39 | <A2207> | <A2207> |
train_000000 | 0 | 50 | 5 | 50 | 17 | {
"step_idx": 17,
"total_steps": 50,
"scheduled_ratio": 0.34,
"current_cmax": 2147,
"total_remaining_work": 17576,
"unfinished_jobs_count": 33,
"unfinished_jobs_ratio": 0.66,
"machine_ready_min": 1380,
"machine_ready_mean": 1767.6,
"machine_ready_max": 2147,
"machine_ready_std": 257.1198942128,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
2,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
32,
34,
37,
38,
42,
43,
44,
45,
46
] | [
"<A3674>",
"<A1387>",
"<A7529>",
"<A0373>",
"<A2232>",
"<A4914>",
"<A0382>",
"<A0174>",
"<A7946>",
"<A6198>",
"<A8783>",
"<A4877>",
"<A2577>",
"<A9545>",
"<A5553>",
"<A2891>",
"<A8616>",
"<A1867>",
"<A1658>",
"<A6110>",
"<A0669>",
"<A5178>",
"<A5000>",
"<A1444>",
"<A0... | {
"<A3674>": 1,
"<A1387>": 3,
"<A7529>": 18,
"<A0373>": 11,
"<A2232>": 5,
"<A4914>": 42,
"<A0382>": 43,
"<A0174>": 25,
"<A7946>": 46,
"<A6198>": 31,
"<A8783>": 44,
"<A4877>": 37,
"<A2577>": 34,
"<A9545>": 16,
"<A5553>": 20,
"<A2891>": 30,
"<A8616>": 38,
"<A1867>": 26,
"<A1658>": 15... | [
"<A8783>",
"<A7946>",
"<A1355>",
"<A2577>",
"<A2232>",
"<A1439>",
"<A1444>",
"<A1387>",
"<A9232>",
"<A7529>",
"<A0373>",
"<A1457>",
"<A6198>",
"<A0174>",
"<A9477>",
"<A0738>",
"<A5553>",
"<A0669>",
"<A3674>",
"<A2891>",
"<A3168>",
"<A4889>",
"<A5000>",
"<A4877>",
"<A0... | 15 | <A0738> | 33 | false | dispatch | pfsp_step_policy_v1 | 2 | <A0738> | <A0738> |
train_000000 | 0 | 50 | 5 | 50 | 18 | {
"step_idx": 18,
"total_steps": 50,
"scheduled_ratio": 0.36,
"current_cmax": 2245,
"total_remaining_work": 17048,
"unfinished_jobs_count": 32,
"unfinished_jobs_ratio": 0.64,
"machine_ready_min": 1527,
"machine_ready_mean": 1873.2,
"machine_ready_max": 2245,
"machine_ready_std": 249.2231128928,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
32,
34,
37,
38,
42,
43,
44,
45,
46
] | [
"<A5044>",
"<A4644>",
"<A9470>",
"<A2526>",
"<A4352>",
"<A3763>",
"<A7922>",
"<A7655>",
"<A5449>",
"<A0675>",
"<A1511>",
"<A3039>",
"<A2524>",
"<A6389>",
"<A0761>",
"<A3923>",
"<A0151>",
"<A6758>",
"<A2733>",
"<A2141>",
"<A5016>",
"<A2441>",
"<A8396>",
"<A9773>",
"<A9... | {
"<A5044>": 31,
"<A4644>": 42,
"<A9470>": 23,
"<A2526>": 20,
"<A4352>": 17,
"<A3763>": 28,
"<A7922>": 19,
"<A7655>": 0,
"<A5449>": 22,
"<A0675>": 26,
"<A1511>": 46,
"<A3039>": 34,
"<A2524>": 6,
"<A6389>": 30,
"<A0761>": 18,
"<A3923>": 16,
"<A0151>": 4,
"<A6758>": 44,
"<A2733>": 7,... | [
"<A6758>",
"<A1511>",
"<A7655>",
"<A3039>",
"<A5016>",
"<A4946>",
"<A7922>",
"<A8396>",
"<A4352>",
"<A0761>",
"<A9228>",
"<A3763>",
"<A5044>",
"<A1775>",
"<A2524>",
"<A2526>",
"<A5449>",
"<A2451>",
"<A6389>",
"<A2141>",
"<A9114>",
"<A9773>",
"<A0792>",
"<A9649>",
"<A3... | 19 | <A2141> | 32 | false | dispatch | pfsp_step_policy_v1 | 32 | <A2141> | <A2141> |
train_000000 | 0 | 50 | 5 | 50 | 19 | {
"step_idx": 19,
"total_steps": 50,
"scheduled_ratio": 0.38,
"current_cmax": 2355,
"total_remaining_work": 16516,
"unfinished_jobs_count": 31,
"unfinished_jobs_ratio": 0.62,
"machine_ready_min": 1634,
"machine_ready_mean": 1979.6,
"machine_ready_max": 2355,
"machine_ready_std": 253.929596542,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
34,
37,
38,
42,
43,
44,
45,
46
] | [
"<A8102>",
"<A2978>",
"<A9121>",
"<A3552>",
"<A5253>",
"<A4806>",
"<A5259>",
"<A0455>",
"<A7966>",
"<A5857>",
"<A5888>",
"<A1067>",
"<A6644>",
"<A7559>",
"<A5404>",
"<A2746>",
"<A5483>",
"<A0104>",
"<A8240>",
"<A1504>",
"<A2856>",
"<A5531>",
"<A0433>",
"<A7103>",
"<A2... | {
"<A8102>": 44,
"<A2978>": 18,
"<A9121>": 23,
"<A3552>": 4,
"<A5253>": 46,
"<A4806>": 3,
"<A5259>": 15,
"<A0455>": 1,
"<A7966>": 7,
"<A5857>": 25,
"<A5888>": 20,
"<A1067>": 24,
"<A6644>": 22,
"<A7559>": 43,
"<A5404>": 0,
"<A2746>": 34,
"<A5483>": 5,
"<A0104>": 11,
"<A8240>": 30,
... | [
"<A8102>",
"<A5253>",
"<A5404>",
"<A2746>",
"<A5483>",
"<A5531>",
"<A1504>",
"<A4806>",
"<A4781>",
"<A2978>",
"<A0104>",
"<A2096>",
"<A0433>",
"<A5857>",
"<A7103>",
"<A5888>",
"<A6644>",
"<A0455>",
"<A8240>",
"<A1067>",
"<A2856>",
"<A4858>",
"<A7559>",
"<A7220>",
"<A9... | 21 | <A4858> | 31 | false | dispatch | pfsp_step_policy_v1 | 37 | <A4858> | <A4858> |
train_000000 | 0 | 50 | 5 | 50 | 20 | {
"step_idx": 20,
"total_steps": 50,
"scheduled_ratio": 0.4,
"current_cmax": 2477,
"total_remaining_work": 15978,
"unfinished_jobs_count": 30,
"unfinished_jobs_ratio": 0.6,
"machine_ready_min": 1752,
"machine_ready_mean": 2087.2,
"machine_ready_max": 2477,
"machine_ready_std": 257.7047923497,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
1,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
34,
38,
42,
43,
44,
45,
46
] | [
"<A9426>",
"<A2835>",
"<A1068>",
"<A3902>",
"<A7615>",
"<A5078>",
"<A5829>",
"<A2804>",
"<A8324>",
"<A3066>",
"<A2647>",
"<A0128>",
"<A4270>",
"<A2813>",
"<A2012>",
"<A0496>",
"<A7743>",
"<A7719>",
"<A8499>",
"<A0310>",
"<A5616>",
"<A9669>",
"<A2627>",
"<A3484>",
"<A1... | {
"<A9426>": 24,
"<A2835>": 5,
"<A1068>": 3,
"<A3902>": 25,
"<A7615>": 22,
"<A5078>": 23,
"<A5829>": 1,
"<A2804>": 45,
"<A8324>": 4,
"<A3066>": 43,
"<A2647>": 28,
"<A0128>": 38,
"<A4270>": 34,
"<A2813>": 42,
"<A2012>": 30,
"<A0496>": 6,
"<A7743>": 7,
"<A7719>": 12,
"<A8499>": 11,
... | [
"<A2627>",
"<A5616>",
"<A3484>",
"<A4270>",
"<A2835>",
"<A2804>",
"<A0310>",
"<A1068>",
"<A5347>",
"<A9221>",
"<A8499>",
"<A2647>",
"<A9669>",
"<A3902>",
"<A0496>",
"<A1291>",
"<A7615>",
"<A5829>",
"<A2012>",
"<A9426>",
"<A7719>",
"<A3066>",
"<A8943>",
"<A5078>",
"<A0... | 17 | <A5829> | 30 | false | dispatch | pfsp_step_policy_v1 | 1 | <A5829> | <A5829> |
train_000000 | 0 | 50 | 5 | 50 | 21 | {
"step_idx": 21,
"total_steps": 50,
"scheduled_ratio": 0.42,
"current_cmax": 2582,
"total_remaining_work": 15454,
"unfinished_jobs_count": 29,
"unfinished_jobs_ratio": 0.58,
"machine_ready_min": 1829,
"machine_ready_mean": 2192,
"machine_ready_max": 2582,
"machine_ready_std": 263.1949847546,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
20,
22,
23,
24,
25,
26,
28,
30,
31,
34,
38,
42,
43,
44,
45,
46
] | [
"<A7294>",
"<A7279>",
"<A4819>",
"<A4145>",
"<A7935>",
"<A1427>",
"<A6336>",
"<A1287>",
"<A1236>",
"<A3318>",
"<A4765>",
"<A1212>",
"<A5030>",
"<A0985>",
"<A3645>",
"<A2097>",
"<A5377>",
"<A3848>",
"<A4486>",
"<A9816>",
"<A0495>",
"<A0548>",
"<A9777>",
"<A2672>",
"<A3... | {
"<A7294>": 38,
"<A7279>": 6,
"<A4819>": 44,
"<A4145>": 22,
"<A7935>": 4,
"<A1427>": 15,
"<A6336>": 31,
"<A1287>": 16,
"<A1236>": 30,
"<A3318>": 18,
"<A4765>": 46,
"<A1212>": 25,
"<A5030>": 24,
"<A0985>": 12,
"<A3645>": 20,
"<A2097>": 19,
"<A5377>": 26,
"<A3848>": 7,
"<A4486>": 0,... | [
"<A4819>",
"<A4765>",
"<A4486>",
"<A7069>",
"<A9104>",
"<A0495>",
"<A2097>",
"<A3733>",
"<A9777>",
"<A3318>",
"<A7011>",
"<A0548>",
"<A6336>",
"<A1212>",
"<A7279>",
"<A3645>",
"<A4145>",
"<A1236>",
"<A5030>",
"<A0985>",
"<A9816>",
"<A1287>",
"<A5915>",
"<A5377>",
"<A3... | 15 | <A3645> | 29 | false | dispatch | pfsp_step_policy_v1 | 20 | <A3645> | <A3645> |
train_000000 | 0 | 50 | 5 | 50 | 22 | {
"step_idx": 22,
"total_steps": 50,
"scheduled_ratio": 0.44,
"current_cmax": 2682,
"total_remaining_work": 14947,
"unfinished_jobs_count": 28,
"unfinished_jobs_ratio": 0.56,
"machine_ready_min": 1961,
"machine_ready_mean": 2293.4,
"machine_ready_max": 2682,
"machine_ready_std": 253.5086586292,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
22,
23,
24,
25,
26,
28,
30,
31,
34,
38,
42,
43,
44,
45,
46
] | [
"<A7802>",
"<A2046>",
"<A6619>",
"<A8785>",
"<A0277>",
"<A3335>",
"<A4402>",
"<A3300>",
"<A2416>",
"<A1308>",
"<A6828>",
"<A7210>",
"<A3249>",
"<A0404>",
"<A1371>",
"<A6602>",
"<A0088>",
"<A1046>",
"<A2861>",
"<A1728>",
"<A9613>",
"<A0750>",
"<A9649>",
"<A4326>",
"<A3... | {
"<A7802>": 28,
"<A2046>": 24,
"<A6619>": 42,
"<A8785>": 31,
"<A0277>": 38,
"<A3335>": 5,
"<A4402>": 3,
"<A3300>": 17,
"<A2416>": 46,
"<A1308>": 4,
"<A6828>": 15,
"<A7210>": 12,
"<A3249>": 44,
"<A0404>": 7,
"<A1371>": 30,
"<A6602>": 34,
"<A0088>": 25,
"<A1046>": 18,
"<A2861>": 22,... | [
"<A3249>",
"<A2416>",
"<A3224>",
"<A6602>",
"<A3335>",
"<A1456>",
"<A4326>",
"<A4402>",
"<A3300>",
"<A1046>",
"<A9649>",
"<A7802>",
"<A8785>",
"<A0088>",
"<A9613>",
"<A2861>",
"<A1371>",
"<A2046>",
"<A7210>",
"<A8835>",
"<A0750>",
"<A3593>",
"<A1728>",
"<A0404>",
"<A6... | 15 | <A2861> | 28 | false | dispatch | pfsp_step_policy_v1 | 22 | <A2861> | <A2861> |
train_000000 | 0 | 50 | 5 | 50 | 23 | {
"step_idx": 23,
"total_steps": 50,
"scheduled_ratio": 0.46,
"current_cmax": 2783,
"total_remaining_work": 14406,
"unfinished_jobs_count": 27,
"unfinished_jobs_ratio": 0.54,
"machine_ready_min": 2074,
"machine_ready_mean": 2402,
"machine_ready_max": 2783,
"machine_ready_std": 246.9291396332,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
23,
24,
25,
26,
28,
30,
31,
34,
38,
42,
43,
44,
45,
46
] | [
"<A6796>",
"<A4733>",
"<A4714>",
"<A8426>",
"<A3604>",
"<A7271>",
"<A7512>",
"<A8663>",
"<A7260>",
"<A9032>",
"<A5553>",
"<A7152>",
"<A3696>",
"<A1180>",
"<A9191>",
"<A7654>",
"<A4327>",
"<A3225>",
"<A7756>",
"<A0750>",
"<A4209>",
"<A1850>",
"<A2609>",
"<A8657>",
"<A2... | {
"<A6796>": 28,
"<A4733>": 43,
"<A4714>": 15,
"<A8426>": 11,
"<A3604>": 5,
"<A7271>": 3,
"<A7512>": 23,
"<A8663>": 16,
"<A7260>": 17,
"<A9032>": 6,
"<A5553>": 7,
"<A7152>": 26,
"<A3696>": 4,
"<A1180>": 38,
"<A9191>": 0,
"<A7654>": 25,
"<A4327>": 24,
"<A3225>": 19,
"<A7756>": 46,
... | [
"<A1850>",
"<A7756>",
"<A9191>",
"<A2609>",
"<A3604>",
"<A2217>",
"<A3225>",
"<A7271>",
"<A7260>",
"<A2044>",
"<A8426>",
"<A6796>",
"<A4209>",
"<A7654>",
"<A9032>",
"<A8657>",
"<A4327>",
"<A0750>",
"<A4733>",
"<A8663>",
"<A7512>",
"<A7152>",
"<A5553>",
"<A2246>",
"<A1... | 23 | <A2246> | 27 | false | dispatch | pfsp_step_policy_v1 | 42 | <A2246> | <A2246> |
train_000000 | 0 | 50 | 5 | 50 | 24 | {
"step_idx": 24,
"total_steps": 50,
"scheduled_ratio": 0.48,
"current_cmax": 2919,
"total_remaining_work": 13901,
"unfinished_jobs_count": 26,
"unfinished_jobs_ratio": 0.52,
"machine_ready_min": 2219,
"machine_ready_mean": 2503,
"machine_ready_max": 2919,
"machine_ready_std": 244.7790840738,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
7,
11,
12,
15,
16,
17,
18,
19,
23,
24,
25,
26,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A1161>",
"<A5112>",
"<A7121>",
"<A4035>",
"<A7303>",
"<A4818>",
"<A4196>",
"<A9183>",
"<A1560>",
"<A8109>",
"<A3019>",
"<A7677>",
"<A8562>",
"<A2097>",
"<A1139>",
"<A5954>",
"<A2740>",
"<A6675>",
"<A7503>",
"<A8273>",
"<A0508>",
"<A8657>",
"<A1840>",
"<A6293>",
"<A2... | {
"<A1161>": 12,
"<A5112>": 38,
"<A7121>": 26,
"<A4035>": 15,
"<A7303>": 19,
"<A4818>": 45,
"<A4196>": 4,
"<A9183>": 23,
"<A1560>": 28,
"<A8109>": 18,
"<A3019>": 30,
"<A7677>": 7,
"<A8562>": 5,
"<A2097>": 3,
"<A1139>": 6,
"<A5954>": 34,
"<A2740>": 16,
"<A6675>": 25,
"<A7503>": 17,
... | [
"<A8273>",
"<A2224>",
"<A6069>",
"<A5954>",
"<A8562>",
"<A4818>",
"<A7303>",
"<A2097>",
"<A7503>",
"<A8109>",
"<A1840>",
"<A1560>",
"<A0508>",
"<A6675>",
"<A1139>",
"<A3019>",
"<A8657>",
"<A1161>",
"<A6293>",
"<A2740>",
"<A9183>",
"<A7121>",
"<A7677>",
"<A5112>",
"<A4... | 22 | <A7677> | 26 | false | dispatch | pfsp_step_policy_v1 | 7 | <A7677> | <A7677> |
train_000000 | 0 | 50 | 5 | 50 | 25 | {
"step_idx": 25,
"total_steps": 50,
"scheduled_ratio": 0.5,
"current_cmax": 3051,
"total_remaining_work": 13356,
"unfinished_jobs_count": 25,
"unfinished_jobs_ratio": 0.5,
"machine_ready_min": 2294,
"machine_ready_mean": 2612,
"machine_ready_max": 3051,
"machine_ready_std": 266.5610624229,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
11,
12,
15,
16,
17,
18,
19,
23,
24,
25,
26,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A1226>",
"<A1903>",
"<A6691>",
"<A7662>",
"<A6805>",
"<A4373>",
"<A9771>",
"<A7037>",
"<A7992>",
"<A4556>",
"<A3339>",
"<A0652>",
"<A2897>",
"<A4719>",
"<A0574>",
"<A2589>",
"<A7201>",
"<A2968>",
"<A2016>",
"<A1565>",
"<A8048>",
"<A5050>",
"<A4003>",
"<A6566>",
"<A9... | {
"<A1226>": 15,
"<A1903>": 17,
"<A6691>": 4,
"<A7662>": 16,
"<A6805>": 34,
"<A4373>": 24,
"<A9771>": 3,
"<A7037>": 44,
"<A7992>": 30,
"<A4556>": 12,
"<A3339>": 18,
"<A0652>": 5,
"<A2897>": 26,
"<A4719>": 31,
"<A0574>": 45,
"<A2589>": 25,
"<A7201>": 46,
"<A2968>": 43,
"<A2016>": 19... | [
"<A7037>",
"<A7201>",
"<A9689>",
"<A6805>",
"<A0652>",
"<A0574>",
"<A2016>",
"<A9771>",
"<A1903>",
"<A3339>",
"<A8048>",
"<A5050>",
"<A4719>",
"<A2589>",
"<A1565>",
"<A7992>",
"<A4373>",
"<A4556>",
"<A2968>",
"<A7662>",
"<A6566>",
"<A2897>",
"<A4003>",
"<A1226>",
"<A6... | 21 | <A2897> | 25 | false | dispatch | pfsp_step_policy_v1 | 26 | <A2897> | <A2897> |
train_000000 | 0 | 50 | 5 | 50 | 26 | {
"step_idx": 26,
"total_steps": 50,
"scheduled_ratio": 0.52,
"current_cmax": 3182,
"total_remaining_work": 12812,
"unfinished_jobs_count": 24,
"unfinished_jobs_ratio": 0.48,
"machine_ready_min": 2409,
"machine_ready_mean": 2720.8,
"machine_ready_max": 3182,
"machine_ready_std": 276.5309385946,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
4,
5,
6,
11,
12,
15,
16,
17,
18,
19,
23,
24,
25,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A7641>",
"<A8205>",
"<A1819>",
"<A9941>",
"<A9500>",
"<A3988>",
"<A7076>",
"<A7688>",
"<A4350>",
"<A5397>",
"<A7179>",
"<A9065>",
"<A5919>",
"<A2729>",
"<A9071>",
"<A2030>",
"<A0685>",
"<A8942>",
"<A7897>",
"<A1738>",
"<A5611>",
"<A0909>",
"<A1531>",
"<A9919>"
] | {
"<A7641>": 28,
"<A8205>": 15,
"<A1819>": 3,
"<A9941>": 5,
"<A9500>": 38,
"<A3988>": 31,
"<A7076>": 44,
"<A7688>": 34,
"<A4350>": 46,
"<A5397>": 4,
"<A7179>": 17,
"<A9065>": 43,
"<A5919>": 16,
"<A2729>": 18,
"<A9071>": 19,
"<A2030>": 6,
"<A0685>": 23,
"<A8942>": 25,
"<A7897>": 24,... | [
"<A7076>",
"<A4350>",
"<A5611>",
"<A7688>",
"<A9941>",
"<A0909>",
"<A9071>",
"<A1819>",
"<A7179>",
"<A2729>",
"<A9919>",
"<A7641>",
"<A3988>",
"<A8942>",
"<A2030>",
"<A1738>",
"<A7897>",
"<A1531>",
"<A9065>",
"<A5919>",
"<A0685>",
"<A9500>",
"<A8205>",
"<A5397>"
] | 23 | <A5397> | 24 | false | dispatch | pfsp_step_policy_v1 | 4 | <A5397> | <A5397> |
train_000000 | 0 | 50 | 5 | 50 | 27 | {
"step_idx": 27,
"total_steps": 50,
"scheduled_ratio": 0.54,
"current_cmax": 3323,
"total_remaining_work": 12246,
"unfinished_jobs_count": 23,
"unfinished_jobs_ratio": 0.46,
"machine_ready_min": 2476,
"machine_ready_mean": 2834,
"machine_ready_max": 3323,
"machine_ready_std": 296.720744135,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
6,
11,
12,
15,
16,
17,
18,
19,
23,
24,
25,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A0612>",
"<A1571>",
"<A2735>",
"<A1093>",
"<A9915>",
"<A5647>",
"<A5375>",
"<A8999>",
"<A6792>",
"<A7616>",
"<A7019>",
"<A9291>",
"<A7171>",
"<A8511>",
"<A5263>",
"<A9175>",
"<A8982>",
"<A7214>",
"<A2326>",
"<A6754>",
"<A6425>",
"<A1055>",
"<A6789>"
] | {
"<A0612>": 23,
"<A1571>": 5,
"<A2735>": 6,
"<A1093>": 17,
"<A9915>": 19,
"<A5647>": 24,
"<A5375>": 16,
"<A8999>": 0,
"<A6792>": 12,
"<A7616>": 43,
"<A7019>": 25,
"<A9291>": 38,
"<A7171>": 30,
"<A8511>": 28,
"<A5263>": 3,
"<A9175>": 34,
"<A8982>": 31,
"<A7214>": 44,
"<A2326>": 46,... | [
"<A7214>",
"<A2326>",
"<A8999>",
"<A9175>",
"<A1571>",
"<A6754>",
"<A9915>",
"<A5263>",
"<A1093>",
"<A6789>",
"<A1055>",
"<A8511>",
"<A8982>",
"<A7019>",
"<A2735>",
"<A7171>",
"<A5647>",
"<A6792>",
"<A7616>",
"<A5375>",
"<A0612>",
"<A9291>",
"<A6425>"
] | 16 | <A5647> | 23 | false | dispatch | pfsp_step_policy_v1 | 24 | <A5647> | <A5647> |
train_000000 | 0 | 50 | 5 | 50 | 28 | {
"step_idx": 28,
"total_steps": 50,
"scheduled_ratio": 0.56,
"current_cmax": 3433,
"total_remaining_work": 11704,
"unfinished_jobs_count": 22,
"unfinished_jobs_ratio": 0.44,
"machine_ready_min": 2590,
"machine_ready_mean": 2942.4,
"machine_ready_max": 3433,
"machine_ready_std": 298.5870727275,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
6,
11,
12,
15,
16,
17,
18,
19,
23,
25,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A1941>",
"<A4819>",
"<A7528>",
"<A7374>",
"<A2235>",
"<A5279>",
"<A1752>",
"<A2534>",
"<A9799>",
"<A3548>",
"<A6727>",
"<A6228>",
"<A3845>",
"<A6552>",
"<A1189>",
"<A8270>",
"<A5240>",
"<A4520>",
"<A6167>",
"<A7305>",
"<A1579>",
"<A1534>"
] | {
"<A1941>": 45,
"<A4819>": 19,
"<A7528>": 6,
"<A7374>": 34,
"<A2235>": 15,
"<A5279>": 43,
"<A1752>": 38,
"<A2534>": 12,
"<A9799>": 5,
"<A3548>": 44,
"<A6727>": 30,
"<A6228>": 46,
"<A3845>": 28,
"<A6552>": 25,
"<A1189>": 16,
"<A8270>": 17,
"<A5240>": 0,
"<A4520>": 11,
"<A6167>": 18... | [
"<A3548>",
"<A6228>",
"<A5240>",
"<A7374>",
"<A9799>",
"<A1941>",
"<A4819>",
"<A1534>",
"<A8270>",
"<A6167>",
"<A4520>",
"<A3845>",
"<A1579>",
"<A6552>",
"<A7528>",
"<A6727>",
"<A2534>",
"<A5279>",
"<A1189>",
"<A7305>",
"<A1752>",
"<A2235>"
] | 19 | <A7305> | 22 | false | dispatch | pfsp_step_policy_v1 | 23 | <A7305> | <A7305> |
train_000000 | 0 | 50 | 5 | 50 | 29 | {
"step_idx": 29,
"total_steps": 50,
"scheduled_ratio": 0.58,
"current_cmax": 3561,
"total_remaining_work": 11124,
"unfinished_jobs_count": 21,
"unfinished_jobs_ratio": 0.42,
"machine_ready_min": 2700,
"machine_ready_mean": 3058.4,
"machine_ready_max": 3561,
"machine_ready_std": 309.7086372706,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
6,
11,
12,
15,
16,
17,
18,
19,
25,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A5305>",
"<A8331>",
"<A0139>",
"<A4341>",
"<A2537>",
"<A3265>",
"<A4315>",
"<A1422>",
"<A3269>",
"<A8393>",
"<A0897>",
"<A9740>",
"<A3176>",
"<A8270>",
"<A0397>",
"<A8630>",
"<A5992>",
"<A7490>",
"<A2132>",
"<A5724>",
"<A2733>"
] | {
"<A5305>": 17,
"<A8331>": 18,
"<A0139>": 31,
"<A4341>": 45,
"<A2537>": 34,
"<A3265>": 43,
"<A4315>": 19,
"<A1422>": 5,
"<A3269>": 6,
"<A8393>": 44,
"<A0897>": 46,
"<A9740>": 16,
"<A3176>": 38,
"<A8270>": 30,
"<A0397>": 12,
"<A8630>": 11,
"<A5992>": 15,
"<A7490>": 28,
"<A2132>": 0... | [
"<A8393>",
"<A0897>",
"<A2132>",
"<A2537>",
"<A1422>",
"<A4341>",
"<A4315>",
"<A2733>",
"<A5305>",
"<A8331>",
"<A8630>",
"<A7490>",
"<A0139>",
"<A5724>",
"<A3269>",
"<A8270>",
"<A0397>",
"<A3265>",
"<A9740>",
"<A3176>",
"<A5992>"
] | 14 | <A3269> | 21 | false | dispatch | pfsp_step_policy_v1 | 6 | <A3269> | <A3269> |
train_000000 | 0 | 50 | 5 | 50 | 30 | {
"step_idx": 30,
"total_steps": 50,
"scheduled_ratio": 0.6,
"current_cmax": 3657,
"total_remaining_work": 10547,
"unfinished_jobs_count": 20,
"unfinished_jobs_ratio": 0.4,
"machine_ready_min": 2786,
"machine_ready_mean": 3173.8,
"machine_ready_max": 3657,
"machine_ready_std": 309.125476142,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
15,
16,
17,
18,
19,
25,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A1204>",
"<A9739>",
"<A3052>",
"<A5636>",
"<A8913>",
"<A6134>",
"<A5029>",
"<A9810>",
"<A2114>",
"<A5617>",
"<A3810>",
"<A6226>",
"<A2350>",
"<A0444>",
"<A3638>",
"<A7459>",
"<A0216>",
"<A7324>",
"<A1131>",
"<A4840>"
] | {
"<A1204>": 16,
"<A9739>": 45,
"<A3052>": 30,
"<A5636>": 19,
"<A8913>": 46,
"<A6134>": 3,
"<A5029>": 18,
"<A9810>": 17,
"<A2114>": 44,
"<A5617>": 11,
"<A3810>": 28,
"<A6226>": 15,
"<A2350>": 38,
"<A0444>": 12,
"<A3638>": 34,
"<A7459>": 31,
"<A0216>": 0,
"<A7324>": 25,
"<A1131>": 4... | [
"<A2114>",
"<A8913>",
"<A0216>",
"<A3638>",
"<A4840>",
"<A9739>",
"<A5636>",
"<A6134>",
"<A9810>",
"<A5029>",
"<A5617>",
"<A3810>",
"<A7459>",
"<A7324>",
"<A3052>",
"<A0444>",
"<A1131>",
"<A1204>",
"<A2350>",
"<A6226>"
] | 13 | <A7324> | 20 | false | dispatch | pfsp_step_policy_v1 | 25 | <A7324> | <A7324> |
train_000000 | 0 | 50 | 5 | 50 | 31 | {
"step_idx": 31,
"total_steps": 50,
"scheduled_ratio": 0.62,
"current_cmax": 3753,
"total_remaining_work": 9979,
"unfinished_jobs_count": 19,
"unfinished_jobs_ratio": 0.38,
"machine_ready_min": 2886,
"machine_ready_mean": 3287.4,
"machine_ready_max": 3753,
"machine_ready_std": 304.9502254467,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
15,
16,
17,
18,
19,
28,
30,
31,
34,
38,
43,
44,
45,
46
] | [
"<A4585>",
"<A2003>",
"<A8228>",
"<A7868>",
"<A9243>",
"<A3001>",
"<A7553>",
"<A4877>",
"<A9614>",
"<A1207>",
"<A7983>",
"<A6624>",
"<A8486>",
"<A8201>",
"<A3314>",
"<A7388>",
"<A1809>",
"<A0363>",
"<A4180>"
] | {
"<A4585>": 11,
"<A2003>": 19,
"<A8228>": 15,
"<A7868>": 43,
"<A9243>": 3,
"<A3001>": 28,
"<A7553>": 31,
"<A4877>": 12,
"<A9614>": 45,
"<A1207>": 5,
"<A7983>": 44,
"<A6624>": 38,
"<A8486>": 17,
"<A8201>": 16,
"<A3314>": 18,
"<A7388>": 30,
"<A1809>": 46,
"<A0363>": 0,
"<A4180>": 34... | [
"<A7983>",
"<A1809>",
"<A0363>",
"<A4180>",
"<A1207>",
"<A9614>",
"<A2003>",
"<A9243>",
"<A8486>",
"<A3314>",
"<A4585>",
"<A3001>",
"<A7553>",
"<A7388>",
"<A4877>",
"<A7868>",
"<A8201>",
"<A6624>",
"<A8228>"
] | 17 | <A6624> | 19 | false | dispatch | pfsp_step_policy_v1 | 38 | <A6624> | <A6624> |
train_000000 | 0 | 50 | 5 | 50 | 32 | {
"step_idx": 32,
"total_steps": 50,
"scheduled_ratio": 0.64,
"current_cmax": 3892,
"total_remaining_work": 9418,
"unfinished_jobs_count": 18,
"unfinished_jobs_ratio": 0.36,
"machine_ready_min": 3021,
"machine_ready_mean": 3399.6,
"machine_ready_max": 3892,
"machine_ready_std": 303.3398094547,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
15,
16,
17,
18,
19,
28,
30,
31,
34,
43,
44,
45,
46
] | [
"<A8443>",
"<A1862>",
"<A5231>",
"<A1977>",
"<A5065>",
"<A2980>",
"<A3549>",
"<A5758>",
"<A1968>",
"<A7237>",
"<A7483>",
"<A8586>",
"<A4553>",
"<A7308>",
"<A2800>",
"<A5134>",
"<A4574>",
"<A8237>"
] | {
"<A8443>": 44,
"<A1862>": 12,
"<A5231>": 15,
"<A1977>": 46,
"<A5065>": 30,
"<A2980>": 18,
"<A3549>": 28,
"<A5758>": 31,
"<A1968>": 16,
"<A7237>": 19,
"<A7483>": 43,
"<A8586>": 17,
"<A4553>": 11,
"<A7308>": 34,
"<A2800>": 5,
"<A5134>": 3,
"<A4574>": 45,
"<A8237>": 0
} | [
"<A8443>",
"<A1977>",
"<A8237>",
"<A7308>",
"<A2800>",
"<A4574>",
"<A7237>",
"<A5134>",
"<A8586>",
"<A2980>",
"<A4553>",
"<A3549>",
"<A5758>",
"<A5065>",
"<A1862>",
"<A7483>",
"<A1968>",
"<A5231>"
] | 15 | <A7483> | 18 | false | dispatch | pfsp_step_policy_v1 | 43 | <A7483> | <A7483> |
train_000000 | 0 | 50 | 5 | 50 | 33 | {
"step_idx": 33,
"total_steps": 50,
"scheduled_ratio": 0.66,
"current_cmax": 4014,
"total_remaining_work": 8785,
"unfinished_jobs_count": 17,
"unfinished_jobs_ratio": 0.34,
"machine_ready_min": 3163,
"machine_ready_mean": 3526.2,
"machine_ready_max": 4014,
"machine_ready_std": 305.5954188138,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
15,
16,
17,
18,
19,
28,
30,
31,
34,
44,
45,
46
] | [
"<A7387>",
"<A9582>",
"<A7154>",
"<A7445>",
"<A0683>",
"<A8423>",
"<A7745>",
"<A5664>",
"<A1640>",
"<A5194>",
"<A1373>",
"<A4116>",
"<A4499>",
"<A8136>",
"<A5697>",
"<A9940>",
"<A7959>"
] | {
"<A7387>": 15,
"<A9582>": 44,
"<A7154>": 12,
"<A7445>": 31,
"<A0683>": 30,
"<A8423>": 45,
"<A7745>": 3,
"<A5664>": 5,
"<A1640>": 11,
"<A5194>": 17,
"<A1373>": 28,
"<A4116>": 19,
"<A4499>": 46,
"<A8136>": 16,
"<A5697>": 0,
"<A9940>": 34,
"<A7959>": 18
} | [
"<A9582>",
"<A4499>",
"<A5697>",
"<A9940>",
"<A5664>",
"<A8423>",
"<A4116>",
"<A7745>",
"<A5194>",
"<A7959>",
"<A1640>",
"<A1373>",
"<A7445>",
"<A0683>",
"<A7154>",
"<A8136>",
"<A7387>"
] | 9 | <A7959> | 17 | false | dispatch | pfsp_step_policy_v1 | 18 | <A7959> | <A7959> |
train_000000 | 0 | 50 | 5 | 50 | 34 | {
"step_idx": 34,
"total_steps": 50,
"scheduled_ratio": 0.68,
"current_cmax": 4100,
"total_remaining_work": 8229,
"unfinished_jobs_count": 16,
"unfinished_jobs_ratio": 0.32,
"machine_ready_min": 3289,
"machine_ready_mean": 3637.4,
"machine_ready_max": 4100,
"machine_ready_std": 292.0997090036,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
15,
16,
17,
19,
28,
30,
31,
34,
44,
45,
46
] | [
"<A6072>",
"<A7591>",
"<A6384>",
"<A3278>",
"<A4866>",
"<A0865>",
"<A6851>",
"<A3889>",
"<A4615>",
"<A4938>",
"<A7180>",
"<A8024>",
"<A3786>",
"<A1363>",
"<A5483>",
"<A4947>"
] | {
"<A6072>": 44,
"<A7591>": 3,
"<A6384>": 45,
"<A3278>": 30,
"<A4866>": 46,
"<A0865>": 12,
"<A6851>": 5,
"<A3889>": 11,
"<A4615>": 28,
"<A4938>": 16,
"<A7180>": 31,
"<A8024>": 0,
"<A3786>": 19,
"<A1363>": 34,
"<A5483>": 15,
"<A4947>": 17
} | [
"<A6072>",
"<A4866>",
"<A8024>",
"<A1363>",
"<A6851>",
"<A6384>",
"<A3786>",
"<A7591>",
"<A4947>",
"<A3889>",
"<A4615>",
"<A7180>",
"<A3278>",
"<A0865>",
"<A4938>",
"<A5483>"
] | 15 | <A5483> | 16 | false | dispatch | pfsp_step_policy_v1 | 15 | <A5483> | <A5483> |
train_000000 | 0 | 50 | 5 | 50 | 35 | {
"step_idx": 35,
"total_steps": 50,
"scheduled_ratio": 0.7,
"current_cmax": 4240,
"total_remaining_work": 7597,
"unfinished_jobs_count": 15,
"unfinished_jobs_ratio": 0.3,
"machine_ready_min": 3409,
"machine_ready_mean": 3763.8,
"machine_ready_max": 4240,
"machine_ready_std": 300.3833550648,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
16,
17,
19,
28,
30,
31,
34,
44,
45,
46
] | [
"<A4141>",
"<A5340>",
"<A3233>",
"<A3941>",
"<A3165>",
"<A1886>",
"<A4790>",
"<A7803>",
"<A9141>",
"<A3897>",
"<A2384>",
"<A9108>",
"<A8203>",
"<A0040>",
"<A4587>"
] | {
"<A4141>": 31,
"<A5340>": 3,
"<A3233>": 16,
"<A3941>": 12,
"<A3165>": 46,
"<A1886>": 30,
"<A4790>": 44,
"<A7803>": 34,
"<A9141>": 17,
"<A3897>": 28,
"<A2384>": 11,
"<A9108>": 5,
"<A8203>": 19,
"<A0040>": 45,
"<A4587>": 0
} | [
"<A4790>",
"<A3165>",
"<A4587>",
"<A7803>",
"<A9108>",
"<A0040>",
"<A8203>",
"<A5340>",
"<A9141>",
"<A2384>",
"<A3897>",
"<A4141>",
"<A1886>",
"<A3941>",
"<A3233>"
] | 14 | <A3233> | 15 | false | dispatch | pfsp_step_policy_v1 | 16 | <A3233> | <A3233> |
train_000000 | 0 | 50 | 5 | 50 | 36 | {
"step_idx": 36,
"total_steps": 50,
"scheduled_ratio": 0.72,
"current_cmax": 4364,
"total_remaining_work": 6959,
"unfinished_jobs_count": 14,
"unfinished_jobs_ratio": 0.28,
"machine_ready_min": 3550,
"machine_ready_mean": 3896.4,
"machine_ready_max": 4364,
"machine_ready_std": 297.6888308284,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
17,
19,
28,
30,
31,
34,
44,
45,
46
] | [
"<A3075>",
"<A1574>",
"<A4919>",
"<A4217>",
"<A7004>",
"<A0560>",
"<A2414>",
"<A6566>",
"<A3092>",
"<A7720>",
"<A6207>",
"<A8945>",
"<A0155>",
"<A3861>"
] | {
"<A3075>": 30,
"<A1574>": 12,
"<A4919>": 11,
"<A4217>": 0,
"<A7004>": 31,
"<A0560>": 28,
"<A2414>": 3,
"<A6566>": 45,
"<A3092>": 34,
"<A7720>": 46,
"<A6207>": 19,
"<A8945>": 17,
"<A0155>": 5,
"<A3861>": 44
} | [
"<A3861>",
"<A7720>",
"<A4217>",
"<A3092>",
"<A0155>",
"<A6566>",
"<A6207>",
"<A2414>",
"<A8945>",
"<A4919>",
"<A0560>",
"<A7004>",
"<A3075>",
"<A1574>"
] | 12 | <A3075> | 14 | false | dispatch | pfsp_step_policy_v1 | 30 | <A3075> | <A3075> |
train_000000 | 0 | 50 | 5 | 50 | 37 | {
"step_idx": 37,
"total_steps": 50,
"scheduled_ratio": 0.74,
"current_cmax": 4473,
"total_remaining_work": 6418,
"unfinished_jobs_count": 13,
"unfinished_jobs_ratio": 0.26,
"machine_ready_min": 3634,
"machine_ready_mean": 4004.6,
"machine_ready_max": 4473,
"machine_ready_std": 302.1195789749,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
12,
17,
19,
28,
31,
34,
44,
45,
46
] | [
"<A2382>",
"<A7169>",
"<A5727>",
"<A9763>",
"<A2670>",
"<A3948>",
"<A4029>",
"<A8102>",
"<A2540>",
"<A1084>",
"<A5750>",
"<A0488>",
"<A3286>"
] | {
"<A2382>": 34,
"<A7169>": 44,
"<A5727>": 46,
"<A9763>": 0,
"<A2670>": 31,
"<A3948>": 17,
"<A4029>": 11,
"<A8102>": 19,
"<A2540>": 5,
"<A1084>": 12,
"<A5750>": 28,
"<A0488>": 45,
"<A3286>": 3
} | [
"<A7169>",
"<A5727>",
"<A9763>",
"<A2382>",
"<A2540>",
"<A0488>",
"<A8102>",
"<A3286>",
"<A3948>",
"<A4029>",
"<A5750>",
"<A2670>",
"<A1084>"
] | 12 | <A1084> | 13 | false | dispatch | pfsp_step_policy_v1 | 12 | <A1084> | <A1084> |
train_000000 | 0 | 50 | 5 | 50 | 38 | {
"step_idx": 38,
"total_steps": 50,
"scheduled_ratio": 0.76,
"current_cmax": 4590,
"total_remaining_work": 5858,
"unfinished_jobs_count": 12,
"unfinished_jobs_ratio": 0.24,
"machine_ready_min": 3734,
"machine_ready_mean": 4116.6,
"machine_ready_max": 4590,
"machine_ready_std": 298.5991292687,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
17,
19,
28,
31,
34,
44,
45,
46
] | [
"<A4449>",
"<A6455>",
"<A8879>",
"<A6895>",
"<A6047>",
"<A5983>",
"<A8730>",
"<A6575>",
"<A6140>",
"<A0408>",
"<A9013>",
"<A6281>"
] | {
"<A4449>": 5,
"<A6455>": 34,
"<A8879>": 31,
"<A6895>": 45,
"<A6047>": 19,
"<A5983>": 17,
"<A8730>": 3,
"<A6575>": 46,
"<A6140>": 28,
"<A0408>": 0,
"<A9013>": 44,
"<A6281>": 11
} | [
"<A9013>",
"<A6575>",
"<A0408>",
"<A6455>",
"<A4449>",
"<A6895>",
"<A6047>",
"<A8730>",
"<A5983>",
"<A6281>",
"<A6140>",
"<A8879>"
] | 11 | <A8879> | 12 | false | dispatch | pfsp_step_policy_v1 | 31 | <A8879> | <A8879> |
train_000000 | 0 | 50 | 5 | 50 | 39 | {
"step_idx": 39,
"total_steps": 50,
"scheduled_ratio": 0.78,
"current_cmax": 4685,
"total_remaining_work": 5239,
"unfinished_jobs_count": 11,
"unfinished_jobs_ratio": 0.22,
"machine_ready_min": 3865,
"machine_ready_mean": 4240.4,
"machine_ready_max": 4685,
"machine_ready_std": 290.5715746593,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
17,
19,
28,
34,
44,
45,
46
] | [
"<A8290>",
"<A7427>",
"<A5540>",
"<A9142>",
"<A8709>",
"<A6296>",
"<A7847>",
"<A0285>",
"<A2612>",
"<A2439>",
"<A7379>"
] | {
"<A8290>": 17,
"<A7427>": 44,
"<A5540>": 11,
"<A9142>": 3,
"<A8709>": 28,
"<A6296>": 34,
"<A7847>": 5,
"<A0285>": 19,
"<A2612>": 0,
"<A2439>": 45,
"<A7379>": 46
} | [
"<A7427>",
"<A7379>",
"<A2612>",
"<A6296>",
"<A7847>",
"<A2439>",
"<A0285>",
"<A9142>",
"<A8290>",
"<A5540>",
"<A8709>"
] | 10 | <A8709> | 11 | false | dispatch | pfsp_step_policy_v1 | 28 | <A8709> | <A8709> |
train_000000 | 0 | 50 | 5 | 50 | 40 | {
"step_idx": 40,
"total_steps": 50,
"scheduled_ratio": 0.8,
"current_cmax": 4774,
"total_remaining_work": 4670,
"unfinished_jobs_count": 10,
"unfinished_jobs_ratio": 0.2,
"machine_ready_min": 3995,
"machine_ready_mean": 4354.2,
"machine_ready_max": 4774,
"machine_ready_std": 276.8887141073,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
17,
19,
34,
44,
45,
46
] | [
"<A2372>",
"<A8027>",
"<A8276>",
"<A4787>",
"<A2943>",
"<A2736>",
"<A4271>",
"<A2566>",
"<A0547>",
"<A7103>"
] | {
"<A2372>": 34,
"<A8027>": 46,
"<A8276>": 19,
"<A4787>": 0,
"<A2943>": 45,
"<A2736>": 17,
"<A4271>": 5,
"<A2566>": 11,
"<A0547>": 3,
"<A7103>": 44
} | [
"<A7103>",
"<A8027>",
"<A4787>",
"<A2372>",
"<A4271>",
"<A2943>",
"<A8276>",
"<A0547>",
"<A2736>",
"<A2566>"
] | 1 | <A8027> | 10 | false | dispatch | pfsp_step_policy_v1 | 46 | <A8027> | <A8027> |
train_000000 | 0 | 50 | 5 | 50 | 41 | {
"step_idx": 41,
"total_steps": 50,
"scheduled_ratio": 0.82,
"current_cmax": 4827,
"total_remaining_work": 4133,
"unfinished_jobs_count": 9,
"unfinished_jobs_ratio": 0.18,
"machine_ready_min": 4141,
"machine_ready_mean": 4461.8,
"machine_ready_max": 4827,
"machine_ready_std": 260.186394725,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
17,
19,
34,
44,
45
] | [
"<A8130>",
"<A7536>",
"<A1454>",
"<A2099>",
"<A6201>",
"<A0564>",
"<A0806>",
"<A3477>",
"<A3100>"
] | {
"<A8130>": 19,
"<A7536>": 45,
"<A1454>": 44,
"<A2099>": 3,
"<A6201>": 11,
"<A0564>": 34,
"<A0806>": 0,
"<A3477>": 17,
"<A3100>": 5
} | [
"<A1454>",
"<A0806>",
"<A0564>",
"<A3100>",
"<A7536>",
"<A8130>",
"<A2099>",
"<A3477>",
"<A6201>"
] | 7 | <A3477> | 9 | false | dispatch | pfsp_step_policy_v1 | 17 | <A3477> | <A3477> |
train_000000 | 0 | 50 | 5 | 50 | 42 | {
"step_idx": 42,
"total_steps": 50,
"scheduled_ratio": 0.84,
"current_cmax": 4905,
"total_remaining_work": 3586,
"unfinished_jobs_count": 8,
"unfinished_jobs_ratio": 0.16,
"machine_ready_min": 4284,
"machine_ready_mean": 4585,
"machine_ready_max": 4905,
"machine_ready_std": 225.2438678411,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
19,
34,
44,
45
] | [
"<A4647>",
"<A0612>",
"<A8014>",
"<A0072>",
"<A8548>",
"<A5219>",
"<A3222>",
"<A7542>"
] | {
"<A4647>": 0,
"<A0612>": 11,
"<A8014>": 34,
"<A0072>": 3,
"<A8548>": 5,
"<A5219>": 19,
"<A3222>": 44,
"<A7542>": 45
} | [
"<A3222>",
"<A4647>",
"<A8014>",
"<A8548>",
"<A7542>",
"<A5219>",
"<A0072>",
"<A0612>"
] | 4 | <A7542> | 8 | false | dispatch | pfsp_step_policy_v1 | 45 | <A7542> | <A7542> |
train_000000 | 0 | 50 | 5 | 50 | 43 | {
"step_idx": 43,
"total_steps": 50,
"scheduled_ratio": 0.86,
"current_cmax": 4969,
"total_remaining_work": 3080,
"unfinished_jobs_count": 7,
"unfinished_jobs_ratio": 0.14,
"machine_ready_min": 4403,
"machine_ready_mean": 4688.2,
"machine_ready_max": 4969,
"machine_ready_std": 201.6922408027,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
19,
34,
44
] | [
"<A3271>",
"<A1755>",
"<A5258>",
"<A3147>",
"<A3646>",
"<A7557>",
"<A5672>"
] | {
"<A3271>": 0,
"<A1755>": 44,
"<A5258>": 5,
"<A3147>": 34,
"<A3646>": 11,
"<A7557>": 3,
"<A5672>": 19
} | [
"<A1755>",
"<A3271>",
"<A3147>",
"<A5258>",
"<A5672>",
"<A7557>",
"<A3646>"
] | 4 | <A5672> | 7 | false | dispatch | pfsp_step_policy_v1 | 19 | <A5672> | <A5672> |
train_000000 | 0 | 50 | 5 | 50 | 44 | {
"step_idx": 44,
"total_steps": 50,
"scheduled_ratio": 0.88,
"current_cmax": 5038,
"total_remaining_work": 2570,
"unfinished_jobs_count": 6,
"unfinished_jobs_ratio": 0.12,
"machine_ready_min": 4515,
"machine_ready_mean": 4790.2,
"machine_ready_max": 5038,
"machine_ready_std": 181.6913866973,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
34,
44
] | [
"<A0509>",
"<A9113>",
"<A5202>",
"<A0197>",
"<A1142>",
"<A8229>"
] | {
"<A0509>": 3,
"<A9113>": 34,
"<A5202>": 0,
"<A0197>": 11,
"<A1142>": 5,
"<A8229>": 44
} | [
"<A8229>",
"<A5202>",
"<A9113>",
"<A1142>",
"<A0509>",
"<A0197>"
] | 2 | <A9113> | 6 | false | dispatch | pfsp_step_policy_v1 | 34 | <A9113> | <A9113> |
train_000000 | 0 | 50 | 5 | 50 | 45 | {
"step_idx": 45,
"total_steps": 50,
"scheduled_ratio": 0.9,
"current_cmax": 5096,
"total_remaining_work": 2132,
"unfinished_jobs_count": 5,
"unfinished_jobs_ratio": 0.1,
"machine_ready_min": 4656,
"machine_ready_mean": 4877.8,
"machine_ready_max": 5096,
"machine_ready_std": 158.806045225,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
3,
5,
11,
44
] | [
"<A2392>",
"<A3100>",
"<A8857>",
"<A1675>",
"<A4602>"
] | {
"<A2392>": 3,
"<A3100>": 0,
"<A8857>": 11,
"<A1675>": 44,
"<A4602>": 5
} | [
"<A3100>",
"<A4602>",
"<A1675>",
"<A2392>",
"<A8857>"
] | 3 | <A2392> | 5 | false | dispatch | pfsp_step_policy_v1 | 3 | <A2392> | <A2392> |
train_000000 | 0 | 50 | 5 | 50 | 46 | {
"step_idx": 46,
"total_steps": 50,
"scheduled_ratio": 0.92,
"current_cmax": 5168,
"total_remaining_work": 1705,
"unfinished_jobs_count": 4,
"unfinished_jobs_ratio": 0.08,
"machine_ready_min": 4768,
"machine_ready_mean": 4967,
"machine_ready_max": 5168,
"machine_ready_std": 149.7771678194,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
5,
11,
44
] | [
"<A6513>",
"<A3105>",
"<A5453>",
"<A3031>"
] | {
"<A6513>": 5,
"<A3105>": 44,
"<A5453>": 11,
"<A3031>": 0
} | [
"<A6513>",
"<A3031>",
"<A5453>",
"<A3105>"
] | 3 | <A3105> | 4 | false | dispatch | pfsp_step_policy_v1 | 44 | <A3105> | <A3105> |
train_000000 | 0 | 50 | 5 | 50 | 47 | {
"step_idx": 47,
"total_steps": 50,
"scheduled_ratio": 0.94,
"current_cmax": 5255,
"total_remaining_work": 1262,
"unfinished_jobs_count": 3,
"unfinished_jobs_ratio": 0.06,
"machine_ready_min": 4828,
"machine_ready_mean": 5062.8,
"machine_ready_max": 5255,
"machine_ready_std": 154.5255965852,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
5,
11
] | [
"<A1329>",
"<A9942>",
"<A4241>"
] | {
"<A1329>": 11,
"<A9942>": 5,
"<A4241>": 0
} | [
"<A4241>",
"<A1329>",
"<A9942>"
] | 1 | <A1329> | 3 | false | dispatch | pfsp_step_policy_v1 | 11 | <A1329> | <A1329> |
train_000000 | 0 | 50 | 5 | 50 | 48 | {
"step_idx": 48,
"total_steps": 50,
"scheduled_ratio": 0.96,
"current_cmax": 5353,
"total_remaining_work": 835,
"unfinished_jobs_count": 2,
"unfinished_jobs_ratio": 0.04,
"machine_ready_min": 4957,
"machine_ready_mean": 5154.6,
"machine_ready_max": 5353,
"machine_ready_std": 140.5255848591,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0,
5
] | [
"<A3337>",
"<A1519>"
] | {
"<A3337>": 0,
"<A1519>": 5
} | [
"<A3337>",
"<A1519>"
] | 1 | <A1519> | 2 | false | dispatch | pfsp_step_policy_v1 | 5 | <A1519> | <A1519> |
train_000000 | 0 | 50 | 5 | 50 | 49 | {
"step_idx": 49,
"total_steps": 50,
"scheduled_ratio": 0.98,
"current_cmax": 5426,
"total_remaining_work": 438,
"unfinished_jobs_count": 1,
"unfinished_jobs_ratio": 0.02,
"machine_ready_min": 5043,
"machine_ready_mean": 5236.4,
"machine_ready_max": 5426,
"machine_ready_std": 142.5631088325,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,106 M1,76 M2,140 M3,62 M4,54
Job 1: M0,77 M1,101 M2,145 M3,96 M4,105
Job 2: M0,147 M1,51 M2,121 M3,111 M4,98
Job 3: M0,112 M1,61 M2,94 M3,88 M4,72
Job 4: M0,67 M1,139 M2,75 M3,144 M4,141
Job... | [
0
] | [
"<A1369>"
] | {
"<A1369>": 0
} | [
"<A1369>"
] | 0 | <A1369> | 1 | true | dispatch | pfsp_step_policy_v1 | 0 | <A1369> | <A1369> |
train_000001 | 1 | 50 | 5 | 50 | 0 | {
"step_idx": 0,
"total_steps": 50,
"scheduled_ratio": 0,
"current_cmax": 0,
"total_remaining_work": 25075,
"unfinished_jobs_count": 50,
"unfinished_jobs_ratio": 1,
"machine_ready_min": 0,
"machine_ready_mean": 0,
"machine_ready_max": 0,
"machine_ready_std": 0,
"machine_remaining_load": [
47... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49
] | [
"<A7278>",
"<A6685>",
"<A8174>",
"<A3507>",
"<A6408>",
"<A6883>",
"<A5655>",
"<A3703>",
"<A5098>",
"<A2065>",
"<A6675>",
"<A9561>",
"<A8808>",
"<A3261>",
"<A4343>",
"<A7967>",
"<A2978>",
"<A2124>",
"<A8766>",
"<A7648>",
"<A6276>",
"<A9575>",
"<A7887>",
"<A5897>",
"<A9... | {
"<A7278>": 13,
"<A6685>": 36,
"<A8174>": 26,
"<A3507>": 1,
"<A6408>": 4,
"<A6883>": 30,
"<A5655>": 40,
"<A3703>": 34,
"<A5098>": 11,
"<A2065>": 49,
"<A6675>": 37,
"<A9561>": 23,
"<A8808>": 47,
"<A3261>": 48,
"<A4343>": 19,
"<A7967>": 9,
"<A2978>": 29,
"<A2124>": 24,
"<A8766>": 22... | [
"<A7278>",
"<A9871>",
"<A7648>",
"<A8814>",
"<A7967>",
"<A4604>",
"<A3261>",
"<A9702>",
"<A8085>",
"<A6883>",
"<A0223>",
"<A5387>",
"<A2692>",
"<A2409>",
"<A5897>",
"<A6276>",
"<A3892>",
"<A2248>",
"<A1205>",
"<A2124>",
"<A1198>",
"<A6368>",
"<A8174>",
"<A9575>",
"<A2... | 2 | <A7648> | 50 | false | dispatch | pfsp_step_policy_v1 | 42 | <A7648> | <A7648> |
train_000001 | 1 | 50 | 5 | 50 | 1 | {
"step_idx": 1,
"total_steps": 50,
"scheduled_ratio": 0.02,
"current_cmax": 406,
"total_remaining_work": 24669,
"unfinished_jobs_count": 49,
"unfinished_jobs_ratio": 0.98,
"machine_ready_min": 51,
"machine_ready_mean": 199.4,
"machine_ready_max": 406,
"machine_ready_std": 125.5413875979,
"machi... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
43,
44,
45,
46,
47,
48,
49
] | [
"<A5119>",
"<A5740>",
"<A1177>",
"<A5126>",
"<A0732>",
"<A7668>",
"<A0686>",
"<A3293>",
"<A7821>",
"<A2701>",
"<A0608>",
"<A0932>",
"<A6084>",
"<A9324>",
"<A2001>",
"<A9699>",
"<A3569>",
"<A8793>",
"<A4369>",
"<A5796>",
"<A4796>",
"<A3356>",
"<A7930>",
"<A9777>",
"<A6... | {
"<A5119>": 33,
"<A5740>": 21,
"<A1177>": 41,
"<A5126>": 27,
"<A0732>": 1,
"<A7668>": 13,
"<A0686>": 17,
"<A3293>": 43,
"<A7821>": 9,
"<A2701>": 49,
"<A0608>": 23,
"<A0932>": 14,
"<A6084>": 44,
"<A9324>": 30,
"<A2001>": 18,
"<A9699>": 36,
"<A3569>": 26,
"<A8793>": 16,
"<A4369>": 2... | [
"<A7668>",
"<A1177>",
"<A7821>",
"<A8173>",
"<A9324>",
"<A2681>",
"<A6277>",
"<A8812>",
"<A8793>",
"<A3893>",
"<A9856>",
"<A5119>",
"<A6084>",
"<A4250>",
"<A4677>",
"<A4125>",
"<A4369>",
"<A0686>",
"<A6350>",
"<A5796>",
"<A3569>",
"<A3874>",
"<A3208>",
"<A5740>",
"<A8... | 15 | <A4125> | 49 | false | dispatch | pfsp_step_policy_v1 | 48 | <A4125> | <A4125> |
train_000001 | 1 | 50 | 5 | 50 | 2 | {
"step_idx": 2,
"total_steps": 50,
"scheduled_ratio": 0.04,
"current_cmax": 535,
"total_remaining_work": 24243,
"unfinished_jobs_count": 48,
"unfinished_jobs_ratio": 0.96,
"machine_ready_min": 102,
"machine_ready_mean": 285.8,
"machine_ready_max": 535,
"machine_ready_std": 156.4498641738,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
43,
44,
45,
46,
47,
49
] | [
"<A8641>",
"<A7562>",
"<A2479>",
"<A1721>",
"<A6043>",
"<A1878>",
"<A3603>",
"<A0250>",
"<A0151>",
"<A1295>",
"<A0075>",
"<A1880>",
"<A7532>",
"<A7324>",
"<A8799>",
"<A0822>",
"<A1887>",
"<A4849>",
"<A4260>",
"<A0247>",
"<A4822>",
"<A7931>",
"<A8340>",
"<A1882>",
"<A8... | {
"<A8641>": 21,
"<A7562>": 5,
"<A2479>": 29,
"<A1721>": 1,
"<A6043>": 14,
"<A1878>": 7,
"<A3603>": 46,
"<A0250>": 22,
"<A0151>": 23,
"<A1295>": 37,
"<A0075>": 43,
"<A1880>": 16,
"<A7532>": 19,
"<A7324>": 15,
"<A8799>": 13,
"<A0822>": 39,
"<A1887>": 2,
"<A4849>": 38,
"<A4260>": 49,... | [
"<A5045>",
"<A8799>",
"<A4391>",
"<A0742>",
"<A7485>",
"<A1882>",
"<A8641>",
"<A6342>",
"<A6306>",
"<A1295>",
"<A0687>",
"<A7570>",
"<A1880>",
"<A0795>",
"<A3933>",
"<A1887>",
"<A1491>",
"<A3603>",
"<A7562>",
"<A9172>",
"<A1721>",
"<A0250>",
"<A4068>",
"<A1878>",
"<A4... | 1 | <A8799> | 48 | false | dispatch | pfsp_step_policy_v1 | 13 | <A8799> | <A8799> |
train_000001 | 1 | 50 | 5 | 50 | 3 | {
"step_idx": 3,
"total_steps": 50,
"scheduled_ratio": 0.06,
"current_cmax": 588,
"total_remaining_work": 23852,
"unfinished_jobs_count": 47,
"unfinished_jobs_ratio": 0.94,
"machine_ready_min": 179,
"machine_ready_mean": 369.2,
"machine_ready_max": 588,
"machine_ready_std": 154.1575817143,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
43,
44,
45,
46,
47,
49
] | [
"<A4673>",
"<A5947>",
"<A7536>",
"<A3636>",
"<A2566>",
"<A9083>",
"<A1098>",
"<A0790>",
"<A2656>",
"<A8956>",
"<A1646>",
"<A2511>",
"<A2492>",
"<A2089>",
"<A2759>",
"<A7532>",
"<A1234>",
"<A6899>",
"<A9086>",
"<A2917>",
"<A6307>",
"<A1440>",
"<A2758>",
"<A8085>",
"<A9... | {
"<A4673>": 16,
"<A5947>": 37,
"<A7536>": 4,
"<A3636>": 7,
"<A2566>": 35,
"<A9083>": 20,
"<A1098>": 43,
"<A0790>": 24,
"<A2656>": 11,
"<A8956>": 30,
"<A1646>": 21,
"<A2511>": 19,
"<A2492>": 5,
"<A2089>": 41,
"<A2759>": 28,
"<A7532>": 38,
"<A1234>": 39,
"<A6899>": 22,
"<A9086>": 46... | [
"<A9890>",
"<A5658>",
"<A9054>",
"<A2089>",
"<A9761>",
"<A9083>",
"<A4673>",
"<A1646>",
"<A8956>",
"<A5947>",
"<A3556>",
"<A2758>",
"<A3636>",
"<A9086>",
"<A4495>",
"<A0687>",
"<A6306>",
"<A2492>",
"<A6307>",
"<A1098>",
"<A8085>",
"<A2070>",
"<A8945>",
"<A2656>",
"<A2... | 33 | <A8161> | 47 | false | dispatch | pfsp_step_policy_v1 | 33 | <A8161> | <A8161> |
train_000001 | 1 | 50 | 5 | 50 | 4 | {
"step_idx": 4,
"total_steps": 50,
"scheduled_ratio": 0.08,
"current_cmax": 739,
"total_remaining_work": 23378,
"unfinished_jobs_count": 46,
"unfinished_jobs_ratio": 0.92,
"machine_ready_min": 238,
"machine_ready_mean": 470.6,
"machine_ready_max": 739,
"machine_ready_std": 185.9791386151,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
41,
43,
44,
45,
46,
47,
49
] | [
"<A6232>",
"<A6912>",
"<A4539>",
"<A3223>",
"<A0512>",
"<A5077>",
"<A4241>",
"<A0104>",
"<A2157>",
"<A9605>",
"<A0533>",
"<A2763>",
"<A4116>",
"<A6873>",
"<A0277>",
"<A8356>",
"<A7910>",
"<A1965>",
"<A0950>",
"<A1745>",
"<A8049>",
"<A2950>",
"<A6467>",
"<A6629>",
"<A2... | {
"<A6232>": 20,
"<A6912>": 29,
"<A4539>": 39,
"<A3223>": 12,
"<A0512>": 38,
"<A5077>": 30,
"<A4241>": 47,
"<A0104>": 36,
"<A2157>": 18,
"<A9605>": 5,
"<A0533>": 7,
"<A2763>": 28,
"<A4116>": 17,
"<A6873>": 34,
"<A0277>": 41,
"<A8356>": 15,
"<A7910>": 3,
"<A1965>": 4,
"<A0950>": 22,... | [
"<A4121>",
"<A0277>",
"<A2144>",
"<A6232>",
"<A9605>",
"<A6629>",
"<A2196>",
"<A5077>",
"<A1745>",
"<A7953>",
"<A6467>",
"<A2384>",
"<A3090>",
"<A8049>",
"<A2950>",
"<A7063>",
"<A7910>",
"<A1152>",
"<A3223>",
"<A0950>",
"<A5701>",
"<A4810>",
"<A0104>",
"<A0964>",
"<A0... | 1 | <A0277> | 46 | false | dispatch | pfsp_step_policy_v1 | 41 | <A0277> | <A0277> |
train_000001 | 1 | 50 | 5 | 50 | 5 | {
"step_idx": 5,
"total_steps": 50,
"scheduled_ratio": 0.1,
"current_cmax": 804,
"total_remaining_work": 22960,
"unfinished_jobs_count": 45,
"unfinished_jobs_ratio": 0.9,
"machine_ready_min": 313,
"machine_ready_mean": 554.2,
"machine_ready_max": 804,
"machine_ready_std": 190.0014736785,
"machin... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A7934>",
"<A9549>",
"<A9268>",
"<A8295>",
"<A7643>",
"<A6877>",
"<A9217>",
"<A8062>",
"<A6696>",
"<A8194>",
"<A7420>",
"<A2492>",
"<A2333>",
"<A8143>",
"<A1747>",
"<A5400>",
"<A2048>",
"<A5674>",
"<A7969>",
"<A7783>",
"<A3803>",
"<A8686>",
"<A1885>",
"<A9177>",
"<A3... | {
"<A7934>": 40,
"<A9549>": 47,
"<A9268>": 4,
"<A8295>": 14,
"<A7643>": 32,
"<A6877>": 11,
"<A9217>": 25,
"<A8062>": 37,
"<A6696>": 0,
"<A8194>": 18,
"<A7420>": 10,
"<A2492>": 24,
"<A2333>": 38,
"<A8143>": 20,
"<A1747>": 21,
"<A5400>": 36,
"<A2048>": 7,
"<A5674>": 27,
"<A7969>": 6,... | [
"<A0277>",
"<A3045>",
"<A8837>",
"<A5152>",
"<A8143>",
"<A6096>",
"<A1747>",
"<A4899>",
"<A5400>",
"<A7507>",
"<A1509>",
"<A2048>",
"<A8062>",
"<A5674>",
"<A3717>",
"<A9217>",
"<A5794>",
"<A7783>",
"<A7420>",
"<A2239>",
"<A8686>",
"<A8295>",
"<A9177>",
"<A6877>",
"<A1... | 3 | <A5152> | 45 | false | dispatch | pfsp_step_policy_v1 | 2 | <A5152> | <A5152> |
train_000001 | 1 | 50 | 5 | 50 | 6 | {
"step_idx": 6,
"total_steps": 50,
"scheduled_ratio": 0.12,
"current_cmax": 895,
"total_remaining_work": 22533,
"unfinished_jobs_count": 44,
"unfinished_jobs_ratio": 0.88,
"machine_ready_min": 371,
"machine_ready_mean": 639.6,
"machine_ready_max": 895,
"machine_ready_std": 189.3120175794,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A3787>",
"<A9052>",
"<A7507>",
"<A4638>",
"<A3970>",
"<A6738>",
"<A3450>",
"<A4984>",
"<A1975>",
"<A4629>",
"<A6134>",
"<A8646>",
"<A2077>",
"<A2386>",
"<A5411>",
"<A9910>",
"<A9912>",
"<A9741>",
"<A4484>",
"<A0444>",
"<A2588>",
"<A7260>",
"<A1599>",
"<A0681>",
"<A3... | {
"<A3787>": 0,
"<A9052>": 12,
"<A7507>": 31,
"<A4638>": 38,
"<A3970>": 37,
"<A6738>": 10,
"<A3450>": 6,
"<A4984>": 30,
"<A1975>": 28,
"<A4629>": 9,
"<A6134>": 25,
"<A8646>": 40,
"<A2077>": 35,
"<A2386>": 36,
"<A5411>": 21,
"<A9910>": 11,
"<A9912>": 32,
"<A9741>": 15,
"<A4484>": 29... | [
"<A4629>",
"<A1594>",
"<A1599>",
"<A7260>",
"<A3942>",
"<A5411>",
"<A9165>",
"<A0992>",
"<A4984>",
"<A3970>",
"<A5780>",
"<A8787>",
"<A6134>",
"<A2386>",
"<A6738>",
"<A3593>",
"<A9360>",
"<A2144>",
"<A1844>",
"<A9052>",
"<A0444>",
"<A7322>",
"<A0019>",
"<A9741>",
"<A7... | 14 | <A6738> | 44 | false | dispatch | pfsp_step_policy_v1 | 10 | <A6738> | <A6738> |
train_000001 | 1 | 50 | 5 | 50 | 7 | {
"step_idx": 7,
"total_steps": 50,
"scheduled_ratio": 0.14,
"current_cmax": 1006,
"total_remaining_work": 22086,
"unfinished_jobs_count": 43,
"unfinished_jobs_ratio": 0.86,
"machine_ready_min": 430,
"machine_ready_mean": 738.2,
"machine_ready_max": 1006,
"machine_ready_std": 214.4746138824,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
7,
8,
9,
11,
12,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A8784>",
"<A9748>",
"<A3148>",
"<A9986>",
"<A5577>",
"<A7760>",
"<A7309>",
"<A6413>",
"<A2758>",
"<A9508>",
"<A5065>",
"<A8517>",
"<A0393>",
"<A6415>",
"<A5947>",
"<A4087>",
"<A2471>",
"<A1275>",
"<A6385>",
"<A0700>",
"<A3214>",
"<A3619>",
"<A5853>",
"<A3395>",
"<A6... | {
"<A8784>": 44,
"<A9748>": 46,
"<A3148>": 49,
"<A9986>": 20,
"<A5577>": 6,
"<A7760>": 24,
"<A7309>": 1,
"<A6413>": 8,
"<A2758>": 16,
"<A9508>": 29,
"<A5065>": 28,
"<A8517>": 14,
"<A0393>": 0,
"<A6415>": 30,
"<A5947>": 25,
"<A4087>": 27,
"<A2471>": 5,
"<A1275>": 35,
"<A6385>": 36,
... | [
"<A8784>",
"<A4457>",
"<A6041>",
"<A9986>",
"<A2758>",
"<A9540>",
"<A2109>",
"<A9748>",
"<A6385>",
"<A2471>",
"<A2851>",
"<A6415>",
"<A6602>",
"<A9287>",
"<A4087>",
"<A3067>",
"<A9785>",
"<A0042>",
"<A5947>",
"<A2962>",
"<A3148>",
"<A8517>",
"<A9771>",
"<A6413>",
"<A5... | 17 | <A0042> | 43 | false | dispatch | pfsp_step_policy_v1 | 17 | <A0042> | <A0042> |
train_000001 | 1 | 50 | 5 | 50 | 8 | {
"step_idx": 8,
"total_steps": 50,
"scheduled_ratio": 0.16,
"current_cmax": 1145,
"total_remaining_work": 21680,
"unfinished_jobs_count": 42,
"unfinished_jobs_ratio": 0.84,
"machine_ready_min": 486,
"machine_ready_mean": 821.2,
"machine_ready_max": 1145,
"machine_ready_std": 238.4109057908,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
7,
8,
9,
11,
12,
14,
15,
16,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A1305>",
"<A2538>",
"<A3979>",
"<A2402>",
"<A1546>",
"<A9107>",
"<A0254>",
"<A1833>",
"<A2358>",
"<A0399>",
"<A6973>",
"<A6224>",
"<A6367>",
"<A7037>",
"<A1070>",
"<A7681>",
"<A5815>",
"<A8634>",
"<A5114>",
"<A8338>",
"<A8892>",
"<A4370>",
"<A3927>",
"<A4119>",
"<A8... | {
"<A1305>": 26,
"<A2538>": 44,
"<A3979>": 37,
"<A2402>": 47,
"<A1546>": 3,
"<A9107>": 9,
"<A0254>": 14,
"<A1833>": 25,
"<A2358>": 34,
"<A0399>": 24,
"<A6973>": 20,
"<A6224>": 46,
"<A6367>": 30,
"<A7037>": 23,
"<A1070>": 16,
"<A7681>": 22,
"<A5815>": 36,
"<A8634>": 1,
"<A5114>": 8,... | [
"<A9107>",
"<A9619>",
"<A2867>",
"<A6973>",
"<A4508>",
"<A1833>",
"<A3979>",
"<A2538>",
"<A1388>",
"<A6367>",
"<A1070>",
"<A1546>",
"<A5114>",
"<A1305>",
"<A4119>",
"<A4023>",
"<A6224>",
"<A4370>",
"<A7681>",
"<A5815>",
"<A8634>",
"<A3525>",
"<A1573>",
"<A0254>",
"<A2... | 21 | <A3525> | 42 | false | dispatch | pfsp_step_policy_v1 | 7 | <A3525> | <A3525> |
train_000001 | 1 | 50 | 5 | 50 | 9 | {
"step_idx": 9,
"total_steps": 50,
"scheduled_ratio": 0.18,
"current_cmax": 1264,
"total_remaining_work": 21245,
"unfinished_jobs_count": 41,
"unfinished_jobs_ratio": 0.82,
"machine_ready_min": 549,
"machine_ready_mean": 908.2,
"machine_ready_max": 1264,
"machine_ready_std": 248.1720371033,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
15,
16,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A9901>",
"<A6626>",
"<A1058>",
"<A0902>",
"<A6039>",
"<A3546>",
"<A0786>",
"<A4558>",
"<A0611>",
"<A0053>",
"<A7876>",
"<A1038>",
"<A2172>",
"<A4470>",
"<A5924>",
"<A8488>",
"<A1421>",
"<A9886>",
"<A2249>",
"<A2847>",
"<A3623>",
"<A5110>",
"<A0083>",
"<A8743>",
"<A9... | {
"<A9901>": 3,
"<A6626>": 49,
"<A1058>": 40,
"<A0902>": 29,
"<A6039>": 43,
"<A3546>": 30,
"<A0786>": 15,
"<A4558>": 1,
"<A0611>": 39,
"<A0053>": 36,
"<A7876>": 24,
"<A1038>": 38,
"<A2172>": 16,
"<A4470>": 18,
"<A5924>": 23,
"<A8488>": 11,
"<A1421>": 20,
"<A9886>": 37,
"<A2249>": 4... | [
"<A2847>",
"<A9747>",
"<A7352>",
"<A8743>",
"<A4120>",
"<A1421>",
"<A6626>",
"<A9901>",
"<A4825>",
"<A7566>",
"<A3623>",
"<A9886>",
"<A8872>",
"<A3546>",
"<A2172>",
"<A3748>",
"<A7414>",
"<A5110>",
"<A5750>",
"<A0053>",
"<A4558>",
"<A4470>",
"<A0902>",
"<A9621>",
"<A2... | 1 | <A9747> | 41 | false | dispatch | pfsp_step_policy_v1 | 25 | <A9747> | <A9747> |
train_000001 | 1 | 50 | 5 | 50 | 10 | {
"step_idx": 10,
"total_steps": 50,
"scheduled_ratio": 0.2,
"current_cmax": 1323,
"total_remaining_work": 20822,
"unfinished_jobs_count": 40,
"unfinished_jobs_ratio": 0.8,
"machine_ready_min": 636,
"machine_ready_mean": 992.8,
"machine_ready_max": 1323,
"machine_ready_std": 251.9757131154,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
15,
16,
18,
19,
20,
21,
22,
23,
24,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A5705>",
"<A5944>",
"<A4616>",
"<A3137>",
"<A9820>",
"<A4227>",
"<A1348>",
"<A7593>",
"<A2526>",
"<A6653>",
"<A7558>",
"<A5375>",
"<A1960>",
"<A2805>",
"<A1333>",
"<A5849>",
"<A4281>",
"<A1521>",
"<A5212>",
"<A2416>",
"<A0674>",
"<A4667>",
"<A7985>",
"<A2204>",
"<A5... | {
"<A5705>": 14,
"<A5944>": 24,
"<A4616>": 49,
"<A3137>": 5,
"<A9820>": 43,
"<A4227>": 40,
"<A1348>": 6,
"<A7593>": 20,
"<A2526>": 47,
"<A6653>": 28,
"<A7558>": 38,
"<A5375>": 4,
"<A1960>": 3,
"<A2805>": 36,
"<A1333>": 23,
"<A5849>": 34,
"<A4281>": 12,
"<A1521>": 39,
"<A5212>": 26,... | [
"<A7984>",
"<A7593>",
"<A1722>",
"<A7364>",
"<A2204>",
"<A5212>",
"<A3137>",
"<A3133>",
"<A1993>",
"<A0674>",
"<A3197>",
"<A4447>",
"<A4616>",
"<A2805>",
"<A1960>",
"<A5736>",
"<A4281>",
"<A5968>",
"<A8450>",
"<A5705>",
"<A7141>",
"<A2416>",
"<A6653>",
"<A4667>",
"<A4... | 21 | <A2416> | 40 | false | dispatch | pfsp_step_policy_v1 | 15 | <A2416> | <A2416> |
train_000001 | 1 | 50 | 5 | 50 | 11 | {
"step_idx": 11,
"total_steps": 50,
"scheduled_ratio": 0.22,
"current_cmax": 1451,
"total_remaining_work": 20368,
"unfinished_jobs_count": 39,
"unfinished_jobs_ratio": 0.78,
"machine_ready_min": 732,
"machine_ready_mean": 1083.6,
"machine_ready_max": 1451,
"machine_ready_std": 257.5155140958,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
20,
21,
22,
23,
24,
26,
27,
28,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A0211>",
"<A7606>",
"<A0668>",
"<A8130>",
"<A4692>",
"<A6209>",
"<A5479>",
"<A6933>",
"<A5050>",
"<A0462>",
"<A6871>",
"<A8199>",
"<A1481>",
"<A8385>",
"<A5883>",
"<A7055>",
"<A9192>",
"<A9131>",
"<A2147>",
"<A1611>",
"<A4467>",
"<A3373>",
"<A8503>",
"<A4345>",
"<A2... | {
"<A0211>": 24,
"<A7606>": 43,
"<A0668>": 46,
"<A8130>": 44,
"<A4692>": 0,
"<A6209>": 6,
"<A5479>": 8,
"<A6933>": 5,
"<A5050>": 34,
"<A0462>": 36,
"<A6871>": 19,
"<A8199>": 21,
"<A1481>": 3,
"<A8385>": 12,
"<A5883>": 14,
"<A7055>": 49,
"<A9192>": 1,
"<A9131>": 35,
"<A2147>": 37,
... | [
"<A4270>",
"<A8199>",
"<A4345>",
"<A6933>",
"<A3373>",
"<A7055>",
"<A1481>",
"<A4220>",
"<A5479>",
"<A8385>",
"<A2147>",
"<A8130>",
"<A1982>",
"<A9057>",
"<A2122>",
"<A0668>",
"<A6871>",
"<A9139>",
"<A0462>",
"<A9192>",
"<A1832>",
"<A3949>",
"<A5883>",
"<A8503>",
"<A1... | 24 | <A1888> | 39 | false | dispatch | pfsp_step_policy_v1 | 28 | <A1888> | <A1888> |
train_000001 | 1 | 50 | 5 | 50 | 12 | {
"step_idx": 12,
"total_steps": 50,
"scheduled_ratio": 0.24,
"current_cmax": 1580,
"total_remaining_work": 19884,
"unfinished_jobs_count": 38,
"unfinished_jobs_ratio": 0.76,
"machine_ready_min": 824,
"machine_ready_mean": 1180.4,
"machine_ready_max": 1580,
"machine_ready_std": 272.1548088864,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
20,
21,
22,
23,
24,
26,
27,
29,
30,
31,
32,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A0993>",
"<A8164>",
"<A5635>",
"<A3387>",
"<A7464>",
"<A1057>",
"<A8862>",
"<A0411>",
"<A7790>",
"<A7478>",
"<A9162>",
"<A0990>",
"<A9479>",
"<A1407>",
"<A3253>",
"<A8642>",
"<A3096>",
"<A3220>",
"<A9752>",
"<A5210>",
"<A7713>",
"<A4635>",
"<A7241>",
"<A8224>",
"<A5... | {
"<A0993>": 4,
"<A8164>": 45,
"<A5635>": 47,
"<A3387>": 39,
"<A7464>": 3,
"<A1057>": 16,
"<A8862>": 24,
"<A0411>": 0,
"<A7790>": 49,
"<A7478>": 23,
"<A9162>": 1,
"<A0990>": 9,
"<A9479>": 37,
"<A1407>": 27,
"<A3253>": 36,
"<A8642>": 35,
"<A3096>": 6,
"<A3220>": 26,
"<A9752>": 5,
... | [
"<A0990>",
"<A0504>",
"<A1407>",
"<A9752>",
"<A9213>",
"<A7790>",
"<A7464>",
"<A8164>",
"<A2219>",
"<A8224>",
"<A9479>",
"<A4635>",
"<A2312>",
"<A1057>",
"<A3220>",
"<A7241>",
"<A3172>",
"<A1846>",
"<A3253>",
"<A9162>",
"<A5761>",
"<A1752>",
"<A8609>",
"<A5635>",
"<A8... | 34 | <A6985> | 38 | false | dispatch | pfsp_step_policy_v1 | 32 | <A6985> | <A6985> |
train_000001 | 1 | 50 | 5 | 50 | 13 | {
"step_idx": 13,
"total_steps": 50,
"scheduled_ratio": 0.26,
"current_cmax": 1718,
"total_remaining_work": 19393,
"unfinished_jobs_count": 37,
"unfinished_jobs_ratio": 0.74,
"machine_ready_min": 931,
"machine_ready_mean": 1278.6,
"machine_ready_max": 1718,
"machine_ready_std": 294.8698696035,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
20,
21,
22,
23,
24,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
47,
49
] | [
"<A3774>",
"<A0686>",
"<A6711>",
"<A9948>",
"<A4418>",
"<A4930>",
"<A7682>",
"<A6683>",
"<A2665>",
"<A1620>",
"<A3421>",
"<A9176>",
"<A1195>",
"<A7522>",
"<A4596>",
"<A9920>",
"<A7855>",
"<A8585>",
"<A2018>",
"<A7802>",
"<A9359>",
"<A1895>",
"<A2733>",
"<A0532>",
"<A7... | {
"<A3774>": 14,
"<A0686>": 6,
"<A6711>": 1,
"<A9948>": 31,
"<A4418>": 38,
"<A4930>": 45,
"<A7682>": 3,
"<A6683>": 24,
"<A2665>": 21,
"<A1620>": 44,
"<A3421>": 29,
"<A9176>": 39,
"<A1195>": 49,
"<A7522>": 23,
"<A4596>": 22,
"<A9920>": 36,
"<A7855>": 46,
"<A8585>": 34,
"<A2018>": 47... | [
"<A0387>",
"<A2665>",
"<A3067>",
"<A5492>",
"<A7748>",
"<A1195>",
"<A7682>",
"<A4930>",
"<A2733>",
"<A4829>",
"<A5157>",
"<A1620>",
"<A7523>",
"<A7002>",
"<A1895>",
"<A7855>",
"<A0532>",
"<A4596>",
"<A9920>",
"<A6711>",
"<A0070>",
"<A3421>",
"<A3774>",
"<A2018>",
"<A7... | 23 | <A2018> | 37 | false | dispatch | pfsp_step_policy_v1 | 47 | <A2018> | <A2018> |
train_000001 | 1 | 50 | 5 | 50 | 14 | {
"step_idx": 14,
"total_steps": 50,
"scheduled_ratio": 0.28,
"current_cmax": 1840,
"total_remaining_work": 18851,
"unfinished_jobs_count": 36,
"unfinished_jobs_ratio": 0.72,
"machine_ready_min": 988,
"machine_ready_mean": 1387,
"machine_ready_max": 1840,
"machine_ready_std": 316.1708398951,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
20,
21,
22,
23,
24,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A0596>",
"<A3497>",
"<A2060>",
"<A2558>",
"<A3995>",
"<A1816>",
"<A1944>",
"<A1475>",
"<A9070>",
"<A8954>",
"<A2164>",
"<A9944>",
"<A0286>",
"<A3875>",
"<A5567>",
"<A5911>",
"<A6600>",
"<A0902>",
"<A9808>",
"<A1529>",
"<A7501>",
"<A1840>",
"<A1051>",
"<A8559>",
"<A6... | {
"<A0596>": 29,
"<A3497>": 3,
"<A2060>": 5,
"<A2558>": 38,
"<A3995>": 19,
"<A1816>": 40,
"<A1944>": 44,
"<A1475>": 21,
"<A9070>": 49,
"<A8954>": 46,
"<A2164>": 27,
"<A9944>": 35,
"<A0286>": 45,
"<A3875>": 12,
"<A5567>": 26,
"<A5911>": 37,
"<A6600>": 11,
"<A0902>": 23,
"<A9808>": 2... | [
"<A7807>",
"<A1475>",
"<A2164>",
"<A2060>",
"<A1456>",
"<A9070>",
"<A3497>",
"<A0286>",
"<A1840>",
"<A3875>",
"<A5911>",
"<A1944>",
"<A2803>",
"<A4598>",
"<A5567>",
"<A8954>",
"<A3995>",
"<A9808>",
"<A8559>",
"<A8321>",
"<A6932>",
"<A0596>",
"<A3476>",
"<A9944>",
"<A1... | 4 | <A1456> | 36 | false | dispatch | pfsp_step_policy_v1 | 20 | <A1456> | <A1456> |
train_000001 | 1 | 50 | 5 | 50 | 15 | {
"step_idx": 15,
"total_steps": 50,
"scheduled_ratio": 0.3,
"current_cmax": 1909,
"total_remaining_work": 18368,
"unfinished_jobs_count": 35,
"unfinished_jobs_ratio": 0.7,
"machine_ready_min": 1084,
"machine_ready_mean": 1483.6,
"machine_ready_max": 1909,
"machine_ready_std": 308.2768885272,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
21,
22,
23,
24,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A1280>",
"<A2928>",
"<A5892>",
"<A7847>",
"<A4329>",
"<A3594>",
"<A2804>",
"<A8366>",
"<A4696>",
"<A1458>",
"<A9430>",
"<A2553>",
"<A6564>",
"<A9941>",
"<A9040>",
"<A0854>",
"<A6649>",
"<A1945>",
"<A9533>",
"<A2363>",
"<A3333>",
"<A2211>",
"<A7888>",
"<A4348>",
"<A6... | {
"<A1280>": 22,
"<A2928>": 0,
"<A5892>": 5,
"<A7847>": 12,
"<A4329>": 9,
"<A3594>": 26,
"<A2804>": 4,
"<A8366>": 29,
"<A4696>": 1,
"<A1458>": 14,
"<A9430>": 3,
"<A2553>": 27,
"<A6564>": 40,
"<A9941>": 18,
"<A9040>": 38,
"<A0854>": 46,
"<A6649>": 39,
"<A1945>": 34,
"<A9533>": 37,
... | [
"<A4329>",
"<A7304>",
"<A2553>",
"<A5892>",
"<A4348>",
"<A9430>",
"<A3334>",
"<A9491>",
"<A7847>",
"<A9533>",
"<A2770>",
"<A6850>",
"<A3780>",
"<A3594>",
"<A0854>",
"<A7487>",
"<A1280>",
"<A2363>",
"<A4696>",
"<A9941>",
"<A8366>",
"<A1458>",
"<A6332>",
"<A6564>",
"<A3... | 32 | <A2211> | 35 | false | dispatch | pfsp_step_policy_v1 | 24 | <A2211> | <A2211> |
train_000001 | 1 | 50 | 5 | 50 | 16 | {
"step_idx": 16,
"total_steps": 50,
"scheduled_ratio": 0.32,
"current_cmax": 2053,
"total_remaining_work": 17877,
"unfinished_jobs_count": 34,
"unfinished_jobs_ratio": 0.68,
"machine_ready_min": 1200,
"machine_ready_mean": 1581.8,
"machine_ready_max": 2053,
"machine_ready_std": 318.4489912058,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
18,
19,
21,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A3292>",
"<A2169>",
"<A3120>",
"<A6551>",
"<A9916>",
"<A1499>",
"<A4500>",
"<A2003>",
"<A5979>",
"<A5087>",
"<A7144>",
"<A1530>",
"<A4843>",
"<A4199>",
"<A9287>",
"<A2793>",
"<A1697>",
"<A2459>",
"<A3973>",
"<A0872>",
"<A7643>",
"<A7698>",
"<A9617>",
"<A3405>",
"<A4... | {
"<A3292>": 46,
"<A2169>": 23,
"<A3120>": 1,
"<A6551>": 12,
"<A9916>": 45,
"<A1499>": 34,
"<A4500>": 30,
"<A2003>": 26,
"<A5979>": 6,
"<A5087>": 49,
"<A7144>": 14,
"<A1530>": 4,
"<A4843>": 9,
"<A4199>": 5,
"<A9287>": 40,
"<A2793>": 44,
"<A1697>": 8,
"<A2459>": 3,
"<A3973>": 16,
... | [
"<A4843>",
"<A7698>",
"<A6571>",
"<A4199>",
"<A5087>",
"<A2459>",
"<A9916>",
"<A1697>",
"<A6551>",
"<A0132>",
"<A2793>",
"<A4500>",
"<A3973>",
"<A2003>",
"<A3292>",
"<A2060>",
"<A8335>",
"<A3405>",
"<A3120>",
"<A8596>",
"<A4438>",
"<A7144>",
"<A7643>",
"<A9287>",
"<A9... | 19 | <A8596> | 34 | false | dispatch | pfsp_step_policy_v1 | 18 | <A8596> | <A8596> |
train_000001 | 1 | 50 | 5 | 50 | 17 | {
"step_idx": 17,
"total_steps": 50,
"scheduled_ratio": 0.34,
"current_cmax": 2166,
"total_remaining_work": 17295,
"unfinished_jobs_count": 33,
"unfinished_jobs_ratio": 0.66,
"machine_ready_min": 1264,
"machine_ready_mean": 1698.2,
"machine_ready_max": 2166,
"machine_ready_std": 331.5825085857,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
0,
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
19,
21,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A7935>",
"<A1884>",
"<A5236>",
"<A2208>",
"<A1583>",
"<A3377>",
"<A7814>",
"<A1320>",
"<A5861>",
"<A9846>",
"<A5045>",
"<A8597>",
"<A1892>",
"<A2250>",
"<A2316>",
"<A9861>",
"<A0202>",
"<A4612>",
"<A0773>",
"<A5747>",
"<A7435>",
"<A3055>",
"<A0518>",
"<A9011>",
"<A8... | {
"<A7935>": 40,
"<A1884>": 9,
"<A5236>": 44,
"<A2208>": 3,
"<A1583>": 1,
"<A3377>": 31,
"<A7814>": 4,
"<A1320>": 49,
"<A5861>": 14,
"<A9846>": 36,
"<A5045>": 19,
"<A8597>": 43,
"<A1892>": 23,
"<A2250>": 34,
"<A2316>": 30,
"<A9861>": 5,
"<A0202>": 12,
"<A4612>": 11,
"<A0773>": 21,
... | [
"<A1884>",
"<A0773>",
"<A5627>",
"<A9861>",
"<A1320>",
"<A2208>",
"<A2401>",
"<A7435>",
"<A0202>",
"<A3982>",
"<A5236>",
"<A2316>",
"<A8886>",
"<A7805>",
"<A9011>",
"<A5045>",
"<A5718>",
"<A9846>",
"<A1583>",
"<A0518>",
"<A5861>",
"<A8584>",
"<A7935>",
"<A8597>",
"<A7... | 30 | <A3055> | 33 | false | dispatch | pfsp_step_policy_v1 | 0 | <A3055> | <A3055> |
train_000001 | 1 | 50 | 5 | 50 | 18 | {
"step_idx": 18,
"total_steps": 50,
"scheduled_ratio": 0.36,
"current_cmax": 2303,
"total_remaining_work": 16794,
"unfinished_jobs_count": 32,
"unfinished_jobs_ratio": 0.64,
"machine_ready_min": 1332,
"machine_ready_mean": 1798.4,
"machine_ready_max": 2303,
"machine_ready_std": 353.1858434309,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
19,
21,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A6019>",
"<A2381>",
"<A3855>",
"<A3792>",
"<A8963>",
"<A8460>",
"<A7673>",
"<A9918>",
"<A5531>",
"<A1711>",
"<A2899>",
"<A9938>",
"<A7643>",
"<A7284>",
"<A5602>",
"<A9721>",
"<A8004>",
"<A1109>",
"<A0022>",
"<A8636>",
"<A5693>",
"<A9887>",
"<A2913>",
"<A3016>",
"<A9... | {
"<A6019>": 9,
"<A2381>": 1,
"<A3855>": 39,
"<A3792>": 21,
"<A8963>": 30,
"<A8460>": 40,
"<A7673>": 6,
"<A9918>": 45,
"<A5531>": 34,
"<A1711>": 16,
"<A2899>": 8,
"<A9938>": 46,
"<A7643>": 5,
"<A7284>": 22,
"<A5602>": 29,
"<A9721>": 37,
"<A8004>": 14,
"<A1109>": 27,
"<A0022>": 38,
... | [
"<A6019>",
"<A3792>",
"<A1109>",
"<A7643>",
"<A8636>",
"<A6815>",
"<A9918>",
"<A2899>",
"<A3016>",
"<A9721>",
"<A9501>",
"<A8963>",
"<A1711>",
"<A9887>",
"<A9938>",
"<A3157>",
"<A7284>",
"<A4357>",
"<A2381>",
"<A5602>",
"<A8004>",
"<A5693>",
"<A8460>",
"<A8104>",
"<A2... | 1 | <A3792> | 32 | false | dispatch | pfsp_step_policy_v1 | 21 | <A3792> | <A3792> |
train_000001 | 1 | 50 | 5 | 50 | 19 | {
"step_idx": 19,
"total_steps": 50,
"scheduled_ratio": 0.38,
"current_cmax": 2362,
"total_remaining_work": 16292,
"unfinished_jobs_count": 31,
"unfinished_jobs_ratio": 0.62,
"machine_ready_min": 1423,
"machine_ready_mean": 1898.8,
"machine_ready_max": 2362,
"machine_ready_std": 344.6002901914,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
11,
12,
14,
16,
19,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A5720>",
"<A5797>",
"<A5133>",
"<A7197>",
"<A9373>",
"<A0194>",
"<A8661>",
"<A9761>",
"<A9980>",
"<A7991>",
"<A3599>",
"<A4464>",
"<A7948>",
"<A3218>",
"<A7924>",
"<A8342>",
"<A7340>",
"<A2544>",
"<A9059>",
"<A0143>",
"<A8981>",
"<A8941>",
"<A9856>",
"<A3099>",
"<A2... | {
"<A5720>": 45,
"<A5797>": 49,
"<A5133>": 1,
"<A7197>": 36,
"<A9373>": 30,
"<A0194>": 44,
"<A8661>": 46,
"<A9761>": 40,
"<A9980>": 12,
"<A7991>": 3,
"<A3599>": 16,
"<A4464>": 11,
"<A7948>": 27,
"<A3218>": 29,
"<A7924>": 8,
"<A8342>": 23,
"<A7340>": 35,
"<A2544>": 26,
"<A9059>": 14... | [
"<A6760>",
"<A7948>",
"<A3099>",
"<A5797>",
"<A7991>",
"<A5720>",
"<A7924>",
"<A9980>",
"<A2319>",
"<A0194>",
"<A9373>",
"<A3599>",
"<A2544>",
"<A8661>",
"<A2378>",
"<A8941>",
"<A7197>",
"<A5133>",
"<A3218>",
"<A9059>",
"<A7340>",
"<A9761>",
"<A9489>",
"<A5507>",
"<A8... | 25 | <A4464> | 31 | false | dispatch | pfsp_step_policy_v1 | 11 | <A4464> | <A4464> |
train_000001 | 1 | 50 | 5 | 50 | 20 | {
"step_idx": 20,
"total_steps": 50,
"scheduled_ratio": 0.4,
"current_cmax": 2497,
"total_remaining_work": 15779,
"unfinished_jobs_count": 30,
"unfinished_jobs_ratio": 0.6,
"machine_ready_min": 1555,
"machine_ready_mean": 2001.4,
"machine_ready_max": 2497,
"machine_ready_std": 339.6360404904,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
37,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A0557>",
"<A0563>",
"<A0378>",
"<A8735>",
"<A3789>",
"<A9131>",
"<A5346>",
"<A8784>",
"<A3758>",
"<A1423>",
"<A7297>",
"<A8455>",
"<A2031>",
"<A0149>",
"<A0025>",
"<A6144>",
"<A0082>",
"<A9913>",
"<A4183>",
"<A7314>",
"<A7292>",
"<A5388>",
"<A6178>",
"<A7580>",
"<A7... | {
"<A0557>": 4,
"<A0563>": 12,
"<A0378>": 39,
"<A8735>": 35,
"<A3789>": 3,
"<A9131>": 16,
"<A5346>": 22,
"<A8784>": 43,
"<A3758>": 40,
"<A1423>": 45,
"<A7297>": 14,
"<A8455>": 8,
"<A2031>": 44,
"<A0149>": 37,
"<A0025>": 49,
"<A6144>": 26,
"<A0082>": 27,
"<A9913>": 30,
"<A4183>": 6,... | [
"<A7770>",
"<A0082>",
"<A7580>",
"<A0025>",
"<A3789>",
"<A1423>",
"<A8455>",
"<A0563>",
"<A0149>",
"<A2031>",
"<A9913>",
"<A9131>",
"<A6144>",
"<A4228>",
"<A5388>",
"<A5346>",
"<A7613>",
"<A0789>",
"<A7314>",
"<A7297>",
"<A8735>",
"<A3758>",
"<A8784>",
"<A0557>",
"<A6... | 8 | <A0149> | 30 | false | dispatch | pfsp_step_policy_v1 | 37 | <A0149> | <A0149> |
train_000001 | 1 | 50 | 5 | 50 | 21 | {
"step_idx": 21,
"total_steps": 50,
"scheduled_ratio": 0.42,
"current_cmax": 2573,
"total_remaining_work": 15275,
"unfinished_jobs_count": 29,
"unfinished_jobs_ratio": 0.58,
"machine_ready_min": 1684,
"machine_ready_mean": 2102.2,
"machine_ready_max": 2573,
"machine_ready_std": 330.5398009317,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
38,
39,
40,
43,
44,
45,
46,
49
] | [
"<A4685>",
"<A0740>",
"<A1359>",
"<A5963>",
"<A9702>",
"<A3378>",
"<A9816>",
"<A2932>",
"<A5144>",
"<A2273>",
"<A5157>",
"<A5732>",
"<A6979>",
"<A6807>",
"<A1507>",
"<A6006>",
"<A5499>",
"<A8929>",
"<A6540>",
"<A3894>",
"<A5782>",
"<A8932>",
"<A9137>",
"<A1523>",
"<A5... | {
"<A4685>": 38,
"<A0740>": 43,
"<A1359>": 16,
"<A5963>": 19,
"<A9702>": 12,
"<A3378>": 29,
"<A9816>": 23,
"<A2932>": 31,
"<A5144>": 4,
"<A2273>": 30,
"<A5157>": 6,
"<A5732>": 1,
"<A6979>": 26,
"<A6807>": 45,
"<A1507>": 46,
"<A6006>": 44,
"<A5499>": 36,
"<A8929>": 9,
"<A6540>": 22,... | [
"<A8929>",
"<A3894>",
"<A6602>",
"<A0637>",
"<A3217>",
"<A6807>",
"<A8932>",
"<A9702>",
"<A6006>",
"<A2273>",
"<A1359>",
"<A6979>",
"<A1507>",
"<A5963>",
"<A6540>",
"<A5499>",
"<A5732>",
"<A3378>",
"<A9467>",
"<A5782>",
"<A1523>",
"<A0740>",
"<A5144>",
"<A2932>",
"<A5... | 21 | <A0740> | 29 | false | dispatch | pfsp_step_policy_v1 | 43 | <A0740> | <A0740> |
train_000001 | 1 | 50 | 5 | 50 | 22 | {
"step_idx": 22,
"total_steps": 50,
"scheduled_ratio": 0.44,
"current_cmax": 2705,
"total_remaining_work": 14755,
"unfinished_jobs_count": 28,
"unfinished_jobs_ratio": 0.56,
"machine_ready_min": 1780,
"machine_ready_mean": 2206.2,
"machine_ready_max": 2705,
"machine_ready_std": 332.8395409202,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
38,
39,
40,
44,
45,
46,
49
] | [
"<A1405>",
"<A5377>",
"<A4802>",
"<A9125>",
"<A0788>",
"<A8601>",
"<A3104>",
"<A3145>",
"<A0378>",
"<A3000>",
"<A2727>",
"<A9559>",
"<A0967>",
"<A4750>",
"<A7715>",
"<A2732>",
"<A7855>",
"<A3799>",
"<A0467>",
"<A5530>",
"<A9641>",
"<A7615>",
"<A7816>",
"<A1967>",
"<A5... | {
"<A1405>": 5,
"<A5377>": 22,
"<A4802>": 49,
"<A9125>": 34,
"<A0788>": 29,
"<A8601>": 14,
"<A3104>": 44,
"<A3145>": 40,
"<A0378>": 46,
"<A3000>": 1,
"<A2727>": 39,
"<A9559>": 9,
"<A0967>": 36,
"<A4750>": 6,
"<A7715>": 31,
"<A2732>": 8,
"<A7855>": 26,
"<A3799>": 45,
"<A0467>": 30,
... | [
"<A9559>",
"<A1967>",
"<A1405>",
"<A4802>",
"<A5530>",
"<A3799>",
"<A2732>",
"<A3566>",
"<A3104>",
"<A0467>",
"<A9641>",
"<A7855>",
"<A0378>",
"<A5643>",
"<A5377>",
"<A0967>",
"<A3000>",
"<A0788>",
"<A8601>",
"<A7615>",
"<A3145>",
"<A3197>",
"<A7715>",
"<A9125>",
"<A7... | 24 | <A7942> | 28 | false | dispatch | pfsp_step_policy_v1 | 38 | <A7942> | <A7942> |
train_000001 | 1 | 50 | 5 | 50 | 23 | {
"step_idx": 23,
"total_steps": 50,
"scheduled_ratio": 0.46,
"current_cmax": 2841,
"total_remaining_work": 14260,
"unfinished_jobs_count": 27,
"unfinished_jobs_ratio": 0.54,
"machine_ready_min": 1891,
"machine_ready_mean": 2305.2,
"machine_ready_max": 2841,
"machine_ready_std": 346.3630465278,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
27,
29,
30,
31,
34,
35,
36,
39,
40,
44,
45,
46,
49
] | [
"<A9726>",
"<A5210>",
"<A4029>",
"<A6622>",
"<A2968>",
"<A8017>",
"<A6161>",
"<A7186>",
"<A2848>",
"<A4322>",
"<A6451>",
"<A9510>",
"<A5304>",
"<A9548>",
"<A5448>",
"<A0852>",
"<A4929>",
"<A7493>",
"<A2223>",
"<A9804>",
"<A8013>",
"<A6820>",
"<A3540>",
"<A3341>",
"<A5... | {
"<A9726>": 6,
"<A5210>": 31,
"<A4029>": 14,
"<A6622>": 45,
"<A2968>": 30,
"<A8017>": 19,
"<A6161>": 46,
"<A7186>": 34,
"<A2848>": 29,
"<A4322>": 16,
"<A6451>": 9,
"<A9510>": 4,
"<A5304>": 36,
"<A9548>": 3,
"<A5448>": 12,
"<A0852>": 22,
"<A4929>": 49,
"<A7493>": 8,
"<A2223>": 1,
... | [
"<A6451>",
"<A3540>",
"<A6894>",
"<A4929>",
"<A9548>",
"<A6622>",
"<A7493>",
"<A5448>",
"<A5938>",
"<A2968>",
"<A4322>",
"<A3515>",
"<A6161>",
"<A8017>",
"<A0852>",
"<A5304>",
"<A2223>",
"<A2848>",
"<A4029>",
"<A3341>",
"<A8013>",
"<A9510>",
"<A5210>",
"<A7186>",
"<A9... | 1 | <A3540> | 27 | false | dispatch | pfsp_step_policy_v1 | 27 | <A3540> | <A3540> |
train_000001 | 1 | 50 | 5 | 50 | 24 | {
"step_idx": 24,
"total_steps": 50,
"scheduled_ratio": 0.48,
"current_cmax": 2905,
"total_remaining_work": 13736,
"unfinished_jobs_count": 26,
"unfinished_jobs_ratio": 0.52,
"machine_ready_min": 1996,
"machine_ready_mean": 2410,
"machine_ready_max": 2905,
"machine_ready_std": 337.2376016995,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
1,
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
29,
30,
31,
34,
35,
36,
39,
40,
44,
45,
46,
49
] | [
"<A4017>",
"<A3714>",
"<A4066>",
"<A6057>",
"<A8742>",
"<A9317>",
"<A8597>",
"<A5626>",
"<A4655>",
"<A4756>",
"<A1460>",
"<A2359>",
"<A5784>",
"<A2582>",
"<A5145>",
"<A8267>",
"<A1064>",
"<A4394>",
"<A1824>",
"<A1866>",
"<A5888>",
"<A6703>",
"<A2006>",
"<A0401>",
"<A8... | {
"<A4017>": 29,
"<A3714>": 36,
"<A4066>": 39,
"<A6057>": 4,
"<A8742>": 12,
"<A9317>": 31,
"<A8597>": 23,
"<A5626>": 19,
"<A4655>": 5,
"<A4756>": 40,
"<A1460>": 22,
"<A2359>": 30,
"<A5784>": 9,
"<A2582>": 45,
"<A5145>": 6,
"<A8267>": 8,
"<A1064>": 34,
"<A4394>": 14,
"<A1824>": 26,
... | [
"<A5784>",
"<A4655>",
"<A6703>",
"<A5888>",
"<A2582>",
"<A8267>",
"<A8742>",
"<A0397>",
"<A2359>",
"<A0401>",
"<A1824>",
"<A2006>",
"<A5626>",
"<A1460>",
"<A3714>",
"<A1866>",
"<A4017>",
"<A4394>",
"<A8052>",
"<A4756>",
"<A6057>",
"<A9317>",
"<A1064>",
"<A5145>",
"<A8... | 15 | <A1866> | 26 | false | dispatch | pfsp_step_policy_v1 | 1 | <A1866> | <A1866> |
train_000001 | 1 | 50 | 5 | 50 | 25 | {
"step_idx": 25,
"total_steps": 50,
"scheduled_ratio": 0.5,
"current_cmax": 3016,
"total_remaining_work": 13198,
"unfinished_jobs_count": 25,
"unfinished_jobs_ratio": 0.5,
"machine_ready_min": 2077,
"machine_ready_mean": 2517.6,
"machine_ready_max": 3016,
"machine_ready_std": 342.092735965,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
4,
5,
6,
8,
9,
12,
14,
16,
19,
22,
23,
26,
29,
30,
31,
34,
35,
36,
39,
40,
44,
45,
46,
49
] | [
"<A1172>",
"<A9364>",
"<A2738>",
"<A6179>",
"<A2820>",
"<A2828>",
"<A9009>",
"<A9986>",
"<A9111>",
"<A9026>",
"<A0602>",
"<A4888>",
"<A9919>",
"<A2942>",
"<A5159>",
"<A7484>",
"<A3316>",
"<A5836>",
"<A6605>",
"<A9116>",
"<A5258>",
"<A9431>",
"<A4285>",
"<A5651>",
"<A7... | {
"<A1172>": 12,
"<A9364>": 26,
"<A2738>": 8,
"<A6179>": 49,
"<A2820>": 34,
"<A2828>": 35,
"<A9009>": 3,
"<A9986>": 36,
"<A9111>": 4,
"<A9026>": 45,
"<A0602>": 44,
"<A4888>": 29,
"<A9919>": 22,
"<A2942>": 30,
"<A5159>": 31,
"<A7484>": 5,
"<A3316>": 14,
"<A5836>": 16,
"<A6605>": 6,
... | [
"<A9431>",
"<A7484>",
"<A6179>",
"<A9009>",
"<A9026>",
"<A2738>",
"<A1172>",
"<A0602>",
"<A2942>",
"<A5836>",
"<A9364>",
"<A7680>",
"<A5651>",
"<A9919>",
"<A9986>",
"<A4888>",
"<A3316>",
"<A2828>",
"<A4285>",
"<A9111>",
"<A5159>",
"<A2820>",
"<A6605>",
"<A9116>",
"<A5... | 5 | <A2738> | 25 | false | dispatch | pfsp_step_policy_v1 | 8 | <A2738> | <A2738> |
train_000001 | 1 | 50 | 5 | 50 | 26 | {
"step_idx": 26,
"total_steps": 50,
"scheduled_ratio": 0.52,
"current_cmax": 3090,
"total_remaining_work": 12676,
"unfinished_jobs_count": 24,
"unfinished_jobs_ratio": 0.48,
"machine_ready_min": 2195,
"machine_ready_mean": 2622,
"machine_ready_max": 3090,
"machine_ready_std": 339.5844519409,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
4,
5,
6,
9,
12,
14,
16,
19,
22,
23,
26,
29,
30,
31,
34,
35,
36,
39,
40,
44,
45,
46,
49
] | [
"<A6472>",
"<A9361>",
"<A3256>",
"<A6932>",
"<A1518>",
"<A0230>",
"<A9415>",
"<A9912>",
"<A3150>",
"<A8866>",
"<A3566>",
"<A7281>",
"<A5762>",
"<A1218>",
"<A5488>",
"<A2321>",
"<A7041>",
"<A0498>",
"<A1702>",
"<A8800>",
"<A2018>",
"<A4736>",
"<A2266>",
"<A6340>"
] | {
"<A6472>": 16,
"<A9361>": 46,
"<A3256>": 6,
"<A6932>": 35,
"<A1518>": 23,
"<A0230>": 9,
"<A9415>": 19,
"<A9912>": 39,
"<A3150>": 12,
"<A8866>": 3,
"<A3566>": 31,
"<A7281>": 26,
"<A5762>": 45,
"<A1218>": 29,
"<A5488>": 40,
"<A2321>": 14,
"<A7041>": 22,
"<A0498>": 44,
"<A1702>": 5,... | [
"<A0230>",
"<A1702>",
"<A4736>",
"<A8866>",
"<A5762>",
"<A3150>",
"<A0498>",
"<A2266>",
"<A6472>",
"<A7281>",
"<A9361>",
"<A9415>",
"<A7041>",
"<A2018>",
"<A1218>",
"<A2321>",
"<A6932>",
"<A5488>",
"<A6340>",
"<A3566>",
"<A8800>",
"<A3256>",
"<A1518>",
"<A9912>"
] | 23 | <A9912> | 24 | false | dispatch | pfsp_step_policy_v1 | 39 | <A9912> | <A9912> |
train_000001 | 1 | 50 | 5 | 50 | 27 | {
"step_idx": 27,
"total_steps": 50,
"scheduled_ratio": 0.54,
"current_cmax": 3239,
"total_remaining_work": 12115,
"unfinished_jobs_count": 23,
"unfinished_jobs_ratio": 0.46,
"machine_ready_min": 2293,
"machine_ready_mean": 2734.2,
"machine_ready_max": 3239,
"machine_ready_std": 347.483179449,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
4,
5,
6,
9,
12,
14,
16,
19,
22,
23,
26,
29,
30,
31,
34,
35,
36,
40,
44,
45,
46,
49
] | [
"<A5962>",
"<A4832>",
"<A7859>",
"<A1068>",
"<A4227>",
"<A0552>",
"<A0092>",
"<A5545>",
"<A0814>",
"<A3104>",
"<A2590>",
"<A0524>",
"<A5702>",
"<A6504>",
"<A1977>",
"<A3746>",
"<A9890>",
"<A7773>",
"<A4362>",
"<A1996>",
"<A8587>",
"<A3525>",
"<A4031>"
] | {
"<A5962>": 26,
"<A4832>": 30,
"<A7859>": 12,
"<A1068>": 4,
"<A4227>": 40,
"<A0552>": 3,
"<A0092>": 45,
"<A5545>": 9,
"<A0814>": 5,
"<A3104>": 44,
"<A2590>": 6,
"<A0524>": 29,
"<A5702>": 23,
"<A6504>": 34,
"<A1977>": 16,
"<A3746>": 14,
"<A9890>": 19,
"<A7773>": 35,
"<A4362>": 36,
... | [
"<A5545>",
"<A0814>",
"<A8587>",
"<A0552>",
"<A0092>",
"<A7859>",
"<A3104>",
"<A4832>",
"<A1977>",
"<A5962>",
"<A4031>",
"<A9890>",
"<A1996>",
"<A4362>",
"<A0524>",
"<A3746>",
"<A7773>",
"<A4227>",
"<A1068>",
"<A3525>",
"<A6504>",
"<A2590>",
"<A5702>"
] | 20 | <A6504> | 23 | false | dispatch | pfsp_step_policy_v1 | 34 | <A6504> | <A6504> |
train_000001 | 1 | 50 | 5 | 50 | 28 | {
"step_idx": 28,
"total_steps": 50,
"scheduled_ratio": 0.56,
"current_cmax": 3374,
"total_remaining_work": 11567,
"unfinished_jobs_count": 22,
"unfinished_jobs_ratio": 0.44,
"machine_ready_min": 2403,
"machine_ready_mean": 2843.8,
"machine_ready_max": 3374,
"machine_ready_std": 364.4137209272,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
4,
5,
6,
9,
12,
14,
16,
19,
22,
23,
26,
29,
30,
31,
35,
36,
40,
44,
45,
46,
49
] | [
"<A3808>",
"<A9767>",
"<A4551>",
"<A1693>",
"<A0806>",
"<A0946>",
"<A1778>",
"<A9620>",
"<A6570>",
"<A9380>",
"<A9459>",
"<A1175>",
"<A8590>",
"<A9679>",
"<A8960>",
"<A3037>",
"<A8079>",
"<A5074>",
"<A4854>",
"<A0170>",
"<A6349>",
"<A7988>"
] | {
"<A3808>": 9,
"<A9767>": 30,
"<A4551>": 12,
"<A1693>": 4,
"<A0806>": 49,
"<A0946>": 5,
"<A1778>": 14,
"<A9620>": 3,
"<A6570>": 40,
"<A9380>": 22,
"<A9459>": 26,
"<A1175>": 46,
"<A8590>": 19,
"<A9679>": 29,
"<A8960>": 44,
"<A3037>": 23,
"<A8079>": 6,
"<A5074>": 31,
"<A4854>": 45,
... | [
"<A3808>",
"<A0946>",
"<A0806>",
"<A9620>",
"<A4854>",
"<A4551>",
"<A8960>",
"<A9767>",
"<A0170>",
"<A9459>",
"<A1175>",
"<A8590>",
"<A9380>",
"<A6349>",
"<A9679>",
"<A1778>",
"<A7988>",
"<A6570>",
"<A1693>",
"<A5074>",
"<A8079>",
"<A3037>"
] | 15 | <A1778> | 22 | false | dispatch | pfsp_step_policy_v1 | 14 | <A1778> | <A1778> |
train_000001 | 1 | 50 | 5 | 50 | 29 | {
"step_idx": 29,
"total_steps": 50,
"scheduled_ratio": 0.58,
"current_cmax": 3495,
"total_remaining_work": 11019,
"unfinished_jobs_count": 21,
"unfinished_jobs_ratio": 0.42,
"machine_ready_min": 2487,
"machine_ready_mean": 2953.4,
"machine_ready_max": 3495,
"machine_ready_std": 366.3231360425,
... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
4,
5,
6,
9,
12,
16,
19,
22,
23,
26,
29,
30,
31,
35,
36,
40,
44,
45,
46,
49
] | [
"<A7099>",
"<A0371>",
"<A8473>",
"<A8459>",
"<A0033>",
"<A3908>",
"<A6939>",
"<A6518>",
"<A7695>",
"<A0917>",
"<A5234>",
"<A6121>",
"<A7427>",
"<A2785>",
"<A3742>",
"<A3911>",
"<A9408>",
"<A5009>",
"<A4836>",
"<A7194>",
"<A1521>"
] | {
"<A7099>": 12,
"<A0371>": 9,
"<A8473>": 3,
"<A8459>": 45,
"<A0033>": 23,
"<A3908>": 35,
"<A6939>": 29,
"<A6518>": 46,
"<A7695>": 6,
"<A0917>": 36,
"<A5234>": 16,
"<A6121>": 5,
"<A7427>": 49,
"<A2785>": 31,
"<A3742>": 30,
"<A3911>": 40,
"<A9408>": 22,
"<A5009>": 26,
"<A4836>": 19,... | [
"<A0371>",
"<A6121>",
"<A7427>",
"<A8473>",
"<A8459>",
"<A7099>",
"<A7194>",
"<A3742>",
"<A5234>",
"<A5009>",
"<A6518>",
"<A4836>",
"<A9408>",
"<A0917>",
"<A6939>",
"<A3908>",
"<A3911>",
"<A1521>",
"<A2785>",
"<A7695>",
"<A0033>"
] | 17 | <A1521> | 21 | false | dispatch | pfsp_step_policy_v1 | 4 | <A1521> | <A1521> |
train_000001 | 1 | 50 | 5 | 50 | 30 | {
"step_idx": 30,
"total_steps": 50,
"scheduled_ratio": 0.6,
"current_cmax": 3628,
"total_remaining_work": 10460,
"unfinished_jobs_count": 20,
"unfinished_jobs_ratio": 0.4,
"machine_ready_min": 2627,
"machine_ready_mean": 3065.2,
"machine_ready_max": 3628,
"machine_ready_std": 377.8139224539,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
16,
19,
22,
23,
26,
29,
30,
31,
35,
36,
40,
44,
45,
46,
49
] | [
"<A9239>",
"<A2584>",
"<A1560>",
"<A8835>",
"<A5779>",
"<A3748>",
"<A3276>",
"<A4005>",
"<A8801>",
"<A9131>",
"<A9960>",
"<A9481>",
"<A4009>",
"<A7614>",
"<A8470>",
"<A1284>",
"<A5057>",
"<A6102>",
"<A4409>",
"<A8500>"
] | {
"<A9239>": 22,
"<A2584>": 23,
"<A1560>": 9,
"<A8835>": 16,
"<A5779>": 49,
"<A3748>": 3,
"<A3276>": 26,
"<A4005>": 5,
"<A8801>": 45,
"<A9131>": 29,
"<A9960>": 30,
"<A9481>": 36,
"<A4009>": 44,
"<A7614>": 46,
"<A8470>": 35,
"<A1284>": 19,
"<A5057>": 6,
"<A6102>": 40,
"<A4409>": 12,... | [
"<A1560>",
"<A4005>",
"<A5779>",
"<A3748>",
"<A8801>",
"<A4409>",
"<A4009>",
"<A9960>",
"<A8835>",
"<A3276>",
"<A7614>",
"<A1284>",
"<A9239>",
"<A9481>",
"<A9131>",
"<A8470>",
"<A6102>",
"<A8500>",
"<A5057>",
"<A2584>"
] | 14 | <A9131> | 20 | false | dispatch | pfsp_step_policy_v1 | 29 | <A9131> | <A9131> |
train_000001 | 1 | 50 | 5 | 50 | 31 | {
"step_idx": 31,
"total_steps": 50,
"scheduled_ratio": 0.62,
"current_cmax": 3747,
"total_remaining_work": 9863,
"unfinished_jobs_count": 19,
"unfinished_jobs_ratio": 0.38,
"machine_ready_min": 2714,
"machine_ready_mean": 3184.6,
"machine_ready_max": 3747,
"machine_ready_std": 380.7437983737,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
16,
19,
22,
23,
26,
30,
31,
35,
36,
40,
44,
45,
46,
49
] | [
"<A7673>",
"<A3200>",
"<A5532>",
"<A8299>",
"<A0999>",
"<A6083>",
"<A7606>",
"<A9217>",
"<A0701>",
"<A3444>",
"<A0071>",
"<A2390>",
"<A4440>",
"<A2780>",
"<A4612>",
"<A5248>",
"<A8559>",
"<A0711>",
"<A6529>"
] | {
"<A7673>": 6,
"<A3200>": 23,
"<A5532>": 49,
"<A8299>": 35,
"<A0999>": 44,
"<A6083>": 45,
"<A7606>": 22,
"<A9217>": 30,
"<A0701>": 36,
"<A3444>": 3,
"<A0071>": 19,
"<A2390>": 31,
"<A4440>": 40,
"<A2780>": 9,
"<A4612>": 46,
"<A5248>": 12,
"<A8559>": 16,
"<A0711>": 26,
"<A6529>": 5
... | [
"<A2780>",
"<A6529>",
"<A5532>",
"<A3444>",
"<A6083>",
"<A5248>",
"<A0999>",
"<A9217>",
"<A8559>",
"<A0711>",
"<A4612>",
"<A0071>",
"<A7606>",
"<A0701>",
"<A8299>",
"<A4440>",
"<A2390>",
"<A7673>",
"<A3200>"
] | 15 | <A4440> | 19 | false | dispatch | pfsp_step_policy_v1 | 40 | <A4440> | <A4440> |
train_000001 | 1 | 50 | 5 | 50 | 32 | {
"step_idx": 32,
"total_steps": 50,
"scheduled_ratio": 0.64,
"current_cmax": 3879,
"total_remaining_work": 9359,
"unfinished_jobs_count": 18,
"unfinished_jobs_ratio": 0.36,
"machine_ready_min": 2814,
"machine_ready_mean": 3285.4,
"machine_ready_max": 3879,
"machine_ready_std": 395.2490860204,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
16,
19,
22,
23,
26,
30,
31,
35,
36,
44,
45,
46,
49
] | [
"<A5472>",
"<A9425>",
"<A4256>",
"<A0537>",
"<A1287>",
"<A8237>",
"<A7203>",
"<A0524>",
"<A7815>",
"<A7218>",
"<A4114>",
"<A2279>",
"<A8299>",
"<A9791>",
"<A3438>",
"<A1358>",
"<A9254>",
"<A6859>"
] | {
"<A5472>": 30,
"<A9425>": 6,
"<A4256>": 44,
"<A0537>": 26,
"<A1287>": 9,
"<A8237>": 5,
"<A7203>": 49,
"<A0524>": 45,
"<A7815>": 23,
"<A7218>": 16,
"<A4114>": 3,
"<A2279>": 12,
"<A8299>": 36,
"<A9791>": 46,
"<A3438>": 22,
"<A1358>": 35,
"<A9254>": 19,
"<A6859>": 31
} | [
"<A1287>",
"<A8237>",
"<A7203>",
"<A4114>",
"<A0524>",
"<A2279>",
"<A4256>",
"<A5472>",
"<A7218>",
"<A0537>",
"<A9791>",
"<A9254>",
"<A3438>",
"<A8299>",
"<A1358>",
"<A6859>",
"<A9425>",
"<A7815>"
] | 12 | <A3438> | 18 | false | dispatch | pfsp_step_policy_v1 | 22 | <A3438> | <A3438> |
train_000001 | 1 | 50 | 5 | 50 | 33 | {
"step_idx": 33,
"total_steps": 50,
"scheduled_ratio": 0.66,
"current_cmax": 3978,
"total_remaining_work": 8809,
"unfinished_jobs_count": 17,
"unfinished_jobs_ratio": 0.34,
"machine_ready_min": 2943,
"machine_ready_mean": 3395.4,
"machine_ready_max": 3978,
"machine_ready_std": 385.2098648789,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
16,
19,
23,
26,
30,
31,
35,
36,
44,
45,
46,
49
] | [
"<A7933>",
"<A4234>",
"<A7444>",
"<A3437>",
"<A0310>",
"<A9638>",
"<A9386>",
"<A7989>",
"<A0084>",
"<A5667>",
"<A2354>",
"<A0678>",
"<A8456>",
"<A0027>",
"<A9478>",
"<A3224>",
"<A5195>"
] | {
"<A7933>": 44,
"<A4234>": 31,
"<A7444>": 36,
"<A3437>": 19,
"<A0310>": 23,
"<A9638>": 30,
"<A9386>": 26,
"<A7989>": 46,
"<A0084>": 5,
"<A5667>": 35,
"<A2354>": 16,
"<A0678>": 3,
"<A8456>": 6,
"<A0027>": 12,
"<A9478>": 9,
"<A3224>": 45,
"<A5195>": 49
} | [
"<A9478>",
"<A0084>",
"<A5195>",
"<A0678>",
"<A3224>",
"<A0027>",
"<A7933>",
"<A9638>",
"<A2354>",
"<A9386>",
"<A7989>",
"<A3437>",
"<A7444>",
"<A5667>",
"<A4234>",
"<A8456>",
"<A0310>"
] | 8 | <A2354> | 17 | false | dispatch | pfsp_step_policy_v1 | 16 | <A2354> | <A2354> |
train_000001 | 1 | 50 | 5 | 50 | 34 | {
"step_idx": 34,
"total_steps": 50,
"scheduled_ratio": 0.68,
"current_cmax": 4059,
"total_remaining_work": 8341,
"unfinished_jobs_count": 16,
"unfinished_jobs_ratio": 0.32,
"machine_ready_min": 3051,
"machine_ready_mean": 3489,
"machine_ready_max": 4059,
"machine_ready_std": 379.2967176236,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
19,
23,
26,
30,
31,
35,
36,
44,
45,
46,
49
] | [
"<A6384>",
"<A8517>",
"<A3326>",
"<A5398>",
"<A8340>",
"<A8251>",
"<A5389>",
"<A6920>",
"<A1855>",
"<A6849>",
"<A5730>",
"<A7495>",
"<A0243>",
"<A1566>",
"<A3083>",
"<A3348>"
] | {
"<A6384>": 6,
"<A8517>": 12,
"<A3326>": 3,
"<A5398>": 45,
"<A8340>": 46,
"<A8251>": 31,
"<A5389>": 9,
"<A6920>": 23,
"<A1855>": 35,
"<A6849>": 49,
"<A5730>": 36,
"<A7495>": 26,
"<A0243>": 19,
"<A1566>": 5,
"<A3083>": 44,
"<A3348>": 30
} | [
"<A5389>",
"<A1566>",
"<A6849>",
"<A3326>",
"<A5398>",
"<A8517>",
"<A3083>",
"<A3348>",
"<A7495>",
"<A8340>",
"<A0243>",
"<A5730>",
"<A1855>",
"<A8251>",
"<A6384>",
"<A6920>"
] | 2 | <A6849> | 16 | false | dispatch | pfsp_step_policy_v1 | 49 | <A6849> | <A6849> |
train_000001 | 1 | 50 | 5 | 50 | 35 | {
"step_idx": 35,
"total_steps": 50,
"scheduled_ratio": 0.7,
"current_cmax": 4128,
"total_remaining_work": 7789,
"unfinished_jobs_count": 15,
"unfinished_jobs_ratio": 0.3,
"machine_ready_min": 3140,
"machine_ready_mean": 3599.4,
"machine_ready_max": 4128,
"machine_ready_std": 372.1293323564,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
19,
23,
26,
30,
31,
35,
36,
44,
45,
46
] | [
"<A6204>",
"<A1406>",
"<A0039>",
"<A5785>",
"<A3014>",
"<A2961>",
"<A0920>",
"<A9887>",
"<A0080>",
"<A7793>",
"<A2661>",
"<A3140>",
"<A4558>",
"<A8569>",
"<A8439>"
] | {
"<A6204>": 19,
"<A1406>": 30,
"<A0039>": 23,
"<A5785>": 26,
"<A3014>": 9,
"<A2961>": 12,
"<A0920>": 46,
"<A9887>": 44,
"<A0080>": 35,
"<A7793>": 45,
"<A2661>": 31,
"<A3140>": 6,
"<A4558>": 36,
"<A8569>": 3,
"<A8439>": 5
} | [
"<A3014>",
"<A8439>",
"<A8569>",
"<A7793>",
"<A2961>",
"<A9887>",
"<A1406>",
"<A5785>",
"<A0920>",
"<A6204>",
"<A4558>",
"<A0080>",
"<A2661>",
"<A3140>",
"<A0039>"
] | 11 | <A0080> | 15 | false | dispatch | pfsp_step_policy_v1 | 35 | <A0080> | <A0080> |
train_000001 | 1 | 50 | 5 | 50 | 36 | {
"step_idx": 36,
"total_steps": 50,
"scheduled_ratio": 0.72,
"current_cmax": 4259,
"total_remaining_work": 7215,
"unfinished_jobs_count": 14,
"unfinished_jobs_ratio": 0.28,
"machine_ready_min": 3273,
"machine_ready_mean": 3714.2,
"machine_ready_max": 4259,
"machine_ready_std": 369.3380023772,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
19,
23,
26,
30,
31,
36,
44,
45,
46
] | [
"<A6654>",
"<A4813>",
"<A0558>",
"<A7056>",
"<A8933>",
"<A0041>",
"<A0726>",
"<A9136>",
"<A6208>",
"<A5778>",
"<A9316>",
"<A7498>",
"<A0927>",
"<A3264>"
] | {
"<A6654>": 26,
"<A4813>": 5,
"<A0558>": 12,
"<A7056>": 46,
"<A8933>": 36,
"<A0041>": 31,
"<A0726>": 19,
"<A9136>": 3,
"<A6208>": 23,
"<A5778>": 30,
"<A9316>": 6,
"<A7498>": 45,
"<A0927>": 44,
"<A3264>": 9
} | [
"<A3264>",
"<A4813>",
"<A9136>",
"<A7498>",
"<A0558>",
"<A0927>",
"<A5778>",
"<A6654>",
"<A7056>",
"<A0726>",
"<A8933>",
"<A0041>",
"<A9316>",
"<A6208>"
] | 5 | <A0927> | 14 | false | dispatch | pfsp_step_policy_v1 | 44 | <A0927> | <A0927> |
train_000001 | 1 | 50 | 5 | 50 | 37 | {
"step_idx": 37,
"total_steps": 50,
"scheduled_ratio": 0.74,
"current_cmax": 4336,
"total_remaining_work": 6734,
"unfinished_jobs_count": 13,
"unfinished_jobs_ratio": 0.26,
"machine_ready_min": 3405,
"machine_ready_mean": 3810.4,
"machine_ready_max": 4336,
"machine_ready_std": 349.2595596401,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
19,
23,
26,
30,
31,
36,
45,
46
] | [
"<A0047>",
"<A6348>",
"<A1975>",
"<A3403>",
"<A8545>",
"<A6668>",
"<A7779>",
"<A9037>",
"<A5110>",
"<A7006>",
"<A2767>",
"<A8898>",
"<A2549>"
] | {
"<A0047>": 30,
"<A6348>": 5,
"<A1975>": 36,
"<A3403>": 12,
"<A8545>": 26,
"<A6668>": 23,
"<A7779>": 3,
"<A9037>": 9,
"<A5110>": 45,
"<A7006>": 19,
"<A2767>": 6,
"<A8898>": 31,
"<A2549>": 46
} | [
"<A9037>",
"<A6348>",
"<A7779>",
"<A5110>",
"<A3403>",
"<A0047>",
"<A8545>",
"<A2549>",
"<A7006>",
"<A1975>",
"<A8898>",
"<A2767>",
"<A6668>"
] | 12 | <A6668> | 13 | false | dispatch | pfsp_step_policy_v1 | 23 | <A6668> | <A6668> |
train_000001 | 1 | 50 | 5 | 50 | 38 | {
"step_idx": 38,
"total_steps": 50,
"scheduled_ratio": 0.76,
"current_cmax": 4482,
"total_remaining_work": 6154,
"unfinished_jobs_count": 12,
"unfinished_jobs_ratio": 0.24,
"machine_ready_min": 3501,
"machine_ready_mean": 3926.4,
"machine_ready_max": 4482,
"machine_ready_std": 365.9566094498,
"... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
19,
26,
30,
31,
36,
45,
46
] | [
"<A0559>",
"<A3453>",
"<A7500>",
"<A8583>",
"<A6818>",
"<A5315>",
"<A4525>",
"<A9127>",
"<A4366>",
"<A4471>",
"<A3285>",
"<A7045>"
] | {
"<A0559>": 12,
"<A3453>": 31,
"<A7500>": 36,
"<A8583>": 46,
"<A6818>": 5,
"<A5315>": 9,
"<A4525>": 6,
"<A9127>": 30,
"<A4366>": 26,
"<A4471>": 19,
"<A3285>": 3,
"<A7045>": 45
} | [
"<A5315>",
"<A6818>",
"<A3285>",
"<A7045>",
"<A0559>",
"<A9127>",
"<A4366>",
"<A8583>",
"<A4471>",
"<A7500>",
"<A3453>",
"<A4525>"
] | 8 | <A4471> | 12 | false | dispatch | pfsp_step_policy_v1 | 19 | <A4471> | <A4471> |
train_000001 | 1 | 50 | 5 | 50 | 39 | {
"step_idx": 39,
"total_steps": 50,
"scheduled_ratio": 0.78,
"current_cmax": 4575,
"total_remaining_work": 5560,
"unfinished_jobs_count": 11,
"unfinished_jobs_ratio": 0.22,
"machine_ready_min": 3630,
"machine_ready_mean": 4050,
"machine_ready_max": 4575,
"machine_ready_std": 356.3717160494,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
6,
9,
12,
26,
30,
31,
36,
45,
46
] | [
"<A6037>",
"<A8507>",
"<A4817>",
"<A7126>",
"<A0008>",
"<A5333>",
"<A6278>",
"<A9777>",
"<A1138>",
"<A2457>",
"<A0471>"
] | {
"<A6037>": 46,
"<A8507>": 45,
"<A4817>": 5,
"<A7126>": 26,
"<A0008>": 36,
"<A5333>": 9,
"<A6278>": 3,
"<A9777>": 30,
"<A1138>": 6,
"<A2457>": 12,
"<A0471>": 31
} | [
"<A5333>",
"<A4817>",
"<A6278>",
"<A8507>",
"<A2457>",
"<A9777>",
"<A7126>",
"<A6037>",
"<A0008>",
"<A0471>",
"<A1138>"
] | 10 | <A1138> | 11 | false | dispatch | pfsp_step_policy_v1 | 6 | <A1138> | <A1138> |
train_000001 | 1 | 50 | 5 | 50 | 40 | {
"step_idx": 40,
"total_steps": 50,
"scheduled_ratio": 0.8,
"current_cmax": 4711,
"total_remaining_work": 4984,
"unfinished_jobs_count": 10,
"unfinished_jobs_ratio": 0.2,
"machine_ready_min": 3751,
"machine_ready_mean": 4166.8,
"machine_ready_max": 4711,
"machine_ready_std": 360.2201549053,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
3,
5,
9,
12,
26,
30,
31,
36,
45,
46
] | [
"<A2909>",
"<A1684>",
"<A5593>",
"<A3480>",
"<A5647>",
"<A8675>",
"<A0942>",
"<A0691>",
"<A5079>",
"<A8778>"
] | {
"<A2909>": 36,
"<A1684>": 9,
"<A5593>": 5,
"<A3480>": 26,
"<A5647>": 3,
"<A8675>": 30,
"<A0942>": 46,
"<A0691>": 31,
"<A5079>": 45,
"<A8778>": 12
} | [
"<A1684>",
"<A5593>",
"<A5647>",
"<A5079>",
"<A8778>",
"<A8675>",
"<A3480>",
"<A0942>",
"<A2909>",
"<A0691>"
] | 2 | <A5647> | 10 | false | dispatch | pfsp_step_policy_v1 | 3 | <A5647> | <A5647> |
train_000001 | 1 | 50 | 5 | 50 | 41 | {
"step_idx": 41,
"total_steps": 50,
"scheduled_ratio": 0.82,
"current_cmax": 4780,
"total_remaining_work": 4393,
"unfinished_jobs_count": 9,
"unfinished_jobs_ratio": 0.18,
"machine_ready_min": 3894,
"machine_ready_mean": 4294.2,
"machine_ready_max": 4780,
"machine_ready_std": 340.2142854144,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
5,
9,
12,
26,
30,
31,
36,
45,
46
] | [
"<A4838>",
"<A9294>",
"<A7391>",
"<A6421>",
"<A0884>",
"<A1332>",
"<A4054>",
"<A2150>",
"<A7658>"
] | {
"<A4838>": 9,
"<A9294>": 26,
"<A7391>": 5,
"<A6421>": 30,
"<A0884>": 45,
"<A1332>": 12,
"<A4054>": 46,
"<A2150>": 36,
"<A7658>": 31
} | [
"<A4838>",
"<A7391>",
"<A0884>",
"<A1332>",
"<A6421>",
"<A9294>",
"<A4054>",
"<A2150>",
"<A7658>"
] | 3 | <A1332> | 9 | false | dispatch | pfsp_step_policy_v1 | 12 | <A1332> | <A1332> |
train_000001 | 1 | 50 | 5 | 50 | 42 | {
"step_idx": 42,
"total_steps": 50,
"scheduled_ratio": 0.84,
"current_cmax": 4856,
"total_remaining_work": 3926,
"unfinished_jobs_count": 8,
"unfinished_jobs_ratio": 0.16,
"machine_ready_min": 3999,
"machine_ready_mean": 4387.6,
"machine_ready_max": 4856,
"machine_ready_std": 346.5201870021,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
5,
9,
26,
30,
31,
36,
45,
46
] | [
"<A9821>",
"<A6544>",
"<A0584>",
"<A9243>",
"<A9583>",
"<A5035>",
"<A5789>",
"<A3989>"
] | {
"<A9821>": 5,
"<A6544>": 31,
"<A0584>": 45,
"<A9243>": 46,
"<A9583>": 26,
"<A5035>": 30,
"<A5789>": 36,
"<A3989>": 9
} | [
"<A3989>",
"<A9821>",
"<A5035>",
"<A9583>",
"<A9243>",
"<A0584>",
"<A5789>",
"<A6544>"
] | 4 | <A9243> | 8 | false | dispatch | pfsp_step_policy_v1 | 46 | <A9243> | <A9243> |
train_000001 | 1 | 50 | 5 | 50 | 43 | {
"step_idx": 43,
"total_steps": 50,
"scheduled_ratio": 0.86,
"current_cmax": 4949,
"total_remaining_work": 3398,
"unfinished_jobs_count": 7,
"unfinished_jobs_ratio": 0.14,
"machine_ready_min": 4070,
"machine_ready_mean": 4498,
"machine_ready_max": 4949,
"machine_ready_std": 340.0864595952,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
5,
9,
26,
30,
31,
36,
45
] | [
"<A1891>",
"<A3946>",
"<A3571>",
"<A7034>",
"<A3031>",
"<A6685>",
"<A4736>"
] | {
"<A1891>": 26,
"<A3946>": 5,
"<A3571>": 9,
"<A7034>": 45,
"<A3031>": 31,
"<A6685>": 36,
"<A4736>": 30
} | [
"<A3571>",
"<A3946>",
"<A4736>",
"<A1891>",
"<A7034>",
"<A6685>",
"<A3031>"
] | 5 | <A6685> | 7 | false | dispatch | pfsp_step_policy_v1 | 36 | <A6685> | <A6685> |
train_000001 | 1 | 50 | 5 | 50 | 44 | {
"step_idx": 44,
"total_steps": 50,
"scheduled_ratio": 0.88,
"current_cmax": 5058,
"total_remaining_work": 2873,
"unfinished_jobs_count": 6,
"unfinished_jobs_ratio": 0.12,
"machine_ready_min": 4175,
"machine_ready_mean": 4603,
"machine_ready_max": 5058,
"machine_ready_std": 333.1696264668,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
5,
9,
26,
30,
31,
45
] | [
"<A3992>",
"<A4179>",
"<A2542>",
"<A7276>",
"<A7986>",
"<A4474>"
] | {
"<A3992>": 31,
"<A4179>": 9,
"<A2542>": 26,
"<A7276>": 45,
"<A7986>": 30,
"<A4474>": 5
} | [
"<A4179>",
"<A4474>",
"<A7276>",
"<A7986>",
"<A2542>",
"<A3992>"
] | 1 | <A4474> | 6 | false | dispatch | pfsp_step_policy_v1 | 5 | <A4474> | <A4474> |
train_000001 | 1 | 50 | 5 | 50 | 45 | {
"step_idx": 45,
"total_steps": 50,
"scheduled_ratio": 0.9,
"current_cmax": 5125,
"total_remaining_work": 2336,
"unfinished_jobs_count": 5,
"unfinished_jobs_ratio": 0.1,
"machine_ready_min": 4293,
"machine_ready_mean": 4713.8,
"machine_ready_max": 5125,
"machine_ready_std": 318.7697601718,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
9,
26,
30,
31,
45
] | [
"<A2282>",
"<A5441>",
"<A4005>",
"<A5968>",
"<A0626>"
] | {
"<A2282>": 30,
"<A5441>": 31,
"<A4005>": 45,
"<A5968>": 9,
"<A0626>": 26
} | [
"<A5968>",
"<A0626>",
"<A2282>",
"<A5441>",
"<A4005>"
] | 1 | <A0626> | 5 | false | dispatch | pfsp_step_policy_v1 | 26 | <A0626> | <A0626> |
train_000001 | 1 | 50 | 5 | 50 | 46 | {
"step_idx": 46,
"total_steps": 50,
"scheduled_ratio": 0.92,
"current_cmax": 5210,
"total_remaining_work": 1840,
"unfinished_jobs_count": 4,
"unfinished_jobs_ratio": 0.08,
"machine_ready_min": 4383,
"machine_ready_mean": 4823.2,
"machine_ready_max": 5210,
"machine_ready_std": 304.2192630324,
"m... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
9,
30,
31,
45
] | [
"<A9974>",
"<A4345>",
"<A6319>",
"<A5251>"
] | {
"<A9974>": 30,
"<A4345>": 45,
"<A6319>": 31,
"<A5251>": 9
} | [
"<A5251>",
"<A9974>",
"<A4345>",
"<A6319>"
] | 3 | <A6319> | 4 | false | dispatch | pfsp_step_policy_v1 | 31 | <A6319> | <A6319> |
train_000001 | 1 | 50 | 5 | 50 | 47 | {
"step_idx": 47,
"total_steps": 50,
"scheduled_ratio": 0.94,
"current_cmax": 5344,
"total_remaining_work": 1335,
"unfinished_jobs_count": 3,
"unfinished_jobs_ratio": 0.06,
"machine_ready_min": 4483,
"machine_ready_mean": 4929.4,
"machine_ready_max": 5344,
"machine_ready_std": 301.81358485,
"mac... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
9,
30,
45
] | [
"<A1921>",
"<A1601>",
"<A9290>"
] | {
"<A1921>": 9,
"<A1601>": 45,
"<A9290>": 30
} | [
"<A1921>",
"<A1601>",
"<A9290>"
] | 2 | <A9290> | 3 | false | dispatch | pfsp_step_policy_v1 | 30 | <A9290> | <A9290> |
train_000001 | 1 | 50 | 5 | 50 | 48 | {
"step_idx": 48,
"total_steps": 50,
"scheduled_ratio": 0.96,
"current_cmax": 5424,
"total_remaining_work": 893,
"unfinished_jobs_count": 2,
"unfinished_jobs_ratio": 0.04,
"machine_ready_min": 4601,
"machine_ready_mean": 5018.6,
"machine_ready_max": 5424,
"machine_ready_std": 298.3652794814,
"ma... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
9,
45
] | [
"<A9490>",
"<A8793>"
] | {
"<A9490>": 9,
"<A8793>": 45
} | [
"<A9490>",
"<A8793>"
] | 1 | <A8793> | 2 | false | dispatch | pfsp_step_policy_v1 | 45 | <A8793> | <A8793> |
train_000001 | 1 | 50 | 5 | 50 | 49 | {
"step_idx": 49,
"total_steps": 50,
"scheduled_ratio": 0.98,
"current_cmax": 5506,
"total_remaining_work": 421,
"unfinished_jobs_count": 1,
"unfinished_jobs_ratio": 0.02,
"machine_ready_min": 4707,
"machine_ready_mean": 5118,
"machine_ready_max": 5506,
"machine_ready_std": 305.0278675793,
"mach... | You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.
Objective: minimize final makespan (Cmax). At each step, choose which job to place next in the permutation.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Static problem context:
PFSP with 50 Jobs, 5 Machines.
All jobs follow ... | PFSP with 50 Jobs, 5 Machines.
All jobs follow the same machine order: M0 -> M1 -> ... -> M4.
Processing times per job:
Job 0: M0,68 M1,71 M2,130 M3,95 M4,137
Job 1: M0,81 M1,123 M2,116 M3,107 M4,111
Job 2: M0,58 M1,132 M2,74 M3,72 M4,91
Job 3: M0,143 M1,122 M2,113 M3,144 M4,69
Job 4: M0,140 M1,62 M2,92 M3,132 M4,133
J... | [
9
] | [
"<A9688>"
] | {
"<A9688>": 9
} | [
"<A9688>"
] | 0 | <A9688> | 1 | true | dispatch | pfsp_step_policy_v1 | 9 | <A9688> | <A9688> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.