{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002278106,0.00008860293,0.0001066453,0.0001254408,0.0007548626,0.0004725926,0.0001522942,0.00001897932,0.00001329568],"category_scores_gemma":[0.0009095636,0.00007562437,0.00003005767,0.00007206928,0.0002602347,0.0003129592,0.00001581556,0.0002740707,0.000003449238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008500476,"about_ca_system_score_gemma":0.0001876866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000127455,"about_ca_topic_score_gemma":0.000002029797,"domain_scores_codex":[0.9988688,0.0001668972,0.0002677355,0.0001279365,0.0003962037,0.0001724544],"domain_scores_gemma":[0.9983595,0.0001707887,0.00008914901,0.000116709,0.001151055,0.0001127759],"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.000295602,0.00006438528,0.001003746,0.00008909711,0.0000945404,0.00004405613,0.0002096566,0.9887506,0.001012412,0.0005157457,0.0004414566,0.007478699],"study_design_scores_gemma":[0.003211712,0.0009419951,0.01671389,0.0007331836,0.0000524749,0.0002804303,0.0006606512,0.974157,0.002342386,0.0001294452,0.0004421436,0.0003346634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.382989,0.000156622,0.6147825,0.001071011,0.0001756033,0.0003132771,0.0000430715,0.00002368921,0.0004452912],"genre_scores_gemma":[0.8884813,0.00003430729,0.1111402,0.000009182577,0.0002478512,0.000005228851,0.00003851885,0.00002064669,0.00002280093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5054923,"threshold_uncertainty_score":0.5805869,"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."}}