{"id":"W2582617327","doi":"10.1287/ijoc.2018.0817","title":"A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Production (economics); Decomposition; Routing (electronic design automation); Computer science; Business; Economics; Microeconomics; Chemistry; Computer network","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.001415261,0.002011874,0.001050672,0.001401419,0.0007467968,0.002126439,0.002071071,0.001436752,0.007934953],"category_scores_gemma":[0.002630902,0.0007908134,0.002677491,0.001474342,0.0009012771,0.001879394,0.002129451,0.003203797,0.002501396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002111929,"about_ca_system_score_gemma":0.00267882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003982306,"about_ca_topic_score_gemma":0.005122611,"domain_scores_codex":[0.9992197,0.000226765,0.00004718781,0.0001572787,0.0002578504,0.00009127022],"domain_scores_gemma":[0.9994071,0.0002760325,0.00005402018,0.0001072761,0.0001176673,0.00003800639],"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.0000625371,0.0001168836,0.0003815505,0.0002975451,0.00005669608,0.0001272979,0.0001185818,0.7047712,0.004301887,0.1695557,0.009747898,0.1104622],"study_design_scores_gemma":[0.00002367244,0.00003747223,0.00006773571,0.00003374346,0.00001532986,0.00006271786,0.00002083882,0.9496552,0.0009910323,0.03887314,0.01020581,0.00001336742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001077464,0.0001275342,0.9946254,0.0001284384,0.00004455303,0.00005475442,0.0001049611,0.0002212132,0.003615805],"genre_scores_gemma":[0.02955886,0.0003699605,0.9653879,0.0001711686,0.00008800003,0.0003304163,0.0003780278,0.0002200193,0.003495584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007934953,"threshold_uncertainty_score":0.02654511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01176565549414905,"score_gpt":0.2495361254760282,"score_spread":0.2377704699818792,"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."}}