{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:23:59Z","timestamp":1759073039040},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0305-0548(89)90023-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"217-233","source":"Crossref","is-referenced-by-count":11,"title":["An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas"],"prefix":"10.1016","volume":"16","author":[{"given":"Andr\u00e9B.","family":"Bondi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/0305-0548(89)90023-3_BIB1","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TCOM.1980.1094756","article-title":"Analysis of finite storage in a computer network node environment under general traffic conditions","volume":"COM-28","author":"Kamoun","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0305-0548(89)90023-3_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1147\/rd.193.0295","article-title":"Solution of queueing problems by a recursive technique","volume":"19","author":"Herzog","year":"1975","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"10.1016\/0305-0548(89)90023-3_BIB3","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TCOM.1980.1094691","article-title":"Flow control: a comparative survey","author":"Gerla","year":"1980","journal-title":"IEEE Trans. Commun. COM-28"},{"issue":"3","key":"10.1016\/0305-0548(89)90023-3_BIB4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TCOM.1978.1094076","article-title":"Buffer management in a packet switch","author":"Irland","year":"1978","journal-title":"IEEE Trans. Commun. COM-26"},{"key":"10.1016\/0305-0548(89)90023-3_BIB5","first-page":"72","article-title":"Servicing two flows with relative priority in a fully accessible system with a restricted number of places for waiting","volume":"2","author":"Basharin","year":"1967","journal-title":"Engng Cybernet."},{"key":"10.1016\/0305-0548(89)90023-3_BIB6","first-page":"40","article-title":"Servicing several flows by fully accessible clusters with relative priority servicing and restricted queueing","volume":"5","author":"Kobotushkin","year":"1969","journal-title":"Probl. Inform. Transm."},{"key":"10.1016\/0305-0548(89)90023-3_BIB7","series-title":"Sixth Int. Teletraffic Congr.","first-page":"315\/1","article-title":"One-server priority system with arbitrary service time and limited waiting room","author":"Bocharov","year":"1970"},{"key":"10.1016\/0305-0548(89)90023-3_BIB8","series-title":"Sixth Int. Teletraffic Congr.","first-page":"323\/1","article-title":"Combined delay and loss systems with several input queues, full and limited accessibility","author":"Kuehn","year":"1970"},{"key":"10.1016\/0305-0548(89)90023-3_BIB9","article-title":"Modellierung und Analyse von Ueberlast-Abwehrmechanismen in Paket-vermittlungsnetzen","author":"Van As","year":"1984"},{"issue":"3","key":"10.1016\/0305-0548(89)90023-3_BIB10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0305-0548(84)90022-4","article-title":"Analysis of a finite capacity non-preemptive priority queue","volume":"11","author":"Kapadia","year":"1984","journal-title":"Computers Opns Res."},{"issue":"4","key":"10.1016\/0305-0548(89)90023-3_BIB11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0305-0548(85)90038-3","article-title":"Finite capacity priority queues with potential health applications","volume":"12","author":"Kapadia","year":"1985","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(89)90023-3_BIB12","series-title":"Proc. ACM S1GMETRICS Conf.","first-page":"257","article-title":"Characterization of an Optimal Delayed Resolution Policy","author":"Thareja","year":"1983"},{"key":"10.1016\/0305-0548(89)90023-3_BIB13","series-title":"Priority Queues","author":"Jaiswal","year":"1968"},{"key":"10.1016\/0305-0548(89)90023-3_BIB14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.2.1.70","article-title":"Priority assignment in waiting line problems","volume":"2","author":"Cobham","year":"1954","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(89)90023-3_BIB15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1287\/opre.3.4.547","article-title":"Priority assignment\u2014a correction","volume":"3","author":"Cobham","year":"1955","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(89)90023-3_BIB16","article-title":"Computer Applications","volume":"Vol. 2","author":"Kleinrock","year":"1976"},{"key":"10.1016\/0305-0548(89)90023-3_BIB17","article-title":"Are bigger buffers always better? An analysis of finite capacity queues with preemptive and non-preemptive priority scheduling","author":"Bondi","year":"1986"},{"key":"10.1016\/0305-0548(89)90023-3_BIB18","article-title":"An analysis of finite capacity queues with priority scheduling and reserved waiting areas","author":"Bondi","year":"1986"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054889900233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054889900233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:58:31Z","timestamp":1552928311000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054889900233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0305054889900233"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(89)90023-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}