{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T06:10:18Z","timestamp":1734934218319,"version":"3.32.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf01149261","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T11:08:57Z","timestamp":1107860937000},"page":"361-383","source":"Crossref","is-referenced-by-count":5,"title":["A decomposition-related throughput property of tandem queueing networks with blocking"],"prefix":"10.1007","volume":"13","author":[{"given":"Xiao -Gao","family":"Liu","sequence":"first","affiliation":[]},{"given":"John A.","family":"Buzacott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/mnsc.11.5.553","volume":"11","author":"B. Avi-Itzhak","year":"1965","unstructured":"B. Avi-Itzhak and M. Yadin, A sequence of two servers with no intermediate queue, Manag. Sci. 11 (1965) 553?564.","journal-title":"Manag. Sci."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/07408178708975416","volume":"19","author":"J.A. Buzacott","year":"1987","unstructured":"J.A. Buzacott and D. Kostelski, Matrix-geometric and recursive algorithm solution of a two-stage unreliable flow line, IIE Trans. 19 (1987) 429?438.","journal-title":"IIE Trans."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1080\/00207548708919865","volume":"25","author":"M.B.A. Koster De","year":"1987","unstructured":"M.B.A. De Koster, Estimation of line efficiency by aggregation, Int. J. Prod. Res. 25 (1987) 615?626.","journal-title":"Int. J. Prod. Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.35.2.291","volume":"35","author":"S.B. Gershwin","year":"1987","unstructured":"S.B. Gershwin, An efficient decomposition method for the approximate evaluation of tandem queues, Oper. Res. 35 (1987) 291?301.","journal-title":"Oper. Res."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.2307\/3212222","volume":"4","author":"D.K. Hildebrand","year":"1967","unstructured":"D.K. Hildebrand, Stability of finite queue, tandem server systems, J. Appl. Prof. 4 (1967) 571?583.","journal-title":"J. Appl. Prof."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.15.2.286","volume":"15","author":"F.S. Hillier","year":"1967","unstructured":"F.S. Hillier and R.W. Boling, Finite queues in series with exponential or Erlang service times, a numerical approach, Oper. Res. 15 (1967) 286?303.","journal-title":"Oper. Res."},{"key":"CR7","volume-title":"Technical Report 87-26","author":"W.J. Hopp","year":"1987","unstructured":"W.J. Hopp and J.T. Simon, Bounds and heuristics for assembly-like queues, Technical Report 87-26, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois (1987)."},{"key":"CR8","first-page":"87","volume-title":"Queueing Networks with Blocking","author":"X-G. Liu","year":"1989","unstructured":"X-G. Liu and J.A. Buzacott, A zero-buffer equivalence technique for decomposing queueing networks with blocking, in:Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science Publ., Amsterdam, 1989) pp. 87?104."},{"key":"CR9","volume-title":"Ph.D. Thesis","author":"X-G. Liu","year":"1990","unstructured":"X-G. Liu, Toward modeling assembly systems: applications of queueing networks with blocking, Ph.D. Thesis, University of Waterloo, Waterloo, Ontario (May 1990)."},{"key":"CR10","unstructured":"H. Matsuo and P.E. Slaten, A convex combination approximation for tandem queues with blocking, Technical report, The University of Texas at Austin (1988)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0377-2217(84)90049-3","volume":"15","author":"E.J. Muth","year":"1984","unstructured":"E.J. Muth, processes and their network representations associated with a production line queueing model, Eur. J. Oper. Res. 15 (1984) 63?83.","journal-title":"Eur. J. Oper. Res."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-6377(86)90067-2","volume":"5?6","author":"R.O. Onvural","year":"1986","unstructured":"R.O. Onvural and H.G. Perros, On equivalences of blocking mechanisms in queueing networks with blocking, Oper. Res. Lett. 5?6 (1986) 293?298.","journal-title":"Oper. Res. Lett."},{"key":"CR13","volume-title":"Stochastics Process","author":"S.M. Ross","year":"1983","unstructured":"S.M. Ross,Stochastics Process (Wiley, New York, 1983)."},{"key":"CR14","volume-title":"Technical report","author":"J.G. Shanthikumar","year":"1987","unstructured":"J.G. Shanthikumar and M. Jufari, Bounding the performance of tandem queues with finite buffer spaces, Technical report, School of Business Administration, University of California, Berkeley (1987)."},{"key":"CR15","first-page":"325","volume-title":"Queueing Networks with Blocking","author":"J.G. Shanthikumar","year":"1989","unstructured":"J.G. Shanthikumar and D.D. Yao, Monotonicity and concavity properties in cyclic queueing networks with finite buffers, in:Queueing Networks with Blocking, eds. H.G. Perros and T. Altiok (Elsevier Science Publ., Amsterdam, 1989) pp. 325?344."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"C. Terracol and R. David, An aggregation technique for performance evaluation of transfer lines with unreliable machines and finite buffers,Proc. IEEE Conf. on Robotics and Automation, Raleigh, NC, April 1987, pp. 1333?1337.","DOI":"10.1109\/ROBOT.1987.1087826"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.2307\/3214323","volume":"26","author":"P. Tsoucas","year":"1989","unstructured":"P. Tsoucas and J. Walrand, Monotonicity of throughput in non-Markovian networks, J. Appl. Prob. 26 (1989) 134?141.","journal-title":"J. Appl. Prob."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01149261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01149261\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01149261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T05:43:47Z","timestamp":1734932627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01149261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01149261"],"URL":"https:\/\/doi.org\/10.1007\/bf01149261","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}