{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T18:01:09Z","timestamp":1786125669253,"version":"3.56.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,28]],"date-time":"2008-10-28T00:00:00Z","timestamp":1225152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10479-008-0443-x","type":"journal-article","created":{"date-parts":[[2008,10,27]],"date-time":"2008-10-27T15:00:50Z","timestamp":1225119650000},"page":"233-249","source":"Crossref","is-referenced-by-count":24,"title":["Near optimal control of queueing networks over a\u00a0finite time horizon"],"prefix":"10.1007","volume":"170","author":[{"given":"Yoni","family":"Nazarathy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gideon","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,28]]},"reference":[{"key":"443_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1017\/S0269964805050102","volume":"19","author":"I. J. B. F. Adan","year":"2005","unstructured":"Adan, I. J. B. F., & Weiss, G. (2005). A two node Jackson network with infinite supply of work. Probability in Engineering and Informational Sciences, 19, 191\u2013212.","journal-title":"Probability in Engineering and Informational Sciences"},{"key":"443_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s11134-006-0065-4","volume":"54","author":"I. J. B. F. Adan","year":"2006","unstructured":"Adan, I. J. B. F., & Weiss, G. (2006). Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Systems Theory and Applications, 54, 169\u2013183.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR3","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1080\/00207728108963831","volume":"12","author":"E. J. Anderson","year":"1981","unstructured":"Anderson, E. J. (1981). A new continuous model for job-shop scheduling. International Journal Systems Science, 12, 1469\u20131475.","journal-title":"International Journal Systems Science"},{"key":"443_CR4","volume-title":"Linear programming in infinite dimensional spaces","author":"E. J. Anderson","year":"1987","unstructured":"Anderson, E. J., & Nash, P. (1987). Linear programming in infinite dimensional spaces. Chichester: Wiley-Interscience."},{"key":"443_CR5","series-title":"IMA volumes in mathematics and its applications","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-1-4757-2418-9_11","volume-title":"Stochastic networks","author":"F. Avram","year":"1995","unstructured":"Avram, F., Bertsimas, D., & Ricard, M. (1995). Fluid models of sequencing problems in open queueing networks: an optimal control approach. In F. P. Kelly & R. Williams (Eds.), IMA volumes in mathematics and its applications: Vol. 71. Stochastic networks (pp. 199\u2013234). New York: Springer."},{"key":"443_CR6","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1073\/pnas.39.9.947","volume":"39","author":"R. Bellman","year":"1953","unstructured":"Bellman, R. (1953). Bottleneck problems and dynamic programming. Proceedings National Academy of Science, 39, 947\u2013951.","journal-title":"Proceedings National Academy of Science"},{"key":"443_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1019160803783","volume":"30","author":"M. Bramson","year":"1998","unstructured":"Bramson, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems Theory and Applications, 30, 89\u2013148.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR8","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1287\/opre.41.6.1104","volume":"41","author":"H. Chen","year":"1993","unstructured":"Chen, H., & Yao, D. (1993). Dynamic scheduling of a multi class fluid network. Operations Research, 41, 1104\u20131115.","journal-title":"Operations Research"},{"key":"443_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1025130105303","volume":"44","author":"M. Chen","year":"2003","unstructured":"Chen, M., Pandit, C., & Meyn, S. P. (2003). In search of sensitivity in network optimization. Queueing Systems Theory and Applications, 44, 313\u2013363.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1019182903300","volume":"32","author":"R. R. Chen","year":"1999","unstructured":"Chen, R. R., & Meyn, S. P. (1999). Value iteration and optimization of multiclass queueing networks. Queueing Systems Theory and Applications, 32, 65\u201397.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/70.282534","volume":"10","author":"D. Connors","year":"1994","unstructured":"Connors, D., Feigin, G., & Yao, D. (1994). Scheduling semiconductor lines using a fluid network model. IEEE Transactions on Robotics and Automation, 10, 88\u201398.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"443_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1214\/aoap\/1177004828","volume":"5","author":"J. G. Dai","year":"1995","unstructured":"Dai, J. G. (1995). On positive Harris recurrence of multi-class queueing networks: a unified approach via fluid limit models. Annals of Applied Probability, 5, 49\u201377.","journal-title":"Annals of Applied Probability"},{"key":"443_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/opre.1040.0170","volume":"53","author":"J. G. Dai","year":"2005","unstructured":"Dai, J. G., & Lin, W. (2005). Maximum pressure policies in stochastic processing networks. Operations Research, 53, 197\u2013218.","journal-title":"Operations Research"},{"key":"443_CR14","unstructured":"Dai, J. G., & Lin, W. (2006). Asymptotic optimality of maximum pressure policies in stochastic processing networks. Annals of Applied Probability (submitted)."},{"key":"443_CR15","unstructured":"Fleischer, L., & Sethuraman, J. (2003). Approximately optimal control of fluid networks. IBM Research Report"},{"key":"443_CR16","unstructured":"Goemans, M. X., & Williamson, D. P. (1996). The primal dual method for approximation algorithms and its application to network design problems. In D. Hochbaum (Ed.) Approximation algorithms (pp.\u00a0144\u2013191)."},{"key":"443_CR17","volume-title":"Proceedings of the IMA workshop on stochastic differential systems","author":"J. M. Harrison","year":"1988","unstructured":"Harrison, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations. In W. Fleming & P. L. Lions (Eds.), Proceedings of the IMA workshop on stochastic differential systems. Berlin: Springer."},{"key":"443_CR18","series-title":"Royal statistical society lecture note series","first-page":"147","volume-title":"Stochastic networks: theory and applications","author":"J. M. Harrison","year":"1996","unstructured":"Harrison, J. M. (1996). The BIGSTEP approach to flow management in stochastic processing networks. In F.\u00a0P. Kelly, S. Zachary, & I. Ziedins (Eds.), Royal statistical society lecture note series: Vol. 4. Stochastic networks: theory and applications (pp. 147\u2013186). Oxford: Oxford University Press."},{"key":"443_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1214\/aoap\/1019737665","volume":"10","author":"J. M. Harrison","year":"2000","unstructured":"Harrison, J. M. (2000). Brownian models of open processing networks: canonical representation of workload. Annals of Applied Probability, 10, 75\u2013103.","journal-title":"Annals of Applied Probability"},{"key":"443_CR20","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1214\/aoap\/1060202837","volume":"13","author":"J. M. Harrison","year":"2001","unstructured":"Harrison, J. M. (2001). A broader view of Brownian networks. Annals of Applied Probability, 13, 1119\u20131150.","journal-title":"Annals of Applied Probability"},{"key":"443_CR21","volume-title":"Analytic methods in applied probability, In memory of Fridrik Karpelevich","author":"J. M. Harrison","year":"2002","unstructured":"Harrison, J. M. (2002). Stochastic networks and activity analysis. In Y. Suhov (Ed.), Analytic methods in applied probability, In memory of Fridrik Karpelevich. Providence: American Mathematical Society."},{"key":"443_CR22","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1214\/aoap\/1034801252","volume":"7","author":"J. M. Harrison","year":"1997","unstructured":"Harrison, J. M., & Van Mieghem, J. (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Annals of Applied Probability, 7, 747\u2013771.","journal-title":"Annals of Applied Probability"},{"key":"443_CR23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01158929","volume":"13","author":"F. P. Kelly","year":"1993","unstructured":"Kelly, F. P., & Laws, C. N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems Theory and Applications, 13, 47\u201386.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR24","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0167-6377(02)00149-9","volume":"30","author":"A. Kopzon","year":"2002","unstructured":"Kopzon, A., & Weiss, G. (2002). A push pull queueing system. Operations Research Letters, 30, 351\u2013359.","journal-title":"Operations Research Letters"},{"key":"443_CR25","unstructured":"Kopzon, A., & Weiss, G. (2007). A push pull system with infinite supply of work. Preprint."},{"key":"443_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0005-2","volume-title":"Heavy traffic analysis of controlled queueing and communication networks","author":"H. J. Kushner","year":"2001","unstructured":"Kushner, H. J. (2001). Heavy traffic analysis of controlled queueing and communication networks. Berlin: Springer."},{"key":"443_CR27","series-title":"Handbooks in operations research and management science","volume-title":"Logistics of production and inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling, algorithms and complexity. In S. C. Graves & A. H. G. Rinnooy (Eds.), Handbooks in operations research and management science: Vol. 4. Logistics of production and inventory. Amsterdam: North Holland."},{"key":"443_CR28","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1019106213778","volume":"31","author":"C. Maglaras","year":"1999","unstructured":"Maglaras, C. (1999). Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies. Queueing Systems Theory and Applications, 31, 171\u2013206.","journal-title":"Queueing Systems Theory and Applications"},{"key":"443_CR29","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1214\/aoap\/1019487513","volume":"10","author":"C. Maglaras","year":"2000","unstructured":"Maglaras, C. (2000). Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Annals of Applied Probability, 10, 897\u2013929.","journal-title":"Annals of Applied Probability"},{"key":"443_CR30","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1137\/S0363012999362724","volume":"40","author":"S. P. Meyn","year":"2001","unstructured":"Meyn, S. P. (2001). Sequencing and routing in multiclass queueing networks. Part I: Feedback regulation. SIAM Journal Control and Optimization, 40, 741\u2013776. IEEE international symposium on information theory. Sorrento, Italy, June 25 \u2013 June 30 2000.","journal-title":"SIAM Journal Control and Optimization"},{"key":"443_CR31","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/S036301290138376X","volume":"42","author":"S. P. Meyn","year":"2003","unstructured":"Meyn, S. P. (2003). Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations. SIAM Journal Control and Optimization, 42, 178\u2013217.","journal-title":"SIAM Journal Control and Optimization"},{"key":"443_CR32","doi-asserted-by":"crossref","unstructured":"Shah, S., & Nahrstedt, K. (2002). Predictive location-based QoS routing in mobile ad hoc networks. In Proceedings of IEEE international conference on communications.","DOI":"10.1109\/ICC.2002.997009"},{"key":"443_CR33","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1137\/0331073","volume":"31","author":"M. C. Pullan","year":"1993","unstructured":"Pullan, M. C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal Control and Optimization, 31, 1558\u20131577.","journal-title":"SIAM Journal Control and Optimization"},{"issue":"1","key":"443_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/1075828046","volume":"14","author":"A. L. Stolyar","year":"2004","unstructured":"Stolyar, A. L. (2004). MaxWeight scheduling in a generalized switch: State space collapse and equivalent workload minimization under complete resource pooling. Annals of Applied Probability, 14(1), 1\u201353.","journal-title":"Annals of Applied Probability"},{"key":"443_CR35","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/9.341781","volume":"40","author":"L. Tassiulas","year":"1995","unstructured":"Tassiulas, L. (1995). Adaptive back-pressure congestion control based on local information. IEEE Transactions on Automatic Control, 40, 236 \u00d0-250.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"443_CR36","doi-asserted-by":"crossref","first-page":"S312","DOI":"10.1287\/opre.40.3.S312","volume":"40","author":"L. M. Wein","year":"1992","unstructured":"Wein, L. M. (1992). Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs. Operations Research, 40, S312\u2013S334.","journal-title":"Operations Research"},{"key":"443_CR37","unstructured":"Weiss, G. (1999). Scheduling and control of manufacturing systems\u2014a fluid approach. In Proceedings of the 37 Allerton conference, Monticello, Illinois 21\u201324, September 1999, (pp.\u00a0577\u2013586)."},{"key":"443_CR38","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1239\/jap\/1127322036","volume":"42","author":"G. Weiss","year":"2005","unstructured":"Weiss, G. (2005). Jackson networks with unlimited supply of work. Journal of Applied Probability, 42, 879\u2013882.","journal-title":"Journal of Applied Probability"},{"key":"443_CR39","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10107-008-0217-x","volume":"115","author":"G. Weiss","year":"2008","unstructured":"Weiss, G. (2008). A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming, 115, 151\u2013198.","journal-title":"Mathematical Programming"},{"key":"443_CR40","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1019108819713","volume":"30","author":"R. J. Williams","year":"1998","unstructured":"Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems Theory and Applications, 30, 27\u201388.","journal-title":"Queueing Systems Theory and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0443-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0443-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0443-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:50Z","timestamp":1559138870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0443-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,28]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["443"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0443-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,28]]}}}