{"id":"W2014774334","doi":"10.1287/mnsc.47.10.1421.10262","title":"Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":116,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Throughput; Queueing theory; Queue; Computer network; Service (business); Markov process; Server farm; Distributed computing; Mathematical optimization; Client–server model; Operating system; Mathematics; Statistics","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.004531399,0.001176856,0.001527606,0.001379085,0.001289446,0.002424223,0.001879466,0.001290606,0.002572911],"category_scores_gemma":[0.01772986,0.0008582056,0.0004633627,0.00159302,0.001703986,0.003002784,0.001197108,0.001299688,0.0005590849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003097804,"about_ca_system_score_gemma":0.002238835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002136284,"about_ca_topic_score_gemma":0.001640428,"domain_scores_codex":[0.9978623,0.001118259,0.0000975232,0.0002214711,0.00032185,0.0003785341],"domain_scores_gemma":[0.9936791,0.004332145,0.0006542142,0.0003621357,0.0005508716,0.0004215854],"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.0001798023,0.0001375894,0.000644497,0.00008093242,0.00003814749,0.00005996592,0.0002430663,0.9149871,0.003114194,0.06186584,0.001011471,0.01763746],"study_design_scores_gemma":[0.00002627718,0.00004358199,0.0001141531,0.00000872039,0.00001095846,0.00001416443,0.00003050978,0.9670123,0.0007600309,0.03166575,0.0003027814,0.00001073144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1185929,0.0004257532,0.8758893,0.0004072826,0.00006730845,0.0001621448,0.00006296375,0.0005941698,0.003798162],"genre_scores_gemma":[0.9160318,0.0004058647,0.08152492,0.00009741245,0.00007868706,0.0001691497,0.00005824673,0.0001071457,0.001526751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004531399,"threshold_uncertainty_score":0.02396458,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02848912473206587,"score_gpt":0.2617988668528339,"score_spread":0.233309742120768,"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."}}