{"id":"W1988428279","doi":"10.1016/j.ijpe.2011.03.005","title":"Supplier selection-order allocation: A two-stage multiple criteria dynamic programming approach","year":2011,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":234,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Analytic hierarchy process; Supply chain; Selection (genetic algorithm); Operations research; Ranking (information retrieval); Mathematical optimization; Dynamic programming; Order (exchange); Supply chain management; Process (computing); Function (biology); Business; Artificial intelligence; Mathematics; Algorithm","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003838151,0.0002346781,0.0003873139,0.001070163,0.0001511902,0.0006045637,0.001433766,0.00009482794,0.001482359],"category_scores_gemma":[0.003458237,0.0002080387,0.0002290038,0.0004378593,0.0001246614,0.001946564,0.0001746922,0.0003279191,0.0001334992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003653286,"about_ca_system_score_gemma":0.0002395509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003657327,"about_ca_topic_score_gemma":0.0000850725,"domain_scores_codex":[0.9960958,0.000188578,0.001945434,0.0006175538,0.0008880484,0.0002645861],"domain_scores_gemma":[0.9940334,0.0002344788,0.001730674,0.000432508,0.003417809,0.0001511461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003045778,0.0028113,0.07552458,0.00002774722,0.001265027,0.00006195404,0.01291804,0.06483227,0.0149332,0.00966107,0.008042651,0.8068764],"study_design_scores_gemma":[0.008238188,0.0005804558,0.05272507,0.0001462448,0.0001581902,0.006149021,0.01064031,0.4947329,0.02116257,0.0379792,0.3655431,0.001944735],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7428302,0.00006794505,0.2422513,0.001471132,0.01127915,0.0003833017,0.00002301706,0.000048466,0.001645466],"genre_scores_gemma":[0.8095919,0.00002802096,0.1876706,0.0001259303,0.001004393,0.00001442912,0.000008962571,0.00002938353,0.001526381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8049316,"threshold_uncertainty_score":0.9994304,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1482788018086866,"score_gpt":0.4015870338649926,"score_spread":0.253308232056306,"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."}}