instance_id stringlengths 12 12 | source_index int64 0 60.2k | num_jobs int64 2 8 | num_machines int64 2 7 | total_steps int64 4 49 | step_idx int64 0 48 | state_json dict | state_text stringlengths 1.22k 3.94k | problem_context_text stringlengths 176 886 | feasible_jobs listlengths 1 8 | feasible_action_codes listlengths 1 8 | action_code_to_job unknown | teacher_operation_idx int64 0 6 | teacher_machine int64 0 6 | env_mode stringclasses 1
value | dispatch_teacher_exact bool 2
classes | feature_schema_version stringclasses 1
value | target_job int64 0 7 | target_action_code stringlengths 7 7 | target_text stringlengths 7 7 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
train_000000 | 0 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
53
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0,
1
] | [
"<A0410>",
"<A4507>"
] | {
"<A0410>": 1,
"<A4507>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4507> | <A4507> |
train_000000 | 0 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 21,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
53
],
"job_ready_time": [
21,
0
],
"machine_ready_time": [
21,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
1
] | [
"<A0632>"
] | {
"<A0632>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A0632> | <A0632> |
train_000000 | 0 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 26,
"current_cmax": 26,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
53
],
"job_ready_time": [
21,
26
],
"machine_ready_time": [
21,
26
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0,
1
] | [
"<A8521>",
"<A8880>"
] | {
"<A8521>": 0,
"<A8880>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A8880> | <A8880> |
train_000000 | 0 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 26,
"current_cmax": 53,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
53
],
"job_ready_time": [
21,
53
],
"machine_ready_time": [
53,
26
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t21) -> (M1,t28)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0
] | [
"<A4455>"
] | {
"<A4455>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4455> | <A4455> |
train_000001 | 1 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
40,
42
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=42, route=(M0,t28) -> (M1,t14) | [
0,
1
] | [
"<A6685>",
"<A8174>"
] | {
"<A6685>": 0,
"<A8174>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A6685> | <A6685> |
train_000001 | 1 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 21,
"current_cmax": 21,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
40,
42
],
"job_ready_time": [
21,
0
],
"machine_ready_time": [
21,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=42, route=(M0,t28) -> (M1,t14) | [
0,
1
] | [
"<A5740>",
"<A1177>"
] | {
"<A5740>": 0,
"<A1177>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A1177> | <A1177> |
train_000001 | 1 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 21,
"current_cmax": 49,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
40,
42
],
"job_ready_time": [
21,
49
],
"machine_ready_time": [
49,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=42, route=(M0,t28) -> (M1,t14) | [
0
] | [
"<A8641>"
] | {
"<A8641>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A8641> | <A8641> |
train_000001 | 1 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 49,
"current_cmax": 49,
"job_next_op": [
2,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
40,
42
],
"job_ready_time": [
40,
49
],
"machine_ready_time": [
49,
40
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=40, route=(M0,t21) -> (M1,t19)
Job 1: ops=2, total_work=42, route=(M0,t28) -> (M1,t14) | [
1
] | [
"<A4673>"
] | {
"<A4673>": 1
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A4673> | <A4673> |
train_000002 | 2 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
51,
32
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=32, route=(M0,t17) -> (M1,t15) | [
0,
1
] | [
"<A6375>",
"<A1051>"
] | {
"<A6375>": 1,
"<A1051>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A6375> | <A6375> |
train_000002 | 2 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 17,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
51,
32
],
"job_ready_time": [
0,
17
],
"machine_ready_time": [
17,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=32, route=(M0,t17) -> (M1,t15) | [
0
] | [
"<A1048>"
] | {
"<A1048>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A1048> | <A1048> |
train_000002 | 2 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 23,
"current_cmax": 23,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
51,
32
],
"job_ready_time": [
23,
17
],
"machine_ready_time": [
17,
23
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=32, route=(M0,t17) -> (M1,t15) | [
0,
1
] | [
"<A3040>",
"<A2900>"
] | {
"<A3040>": 0,
"<A2900>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A3040> | <A3040> |
train_000002 | 2 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 23,
"current_cmax": 51,
"job_next_op": [
2,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
51,
32
],
"job_ready_time": [
51,
17
],
"machine_ready_time": [
51,
23
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=51, route=(M1,t23) -> (M0,t28)
Job 1: ops=2, total_work=32, route=(M0,t17) -> (M1,t15) | [
1
] | [
"<A5342>"
] | {
"<A5342>": 1
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A5342> | <A5342> |
train_000003 | 3 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
40
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=40, route=(M1,t22) -> (M0,t18) | [
0,
1
] | [
"<A7732>",
"<A9303>"
] | {
"<A7732>": 1,
"<A9303>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A9303> | <A9303> |
train_000003 | 3 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 30,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
40
],
"job_ready_time": [
30,
0
],
"machine_ready_time": [
30,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=40, route=(M1,t22) -> (M0,t18) | [
1
] | [
"<A1117>"
] | {
"<A1117>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A1117> | <A1117> |
train_000003 | 3 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 30,
"current_cmax": 30,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
40
],
"job_ready_time": [
30,
22
],
"machine_ready_time": [
30,
22
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=40, route=(M1,t22) -> (M0,t18) | [
0,
1
] | [
"<A4453>",
"<A9997>"
] | {
"<A4453>": 0,
"<A9997>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A9997> | <A9997> |
train_000003 | 3 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 30,
"current_cmax": 48,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
49,
40
],
"job_ready_time": [
30,
48
],
"machine_ready_time": [
48,
22
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=49, route=(M0,t30) -> (M1,t19)
Job 1: ops=2, total_work=40, route=(M1,t22) -> (M0,t18) | [
0
] | [
"<A5719>"
] | {
"<A5719>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5719> | <A5719> |
train_000004 | 4 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
33,
35
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=35, route=(M0,t17) -> (M1,t18) | [
0,
1
] | [
"<A4276>",
"<A8233>"
] | {
"<A4276>": 0,
"<A8233>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A8233> | <A8233> |
train_000004 | 4 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 17,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
33,
35
],
"job_ready_time": [
0,
17
],
"machine_ready_time": [
17,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=35, route=(M0,t17) -> (M1,t18) | [
0
] | [
"<A5514>"
] | {
"<A5514>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5514> | <A5514> |
train_000004 | 4 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 18,
"current_cmax": 18,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
33,
35
],
"job_ready_time": [
18,
17
],
"machine_ready_time": [
17,
18
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=35, route=(M0,t17) -> (M1,t18) | [
0,
1
] | [
"<A9488>",
"<A5395>"
] | {
"<A9488>": 1,
"<A5395>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5395> | <A5395> |
train_000004 | 4 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 18,
"current_cmax": 33,
"job_next_op": [
2,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
33,
35
],
"job_ready_time": [
33,
17
],
"machine_ready_time": [
33,
18
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=33, route=(M1,t18) -> (M0,t15)
Job 1: ops=2, total_work=35, route=(M0,t17) -> (M1,t18) | [
1
] | [
"<A1350>"
] | {
"<A1350>": 1
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A1350> | <A1350> |
train_000005 | 5 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
47,
53
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0,
1
] | [
"<A2289>",
"<A1013>"
] | {
"<A2289>": 0,
"<A1013>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A2289> | <A2289> |
train_000005 | 5 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 24,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
47,
53
],
"job_ready_time": [
24,
0
],
"machine_ready_time": [
24,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
1
] | [
"<A9856>"
] | {
"<A9856>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A9856> | <A9856> |
train_000005 | 5 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 26,
"current_cmax": 26,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
47,
53
],
"job_ready_time": [
24,
26
],
"machine_ready_time": [
24,
26
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0,
1
] | [
"<A2040>",
"<A5044>"
] | {
"<A2040>": 1,
"<A5044>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A2040> | <A2040> |
train_000005 | 5 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 26,
"current_cmax": 53,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
47,
53
],
"job_ready_time": [
24,
53
],
"machine_ready_time": [
53,
26
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=47, route=(M0,t24) -> (M1,t23)
Job 1: ops=2, total_work=53, route=(M1,t26) -> (M0,t27) | [
0
] | [
"<A6883>"
] | {
"<A6883>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A6883> | <A6883> |
train_000006 | 6 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
39,
46
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=46, route=(M1,t23) -> (M0,t23) | [
0,
1
] | [
"<A2820>",
"<A0374>"
] | {
"<A2820>": 0,
"<A0374>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A0374> | <A0374> |
train_000006 | 6 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 23,
"current_cmax": 23,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
39,
46
],
"job_ready_time": [
0,
23
],
"machine_ready_time": [
0,
23
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=46, route=(M1,t23) -> (M0,t23) | [
0,
1
] | [
"<A3676>",
"<A9994>"
] | {
"<A3676>": 0,
"<A9994>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A9994> | <A9994> |
train_000006 | 6 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 23,
"current_cmax": 46,
"job_next_op": [
0,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
39,
46
],
"job_ready_time": [
0,
46
],
"machine_ready_time": [
46,
23
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=46, route=(M1,t23) -> (M0,t23) | [
0
] | [
"<A9500>"
] | {
"<A9500>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A9500> | <A9500> |
train_000006 | 6 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 46,
"current_cmax": 46,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
39,
46
],
"job_ready_time": [
45,
46
],
"machine_ready_time": [
46,
45
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=39, route=(M1,t22) -> (M0,t17)
Job 1: ops=2, total_work=46, route=(M1,t23) -> (M0,t23) | [
0
] | [
"<A0358>"
] | {
"<A0358>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A0358> | <A0358> |
train_000007 | 7 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
28,
44
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=44, route=(M0,t22) -> (M1,t22) | [
0,
1
] | [
"<A9329>",
"<A9663>"
] | {
"<A9329>": 0,
"<A9663>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A9663> | <A9663> |
train_000007 | 7 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 22,
"current_cmax": 22,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
28,
44
],
"job_ready_time": [
0,
22
],
"machine_ready_time": [
22,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=44, route=(M0,t22) -> (M1,t22) | [
0,
1
] | [
"<A0688>",
"<A6722>"
] | {
"<A0688>": 1,
"<A6722>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A6722> | <A6722> |
train_000007 | 7 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 22,
"current_cmax": 37,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
28,
44
],
"job_ready_time": [
37,
22
],
"machine_ready_time": [
37,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=44, route=(M0,t22) -> (M1,t22) | [
1
] | [
"<A4394>"
] | {
"<A4394>": 1
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A4394> | <A4394> |
train_000007 | 7 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 44,
"current_cmax": 44,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
28,
44
],
"job_ready_time": [
37,
44
],
"machine_ready_time": [
37,
44
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=28, route=(M0,t15) -> (M1,t13)
Job 1: ops=2, total_work=44, route=(M0,t22) -> (M1,t22) | [
0
] | [
"<A8054>"
] | {
"<A8054>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A8054> | <A8054> |
train_000008 | 8 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
38,
45
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=45, route=(M1,t23) -> (M0,t22) | [
0,
1
] | [
"<A8174>",
"<A4602>"
] | {
"<A8174>": 1,
"<A4602>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4602> | <A4602> |
train_000008 | 8 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 22,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
38,
45
],
"job_ready_time": [
22,
0
],
"machine_ready_time": [
22,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=45, route=(M1,t23) -> (M0,t22) | [
1
] | [
"<A3900>"
] | {
"<A3900>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A3900> | <A3900> |
train_000008 | 8 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 23,
"current_cmax": 23,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
38,
45
],
"job_ready_time": [
22,
23
],
"machine_ready_time": [
22,
23
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=45, route=(M1,t23) -> (M0,t22) | [
0,
1
] | [
"<A4372>",
"<A6837>"
] | {
"<A4372>": 1,
"<A6837>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A4372> | <A4372> |
train_000008 | 8 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 23,
"current_cmax": 45,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
38,
45
],
"job_ready_time": [
22,
45
],
"machine_ready_time": [
45,
23
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=38, route=(M0,t22) -> (M1,t16)
Job 1: ops=2, total_work=45, route=(M1,t23) -> (M0,t22) | [
0
] | [
"<A2830>"
] | {
"<A2830>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A2830> | <A2830> |
train_000009 | 9 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
35
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=35, route=(M1,t10) -> (M0,t25) | [
0,
1
] | [
"<A7871>",
"<A5311>"
] | {
"<A7871>": 1,
"<A5311>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A7871> | <A7871> |
train_000009 | 9 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 10,
"current_cmax": 10,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
35
],
"job_ready_time": [
0,
10
],
"machine_ready_time": [
0,
10
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=35, route=(M1,t10) -> (M0,t25) | [
0,
1
] | [
"<A4247>",
"<A5888>"
] | {
"<A4247>": 0,
"<A5888>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A5888> | <A5888> |
train_000009 | 9 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 10,
"current_cmax": 35,
"job_next_op": [
0,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
35
],
"job_ready_time": [
0,
35
],
"machine_ready_time": [
35,
10
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=35, route=(M1,t10) -> (M0,t25) | [
0
] | [
"<A4047>"
] | {
"<A4047>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4047> | <A4047> |
train_000009 | 9 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 35,
"current_cmax": 35,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
35
],
"job_ready_time": [
29,
35
],
"machine_ready_time": [
35,
29
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M1,t19) -> (M0,t26)
Job 1: ops=2, total_work=35, route=(M1,t10) -> (M0,t25) | [
0
] | [
"<A6156>"
] | {
"<A6156>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A6156> | <A6156> |
train_000010 | 10 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
46
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=46, route=(M0,t22) -> (M1,t24) | [
0,
1
] | [
"<A8382>",
"<A7627>"
] | {
"<A8382>": 0,
"<A7627>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A8382> | <A8382> |
train_000010 | 10 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 20,
"current_cmax": 20,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
46
],
"job_ready_time": [
20,
0
],
"machine_ready_time": [
20,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=46, route=(M0,t22) -> (M1,t24) | [
0,
1
] | [
"<A0776>",
"<A9189>"
] | {
"<A0776>": 1,
"<A9189>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A0776> | <A0776> |
train_000010 | 10 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 20,
"current_cmax": 42,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
46
],
"job_ready_time": [
20,
42
],
"machine_ready_time": [
42,
0
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=46, route=(M0,t22) -> (M1,t24) | [
0
] | [
"<A4721>"
] | {
"<A4721>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4721> | <A4721> |
train_000010 | 10 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 45,
"current_cmax": 45,
"job_next_op": [
2,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
45,
46
],
"job_ready_time": [
45,
42
],
"machine_ready_time": [
42,
45
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=45, route=(M0,t20) -> (M1,t25)
Job 1: ops=2, total_work=46, route=(M0,t22) -> (M1,t24) | [
1
] | [
"<A6235>"
] | {
"<A6235>": 1
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A6235> | <A6235> |
train_000011 | 11 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
55,
36
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=36, route=(M1,t15) -> (M0,t21) | [
0,
1
] | [
"<A3951>",
"<A3195>"
] | {
"<A3951>": 0,
"<A3195>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A3951> | <A3951> |
train_000011 | 11 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 32,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
55,
36
],
"job_ready_time": [
32,
0
],
"machine_ready_time": [
32,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=36, route=(M1,t15) -> (M0,t21) | [
1
] | [
"<A4590>"
] | {
"<A4590>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A4590> | <A4590> |
train_000011 | 11 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 32,
"current_cmax": 32,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
55,
36
],
"job_ready_time": [
32,
15
],
"machine_ready_time": [
32,
15
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=36, route=(M1,t15) -> (M0,t21) | [
0,
1
] | [
"<A2878>",
"<A2386>"
] | {
"<A2878>": 0,
"<A2386>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A2386> | <A2386> |
train_000011 | 11 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 32,
"current_cmax": 53,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
55,
36
],
"job_ready_time": [
32,
53
],
"machine_ready_time": [
53,
15
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=55, route=(M0,t32) -> (M1,t23)
Job 1: ops=2, total_work=36, route=(M1,t15) -> (M0,t21) | [
0
] | [
"<A2336>"
] | {
"<A2336>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A2336> | <A2336> |
train_000012 | 12 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
40
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=40, route=(M1,t19) -> (M0,t21) | [
0,
1
] | [
"<A3461>",
"<A7198>"
] | {
"<A3461>": 1,
"<A7198>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A3461> | <A3461> |
train_000012 | 12 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 19,
"current_cmax": 19,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
40
],
"job_ready_time": [
0,
19
],
"machine_ready_time": [
0,
19
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=40, route=(M1,t19) -> (M0,t21) | [
0,
1
] | [
"<A0293>",
"<A3383>"
] | {
"<A0293>": 0,
"<A3383>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A3383> | <A3383> |
train_000012 | 12 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 19,
"current_cmax": 40,
"job_next_op": [
0,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
40
],
"job_ready_time": [
0,
40
],
"machine_ready_time": [
40,
19
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=40, route=(M1,t19) -> (M0,t21) | [
0
] | [
"<A9100>"
] | {
"<A9100>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A9100> | <A9100> |
train_000012 | 12 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 44,
"current_cmax": 44,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
40
],
"job_ready_time": [
44,
40
],
"machine_ready_time": [
40,
44
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t25) -> (M0,t23)
Job 1: ops=2, total_work=40, route=(M1,t19) -> (M0,t21) | [
0
] | [
"<A4246>"
] | {
"<A4246>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4246> | <A4246> |
train_000013 | 13 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
31
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=31, route=(M1,t12) -> (M0,t19) | [
0,
1
] | [
"<A7820>",
"<A6795>"
] | {
"<A7820>": 1,
"<A6795>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A7820> | <A7820> |
train_000013 | 13 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 12,
"current_cmax": 12,
"job_next_op": [
0,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
31
],
"job_ready_time": [
0,
12
],
"machine_ready_time": [
0,
12
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=31, route=(M1,t12) -> (M0,t19) | [
0,
1
] | [
"<A4733>",
"<A6066>"
] | {
"<A4733>": 1,
"<A6066>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A4733> | <A4733> |
train_000013 | 13 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 12,
"current_cmax": 31,
"job_next_op": [
0,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
31
],
"job_ready_time": [
0,
31
],
"machine_ready_time": [
31,
12
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=31, route=(M1,t12) -> (M0,t19) | [
0
] | [
"<A7565>"
] | {
"<A7565>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A7565> | <A7565> |
train_000013 | 13 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 33,
"current_cmax": 33,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
48,
31
],
"job_ready_time": [
33,
31
],
"machine_ready_time": [
31,
33
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=48, route=(M1,t21) -> (M0,t27)
Job 1: ops=2, total_work=31, route=(M1,t12) -> (M0,t19) | [
0
] | [
"<A5709>"
] | {
"<A5709>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5709> | <A5709> |
train_000014 | 14 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
36,
34
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=34, route=(M1,t15) -> (M0,t19) | [
0,
1
] | [
"<A9652>",
"<A5780>"
] | {
"<A9652>": 1,
"<A5780>": 0
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5780> | <A5780> |
train_000014 | 14 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 15,
"current_cmax": 15,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
36,
34
],
"job_ready_time": [
15,
0
],
"machine_ready_time": [
0,
15
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=34, route=(M1,t15) -> (M0,t19) | [
0,
1
] | [
"<A7250>",
"<A4910>"
] | {
"<A7250>": 1,
"<A4910>": 0
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4910> | <A4910> |
train_000014 | 14 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 15,
"current_cmax": 36,
"job_next_op": [
2,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
36,
34
],
"job_ready_time": [
36,
0
],
"machine_ready_time": [
36,
15
],
"nex... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=34, route=(M1,t15) -> (M0,t19) | [
1
] | [
"<A5427>"
] | {
"<A5427>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A5427> | <A5427> |
train_000014 | 14 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 36,
"current_cmax": 36,
"job_next_op": [
2,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
36,
34
],
"job_ready_time": [
36,
30
],
"machine_ready_time": [
36,
30
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=36, route=(M1,t15) -> (M0,t21)
Job 1: ops=2, total_work=34, route=(M1,t15) -> (M0,t19) | [
1
] | [
"<A7183>"
] | {
"<A7183>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A7183> | <A7183> |
train_000015 | 15 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
34,
38
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=38, route=(M1,t16) -> (M0,t22) | [
0,
1
] | [
"<A4354>",
"<A5833>"
] | {
"<A4354>": 0,
"<A5833>": 1
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A4354> | <A4354> |
train_000015 | 15 | 2 | 2 | 4 | 1 | {
"step_idx": 1,
"total_steps": 4,
"scheduled_ratio": 0.25,
"current_time": 0,
"current_cmax": 17,
"job_next_op": [
1,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
34,
38
],
"job_ready_time": [
17,
0
],
"machine_ready_time": [
17,
0
],
"next... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=38, route=(M1,t16) -> (M0,t22) | [
1
] | [
"<A5137>"
] | {
"<A5137>": 1
} | 0 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A5137> | <A5137> |
train_000015 | 15 | 2 | 2 | 4 | 2 | {
"step_idx": 2,
"total_steps": 4,
"scheduled_ratio": 0.5,
"current_time": 17,
"current_cmax": 17,
"job_next_op": [
1,
1
],
"job_total_ops": [
2,
2
],
"job_total_work": [
34,
38
],
"job_ready_time": [
17,
16
],
"machine_ready_time": [
17,
16
],
"ne... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=38, route=(M1,t16) -> (M0,t22) | [
0,
1
] | [
"<A0343>",
"<A6582>"
] | {
"<A0343>": 0,
"<A6582>": 1
} | 1 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 1 | <A6582> | <A6582> |
train_000015 | 15 | 2 | 2 | 4 | 3 | {
"step_idx": 3,
"total_steps": 4,
"scheduled_ratio": 0.75,
"current_time": 17,
"current_cmax": 39,
"job_next_op": [
1,
2
],
"job_total_ops": [
2,
2
],
"job_total_work": [
34,
38
],
"job_ready_time": [
17,
39
],
"machine_ready_time": [
39,
16
],
"n... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=34, route=(M0,t17) -> (M1,t17)
Job 1: ops=2, total_work=38, route=(M1,t16) -> (M0,t22) | [
0
] | [
"<A6877>"
] | {
"<A6877>": 0
} | 1 | 1 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A6877> | <A6877> |
train_000016 | 16 | 2 | 2 | 4 | 0 | {
"step_idx": 0,
"total_steps": 4,
"scheduled_ratio": 0,
"current_time": 0,
"current_cmax": 0,
"job_next_op": [
0,
0
],
"job_total_ops": [
2,
2
],
"job_total_work": [
42,
39
],
"job_ready_time": [
0,
0
],
"machine_ready_time": [
0,
0
],
"next_machi... | You are solving JSSP with event-driven dispatching.
Objective: minimize final makespan (Cmax) while respecting precedence and machine availability.
Static problem context:
Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=42, route=(M0,t22) -> (M1,t20)
Job 1: ops=2, total_work=... | Problem: 2 jobs x 2 machines (total_ops=4)
Fixed operation routes:
Job 0: ops=2, total_work=42, route=(M0,t22) -> (M1,t20)
Job 1: ops=2, total_work=39, route=(M1,t16) -> (M0,t23) | [
0,
1
] | [
"<A2924>",
"<A5935>"
] | {
"<A2924>": 1,
"<A5935>": 0
} | 0 | 0 | dispatch | true | jssp_step_policy_dispatch_v1_action_token | 0 | <A5935> | <A5935> |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 4