{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001169214,0.0001117542,0.0001168122,0.0002922928,0.00004587087,0.00009947267,0.0001114066,0.00009358584,0.00001173334],"category_scores_gemma":[0.0002042676,0.000119981,0.00003303757,0.0001446716,0.00001636227,0.0002352619,0.0000185213,0.000497579,7.701452e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008599977,"about_ca_system_score_gemma":0.00003934457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005727545,"about_ca_topic_score_gemma":0.000005172531,"domain_scores_codex":[0.9993052,0.000005691282,0.0003126077,0.0000747861,0.0001805121,0.000121144],"domain_scores_gemma":[0.9994277,0.00009308258,0.00009609621,0.00003732728,0.0002800658,0.00006574344],"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.00000474085,0.00001118778,0.00008219047,0.000004163915,0.00006254974,0.00000520366,0.00006249471,0.9761221,0.004793093,0.0002883631,0.000009850738,0.01855405],"study_design_scores_gemma":[0.0004910567,0.00002168877,0.0002256528,0.0000451706,0.00002399849,0.0001934689,0.00002326757,0.99605,0.0008552138,0.000140394,0.001804092,0.0001260258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2548652,0.00002805579,0.7425966,0.00005008597,0.002310274,0.00005363577,0.000003879674,0.00007771744,0.00001453728],"genre_scores_gemma":[0.8366333,0.00001214676,0.1628527,0.000004056983,0.0004630434,0.000001291898,0.000007351352,0.00002287662,0.00000316078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5817682,"threshold_uncertainty_score":0.4892684,"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."}}