{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:15:01Z","timestamp":1770524101096,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":["Performance Evaluation"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0166-5316(89)90013-8","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"233-245","source":"Crossref","is-referenced-by-count":45,"title":["Equivalence relations in queueing models of Fork\/Join networks with blocking"],"prefix":"10.1016","volume":"10","author":[{"given":"Mostafa H.","family":"Ammar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley B.","family":"Gershwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-5316(89)90013-8_BIB1","series-title":"Proc. 19th IEEE Conference on Decision and Control","article-title":"Equivalence relations in queueing models of manufacturing networks","author":"Ammar","year":"1980"},{"key":"10.1016\/0166-5316(89)90013-8_BIB2","series-title":"MIT Laboratory for Information and Decision Systems","article-title":"Modelling and Analysis of Unreliable Manufacturing Assembly Networks with Finite Storages","author":"Ammar","year":"1980"},{"key":"10.1016\/0166-5316(89)90013-8_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF00269808","article-title":"Approximate analysis of exponential queueing systems with blocking","volume":"15","author":"Boxma","year":"1981","journal-title":"Acta Inf."},{"key":"10.1016\/0166-5316(89)90013-8_BIB4","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/TSE.1979.230199","article-title":"Throughput capacity of a sequence of transfer lines with blocking due to finite waiting room","volume":"5","author":"Caseau","year":"1979","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/0166-5316(89)90013-8_BIB5","article-title":"Approximation of Assembly -Disassembly Systems","author":"de Koster","year":"1987"},{"key":"10.1016\/0166-5316(89)90013-8_BIB6","article-title":"Capacity Oriented Analysis and Design of Production Systems","author":"de Koster","year":"1988"},{"key":"10.1016\/0166-5316(89)90013-8_BIB7","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF00263293","article-title":"Performance evaluation of fork and join synchronization primitives","volume":"24","author":"Duda","year":"1987","journal-title":"Acta Inf."},{"key":"10.1016\/0166-5316(89)90013-8_BIB8","series-title":"Proc. 1986 IEEE International Conference on Systems Man and Cybernetics","article-title":"Modelling and analysis of assembly\/disassembly networks","author":"Gershwin","year":"1986"},{"key":"10.1016\/0166-5316(89)90013-8_BIB9","article-title":"Assembly\/Disassembly: An Efficient Decomposition Algorithm for Tree Structured Networks","author":"Gershwin","year":"1988","journal-title":"MIT Laboratory for Information and Decision Systems, Report LIDS-1579"},{"key":"10.1016\/0166-5316(89)90013-8_BIB10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.15.2.266","article-title":"Cyclic queueing systems with restricted length queues","volume":"15","author":"Gordon","year":"1967","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(89)90013-8_BIB11","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/TC.1982.1675926","article-title":"Queueing network models for parallel processing with synchronous tasks","volume":"31","author":"Heidelberger","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(89)90013-8_BIB12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TC.1983.1676125","article-title":"Analytic queueing models for programs with internal concurrencies","volume":"32","author":"Heidelberg","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(89)90013-8_BIB13","series-title":"A First Course in Stochastic Processes","author":"Karlin","year":"1975"},{"key":"10.1016\/0166-5316(89)90013-8_BIB14","series-title":"Reversibility and Stochastic Networks","author":"Kelly","year":"1979"},{"key":"10.1016\/0166-5316(89)90013-8_BIB15","article-title":"Approximate Analysis of a Closed Fork\/Join Model","author":"Liu","year":"1987","journal-title":"North Carolina State University, Center for Communication and Signal Processing, Technical Report TR-87-12"},{"key":"10.1016\/0166-5316(89)90013-8_BIB16","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1287\/mnsc.32.12.1648","article-title":"A note on the reversibility and duality of some tandem blocking queueing systems","volume":"32","author":"Melamed","year":"1986","journal-title":"Manage. Sci."},{"key":"10.1016\/0166-5316(89)90013-8_BIB17","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/mnsc.25.2.152","article-title":"The reversibility property of production lines","volume":"25","author":"Muth","year":"1979","journal-title":"Manage. Sci"},{"key":"10.1016\/0166-5316(89)90013-8_BIB18","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/12.2213","article-title":"Approximate analysis of fork\/join synchronization in parallel queues","volume":"37","author":"Nelson","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(89)90013-8_BIB19","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/32.4676","article-title":"Performance analysis of parallel processing systems","volume":"14","author":"Nelson","year":"1988","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/0166-5316(89)90013-8_BIB20","doi-asserted-by":"crossref","unstructured":"R.O. Onvural, A survey of closed queueing networks with blocking, ACM Comput. Surv., to appear.","DOI":"10.1145\/78919.78920"},{"key":"10.1016\/0166-5316(89)90013-8_BIB21","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/32.24733","article-title":"On equivalencies of blocking mechanisms in queueing networks with finite buffers","volume":"15","author":"Onvural","year":"1989","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/0166-5316(89)90013-8_BIB22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02504640","article-title":"Problems of duality in tandem queueing systems","volume":"27","author":"Yamazaki","year":"1975","journal-title":"Ann. Inst. Math. Stat."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531689900138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531689900138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:58:14Z","timestamp":1552611494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531689900138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0166531689900138"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(89)90013-8","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}