{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:42:52Z","timestamp":1749494572090},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T00:00:00Z","timestamp":1496707200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Department of Science and Technology, New Delhi, India","award":["SR\/FTP\/MS-003\/2012"],"award-info":[{"award-number":["SR\/FTP\/MS-003\/2012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10479-017-2534-z","type":"journal-article","created":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T14:18:32Z","timestamp":1496758712000},"page":"185-206","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Computing conditional sojourn time of a randomly chosen tagged customer in a \n                $$\\textit{BMAP\/MSP\/}1$$\n                \n                    \n                        \n                            BMAP\n                            \/\n                            MSP\n                            \/\n                            1\n                        \n                    \n                \n             queue under random order service discipline"],"prefix":"10.1007","volume":"261","author":[{"given":"Souvik","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. D.","family":"Banik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,6]]},"reference":[{"key":"2534_CR1","volume-title":"Applied probability and queues","author":"S Asmussen","year":"2003","unstructured":"Asmussen, S. (2003). Applied probability and queues (Vol. 51). Berlin: Springer."},{"issue":"2","key":"2534_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/2034832.2034842","volume":"39","author":"U Ayesta","year":"2011","unstructured":"Ayesta, U., Izagirre, A., & Verloop, I. M. (2011). Heavy traffic analysis of the discriminatory random-order-of-service discipline. ACM SIGMETRICS Performance Evaluation Review, 39(2), 41\u201343.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"1","key":"2534_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10479-007-0292-z","volume":"160","author":"JW Baek","year":"2008","unstructured":"Baek, J. W., Lee, H. W., Lee, S. W., & Ahn, S. (2008). A factorization property for \n                        $$\\mathit{BMAP}\/G\/1$$\n                        \n                            \n                                \n                                    BMAP\n                                    \/\n                                    G\n                                    \/\n                                    1\n                                \n                            \n                        \n                     vacation queues under variable service speed. Annals of Operations Research, 160(1), 19\u201329.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2534_CR4","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0167-6377(03)00006-3","volume":"31","author":"SC Borst","year":"2003","unstructured":"Borst, S. C., Boxma, O. J., Morrison, J. A., & Queija, R. N. (2003). The equivalence between processor sharing and service in random order. Operations Research Letters, 31(4), 254\u2013262.","journal-title":"Operations Research Letters"},{"issue":"2","key":"2534_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.20.2.389","volume":"20","author":"GM Carter","year":"1972","unstructured":"Carter, G. M., & Cooper, R. B. (1972). Queues with service in random order. Operations Research, 20(2), 389\u2013405.","journal-title":"Operations Research"},{"issue":"1","key":"2534_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.seps.2009.04.001","volume":"44","author":"JP Caulkins","year":"2010","unstructured":"Caulkins, J. P. (2010). Might randomization in queue discipline be useful when waiting cost is a concave function of waiting time? Socio-Economic Planning Sciences, 44(1), 19\u201324.","journal-title":"Socio-Economic Planning Sciences"},{"key":"2534_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhry, M. L., Banik, A. D., & Pacheco, A. (2017). A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \n                        $$GI^{[X]}\/C$$\n                        \n                            \n                                \n                                    G\n                                    \n                                        I\n                                        \n                                            [\n                                            X\n                                            ]\n                                        \n                                    \n                                    \/\n                                    C\n                                \n                            \n                        \n                    -\n                        $$MSP\/1\/\\infty $$\n                        \n                            \n                                \n                                    M\n                                    S\n                                    P\n                                    \/\n                                    1\n                                    \/\n                                    \u221e\n                                \n                            \n                        \n                    . Annals of Operations Research, 252(1), 135\u2013173.","DOI":"10.1007\/s10479-015-2026-y"},{"key":"2534_CR8","unstructured":"Chongwatpol, J. (2012). Evaluation of RFID for information visibility based job-shop scheduling in lean manufacturing environments. Ph.D. thesis, Oklahoma State University."},{"issue":"2","key":"2534_CR9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/opre.19.2.453","volume":"19","author":"L Durr","year":"1971","unstructured":"Durr, L. (1971). Priority queues with random order of service. Operations Research, 19(2), 453\u2013460.","journal-title":"Operations Research"},{"issue":"2","key":"2534_CR10","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1214\/aoap\/1034625337","volume":"7","author":"L Flatto","year":"1997","unstructured":"Flatto, L. (1997). The waiting time distribution for the random order service \n                        $$ M\/M\/1$$\n                        \n                            \n                                \n                                    M\n                                    \/\n                                    M\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queue. The Annals of Applied Probability, 7(2), 382\u2013409.","journal-title":"The Annals of Applied Probability"},{"key":"2534_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.10.001","volume":"79","author":"S Ghosh","year":"2017","unstructured":"Ghosh, S., & Banik, A. D. (2017). An algorithmic analysis of the \n                        $$BMAP\/MSP\/1$$\n                        \n                            \n                                \n                                    B\n                                    M\n                                    A\n                                    P\n                                    \/\n                                    M\n                                    S\n                                    P\n                                    \/\n                                    1\n                                \n                            \n                        \n                     generalized processor-sharing queue. Computers & Operations Research, 79, 1\u201311.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2534_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.orl.2006.02.003","volume":"35","author":"UC Gupta","year":"2007","unstructured":"Gupta, U. C., & Banik, A. D. (2007). Complete analysis of finite and infinite buffer \n                        $$GI\/MSP\/1$$\n                        \n                            \n                                \n                                    G\n                                    I\n                                    \/\n                                    M\n                                    S\n                                    P\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queue\u2014A computational approach. Operations Research Letters, 35(2), 273\u2013280.","journal-title":"Operations Research Letters"},{"issue":"4","key":"2534_CR13","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1017\/S0021900200103365","volume":"32","author":"DP Heyman","year":"1995","unstructured":"Heyman, D. P. (1995). A decomposition theorem for infinite stochastic matrices. Journal of applied probability, 32(4), 893\u2013901.","journal-title":"Journal of applied probability"},{"issue":"3","key":"2534_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.peva.2010.12.001","volume":"68","author":"J Kim","year":"2011","unstructured":"Kim, J., Kim, J., & Kim, B. (2011). Analysis of the \n                        $$M\/G\/1$$\n                        \n                            \n                                \n                                    M\n                                    \/\n                                    G\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queue with discriminatory random order service policy. Performance Evaluation, 68(3), 256\u2013270.","journal-title":"Performance Evaluation"},{"key":"2534_CR15","doi-asserted-by":"crossref","unstructured":"Kingman, J. F. C. (1962). On queues in which customers are served in random order. In: Mathematical proceedings of the Cambridge Philosophical Society (Vol.\u00a058, pp. 79\u201391). Cambridge: Cambridge University Press.","DOI":"10.1017\/S0305004100036239"},{"issue":"5","key":"2534_CR16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1049\/el:19950226","volume":"31","author":"K Laevens","year":"1995","unstructured":"Laevens, K., & Bruneel, H. (1995). Delay analysis for ATM queues with random order of service. Electronics Letters, 31(5), 346\u2013347.","journal-title":"Electronics Letters"},{"key":"2534_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719734","volume-title":"Introduction to matrix analytic methods in stochastic modeling","author":"G Latouche","year":"1999","unstructured":"Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling (Vol. 5). Philadelphia: Siam."},{"key":"2534_CR18","volume-title":"Constructive computation in stochastic models with applications: The RG-Factorizations","author":"QL Li","year":"2011","unstructured":"Li, Q. L. (2011). Constructive computation in stochastic models with applications: The RG-Factorizations. Berlin: Springer."},{"issue":"2\u20133","key":"2534_CR19","first-page":"507","volume":"21","author":"QL Li","year":"2005","unstructured":"Li, Q. L., Lian, Z., & Liu, L. (2005). An \n                        $$RG$$\n                        \n                            \n                                \n                                    R\n                                    G\n                                \n                            \n                        \n                    -factorization approach for a \n                        $$BMAP\/M\/1$$\n                        \n                            \n                                \n                                    B\n                                    M\n                                    A\n                                    P\n                                    \/\n                                    M\n                                    \/\n                                    1\n                                \n                            \n                        \n                     generalized processor-sharing queue. Stochastic models, 21(2\u20133), 507\u2013530.","journal-title":"Stochastic models"},{"issue":"1","key":"2534_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/15326349108807174","volume":"7","author":"DM Lucantoni","year":"1991","unstructured":"Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Communications in Statistics. Stochastic Models, 7(1), 1\u201346.","journal-title":"Communications in Statistics. Stochastic Models"},{"issue":"3","key":"2534_CR21","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1017\/S0001867800019947","volume":"22","author":"DM Lucantoni","year":"1990","unstructured":"Lucantoni, D. M., Meier-Hellstern, K. S., & Neuts, M. F. (1990). A single-server queue with server vacations and a class of non-renewal arrival processes. Advances in Applied Probability, 22(3), 676\u2013705.","journal-title":"Advances in Applied Probability"},{"issue":"5","key":"2534_CR22","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0167-6377(03)00028-2","volume":"31","author":"H Masuyama","year":"2003","unstructured":"Masuyama, H., & Takine, T. (2003). Sojourn time distribution in a \n                        $$MAP\/M\/1$$\n                        \n                            \n                                \n                                    M\n                                    A\n                                    P\n                                    \/\n                                    M\n                                    \/\n                                    1\n                                \n                            \n                        \n                     processor-sharing queue. Operations Research Letters, 31(5), 406\u2013412.","journal-title":"Operations Research Letters"},{"issue":"4","key":"2534_CR23","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1017\/S0021900200033465","volume":"6","author":"MF Neuts","year":"1979","unstructured":"Neuts, M. F. (1979). A versatile Markovian point process. Journal of Applied Probability, 6(4), 764\u2013779.","journal-title":"Journal of Applied Probability"},{"key":"2534_CR24","volume-title":"Matrix-geometric solutions in stochastic models: An algorithmic approach","author":"MF Neuts","year":"1981","unstructured":"Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. North Chelmsford: Courier Corporation."},{"key":"2534_CR25","volume-title":"Structured stochastic matrices of M\/G\/1 type and their applications","author":"MF Neuts","year":"1989","unstructured":"Neuts, M. F. (1989). Structured stochastic matrices of M\/G\/1 type and their applications. New York: Marcel Decker Inc."},{"issue":"2","key":"2534_CR26","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01158473","volume":"7","author":"MF Neuts","year":"1990","unstructured":"Neuts, M. F., & Rao, B. (1990). Numerical investigation of a multiserver retrial model. Queueing systems, 7(2), 169\u2013189.","journal-title":"Queueing systems"},{"key":"2534_CR27","volume-title":"Planning and scheduling in manufacturing and services","author":"M Pinedo","year":"2005","unstructured":"Pinedo, M. (2005). Planning and scheduling in manufacturing and services (Vol. 24). Berlin: Springer."},{"issue":"1","key":"2534_CR28","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1017\/S0001867800033474","volume":"12","author":"V Ramaswami","year":"1980","unstructured":"Ramaswami, V. (1980). The \n                        $$N\/G\/1$$\n                        \n                            \n                                \n                                    N\n                                    \/\n                                    G\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queue and its detailed analysis. Advances in Applied Probability, 12(1), 222\u2013261.","journal-title":"Advances in Applied Probability"},{"issue":"1","key":"2534_CR29","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10479-014-1721-4","volume":"226","author":"W Rogiest","year":"2015","unstructured":"Rogiest, W., Laevens, K., Walraevens, J., & Bruneel, H. (2015). Random-order-of-service for heterogeneous customers: Waiting time analysis. Annals of Operations Research, 226(1), 527\u2013550.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"2534_CR30","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.orl.2015.06.010","volume":"43","author":"W Rogiest","year":"2015","unstructured":"Rogiest, W., Laevens, K., Walraevens, J., & Bruneel, H. (2015). When random-order-of-service outperforms first-come-first-served. Operations Research Letters, 43(5), 504\u2013506.","journal-title":"Operations Research Letters"},{"issue":"4","key":"2534_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12597-015-0202-0","volume":"52","author":"SK Samanta","year":"2015","unstructured":"Samanta, S. K. (2015). Sojourn-time distribution of the \n                        $$GI\/M S P\/1$$\n                        \n                            \n                                \n                                    G\n                                    I\n                                    \/\n                                    M\n                                    S\n                                    P\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queueing system. OPSEARCH, 52(4), 1\u201315.","journal-title":"OPSEARCH"},{"key":"2534_CR32","doi-asserted-by":"publisher","unstructured":"Samanta, S. K. (2015). Waiting-time analysis of \n                        $$D$$\n                        \n                            \n                                D\n                            \n                        \n                    -\n                        $$BMAP\/G\/1$$\n                        \n                            \n                                \n                                    B\n                                    M\n                                    A\n                                    P\n                                    \/\n                                    G\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queueing system. Annals of Operations Research. doi:\n                        10.1007\/s10479-015-1974-6\n                        \n                    .","DOI":"10.1007\/s10479-015-1974-6"},{"issue":"2","key":"2534_CR33","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s11009-014-9429-0","volume":"18","author":"SK Samanta","year":"2016","unstructured":"Samanta, S. K., Chaudhry, M. L., & Pacheco, A. (2016). Analysis of \n                        $$BMAP\/MSP\/1$$\n                        \n                            \n                                \n                                    B\n                                    M\n                                    A\n                                    P\n                                    \/\n                                    M\n                                    S\n                                    P\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queue. Methodology and Computing in Applied Probability, 18(2), 419\u2013440.","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"2","key":"2534_CR34","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/j.1538-7305.1963.tb00509.x","volume":"42","author":"L Tak\u00e1cs","year":"1963","unstructured":"Tak\u00e1cs, L. (1963). Delay distributions for one line with Poisson input, general holding times, and various orders of service. Bell System Technical Journal, 42(2), 487\u2013503.","journal-title":"Bell System Technical Journal"},{"issue":"4","key":"2534_CR35","doi-asserted-by":"crossref","first-page":"486","DOI":"10.15807\/jorsj.39.486","volume":"39","author":"H Takagi","year":"1996","unstructured":"Takagi, H. (1996). A note on the response time in \n                        $$M\/G\/1$$\n                        \n                            \n                                \n                                    M\n                                    \/\n                                    G\n                                    \/\n                                    1\n                                \n                            \n                        \n                     queues with service in random order and bernoulli feedback. Journal of the Operations Research Society of Japan, 39(4), 486\u2013500.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"2534_CR36","unstructured":"Zhao, Y. Q. (2000). Censoring technique in studying block-structured Markov chains. In G. Latouche & P. G. Taylor (Eds.), Advances in algorithmic methods for stochastic models (pp. 417\u2013433). New Jersey: Notable publications Inc."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2534-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2534-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2534-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T16:25:32Z","timestamp":1516033532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2534-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,6]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2534"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2534-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,6]]}}}