{"id":"W2008705270","doi":"10.1016/j.ejor.2007.03.035","title":"Maximizing throughput in queueing networks with limited flexibility","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Queueing theory; Computer science; Flexibility (engineering); Throughput; Layered queueing network; Class (philosophy); Computer network; Capacity planning; Set (abstract data type); Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence; Telecommunications; Operating system","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.02000996,0.0001187381,0.0001953427,0.0007605091,0.000287815,0.000323676,0.0004001177,0.00002151605,0.000160044],"category_scores_gemma":[0.001288494,0.00009179897,0.00006476193,0.001400012,0.0001470591,0.001532944,0.0001622935,0.0008271965,0.0000580413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235643,"about_ca_system_score_gemma":0.00006117536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000311279,"about_ca_topic_score_gemma":0.00008366998,"domain_scores_codex":[0.9976111,0.0003126846,0.000612259,0.0002119418,0.0008506794,0.0004013038],"domain_scores_gemma":[0.9978949,0.0004163565,0.0002215021,0.0001932998,0.001242119,0.00003180451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.002668652,0.0003599935,0.03810436,0.00006023168,0.0001298015,0.002997416,0.0003710684,0.8646875,0.001895463,0.06002012,0.0009195171,0.02778587],"study_design_scores_gemma":[0.01057367,0.0008585511,0.4852283,0.002458919,0.000158072,0.0004183125,0.007280588,0.3798349,0.0008849064,0.01729612,0.09316333,0.001844402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.851976,0.0002116896,0.1019073,0.001353054,0.0001121962,0.0001533657,2.68824e-7,0.00002264322,0.0442635],"genre_scores_gemma":[0.9938402,0.00001242003,0.004043627,0.0004492091,0.00143833,5.508642e-7,0.000004427422,0.00003208076,0.0001792225],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4848526,"threshold_uncertainty_score":0.6935092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08447565047504504,"score_gpt":0.3474532981743744,"score_spread":0.2629776476993294,"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."}}