{"id":"W4382934541","doi":"10.1111/itor.13333","title":"A decomposition algorithm for multi‐item production planning with independent random demand","year":2023,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematical optimization; Heuristic; Time horizon; Computer science; Lagrangian relaxation; Task (project management); Modular design; Production planning; Decomposition; Component (thermodynamics); Production (economics); Range (aeronautics); Stochastic programming; Algorithm; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.001705469,0.0001267282,0.0001160006,0.001433626,0.0004513388,0.0003938231,0.0002427082,0.00005691174,0.0003894085],"category_scores_gemma":[0.0001215503,0.0001180096,0.00005701072,0.0008743816,0.0000701469,0.001209564,0.00002809084,0.0002531385,0.0001457931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002158689,"about_ca_system_score_gemma":0.0000614522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001796705,"about_ca_topic_score_gemma":0.0002402166,"domain_scores_codex":[0.9980654,0.00003668313,0.0002891974,0.0003943139,0.0009097548,0.0003046151],"domain_scores_gemma":[0.9989868,0.0001848679,0.00004597832,0.0001163338,0.000649109,0.00001685219],"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.00276579,0.002207201,0.0196137,0.0003839876,0.0007270494,0.0001522878,0.001278023,0.7676145,0.003606798,0.03034626,0.0199225,0.1513819],"study_design_scores_gemma":[0.003295209,0.00003281874,0.009531409,0.0001314355,0.00001227169,0.000007139795,0.0009916693,0.9428263,0.0003429342,0.0007567151,0.04188028,0.0001918089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07782976,0.00004658031,0.9025576,0.008907762,0.002037468,0.00260021,0.00003995868,0.0002464778,0.00573414],"genre_scores_gemma":[0.9804295,0.00003889211,0.008007496,0.0003494369,0.001398772,0.001951738,0.0006272295,0.00004364526,0.00715333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9025997,"threshold_uncertainty_score":0.4812291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1246923583858322,"score_gpt":0.4039890544427045,"score_spread":0.2792966960568723,"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."}}