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":213(...TRUNCATED) | "You are solving PFSP (Permutation Flow Shop Scheduling Problem) step-by-step.\nObjective: minimize (...TRUNCATED) | "PFSP with 50 Jobs, 5 Machines.\nAll jobs follow the same machine order: M0 -> M1 -> ... -> M4.\nPro(...TRUNCATED) | [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(...TRUNCATED) | ["<A3990>","<A8229>","<A9049>","<A2654>","<A4032>","<A3792>","<A9050>","<A4192>","<A6511>","<A8984>"(...TRUNCATED) | {"<A3990>":26,"<A8229>":11,"<A9049>":42,"<A2654>":2,"<A4032>":23,"<A3792>":44,"<A9050>":6,"<A4192>":(...TRUNCATED) | ["<A3792>","<A4550>","<A0125>","<A7358>","<A5690>","<A6337>","<A4192>","<A4231>","<A8830>","<A6618>"(...TRUNCATED) | 32 | <A5611> | 41 | false | dispatch | pfsp_step_policy_v1 | 10 | <A5611> | <A5611> |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 20