{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:40:20Z","timestamp":1648762820279},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T00:00:00Z","timestamp":1435795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10951-015-0439-8","type":"journal-article","created":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T10:19:54Z","timestamp":1435745994000},"page":"513-524","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal control of a two-server flow-shop network"],"prefix":"10.1007","volume":"18","author":[{"given":"Yossef","family":"Luzon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yariv","family":"Marmor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Khmelnitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,2]]},"reference":[{"key":"439_CR1","volume-title":"Optimal control","author":"M Athans","year":"1966","unstructured":"Athans, M., & Falb, P. (1966). Optimal control. New York: McGraw-Hill."},{"key":"439_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-1-4757-2418-9_11","volume-title":"Stochastic networks. Proceedings of the International Mathematics Association","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. J. Williams (Eds.), Stochastic networks. Proceedings of the International Mathematics Association (Vol. 71, pp. 199\u2013234). New York: Springer."},{"key":"439_CR3","doi-asserted-by":"crossref","unstructured":"Bai, D., Huo, M., & Tang, L. (2008). A new lower bound for flow shop makespan with release dates. In IEEE International Conference on Service Operations and Logistics, and Informatics IEEE Xplore, Vol. 1 (pp. 276\u2013280).","DOI":"10.1109\/SOLI.2008.4686405"},{"issue":"3","key":"439_CR4","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operations Research, 168(3), 694\u2013715.","journal-title":"European Journal of Operations Research"},{"key":"439_CR5","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D. P. (1995). Dynamic programming and optimal control (Vol. 1). Belmont, MA: Athena Scientific."},{"key":"439_CR6","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jagm.1999.1047","volume":"33","author":"D Bertsimas","year":"1999","unstructured":"Bertsimas, D., & Gamarnik, D. (1999). Asymptotically optimal algorithm for job shop scheduling and packet routing. Journal of Algorithms, 33, 296\u2013318.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"439_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s101070100272","volume":"92","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas, D., & Sethuraman, J. (2002). From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective. Mathematical Programming, 92(1), 61\u2013102.","journal-title":"Mathematical Programming"},{"issue":"11","key":"439_CR8","doi-asserted-by":"crossref","first-page":"1618","DOI":"10.1109\/9.543999","volume":"41","author":"D Bertsimas","year":"1996","unstructured":"Bertsimas, D., Gamarnik, D., & Tsitsiklis, N. (1996). Stability conditions for multiclass fluid queueing networks. IEEE Transactions on Automatic Control, 41(11), 1618\u20131631.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"439_CR9","volume-title":"Applied optimal control","author":"AE Bryson","year":"1975","unstructured":"Bryson, A. E., & Ho, Y. C. (1975). Applied optimal control. New York: Hemisphere Publishing."},{"issue":"6","key":"439_CR10","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. D. (1993). Dynamic scheduling of a multiclass fluid network. Operations Research, 41(6), 1104\u20131115.","journal-title":"Operations Research"},{"key":"439_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow shop scheduling: Theoretical results, algorithms and appllications. International Series in Operations Research and Management Science","author":"H Emmons","year":"2013","unstructured":"Emmons, H., & Vairaktarakis, G. (2013). Flow shop scheduling: Theoretical results, algorithms and appllications. International Series in Operations Research and Management Science (Vol. 182). New Yok: Springer."},{"key":"439_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0120028","volume":"20","author":"R Haji","year":"1971","unstructured":"Haji, R., & Newell, G. (1971). Optimal strategies for priority queues with nonlinear costs of delay. SIAM Journal on Applied Mathematics, 20, 224\u2013240.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"439_CR13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/moor.19.1.68","volume":"19","author":"LA Hall","year":"1994","unstructured":"Hall, L. A. (1994). A polynomial time approximation scheme for a constrained flow-shop scheduling problem. Mathematics of Operation Research, 19, 68\u201385.","journal-title":"Mathematics of Operation Research"},{"key":"439_CR14","first-page":"175","volume":"82","author":"LA Hall","year":"1998","unstructured":"Hall, L. A. (1998). Approximability of flow shop scheduling. Mathematical Programming, 82, 175\u2013190.","journal-title":"Mathematical Programming"},{"key":"439_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201367.","journal-title":"Naval Research Logistics Quarterly"},{"key":"439_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-6377(01)00099-2","volume":"29","author":"P Kaminsky","year":"2001","unstructured":"Kaminsky, P., & Simchi-Levi, M. (2001). Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates. Operations Research Letters, 29, 141\u2013148.","journal-title":"Operations Research Letters"},{"issue":"1","key":"439_CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(00)00374-7","volume":"114","author":"KN Kashyrskikh","year":"2001","unstructured":"Kashyrskikh, K. N., Potts, C., & Sevastianov, S. (2001). A 3\/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. Discrete Applied Mathematics, 114(1), 255\u2013271.","journal-title":"Discrete Applied Mathematics"},{"key":"439_CR18","unstructured":"Kebarighotbi, A., & Cassandras, CG. (2009). Revisiting the optimality of the $$c\\mu $$ c \u03bc -rule with stochastic flow models. In Proceedings of the 48th IEEE Conference on Decision and Control, held jointly with the 28th Chinese Control Conference (CDC\/CCC) (pp. 2304\u20132309). Shanghai: IEEE."},{"key":"439_CR19","first-page":"343","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Operations Research, 1, 343\u2013362.","journal-title":"Annals of Operations Research"},{"key":"439_CR20","first-page":"177210","volume":"37","author":"X Luo","year":"1999","unstructured":"Luo, X., & Bertsimas, D. (1999). A new algorithm for state-constrained separated continuous linear programs. SIAM Journal on Control and Optimization, 37, 177210.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"439_CR21","unstructured":"Luzon, Y. (2010). Fluid based resource allocation and appointment scheduling system and method PPA No. 61\/089,120 App No US13\/958,743, EP09168021.5, IL200425."},{"key":"439_CR22","doi-asserted-by":"crossref","unstructured":"Luzon, Y., Penn, M., & Mandelbaum, A. (2009). Scheduling appointments via fluids control. In International Conference on Model-Based Systems Engineering (MBSE \u201909) (pp. 29\u201335). Israel: IEEE.","DOI":"10.1109\/MBSE.2009.5031717"},{"key":"439_CR23","unstructured":"Luzon, Y., Marmor, Y., & Khmelnitsky, E. (2012). An optimal control policy for a tandem queueing network. In 12th Viennese Workshop Optimal Control, Dynamic Games and Nonlinear Dynamics, ORCOS, Institute of Mathematical Methods in Economics, Vienna University of Technology, Vienna, Austria."},{"key":"439_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2834-7","volume-title":"Optimal flow control in manufacturing systems: Production planning and scheduling","author":"O Maimon","year":"1998","unstructured":"Maimon, O., Khmelnitsky, E., & Kogan, K. (1998). Optimal flow control in manufacturing systems: Production planning and scheduling. Dordrecht: Kluwer Academic Publishers."},{"key":"439_CR25","volume-title":"Control techniques for complex networks","author":"SP Meyn","year":"2008","unstructured":"Meyn, S. P. (2008). Control techniques for complex networks. New York: Cambridge University Press."},{"key":"439_CR26","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1214\/aoap\/1177004706","volume":"5","author":"JAV Mieghem","year":"1995","unstructured":"Mieghem, J. A. V. (1995). Dynamic scheduling with convex delay costs: The generalized $$c\\mu $$ c \u03bc rule. Annals of Applied Probability, 5, 809\u2013833.","journal-title":"Annals of Applied Probability"},{"issue":"6","key":"439_CR27","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J. W., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583\u2013599.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"439_CR28","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10951-010-0174-0","volume":"13","author":"Y Nazarathy","year":"2010","unstructured":"Nazarathy, Y., & Weiss, G. (2010). A fluid approach to large volume job shop scheduling. Journal of Scheduling, 13(5), 509\u2013529.","journal-title":"Journal of Scheduling"},{"key":"439_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-0910-7","volume-title":"Planning and scheduling in manufacturing and services. Springer series in operations research","author":"M Pinedo","year":"2009","unstructured":"Pinedo, M. (2009). Planning and scheduling in manufacturing and services. Springer series in operations research (2nd ed.). New York: Springer.","edition":"2"},{"key":"439_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M. (2012). Scheduling: Theory, algorithms and systems (4th ed.). New York: Springer.","edition":"4"},{"key":"439_CR31","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.10.4.576","volume":"10","author":"CN Potts","year":"1985","unstructured":"Potts, C. N. (1985). Analysis of heuristics for two-machine flow-shop sequencing subject to release dates. Mathematics of Operation Research, 10, 576\u2013584.","journal-title":"Mathematics of Operation Research"},{"key":"439_CR32","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1137\/0331073","volume":"31","author":"MC Pullan","year":"1993","unstructured":"Pullan, M. C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal on Control and Optimization, 31, 1558\u20131577.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"439_CR33","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1137\/S0363012992227216","volume":"32","author":"MC Pullan","year":"1994","unstructured":"Pullan, M. C. (1994). On the solution of a class of continuous linear programs. SIAM Journal on Control and Optimization, 32, 1289\u20131296.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"6","key":"439_CR34","doi-asserted-by":"crossref","first-page":"1952","DOI":"10.1137\/S0363012993247858","volume":"33","author":"MC Pullan","year":"1995","unstructured":"Pullan, M. C. (1995). Form of optimal solutions for separated continuous linear programs. SIAM Journal on Control and Optimization, 33(6), 1952\u20131977.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"439_CR35","volume-title":"Optimal control theory: Applications to management science and economics","author":"S Sethi","year":"2000","unstructured":"Sethi, S., & Thompson, G. (2000). Optimal control theory: Applications to management science and economics (2nd ed.). Boston: Kluwer Academic Publishers.","edition":"2"},{"issue":"1\u20132","key":"439_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"439_CR37","first-page":"93","volume":"47","author":"PP Talwar","year":"1967","unstructured":"Talwar, P. P. (1967). A note on sequencing problems with uncertain job times. Journal of the Operations Research Society of Japan, 47, 93\u201397.","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"5","key":"439_CR38","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7(5), 333\u2013348.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0439-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0439-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0439-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:51Z","timestamp":1559468391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0439-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,2]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["439"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0439-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,2]]}}}