{"id":"W2100264258","doi":"10.1017/s0269964808000119","title":"MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS","year":2008,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Throughput; Reliability (semiconductor); Markov process; Heuristics; Computer network; Queueing theory; Distributed computing; 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.002042604,0.0009668805,0.001132228,0.001113843,0.0008552485,0.001909417,0.001807293,0.001155486,0.002163676],"category_scores_gemma":[0.006194616,0.0007721981,0.0005405443,0.001867058,0.001725778,0.002311402,0.001008451,0.0006711463,0.0003812019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003078727,"about_ca_system_score_gemma":0.00150033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006033571,"about_ca_topic_score_gemma":0.003713205,"domain_scores_codex":[0.9990588,0.0003343695,0.0000328373,0.0001402429,0.0001418035,0.0002918679],"domain_scores_gemma":[0.9965692,0.002240456,0.0004552552,0.0001516358,0.0002730597,0.0003104944],"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.0001300212,0.00004109054,0.0004710173,0.00002428861,0.00001999547,0.0001004958,0.00004472842,0.9826699,0.00197933,0.01063613,0.0003217144,0.003561378],"study_design_scores_gemma":[0.00001573709,0.00004214633,0.0001095161,0.000002970953,0.000008208035,0.00001456573,0.00002557255,0.989017,0.0006590526,0.009991579,0.0001066655,0.000006926659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5262453,0.0003470801,0.4670476,0.0005061924,0.0000426695,0.00007641525,0.0001576547,0.0004542524,0.005122792],"genre_scores_gemma":[0.9829069,0.00019397,0.0149234,0.00003152913,0.00002403372,0.00004536096,0.00005309913,0.00003731608,0.001784385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006033571,"threshold_uncertainty_score":0.02233785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02185443511501407,"score_gpt":0.2063125399319547,"score_spread":0.1844581048169406,"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."}}