{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:13Z","timestamp":1773656053202,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1007\/bf01194397","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T13:25:53Z","timestamp":1108733153000},"page":"181-220","source":"Crossref","is-referenced-by-count":10,"title":["On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers"],"prefix":"10.1007","volume":"47","author":[{"given":"Andreas","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Brandt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"26","volume-title":"Applications of Mathematics","author":"F Baccelli","year":"1994","unstructured":"Baccelli F, Bremaud P (1994) Elements of queueing theory. Applications of Mathematics 26, Springer-Verlag, Berlin"},{"issue":"1?3","key":"CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01149192","volume":"5","author":"OJ Boxma","year":"1989","unstructured":"Boxma OJ (1989) Workloads and waiting times in single-server systems with multiple customer classes. Queueing Systems 5, 1?3:185?214","journal-title":"Queueing Systems"},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/49.68445","volume":"9","author":"OJ Boxma","year":"1991","unstructured":"Boxma OJ, Cohen JW (1991) The M\/G\/1 queue with permanent customers. IEEE J. Sel. Areas Commun. 9, 2:179?184","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/26.2746","volume":"36","author":"OJ Boxma","year":"1988","unstructured":"Boxma OJ, Groendijk WP (1988) Waiting times in discrete-time cyclic-service systems. IEEE Transactions on Communications 36, 2:164?170","journal-title":"IEEE Transactions on Communications"},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9783112727515","volume-title":"Stationary stochastic models","author":"A Brandt","year":"1990","unstructured":"Brandt A, Franken P, Lisek B (1990) Stationary stochastic models. Akademie-Verlag, Berlin; Wiley, Chichester"},{"key":"CR6","first-page":"1","volume":"SC 96-55","author":"A Brandt","year":"1996","unstructured":"Brandt A, Brandt M (1996) A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers. Preprint Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, SC 96-55:1?17","journal-title":"Preprint Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin"},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"EG Coffman","year":"1970","unstructured":"Coffman EG, Muntz R, Trotter H (1970) Waiting time distributions for processor-sharing system. J. ACM 17, 1:123?130","journal-title":"J. ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264581","volume":"12","author":"JW Cohen","year":"1979","unstructured":"Cohen JW (1979) The multiple phase service network with generalized processor sharing. Acta Informatica 12:245?284","journal-title":"Acta Informatica"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00289264","volume":"15","author":"H Daduna","year":"1981","unstructured":"Daduna H, Schassberger R (1981) A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions. Acta Informatica 15:251?263","journal-title":"Acta Informatica"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00535168","volume":"47","author":"G Fayolle","year":"1979","unstructured":"Fayolle G, Iasnogorodski R (1979) Two coupled processors: The reduction to a Riemann-Hilbert problem. Z. Wahrscheinlichkeitstheorie verw. Gebiete 47:325?351","journal-title":"Z. Wahrscheinlichkeitstheorie verw. Gebiete"},{"issue":"3","key":"CR11","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/322203.322212","volume":"27","author":"G Fayolle","year":"1980","unstructured":"Fayolle G, Mitrani I, Iasnogorodski R (1980) Sharing a processor among many job classes. J. ACM 27, 3:519?532","journal-title":"J. ACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01158796","volume":"9","author":"KW Fendrick","year":"1991","unstructured":"Fendrick KW, Rodrigues MA (1991) A heavy-traffic comparsion of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline. Queueing Systems 9:163?190","journal-title":"Queueing Systems"},{"key":"CR13","volume-title":"Queues and point processes","author":"P Franken","year":"1982","unstructured":"Franken P, K\u00f6nig D, Arndt U, Schmidt V (1982) Queues and point processes. Akademie-Verlag, Berlin; Wiley, Chichester"},{"key":"CR14","volume-title":"Handbuch der Bedienungstheorie. Vol. I, Vol. II","year":"1984","unstructured":"Gnedenko BW, K\u00f6nig D (Eds.) (1984) Handbuch der Bedienungstheorie. Vol. I, Vol. II. Akademie-Verlag, Berlin"},{"key":"CR15","unstructured":"Hellerstein J (1992) Control considerations for CPU scheduling in UNIX? systems. USENIX-Winter: 359?374"},{"issue":"5","key":"CR16","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1137\/0148069","volume":"48","author":"G Hooghiemstra","year":"1988","unstructured":"Hooghiemstra G, Keane M, Van de Ree S (1988) Power series for stationary distributions of coupled processor models. SIAM J. Appl. Math. 48, 5:1159?1166","journal-title":"SIAM J. Appl. Math."},{"key":"CR17","first-page":"211","volume":"4","author":"MY Kitaev","year":"1978","unstructured":"Kitaev MY, Yashkov SF (1978) Distribution of the conditional sojourn time of requests in shared-processor systems. Izv. Akad. Nauk SSSR, Tekh. Kibernet. 4:211?215","journal-title":"Izv. Akad. Nauk SSSR, Tekh. Kibernet."},{"key":"CR18","first-page":"64","volume":"6","author":"MY Kitaev","year":"1979","unstructured":"Kitaev MY, Yashkov SF (1979) Analysis of single-line shared-processor systems. Izv. Akad. Nauk SSSR. Tekh. Kibernet. 6:64?71","journal-title":"Izv. Akad. Nauk SSSR. Tekh. Kibernet."},{"issue":"2","key":"CR19","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L Kleinrock","year":"1967","unstructured":"Kleinrock L (1967) Time-shared systems: A theoretical treatment. J. ACM 14, 2:242?261","journal-title":"J. ACM"},{"key":"CR20","volume-title":"Queueing systems. Vol. II.","author":"L Kleinrock","year":"1976","unstructured":"Kleinrock L (1976) Queueing systems. Vol. II. Wiley, New York"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1109\/9.106152","volume":"36","author":"C Knessl","year":"1991","unstructured":"Knessl C (1991) On the diffusion approximation to two parallel queues with processor sharing. IEEE Trans. Automat. Contr. 36:1356?1367","journal-title":"IEEE Trans. Automat. Contr."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"952","DOI":"10.2307\/3213071","volume":"18","author":"AG Konheim","year":"1981","unstructured":"Konheim AG, Meilijson I, Melkman A (1981) Processor-sharing of two parallel lines. J. Appl. Prob. 18:952?956","journal-title":"J. Appl. Prob."},{"key":"CR23","volume-title":"Complex analysis. Methods, trends, and applications","year":"1983","unstructured":"Lanckau E, Tutschke W (Eds.) (1983) Complex analysis. Methods, trends, and applications. Akademie-Verlag, Berlin"},{"key":"CR24","first-page":"189","volume":"C-5","author":"KK Leung","year":"1992","unstructured":"Leung KK (1992) Performance analysis of a processor-sharing policy with interactive and background jobs. IFIP Transactions C (Communication Systems) C-5:189?207","journal-title":"IFIP Transactions C (Communication Systems)"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"0497","DOI":"10.1017\/S0305004100036781","volume":"58","author":"RM Loynes","year":"1962","unstructured":"Loynes RM (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Cambridge Philos. Soc. 58:0497?520","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0145007","volume":"45","author":"JA Morrison","year":"1985","unstructured":"Morrison JA (1985) Response-time distribution for a processor-sharing system. SIAM J. App. Math. 45:152?167","journal-title":"SIAM J. App. Math."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/0146012","volume":"46","author":"JA Morrison","year":"1986","unstructured":"Morrison JA (1986) Asymptotic analysis of the waiting-time distribution for a large closed processor-sharing system. SIAM J. App. Math. 46:140?170","journal-title":"SIAM J. App. Math."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/0153028","volume":"53","author":"JA Morrison","year":"1993","unstructured":"Morrison JA (1993) Diffusion approximation for head of the line processor sharing for two parallel queues. SIAM J. App. Math. 53:471?490","journal-title":"SIAM J. App. Math."},{"issue":"1?2","key":"CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01153535","volume":"14","author":"JA Morrison","year":"1993","unstructured":"Morrison JA (1993) Head of the line processor sharing for many symmetric queues with finite capacity. Queueing Systems 14, 1?2:215?237","journal-title":"Queueing Systems"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"TJ Ott","year":"1984","unstructured":"Ott TJ (1984) The sojourn-time distribution in the M\/G\/1 queue with processor sharing. J. Appl. Prob. 21:360?378","journal-title":"J. Appl. Prob."},{"issue":"5","key":"CR31","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1002\/j.1538-7305.1985.tb00456.x","volume":"64","author":"KM Rege","year":"1985","unstructured":"Rege KM, Sengupta B (1985) Sojourn time distribution in a multiprogrammed computer system. AT & T Techn. J. 64, 5:1077?1090","journal-title":"AT & T Techn. J."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"202","DOI":"10.2307\/1427231","volume":"16","author":"R Schassberger","year":"1984","unstructured":"Schassberger R (1984) A new approach to the M\/G\/1 processor-sharing queue. Adv. Appl. Prob. 16:202?213","journal-title":"Adv. Appl. Prob."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0377-2217(86)90222-5","volume":"23","author":"LP Seelen","year":"1986","unstructured":"Seelen LP (1986) An algorithm for Ph\/Ph\/c queues. European J. Operat. Res. 23:118?127","journal-title":"European J. Operat. Res."},{"issue":"2","key":"CR34","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/j.1538-7305.1985.tb00440.x","volume":"64","author":"B Sengupta","year":"1985","unstructured":"Sengupta B, Jagerman DL (1985) A conditional response time of M\/M\/1 processor-sharing queue. AT & T Techn. J. 64, 2:409?421","journal-title":"AT & T Techn. J."},{"key":"CR35","volume-title":"Stochastic modelling and analysis: A computational approach","author":"HC Tijms","year":"1986","unstructured":"Tijms HC (1986) Stochastic modelling and analysis: A computational approach. Wiley, Chichester"},{"key":"CR36","first-page":"88","volume":"5","author":"SF Yashkov","year":"1977","unstructured":"Yashkov SF (1977) Distribution of conditional waiting time in time-shared systems. Izv. Akad. Nauk SSSR, Tekh. Kibernet. 5:88?94","journal-title":"Izv. Akad. Nauk SSSR, Tekh. Kibernet."},{"issue":"4","key":"CR37","first-page":"3","volume":"15","author":"SF Yashkov","year":"1981","unstructured":"Yashkov SF (1981) Some results of analysing of a stochastic model of remote processing systems (transi. Russian journ. Avtomat. i. Vycisl. Techn., Riga). Automatic Control and Comput. Sci. 15, 4:3?11","journal-title":"Automatic Control and Comput. Sci."},{"key":"CR38","first-page":"133","volume":"12","author":"SF Yashkov","year":"1983","unstructured":"Yashkov SF (1983) A derivation of response time distribution for a M\/G\/1 processor sharing queue. Problems Contr. Info. Theory 12:133?148","journal-title":"Problems Contr. Info. Theory"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"SF Yashkov","year":"1987","unstructured":"Yashkov SF (1987) Processor-sharing queues: some progress in analysis. Queueing Systems 2:1?17","journal-title":"Queueing Systems"},{"key":"CR40","volume-title":"Analysis of Queues in Computers (in Russian)","author":"SF Yashkov","year":"1989","unstructured":"Yashkov SF (1989) Analysis of Queues in Computers (in Russian). Radio Svyaz, Moscow"},{"key":"CR41","first-page":"3","volume":"29","author":"SF Yashkov","year":"1990","unstructured":"Yashkov SF (1990) Mathematical problems in the theory of shared-processor systems. Itogi Nauki i Tekhniki, Seriya Teoriya Veroyatnostei, Matematicheskaya Statistika. Teoreticheskaya Kibernetika 29:3?82","journal-title":"Teoreticheskaya Kibernetika"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194397.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01194397\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:31:50Z","timestamp":1734957110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01194397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["BF01194397"],"URL":"https:\/\/doi.org\/10.1007\/bf01194397","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}