{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436076,0.00010033,0.0001207389,0.0001424431,0.0002231669,0.0001769683,0.0000667936,0.00005221202,0.000005665232],"category_scores_gemma":[0.000163173,0.00009386732,0.00003923283,0.00009366311,0.00000962491,0.0001994815,0.00001271979,0.0002229332,0.00001320756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008684422,"about_ca_system_score_gemma":0.00002664203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.538705e-7,"about_ca_topic_score_gemma":3.990117e-7,"domain_scores_codex":[0.9992903,0.00001105483,0.0002872216,0.00008567942,0.0001276258,0.0001981237],"domain_scores_gemma":[0.9995466,0.00008266139,0.00009858283,0.00007436384,0.0001160626,0.00008176028],"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.00001888781,0.00001228917,0.00144633,0.00007543994,0.00003901626,0.000001816076,0.0008889639,0.9751489,0.0001710738,0.001421376,0.0001742383,0.02060166],"study_design_scores_gemma":[0.0004041804,0.0000654953,0.0004896718,0.000268064,0.000009084079,0.0001154718,0.0002393399,0.9971659,0.0003639395,0.0002200421,0.0005106829,0.0001481841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7591298,0.00007129512,0.2374919,0.000105812,0.00174102,0.0001964778,6.397558e-7,0.0001766985,0.001086449],"genre_scores_gemma":[0.9565751,0.00002248055,0.04274382,0.00008332123,0.0004718624,0.000001350907,0.000003761462,0.00002259817,0.00007567899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1974454,"threshold_uncertainty_score":0.3827798,"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."}}