{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416883,0.0008733706,0.001102813,0.0007778484,0.0004400946,0.0008168747,0.0009246907,0.0009836883,0.003461424],"category_scores_gemma":[0.001892025,0.0006079409,0.0008833559,0.0009346909,0.0004339617,0.0008411871,0.001121861,0.001379123,0.0005087245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115575,"about_ca_system_score_gemma":0.001847164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006169749,"about_ca_topic_score_gemma":0.004900034,"domain_scores_codex":[0.9993929,0.0002733956,0.00002993233,0.00009076572,0.0001189578,0.00009420857],"domain_scores_gemma":[0.9990591,0.0006210994,0.00007549115,0.00005561226,0.0001287073,0.00005988973],"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.00002967792,0.00003190983,0.0001314744,0.00003248825,0.000014934,0.00002259083,0.00002300214,0.9666163,0.0005446118,0.00587591,0.0006523729,0.02602471],"study_design_scores_gemma":[0.000005469728,0.000007753912,0.00001541516,0.000002364848,0.000001264237,0.00000280181,0.000002974169,0.9983867,0.00007291122,0.001354524,0.0001466372,0.000001130512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007963438,0.0001013899,0.989814,0.00008824003,0.00001616813,0.00006189095,0.00006608406,0.0001825966,0.001706223],"genre_scores_gemma":[0.2649828,0.0001857977,0.7317955,0.00007348935,0.00002790637,0.0003462286,0.0003219789,0.000126489,0.00213984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006169749,"threshold_uncertainty_score":0.01226765,"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."}}