{"id":"W2598696228","doi":"10.1016/j.ejor.2017.03.028","title":"A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Tardiness; Mathematical optimization; Travelling salesman problem; Scheduling (production processes); Computer science; Job shop scheduling; Heuristic; Benders' decomposition; Production (economics); Decomposition; Heuristics; Operations research; Mathematics; Schedule","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502753,0.001398789,0.001859579,0.001494883,0.0008439135,0.001364165,0.001378322,0.001962692,0.00535402],"category_scores_gemma":[0.001927846,0.00141485,0.001582355,0.001443688,0.0006492711,0.001324841,0.001177216,0.001607169,0.0006429838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001621912,"about_ca_system_score_gemma":0.002389389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007636044,"about_ca_topic_score_gemma":0.008305588,"domain_scores_codex":[0.9994191,0.0002181745,0.00002816217,0.00009170658,0.00010258,0.0001403106],"domain_scores_gemma":[0.9991474,0.000483781,0.00008946002,0.0000494459,0.0001052943,0.0001245917],"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.0002201853,0.0001513518,0.0002157257,0.0001026388,0.00004589829,0.00006783508,0.00005508377,0.9457005,0.002688109,0.004787382,0.001691906,0.04427342],"study_design_scores_gemma":[0.00004562431,0.00007220594,0.00008692016,0.00001333069,0.00002079734,0.00001326464,0.00002281734,0.9960109,0.0005330608,0.002591487,0.0005797193,0.000009839455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05191356,0.0004357955,0.938652,0.0003794379,0.0001637751,0.0002899101,0.0002244203,0.0006976369,0.007243495],"genre_scores_gemma":[0.2882498,0.0003814681,0.704699,0.0002443518,0.00007137662,0.0003368188,0.0004729864,0.0002478289,0.005296383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007636044,"threshold_uncertainty_score":0.01791096,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05202032477694222,"score_gpt":0.3255017149963965,"score_spread":0.2734813902194543,"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."}}