{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004557246,0.000363717,0.0002414078,0.0003640079,0.0001696039,0.0007418241,0.0004318495,0.0001011381,0.000253655],"category_scores_gemma":[0.0001308847,0.0003369039,0.00010762,0.0003360931,0.00002474177,0.00032629,0.0001525435,0.0002875916,0.00002902278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000112475,"about_ca_system_score_gemma":0.00001965757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005550243,"about_ca_topic_score_gemma":0.000007051084,"domain_scores_codex":[0.9982276,0.0000118007,0.000410228,0.0005591295,0.0003929209,0.0003983525],"domain_scores_gemma":[0.9991815,0.00008174058,0.0001241451,0.0003429302,0.0002222896,0.00004740938],"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.00003666812,0.0001682776,0.00003471036,0.0001278285,0.0002062753,0.0000216027,0.00003308409,0.951115,0.0004212517,0.04325531,0.0006454695,0.003934597],"study_design_scores_gemma":[0.002360526,0.00002286197,0.0001313616,0.0002169332,0.0001098986,0.000002027814,0.000231753,0.9724423,0.000153435,0.000018992,0.02393332,0.0003766321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008955176,0.00009809253,0.9762297,0.001943299,0.008004598,0.001564141,0.00003745658,0.0004151285,0.002752387],"genre_scores_gemma":[0.9726773,0.0001362938,0.02030194,0.0004766858,0.003121884,0.0006261352,0.0003022657,0.0001217792,0.002235698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9637222,"threshold_uncertainty_score":0.9999083,"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."}}