Dataset Viewer (First 5GB)
Auto-converted to Parquet Duplicate
instance_id
stringlengths
12
12
source_index
int64
0
41k
num_jobs
int64
2
7
num_machines
int64
2
6
total_steps
int64
4
36
step_idx
int64
0
35
state_json
dict
state_text
stringlengths
1.04k
2.95k
state_text_with_retrieval
stringlengths
1.04k
3.75k
retrieval_text
stringlengths
0
839
retrieval_used
bool
2 classes
retrieval_case_count
int64
0
2
retrieval_case_instances
listlengths
0
2
retrieval_selection_reason
stringclasses
4 values
retrieval_adaptive_k
int64
0
2
retrieval_top1_score
float64
0
19.8
retrieval_top2_score
float64
0
16
⌀
retrieval_top12_gap
float64
0
10.1
⌀
state_prefix_text
stringlengths
1.04k
2.95k
candidate_display_lines
listlengths
1
7
candidate_labels_in_order
listlengths
1
7
target_candidate_index
int64
0
6
target_candidate_label
stringlengths
7
7
problem_context_text
stringclasses
17 values
feasible_jobs
listlengths
1
7
feasible_action_codes
listlengths
1
7
action_code_to_job
unknown
teacher_operation_idx
int64
0
5
teacher_machine
int64
0
5
env_mode
stringclasses
1 value
dispatch_teacher_exact
bool
2 classes
feature_schema_version
stringclasses
1 value
target_job
int64
0
6
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R5985> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000447", "train_000413" ]
use_top2_both_strong
2
3.690047
3.987175
0.297128
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A1825> | operation machine=M0 | processing time=21 | decision_t=0 | est_start=0 | est_end=21 | cmax:0->21 | delta_cmax=21 | job_ready:0->21 | machine_ready:0->21 | rem_ops:2->1 | rem_work:49->28 | machine_load=48 | machine_ops_left=2 | rem_work_after_ratio=0.5714 | post_route=[M1:28]", "<A0410> | operation mach...
[ "<A1825>", "<A0410>" ]
0
<A1825>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A1825>", "<A0410>" ]
{ "<A1825>": 0, "<A0410>": 1 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
0
<A1825>
<A1825>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R4818> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000414", "train_000266" ]
use_top2_both_strong
2
3.253208
3.27694
0.023732
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A0632> | operation machine=M1 | processing time=26 | decision_t=0 | est_start=0 | est_end=26 | cmax:21->26 | delta_cmax=5 | job_ready:0->26 | machine_ready:0->26 | rem_ops:2->1 | rem_work:53->27 | machine_load=54 | machine_ops_left=2 | rem_work_after_ratio=0.5094 | post_route=[M0:27]" ]
[ "<A0632>" ]
0
<A0632>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A0632>" ]
{ "<A0632>": 1 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R7600> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000726" ]
use_top1_clear_winner
1
5.858535
6.369444
0.51091
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
[ "<A6694> | operation machine=M0 | processing time=27 | decision_t=26 | est_start=26 | est_end=53 | cmax:26->53 | delta_cmax=27 | job_ready:26->53 | machine_ready:21->53 | rem_ops:1->0 | rem_work:27->0 | machine_load=27 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]", "<A8521> | operation machine=M1...
[ "<A6694>", "<A8521>" ]
0
<A6694>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A6694>", "<A8521>" ]
{ "<A6694>": 1, "<A8521>": 0 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A6694>
<A6694>
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R5696> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000924", "train_000977" ]
use_top2_both_strong
2
0
0
0
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
[ "<A4455> | operation machine=M1 | processing time=28 | decision_t=26 | est_start=26 | est_end=54 | cmax:53->54 | delta_cmax=1 | job_ready:21->54 | machine_ready:26->54 | rem_ops:1->0 | rem_work:28->0 | machine_load=28 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A4455>" ]
0
<A4455>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A4455>" ]
{ "<A4455>": 0 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R6326> (same as default) - preference: teacher preferred a short-processing candidate + near-minimum remaining-work candida...
true
1
[ "train_000488" ]
use_top1_clear_winner
1
3.183081
3.752234
0.569154
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A7278> | operation machine=M0 | processing time=21 | decision_t=0 | est_start=0 | est_end=21 | cmax:0->21 | delta_cmax=21 | job_ready:0->21 | machine_ready:0->21 | rem_ops:2->1 | rem_work:40->19 | machine_load=49 | machine_ops_left=2 | rem_work_after_ratio=0.475 | post_route=[M1:19]", "<A6685> | operation machi...
[ "<A7278>", "<A6685>" ]
0
<A7278>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A7278>", "<A6685>" ]
{ "<A7278>": 0, "<A6685>": 1 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
0
<A7278>
<A7278>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=21 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=21 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R3881> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000762", "train_000212" ]
use_top2_both_strong
2
5.15801
5.282385
0.124375
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=21 current_cmax=21 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
[ "<A5119> | operation machine=M0 | processing time=28 | decision_t=21 | est_start=21 | est_end=49 | cmax:21->49 | delta_cmax=28 | job_ready:0->49 | machine_ready:21->49 | rem_ops:2->1 | rem_work:42->14 | machine_load=28 | machine_ops_left=1 | rem_work_after_ratio=0.3333 | post_route=[M1:14]", "<A5740> | operation ...
[ "<A5119>", "<A5740>" ]
0
<A5119>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A5119>", "<A5740>" ]
{ "<A5119>": 1, "<A5740>": 0 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A5119>
<A5119>
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=21 current_cmax=49 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=21 current_cmax=49 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R8252> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000432", "train_000827" ]
use_top2_both_strong
2
2.322718
2.709091
0.386373
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=21 current_cmax=49 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A8641> | operation machine=M1 | processing time=19 | decision_t=21 | est_start=21 | est_end=40 | cmax:49->49 | delta_cmax=0 | job_ready:21->40 | machine_ready:0->40 | rem_ops:1->0 | rem_work:19->0 | machine_load=33 | machine_ops_left=2 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A8641>" ]
0
<A8641>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A8641>" ]
{ "<A8641>": 0 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=49 current_cmax=49 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M0', 'M1'] num_runn...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=49 current_cmax=49 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M0', 'M1'] num_runn...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R9939> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000068", "train_000222" ]
use_top2_both_strong
2
0
0
0
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=49 current_cmax=49 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M0', 'M1'] num_runn...
[ "<A4673> | operation machine=M1 | processing time=14 | decision_t=49 | est_start=49 | est_end=63 | cmax:49->63 | delta_cmax=14 | job_ready:49->63 | machine_ready:40->63 | rem_ops:1->0 | rem_work:14->0 | machine_load=14 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A4673>" ]
0
<A4673>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A4673>" ]
{ "<A4673>": 1 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=2 - local action codes: chosen=<R1632>, default=<R5557> - preference: teacher overrode the default and preferred a near-minimum remaining-work candidate; t...
true
1
[ "train_000201" ]
use_top1_clear_winner
1
2.783118
5.140216
2.357097
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A4088> | operation machine=M0 | processing time=17 | decision_t=0 | est_start=0 | est_end=17 | cmax:0->17 | delta_cmax=17 | job_ready:0->17 | machine_ready:0->17 | rem_ops:2->1 | rem_work:32->15 | machine_load=45 | machine_ops_left=2 | rem_work_after_ratio=0.4688 | post_route=[M1:15]", "<A6375> | operation mach...
[ "<A4088>", "<A6375>" ]
0
<A4088>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A4088>", "<A6375>" ]
{ "<A4088>": 1, "<A6375>": 0 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A4088>
<A4088>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R4818> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000414", "train_000387" ]
use_top2_both_strong
2
3.42568
3.603154
0.177474
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A1048> | operation machine=M1 | processing time=23 | decision_t=0 | est_start=0 | est_end=23 | cmax:17->23 | delta_cmax=6 | job_ready:0->23 | machine_ready:0->23 | rem_ops:2->1 | rem_work:51->28 | machine_load=38 | machine_ops_left=2 | rem_work_after_ratio=0.549 | post_route=[M0:28]" ]
[ "<A1048>" ]
0
<A1048>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A1048>" ]
{ "<A1048>": 0 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=2 - local action codes: chosen=<R1768>, default=<R4181> - preference: teacher overrode the default and preferred a near-minimum remaining-work candidate; t...
true
1
[ "train_000085" ]
use_top1_clear_winner
1
5.478063
7.451163
1.9731
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
[ "<A7888> | operation machine=M1 | processing time=15 | decision_t=23 | est_start=23 | est_end=38 | cmax:23->38 | delta_cmax=15 | job_ready:17->38 | machine_ready:23->38 | rem_ops:1->0 | rem_work:15->0 | machine_load=15 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]", "<A3040> | operation machine=M0...
[ "<A7888>", "<A3040>" ]
1
<A3040>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A7888>", "<A3040>" ]
{ "<A7888>": 1, "<A3040>": 0 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=23 current_cmax=51 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=23 current_cmax=51 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R6403> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000502" ]
use_top1_clear_winner
1
0
1.0125
1.0125
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=23 current_cmax=51 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
[ "<A5342> | operation machine=M1 | processing time=15 | decision_t=23 | est_start=23 | est_end=38 | cmax:51->51 | delta_cmax=0 | job_ready:17->38 | machine_ready:23->38 | rem_ops:1->0 | rem_work:15->0 | machine_load=15 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A5342>" ]
0
<A5342>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A5342>" ]
{ "<A5342>": 1 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R6328> (same as default) - preference: teacher preferred a short-processing candidate + near-minimum remaining-work candida...
true
2
[ "train_000413", "train_000447" ]
use_top2_both_strong
2
3.20913
3.656552
0.447422
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A1394> | operation machine=M0 | processing time=30 | decision_t=0 | est_start=0 | est_end=30 | cmax:0->30 | delta_cmax=30 | job_ready:0->30 | machine_ready:0->30 | rem_ops:2->1 | rem_work:49->19 | machine_load=48 | machine_ops_left=2 | rem_work_after_ratio=0.3878 | post_route=[M1:19]", "<A7732> | operation mach...
[ "<A1394>", "<A7732>" ]
0
<A1394>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A1394>", "<A7732>" ]
{ "<A1394>": 0, "<A7732>": 1 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
0
<A1394>
<A1394>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R4818> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000414", "train_000172" ]
use_top2_both_strong
2
3.754342
3.780428
0.026087
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A1117> | operation machine=M1 | processing time=22 | decision_t=0 | est_start=0 | est_end=22 | cmax:30->30 | delta_cmax=0 | job_ready:0->22 | machine_ready:0->22 | rem_ops:2->1 | rem_work:40->18 | machine_load=41 | machine_ops_left=2 | rem_work_after_ratio=0.45 | post_route=[M0:18]" ]
[ "<A1117>" ]
0
<A1117>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A1117>" ]
{ "<A1117>": 1 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=30 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=30 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=2 - local action codes: chosen=<R1768>, default=<R4181> - preference: teacher overrode the default and preferred a near-minimum remaining-work candidate; t...
true
1
[ "train_000085" ]
use_top1_clear_winner
1
7.820864
8.541699
0.720835
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=30 current_cmax=30 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
[ "<A5871> | operation machine=M1 | processing time=19 | decision_t=30 | est_start=30 | est_end=49 | cmax:30->49 | delta_cmax=19 | job_ready:30->49 | machine_ready:22->49 | rem_ops:1->0 | rem_work:19->0 | machine_load=19 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]", "<A4453> | operation machine=M0...
[ "<A5871>", "<A4453>" ]
1
<A4453>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A5871>", "<A4453>" ]
{ "<A5871>": 0, "<A4453>": 1 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A4453>
<A4453>
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=30 current_cmax=48 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=30 current_cmax=48 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R7860> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000827" ]
use_top1_clear_winner
1
0
0.81
0.81
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=30 current_cmax=48 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
[ "<A5719> | operation machine=M1 | processing time=19 | decision_t=30 | est_start=30 | est_end=49 | cmax:48->49 | delta_cmax=1 | job_ready:30->49 | machine_ready:22->49 | rem_ops:1->0 | rem_work:19->0 | machine_load=19 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A5719>" ]
0
<A5719>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A5719>" ]
{ "<A5719>": 0 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R3339> (same as default) - preference: teacher preferred a short-processing candidate + near-minimum remaining-work candida...
true
2
[ "train_000818", "train_000726" ]
use_top2_both_strong
2
5.337817
5.408021
0.070204
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A7456> | operation machine=M1 | processing time=18 | decision_t=0 | est_start=0 | est_end=18 | cmax:0->18 | delta_cmax=18 | job_ready:0->18 | machine_ready:0->18 | rem_ops:2->1 | rem_work:33->15 | machine_load=36 | machine_ops_left=2 | rem_work_after_ratio=0.4545 | post_route=[M0:15]", "<A4276> | operation mach...
[ "<A7456>", "<A4276>" ]
1
<A4276>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A7456>", "<A4276>" ]
{ "<A7456>": 0, "<A4276>": 1 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A4276>
<A4276>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R5768> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000172" ]
use_top1_clear_winner
1
1.918599
4.249977
2.331378
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=17 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A5514> | operation machine=M1 | processing time=18 | decision_t=0 | est_start=0 | est_end=18 | cmax:17->18 | delta_cmax=1 | job_ready:0->18 | machine_ready:0->18 | rem_ops:2->1 | rem_work:33->15 | machine_load=36 | machine_ops_left=2 | rem_work_after_ratio=0.4545 | post_route=[M0:15]" ]
[ "<A5514>" ]
0
<A5514>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A5514>" ]
{ "<A5514>": 0 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=18 current_cmax=18 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=18 current_cmax=18 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=2 - local action codes: chosen=<R1768>, default=<R4181> - preference: teacher overrode the default and preferred a near-minimum remaining-work candidate; t...
true
1
[ "train_000085" ]
use_top1_clear_winner
1
7.057342
8.220779
1.163437
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=18 current_cmax=18 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
[ "<A0381> | operation machine=M0 | processing time=15 | decision_t=18 | est_start=18 | est_end=33 | cmax:18->33 | delta_cmax=15 | job_ready:18->33 | machine_ready:17->33 | rem_ops:1->0 | rem_work:15->0 | machine_load=15 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]", "<A9488> | operation machine=M1...
[ "<A0381>", "<A9488>" ]
0
<A0381>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A0381>", "<A9488>" ]
{ "<A0381>": 0, "<A9488>": 1 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
0
<A0381>
<A0381>
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=18 current_cmax=33 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=18 current_cmax=33 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R7860> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000827", "train_000016" ]
use_top2_both_strong
2
0.852632
0.9
0.047368
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=18 current_cmax=33 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
[ "<A1350> | operation machine=M1 | processing time=18 | decision_t=18 | est_start=18 | est_end=36 | cmax:33->36 | delta_cmax=3 | job_ready:17->36 | machine_ready:18->36 | rem_ops:1->0 | rem_work:18->0 | machine_load=18 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A1350>" ]
0
<A1350>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A1350>" ]
{ "<A1350>": 1 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R5985> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000447" ]
use_top1_clear_winner
1
3.005389
3.533835
0.528446
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A9524> | operation machine=M1 | processing time=26 | decision_t=0 | est_start=0 | est_end=26 | cmax:0->26 | delta_cmax=26 | job_ready:0->26 | machine_ready:0->26 | rem_ops:2->1 | rem_work:53->27 | machine_load=49 | machine_ops_left=2 | rem_work_after_ratio=0.5094 | post_route=[M0:27]", "<A7319> | operation mach...
[ "<A9524>", "<A7319>" ]
1
<A7319>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A9524>", "<A7319>" ]
{ "<A9524>": 1, "<A7319>": 0 }
0
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
0
<A7319>
<A7319>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=24 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=24 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R4818> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000414", "train_000266" ]
use_top2_both_strong
2
3.558877
3.597465
0.038588
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=0 current_cmax=24 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M1'] num_running_ops=1...
[ "<A9856> | operation machine=M1 | processing time=26 | decision_t=0 | est_start=0 | est_end=26 | cmax:24->26 | delta_cmax=2 | job_ready:0->26 | machine_ready:0->26 | rem_ops:2->1 | rem_work:53->27 | machine_load=49 | machine_ops_left=2 | rem_work_after_ratio=0.5094 | post_route=[M0:27]" ]
[ "<A9856>" ]
0
<A9856>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 1 ]
[ "<A9856>" ]
{ "<A9856>": 1 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R3881> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000762" ]
use_top1_clear_winner
1
5.967568
6.62163
0.654062
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=3/4 scheduled_ratio=0.5 current_time=26 current_cmax=26 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running...
[ "<A8814> | operation machine=M0 | processing time=27 | decision_t=26 | est_start=26 | est_end=53 | cmax:26->53 | delta_cmax=27 | job_ready:26->53 | machine_ready:24->53 | rem_ops:1->0 | rem_work:27->0 | machine_load=27 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]", "<A2029> | operation machine=M1...
[ "<A8814>", "<A2029>" ]
0
<A8814>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A8814>", "<A2029>" ]
{ "<A8814>": 1, "<A2029>": 0 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A8814>
<A8814>
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. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=1 - local action codes: chosen=<R5840> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
1
[ "train_000054" ]
use_top1_clear_winner
1
0.704348
1.296
0.591652
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=4/4 scheduled_ratio=0.75 current_time=26 current_cmax=53 unfinished_jobs_count=1 unfinished_jobs_ratio=0.5 idle_machines=['M1'] num_running_op...
[ "<A6883> | operation machine=M1 | processing time=23 | decision_t=26 | est_start=26 | est_end=49 | cmax:53->53 | delta_cmax=0 | job_ready:24->49 | machine_ready:26->49 | rem_ops:1->0 | rem_work:23->0 | machine_load=23 | machine_ops_left=1 | rem_work_after_ratio=0 | post_route=[]" ]
[ "<A6883>" ]
0
<A6883>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0 ]
[ "<A6883>" ]
{ "<A6883>": 0 }
1
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
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. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M1 | candidates=2 - local action codes: chosen=<R1632>, default=<R5557> - preference: teacher overrode the default and preferred a near-minimum remaining-work candidate; t...
true
1
[ "train_000201" ]
use_top1_clear_winner
1
4.917356
7.646607
2.72925
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=1/4 scheduled_ratio=0 current_time=0 current_cmax=0 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_running_ops...
[ "<A6490> | operation machine=M1 | processing time=23 | decision_t=0 | est_start=0 | est_end=23 | cmax:0->23 | delta_cmax=23 | job_ready:0->23 | machine_ready:0->23 | rem_ops:2->1 | rem_work:46->23 | machine_load=45 | machine_ops_left=2 | rem_work_after_ratio=0.5 | post_route=[M0:23]", "<A2820> | operation machine...
[ "<A6490>", "<A2820>" ]
0
<A6490>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A6490>", "<A2820>" ]
{ "<A6490>": 1, "<A2820>": 0 }
0
1
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A6490>
<A6490>
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. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
Retrieved similar prior dispatch case(s): Retrieved-case action codes use the <RXXXX> format and are local to each prior case only. [Case 1] machine=M0 | candidates=2 - local action codes: chosen=<R7600> (same as default) - preference: teacher preferred a short-processing candidate + low-remaining-work candidate; teach...
true
2
[ "train_000726", "train_000818" ]
use_top2_both_strong
2
5.907165
6.030689
0.123524
You are solving JSSP with event-driven dispatching. Objective: minimize final makespan (Cmax) while respecting precedence and machine availability. Dispatch state: decision_step=2/4 scheduled_ratio=0.25 current_time=23 current_cmax=23 unfinished_jobs_count=2 unfinished_jobs_ratio=1 idle_machines=['M0', 'M1'] num_runnin...
[ "<A5658> | operation machine=M0 | processing time=23 | decision_t=23 | est_start=23 | est_end=46 | cmax:23->46 | delta_cmax=23 | job_ready:23->46 | machine_ready:0->46 | rem_ops:1->0 | rem_work:23->0 | machine_load=40 | machine_ops_left=2 | rem_work_after_ratio=0 | post_route=[]", "<A3676> | operation machine=M1 ...
[ "<A5658>", "<A3676>" ]
0
<A5658>
Problem: 2 jobs x 2 machines (total_ops=4)
[ 0, 1 ]
[ "<A5658>", "<A3676>" ]
{ "<A5658>": 1, "<A3676>": 0 }
1
0
dispatch
true
jssp_step_policy_dispatch_v2_candidate_label
1
<A5658>
<A5658>
End of preview. Expand in Data Studio

No dataset card yet

Downloads last month
1