{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00371915,0.0001816351,0.0004580481,0.001144776,0.0004504757,0.0002383293,0.0005314015,0.00007608277,0.0001412417],"category_scores_gemma":[0.001278998,0.0001265131,0.0001097363,0.008056502,0.0002442407,0.001270825,0.0003823687,0.0002901338,0.000009832535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001863645,"about_ca_system_score_gemma":0.0002094827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004524171,"about_ca_topic_score_gemma":0.008283306,"domain_scores_codex":[0.9975817,0.0003040286,0.000453008,0.0003740953,0.0009101226,0.0003770942],"domain_scores_gemma":[0.9945808,0.0002647263,0.0001630335,0.0006637092,0.004277416,0.00005029082],"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.0003358737,0.0002090124,0.06680043,0.0002783201,0.001300539,0.000004626524,0.001235559,0.9186102,0.002493381,0.007303406,0.0003698569,0.001058799],"study_design_scores_gemma":[0.0004536179,0.00004128482,0.01246227,0.0000928614,0.0007145021,0.000001611193,0.003749056,0.9726594,0.002468295,0.005607089,0.001479511,0.0002705062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907124,0.0000659931,0.00493404,0.002301382,0.00001668067,0.0003579611,0.00002697307,0.00002084385,0.001563744],"genre_scores_gemma":[0.997485,0.000006703,0.0016665,0.0005351081,0.00009984693,0.00002832193,0.00003766598,0.00002617641,0.0001146721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05433816,"threshold_uncertainty_score":0.6839224,"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."}}