{"id":"W3125991013","doi":"","title":"Maximizing Throughput in Finite-Source Parallel Queue Systems","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Server; Pooling; Computer science; Throughput; Queue; Markov process; Queueing theory; Fork–join queue; Routing (electronic design automation); Computer network; Markovian arrival process; Markov decision process; Mathematical optimization; Distributed computing; Queue management system; Mathematics; Telecommunications","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.003234015,0.0008781989,0.001323996,0.0008357291,0.0009043339,0.00239489,0.001713957,0.00111891,0.001999667],"category_scores_gemma":[0.01039204,0.0007228174,0.0005491744,0.001350409,0.001784922,0.00295248,0.001508862,0.00116523,0.0002637201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003684196,"about_ca_system_score_gemma":0.002369956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005643674,"about_ca_topic_score_gemma":0.003924558,"domain_scores_codex":[0.9980233,0.0009239535,0.00007280109,0.000254895,0.0003493833,0.0003756233],"domain_scores_gemma":[0.9935015,0.005008786,0.0005273628,0.0002150132,0.0004400362,0.0003073935],"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.0001228006,0.00007662793,0.0004303979,0.000060478,0.00003786498,0.0001157025,0.0001060404,0.9317224,0.001543108,0.06065802,0.0006569009,0.004469674],"study_design_scores_gemma":[0.00001817667,0.00002043874,0.00007779011,0.000004059632,0.000006732176,0.00001040051,0.00001899672,0.9672122,0.0002445363,0.03223278,0.0001466493,0.000007200432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2347058,0.00063776,0.7554438,0.001058061,0.0000919861,0.00009232342,0.000178187,0.0003845485,0.0074076],"genre_scores_gemma":[0.9799774,0.0003314123,0.0175825,0.00006018344,0.00006312851,0.00006628,0.00005116488,0.00004180889,0.001826115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005643674,"threshold_uncertainty_score":0.02673084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01925439238144715,"score_gpt":0.216535664884095,"score_spread":0.1972812725026479,"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."}}