{"id":"W3177084066","doi":"","title":"Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Flow shop scheduling; Upper and lower bounds; Approximation algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007579448,0.0001885317,0.000188697,0.00005014819,0.00008670009,0.00006756338,0.0001360904,0.00006299416,0.000105888],"category_scores_gemma":[0.00003270398,0.0001509169,0.00005951959,0.0002753107,0.00002051944,0.00004080403,0.00001794525,0.0001172436,0.0000484692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001892985,"about_ca_system_score_gemma":0.00001932261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003624815,"about_ca_topic_score_gemma":0.000001420885,"domain_scores_codex":[0.9991372,0.000006317359,0.0001937361,0.0002334798,0.0001558332,0.0002734848],"domain_scores_gemma":[0.9995529,0.00004986752,0.00001977998,0.0001302583,0.0000719458,0.0001752419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002283652,0.00001050225,0.0001111424,0.00004902211,0.00003771335,0.00000161666,0.0002120418,0.9959491,0.00008231367,0.0004949403,0.0002028691,0.002825925],"study_design_scores_gemma":[0.0008521866,0.00007018646,0.00002783617,0.00001500161,0.00001927386,0.000003671627,0.0001714312,0.9972621,0.000829872,0.00001644501,0.0004857964,0.0002462563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01056312,0.0002501928,0.9837222,0.0007574139,0.000185301,0.0002729128,0.000009586787,0.001455862,0.002783459],"genre_scores_gemma":[0.07491168,0.00001175441,0.9238955,0.0004069091,0.0002748457,0.00005694969,0.00002098029,0.00006635002,0.0003549722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06434856,"threshold_uncertainty_score":0.6154211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02597424252735754,"score_gpt":0.2479555810259531,"score_spread":0.2219813384985955,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}