{"id":"W4206457505","doi":"10.1109/ieem50564.2021.9672852","title":"An Efficient Heuristic for the Two-echelon Multi-vendor Multi-buyer Optimization Problem","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Moncton","funders":"","keywords":"Vendor; Mathematical optimization; Computer science; Heuristic; Schedule; Integer programming; Set (abstract data type); Linear programming; Operations research; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861097,0.0008733706,0.001277919,0.0008497419,0.0005845212,0.001378004,0.001750712,0.001304881,0.005317048],"category_scores_gemma":[0.001445999,0.0006522394,0.0007974712,0.001492813,0.0005300215,0.001631354,0.0009319143,0.001120763,0.0006133494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268518,"about_ca_system_score_gemma":0.002770043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003355597,"about_ca_topic_score_gemma":0.004478426,"domain_scores_codex":[0.9994318,0.000207993,0.00002151707,0.00008811848,0.0001306576,0.0001197944],"domain_scores_gemma":[0.9994598,0.0003441613,0.00005157136,0.00004443093,0.00005429891,0.00004570678],"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.0001051933,0.0002136627,0.0002546232,0.0001542884,0.00003990616,0.000145158,0.00006056351,0.9021305,0.001549429,0.02458715,0.003039727,0.06771982],"study_design_scores_gemma":[0.00004925276,0.00005914334,0.00006195728,0.00001172976,0.00001267433,0.00004051842,0.00002544095,0.9927088,0.0004322552,0.005173097,0.001416827,0.000008285231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01338919,0.0003361337,0.9795013,0.0001416472,0.00006229408,0.000204293,0.00009477955,0.0003386433,0.005931603],"genre_scores_gemma":[0.2639609,0.0004852619,0.7313641,0.0001478227,0.00004024326,0.000380288,0.0002346557,0.0001126755,0.003274001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005317048,"threshold_uncertainty_score":0.01778734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07453157160346145,"score_gpt":0.268037652539565,"score_spread":0.1935060809361035,"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."}}