{"id":"W3128553668","doi":"10.1287/opre.2020.2027","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Computer science; Mathematical optimization; Queueing system; Layered queueing network; Mathematics; Theoretical computer science; Statistics; Computer network; Graph","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.003709541,0.0007542605,0.001363204,0.001062824,0.001049172,0.002158537,0.001662224,0.002028985,0.003373371],"category_scores_gemma":[0.01074312,0.0009816797,0.0006208807,0.001176025,0.001488635,0.001863952,0.002128514,0.001155137,0.0004412023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002886269,"about_ca_system_score_gemma":0.003692023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005927781,"about_ca_topic_score_gemma":0.004977058,"domain_scores_codex":[0.9976245,0.001197754,0.00009370007,0.0003179509,0.0003917877,0.000374385],"domain_scores_gemma":[0.9964653,0.002465796,0.0002180398,0.0001688233,0.0004233489,0.0002585413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001438556,0.00006944193,0.0003286572,0.00007913278,0.00002920996,0.00003749704,0.00008683596,0.9248482,0.003519327,0.05617166,0.000721981,0.01396422],"study_design_scores_gemma":[0.00001815469,0.00002484981,0.00003785361,0.000005538325,0.000006741314,0.000005658724,0.00001244005,0.9831787,0.0002835552,0.01621,0.0002108217,0.000005637163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03223761,0.0001378692,0.9634126,0.0003586771,0.00003804105,0.0001331132,0.00006327958,0.0001947903,0.003423989],"genre_scores_gemma":[0.8044657,0.0002947494,0.1916387,0.0002338068,0.00006489721,0.0002299555,0.0001086017,0.0001017025,0.002861908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005927781,"threshold_uncertainty_score":0.02094144,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08790752156144246,"score_gpt":0.3437397158320938,"score_spread":0.2558321942706514,"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."}}