{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T03:09:22Z","timestamp":1770520162225,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1007\/bf01149328","type":"journal-article","created":{"date-parts":[[2005,2,7]],"date-time":"2005-02-07T09:54:27Z","timestamp":1107770067000},"page":"67-83","source":"Crossref","is-referenced-by-count":73,"title":["Assembly-like queues with finite capacity: Bounds, asymptotics and approximations"],"prefix":"10.1007","volume":"1","author":[{"given":"E. H.","family":"Lipper","sequence":"first","affiliation":[]},{"given":"B.","family":"Sengupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"F. Baccelli and A. Makowski, Simple computable bounds for the fork-join queue,Proc. John Hopkins Conf. Info. Sciences (1985)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"U.N. Bhat, Finite capacity assembly-like queues, Queueing Syst. Theor. and Appl. 1(1986)","DOI":"10.1007\/BF01149329"},{"key":"CR3","unstructured":"F. Bonomi, private communication."},{"key":"CR4","volume-title":"Fundamentals of Queueing Theory","author":"D. Gross","year":"1974","unstructured":"D. Gross and C.M. Harris,Fundamentals of Queueing Theory (Wiley, New York, 1974)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.2307\/3212352","volume":"10","author":"J.M. Harrison","year":"1973","unstructured":"J.M. Harrison, Assembly-like queues, J. Appl. Prob. 10(1973)354.","journal-title":"J. Appl. Prob."},{"key":"CR6","first-page":"559","volume":"A31","author":"B.R.K. Kashyap","year":"1965","unstructured":"B.R.K. Kashyap, A double ended queueing system with limited waiting space, Proc. Nat. Inst. Sci. India A31(1965)559.","journal-title":"Proc. Nat. Inst. Sci. India"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"684","DOI":"10.2307\/3213322","volume":"18","author":"G. Latouche","year":"1981","unstructured":"G. Latouche, Queues with paired customers, J. Appl. Prob. 18(1981)684.","journal-title":"J. Appl. Prob."},{"key":"CR8","first-page":"5","volume":"44","author":"L. Flatto","year":"1984","unstructured":"L. Flatto and S. Hahn, Two parallel queues created by arrivals with two demands, I, SIAM J. Appl. Math. 44, 5(1984).","journal-title":"I, SIAM J. Appl. Math."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01149328.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01149328\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01149328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T17:10:03Z","timestamp":1586106603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01149328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF01149328"],"URL":"https:\/\/doi.org\/10.1007\/bf01149328","relation":{},"ISSN":["0340-4384","1572-9443"],"issn-type":[{"value":"0340-4384","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}