{"id":"W2084502319","doi":"10.1016/s0377-2217(98)00396-8","title":"Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Computer science; Markov chain; Tree (set theory); Queue; Stationary distribution; Birth–death process; Markov process; Bulk queue; Mathematical optimization; Computer network; Mathematics; Combinatorics; Statistics; Machine learning","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.004710943,0.0006976979,0.001540285,0.001477898,0.001775491,0.002844502,0.003736676,0.001914035,0.006082259],"category_scores_gemma":[0.009885165,0.0009666843,0.001219581,0.00230846,0.002276429,0.003338719,0.00171439,0.002425449,0.0008785893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002695674,"about_ca_system_score_gemma":0.003414909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01127777,"about_ca_topic_score_gemma":0.009106066,"domain_scores_codex":[0.9981665,0.0004949068,0.0001234052,0.0003233837,0.0004325318,0.0004592669],"domain_scores_gemma":[0.99232,0.004164355,0.001042316,0.0007507548,0.001074399,0.0006482523],"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.0004663251,0.0001451119,0.002145041,0.0001163443,0.00007128275,0.0004126887,0.0002589466,0.2437286,0.002268514,0.7351867,0.003048904,0.01215151],"study_design_scores_gemma":[0.00006432678,0.00005530539,0.0005245568,0.00001117405,0.00002896937,0.0001306611,0.00003167724,0.8949786,0.000306699,0.1029073,0.0009301046,0.00003058596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1337243,0.0007721077,0.8554361,0.001424785,0.0002602279,0.000242461,0.001268646,0.0004416409,0.006429744],"genre_scores_gemma":[0.8822669,0.0009717429,0.09960506,0.0003603538,0.0003505867,0.0003435233,0.0006199615,0.00008429535,0.01539765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01127777,"threshold_uncertainty_score":0.02491415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02225835286212159,"score_gpt":0.2854121590917731,"score_spread":0.2631538062296516,"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."}}