{"id":"W2205749379","doi":"10.1007/s10479-015-2026-y","title":"A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\\infty $$ M S P / 1 / ∞","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Royal Military College of Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Theory of computation; Simple (philosophy); Markovian arrival process; Markov process; Applied mathematics; Mathematics; Computer science; Buffer (optical fiber); Burke's theorem; Algorithm; Mathematical optimization; Discrete mathematics; Combinatorics; Queue management system; Statistics; Computer network; Fork–join queue; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.001900042,0.001175801,0.001455643,0.001325651,0.0007390907,0.001510764,0.002599454,0.001139243,0.008132786],"category_scores_gemma":[0.006521536,0.000588902,0.001301509,0.001019397,0.001359088,0.003114806,0.001102064,0.001810041,0.0009783603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002401723,"about_ca_system_score_gemma":0.003751079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00971447,"about_ca_topic_score_gemma":0.005827212,"domain_scores_codex":[0.9990809,0.0001992792,0.00003034114,0.0001538693,0.0003887528,0.0001468544],"domain_scores_gemma":[0.9983506,0.000897703,0.0001274994,0.00008721281,0.0004375094,0.00009950806],"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.0001426673,0.0001498194,0.0008873863,0.0002607873,0.0000737372,0.0003934074,0.0003212161,0.4208923,0.01132258,0.5402669,0.004940177,0.02034898],"study_design_scores_gemma":[0.00001523352,0.0000222281,0.0002570921,0.00001115803,0.00001778534,0.000060471,0.0000222991,0.960129,0.000504081,0.0378842,0.001050372,0.00002599752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0333222,0.0009513829,0.9554214,0.0007383834,0.0003289387,0.0001192136,0.0001591873,0.0003860131,0.008573142],"genre_scores_gemma":[0.8308691,0.001701625,0.1290796,0.0004740822,0.0006636491,0.0002904197,0.0002692185,0.000444486,0.03620769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00971447,"threshold_uncertainty_score":0.0272069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2093153899610347,"score_gpt":0.4527562894871882,"score_spread":0.2434408995261535,"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."}}