{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391791,0.0001961339,0.000234226,0.000412585,0.000743629,0.0004992145,0.001057098,0.00001887291,0.00002510452],"category_scores_gemma":[0.0001282067,0.0001430153,0.0001072602,0.001881841,0.0004005102,0.001634641,0.0006141918,0.00006983848,0.00004393962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008894718,"about_ca_system_score_gemma":0.00001033161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003331568,"about_ca_topic_score_gemma":0.0000348063,"domain_scores_codex":[0.9979416,0.00001936991,0.0004081878,0.000441669,0.0006522844,0.0005369333],"domain_scores_gemma":[0.998628,0.0001350526,0.0004346899,0.0006258995,0.0001615152,0.00001488948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005086213,0.00007101469,0.002971152,0.0004120768,0.00009422696,0.000009696761,0.0002979234,0.3457812,0.0005586967,0.6436346,0.0003999109,0.005718614],"study_design_scores_gemma":[0.001598872,0.00005521481,0.00722499,0.0006605285,0.0006031828,0.000003978071,0.01404768,0.5869718,0.0006101033,0.08169889,0.3053596,0.00116524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627695,0.0003598454,0.4970951,0.004716535,0.001679401,0.003115688,0.000007668186,0.0004437966,0.1298125],"genre_scores_gemma":[0.9954153,0.00003246395,0.0006542521,0.0009185077,0.0001807593,0.00008727817,0.000002819479,0.0000208169,0.002687815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6326458,"threshold_uncertainty_score":0.5831995,"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."}}