{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002484526,0.0002405377,0.0003346751,0.0004780469,0.000252453,0.0001690734,0.0004957611,0.00009412647,0.00009246021],"category_scores_gemma":[0.000235958,0.0002205775,0.0001587897,0.000603492,0.00005024554,0.001378485,0.0001090831,0.001512362,0.0002617165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004595238,"about_ca_system_score_gemma":0.0001855025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001163876,"about_ca_topic_score_gemma":0.001449218,"domain_scores_codex":[0.9968894,0.00005814164,0.0004924731,0.0002915062,0.0002601288,0.002008353],"domain_scores_gemma":[0.9991084,0.00006885851,0.0004346349,0.0002673118,0.0001026828,0.00001809806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000224029,0.0001420766,0.01134708,0.00004704723,0.0002340109,0.00004812127,0.0003096071,0.03697691,0.00007856758,0.9417399,0.0000561718,0.00879644],"study_design_scores_gemma":[0.001693915,0.00005755089,0.0004895095,0.0001711217,0.0002083452,0.0001629913,0.008956851,0.0410968,0.00001434764,0.9306517,0.01572919,0.00076764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3723843,0.007125075,0.5692119,0.0006911441,0.001077195,0.0005153221,0.000001159654,0.0004200085,0.04857389],"genre_scores_gemma":[0.9959609,0.000445525,0.0002603709,0.0003217461,0.0008518053,0.00001149105,0.000003388149,0.00005286671,0.002091922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6235766,"threshold_uncertainty_score":0.8994889,"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."}}