{"id":"W2564265628","doi":"10.1017/s0269888916000254","title":"Logic-based Benders decomposition for planning and scheduling: a computational analysis","year":2016,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Benders' decomposition; Scheduling (production processes); Mathematical optimization; Computer science; Implementation; Constraint programming; Integer programming; Job shop scheduling; Theoretical computer science; Operations research; Mathematics; Programming language; Schedule; Stochastic programming","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.0003037086,0.00008471742,0.0001459804,0.0001002238,0.00007866578,0.0000348495,0.0001361917,0.00001938817,0.000009950769],"category_scores_gemma":[0.00008560388,0.00005187071,0.00007892928,0.0003699377,0.00001633887,0.0001037364,0.00002544768,0.00003332492,0.000005248427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002907327,"about_ca_system_score_gemma":0.000026306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.078482e-7,"about_ca_topic_score_gemma":5.347547e-7,"domain_scores_codex":[0.9994991,0.00002600867,0.000155624,0.0001572344,0.00006132421,0.0001006858],"domain_scores_gemma":[0.9992973,0.0004033906,0.00005032229,0.0001373099,0.00007183049,0.00003985172],"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.000004246486,0.00002890168,0.0005646143,0.0008656444,0.0002595552,9.329573e-7,0.00018834,0.6939742,0.0001999776,0.06926845,0.0002220037,0.2344231],"study_design_scores_gemma":[0.0001890916,0.00001335211,0.00215223,0.000611976,0.0001033857,0.000003753472,0.000001180843,0.9951355,0.00002204677,0.0003323028,0.001339006,0.00009615153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001533925,0.01277275,0.9845008,0.002155781,0.0000701833,0.0001979226,0.000002072191,0.0001013385,0.00004576029],"genre_scores_gemma":[0.6560736,0.0008335697,0.3424704,0.0004420524,0.00004835427,0.00007947579,0.00001449269,0.00001083227,0.00002722988],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6559201,"threshold_uncertainty_score":0.2115226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02560682844979911,"score_gpt":0.3048572922159124,"score_spread":0.2792504637661133,"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."}}