{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:35Z","timestamp":1750307615312,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMM10644959DMI--0323765"],"award-info":[{"award-number":["CMM10644959DMI--0323765"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMM10644959DMI--0323765"],"award-info":[{"award-number":["CMM10644959DMI--0323765"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p>Closed tandem queueing networks are an important class of queueing models. Common approaches for analyzing these systems include Markov processes, renewal theory, and random walks. This article presents optimization models for sample paths of closed tandem queues. These mathematical models provide a new tool for analyzing these queueing systems using the techniques and algorithms from mathematical programming, and from graph theory in particular. We then apply operators from computer graphics (electronic picture manipulation) to graph theoretic representations of discrete-event system dynamics to establish some fundamental mathematical properties for these queueing systems.<\/jats:p>","DOI":"10.1145\/1456645.1456648","type":"journal-article","created":{"date-parts":[[2009,1,7]],"date-time":"2009-01-07T15:50:36Z","timestamp":1231343436000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Mathematical programming models of closed tandem queueing networks"],"prefix":"10.1145","volume":"19","author":[{"given":"Wai Kin Victor","family":"Chan","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee W.","family":"Schruben","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,1,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Askin R. G. and Standridge C. R. 1993. Modeling and Analysis of Manufacturing Systems Wiley.  Askin R. G. and Standridge C. R. 1993. Modeling and Analysis of Manufacturing Systems Wiley."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(95)00022-4"},{"volume-title":"Proceedings of the Winter Simulation Conference (IEEE), 732--737","author":"Buss A. H.","key":"e_1_2_1_3_1","unstructured":"Buss , A. H. and Sanchez , P. J . 2002. Building complex models with LEGOs (listener event graph objects) . Proceedings of the Winter Simulation Conference (IEEE), 732--737 . Buss, A. H. and Sanchez, P. J. 2002. Building complex models with LEGOs (listener event graph objects). Proceedings of the Winter Simulation Conference (IEEE), 732--737."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Buzacott J. A. 1989. Queueing models of kanban and mrp controlled production systems. Engineering Cost and Production Economics 3--20.  Buzacott J. A. 1989. Queueing models of kanban and mrp controlled production systems. Engineering Cost and Production Economics 3--20.","DOI":"10.1016\/0167-188X(89)90050-5"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Buzacott J. A. and Shanthikumar J. G. 1993. Stochastic Models of Manufacturing Systems Prentice Hall New Jersey.  Buzacott J. A. and Shanthikumar J. G. 1993. Stochastic Models of Manufacturing Systems Prentice Hall New Jersey.","DOI":"10.1007\/978-1-4612-2670-3_1"},{"volume-title":"Proceedings of the Winter Simulation Conference (IEEE). 496--502","author":"Chan W. K. V.","key":"e_1_2_1_6_1","unstructured":"Chan , W. K. V. and Schruben , L. W . 2003. Properties of discrete event systems from their mathematical programming representations . Proceedings of the Winter Simulation Conference (IEEE). 496--502 . Chan, W. K. V. and Schruben, L. W. 2003. Properties of discrete event systems from their mathematical programming representations. Proceedings of the Winter Simulation Conference (IEEE). 496--502."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Chan W. K. V. and Schruben L. W. 2007. Optimization models of discrete-event system dynamics. Oper. Res. (to appear).  Chan W. K. V. and Schruben L. W. 2007. Optimization models of discrete-event system dynamics. Oper. Res. (to appear).","DOI":"10.1287\/opre.1080.0559"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.41.5.864"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01158578"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Cheng D. W. and Yao D. D. 1993. Tandem queues with general blocking: a unified model and comparison results. Discrete Event Dyn. Syst. 2 3--4 207--234.  Cheng D. W. and Yao D. D. 1993. Tandem queues with general blocking: a unified model and comparison results. Discrete Event Dyn. Syst. 2 3--4 207--234.","DOI":"10.1007\/BF01797159"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90075-Z"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185776"},{"volume-title":"Tandem Queueing Systems with Blocking","author":"Dattatreya E. S.","key":"e_1_2_1_13_1","unstructured":"Dattatreya , E. S. 1978. Tandem Queueing Systems with Blocking . University of California , Berkeley. Dattatreya, E. S. 1978. Tandem Queueing Systems with Blocking. University of California, Berkeley."},{"key":"e_1_2_1_14_1","unstructured":"Law A. and Kelton W. D. 2000. Simulation Modeling and Analysis McGraw-Hill.   Law A. and Kelton W. D. 2000. Simulation Modeling and Analysis McGraw-Hill."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018980024795"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90030-7"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.12.1648"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.36.12.1548"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.5.807"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.25.2.152"},{"volume-title":"Hideaki","author":"Onvural R. O.","key":"e_1_2_1_21_1","unstructured":"Onvural , R. O. 1990. Closed queueing networks with blocking. Stochastic Analysis of Computer and Communication Systems. Takagi , Hideaki , Elsevier Science Publishers B.V. (North-Holland) , 499--528. Onvural, R. O. 1990. Closed queueing networks with blocking. Stochastic Analysis of Computer and Communication Systems. Takagi, Hideaki, Elsevier Science Publishers B.V. (North-Holland), 499--528."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(89)90036-9"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/21850.253077"},{"key":"e_1_2_1_24_1","unstructured":"Perros H. G. 1990. Approximation algorithms for open queueing networks with blocking. Stochastic Analysis of Computer and Communication Systems. North-Holland 451--498.  Perros H. G. 1990. Approximation algorithms for open queueing networks with blocking. Stochastic Analysis of Computer and Communication Systems. North-Holland 451--498."},{"key":"e_1_2_1_25_1","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo M.","year":"2002","unstructured":"Pinedo , M. 2002 . Scheduling: Theory, Algorithms, and Systems , Prentice Hall , Upper Saddle River, NJ. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Upper Saddle River, NJ."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0053"},{"key":"e_1_2_1_27_1","unstructured":"Schruben D. and Schruben L. W. 2000. Graphical Simulation using SIGMA. Custom Simulation Ithica NY.  Schruben D. and Schruben L. W. 2000. Graphical Simulation using SIGMA. Custom Simulation Ithica NY."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/182.358460"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/510378.510439"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1177\/0037549703255634"},{"key":"e_1_2_1_31_1","unstructured":"Seila A. F. Ceric V. and Tadikamalla P. R. 2003. Applied Simulation Modeling Thomson Brooks\/Cole Belmont.  Seila A. F. Ceric V. and Tadikamalla P. R. 2003. Applied Simulation Modeling Thomson Brooks\/Cole Belmont."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.2.107"},{"volume-title":"An Introduction to Queueing Networks","author":"Walrand J.","key":"e_1_2_1_33_1","unstructured":"Walrand , J. 1988. An Introduction to Queueing Networks , Prentice Hall, Englewood Cliffs , NJ. Walrand, J. 1988. An Introduction to Queueing Networks, Prentice Hall, Englewood Cliffs, NJ."},{"key":"e_1_2_1_34_1","unstructured":"Wu J. H. and Chung C. N. 1991. Timed Finite Automata as the Theoretical Foundation for Simulation Modeling with Event Graphs. Tech. Rep. Dept. of Decision Sciences and Information Systems University of Kentucky Lexington.  Wu J. H. and Chung C. N. 1991. Timed Finite Automata as the Theoretical Foundation for Simulation Modeling with Event Graphs. Tech. Rep. Dept. of Decision Sciences and Information Systems University of Kentucky Lexington."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Yamazaki G. Sakasegawa H. and Kawashima T. 1978. Production rate estimated with flow-shop reversibility. Bull. JSME. 21 167--171.  Yamazaki G. Sakasegawa H. and Kawashima T. 1978. Production rate estimated with flow-shop reversibility. Bull. JSME. 21 167--171.","DOI":"10.1299\/jsme1958.21.167"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.1.78"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.1.137"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456645.1456648","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1456645.1456648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:45Z","timestamp":1750250745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456645.1456648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1145\/1456645.1456648"],"URL":"https:\/\/doi.org\/10.1145\/1456645.1456648","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2008,12]]},"assertion":[{"value":"2007-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}