{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:45:10Z","timestamp":1777902310394,"version":"3.51.4"},"reference-count":9,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T00:00:00Z","timestamp":1409184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2014,10]]},"abstract":"<jats:p>This paper presents two algorithms to analytically approximate work in process (WIP)-dependent inter-departure times for tandem queues composed of a series of M\/M\/1 systems. The first algorithm is used for homogeneous tandem queues, the second for such with bottlenecks. Both algorithms are based on the possible combinations of distributing the WIP on the queues. For each combination the time to the next departure is estimated. A weighted average of all estimated times of each WIP level is calculated to get the expected mean inter-departure time. The generated inter-departure times are used in a simple model of the tandem queue. The inter-departure times, the average WIP and average cycle time of the tandem queue and the simple model are compared in several tandem queue parameterizations. Results show only a small error between the simple model and the tandem queue, rendering this approach applicable in many applications.<\/jats:p>","DOI":"10.1177\/0037549714546665","type":"journal-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T03:27:11Z","timestamp":1409282831000},"page":"1188-1196","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Simplification of DES models of M\/M\/1 tandem queues by approximating WIP-dependent inter-departure times"],"prefix":"10.1177","volume":"90","author":[{"given":"Daniel","family":"Huber","sequence":"first","affiliation":[{"name":"WPC Supply Chain Management, Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Fowler","sequence":"additional","affiliation":[{"name":"WPC Supply Chain Management, Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Armbruster","sequence":"additional","affiliation":[{"name":"School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2014,8,28]]},"reference":[{"key":"bibr1-0037549714546665","first-page":"1610","volume-title":"Proceedings of the 2009 Winter Simulation Conference","author":"Veeger C"},{"key":"bibr2-0037549714546665","first-page":"1795","volume-title":"Proceedings of the 2011 Winter Simulation Conference","author":"Etman P"},{"key":"bibr3-0037549714546665","first-page":"105","volume":"2","author":"Karmarkar US","year":"1989","journal-title":"J Manufact Operat Management"},{"key":"bibr4-0037549714546665","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6485-4_16"},{"key":"bibr5-0037549714546665","first-page":"1699","volume-title":"Proceedings of the 2010 Winter Simulation Conference","author":"Kacar NB"},{"key":"bibr6-0037549714546665","doi-asserted-by":"crossref","unstructured":"Armbruster D, Uzsoy R. Continuous dynamic models, clearing functions, and discrete-event simulation in aggregate production planning. In Tutorials in Operations Research, INFORMS 2012.","DOI":"10.1287\/educ.1120.0102"},{"key":"bibr7-0037549714546665","first-page":"1709","volume-title":"Proceedings of the 2007 Winter Simulation Conference","author":"Rose O"},{"key":"bibr8-0037549714546665","volume-title":"Factory Physics","author":"Hopp WJ","year":"2001"},{"key":"bibr9-0037549714546665","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-011-9240-3"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549714546665","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549714546665","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549714546665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:25:40Z","timestamp":1777634740000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549714546665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,28]]},"references-count":9,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["10.1177\/0037549714546665"],"URL":"https:\/\/doi.org\/10.1177\/0037549714546665","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,28]]}}}