{"id":"W2031832347","doi":"10.5267/j.ijiec.2010.03.007","title":"Supplier selection and order lot sizing using dynamic programming","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Sizing; Selection (genetic algorithm); Order (exchange); Build to order; Mathematical optimization; Dynamic programming; Computer science; Operations research; Engineering; Production (economics); Mathematics; Business; Economics; Microeconomics; Artificial intelligence; Chemistry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077896,0.001372693,0.001703379,0.0009851791,0.0005785826,0.00131662,0.001264309,0.001044776,0.003312788],"category_scores_gemma":[0.001824803,0.001133451,0.0009250758,0.001625315,0.000579107,0.001244682,0.0006735849,0.001069491,0.0004674247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001597704,"about_ca_system_score_gemma":0.002222815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007794478,"about_ca_topic_score_gemma":0.008301512,"domain_scores_codex":[0.9991316,0.0003292312,0.00002647637,0.0001544296,0.0002489176,0.0001093589],"domain_scores_gemma":[0.9992568,0.0005248616,0.00008013815,0.00002956418,0.00007418249,0.00003438222],"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.00003205345,0.00002278675,0.0000884944,0.00003781912,0.00002058647,0.00003115079,0.00001578548,0.9805402,0.0005850816,0.004546006,0.0003527418,0.01372726],"study_design_scores_gemma":[0.00001173367,0.0000153522,0.00003512089,0.000003450977,0.000005485094,0.000009315168,0.000004511287,0.9960098,0.0002571948,0.003204816,0.0004393605,0.000003968718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081673,0.0002261133,0.9850758,0.000126566,0.00003017997,0.00007189428,0.00006083268,0.0001716712,0.003420317],"genre_scores_gemma":[0.5528089,0.0005969248,0.4374673,0.0001466136,0.00006500455,0.0003695173,0.0003312219,0.0001353201,0.008079208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007794478,"threshold_uncertainty_score":0.01549822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01468779194253076,"score_gpt":0.2585349283688055,"score_spread":0.2438471364262747,"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."}}