{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T05:49:17Z","timestamp":1778737757065,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027372722187","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"291-318","source":"Crossref","is-referenced-by-count":25,"title":["The Flow Shop Scheduling Polyhedron with Setup Times"],"prefix":"10.1007","volume":"7","author":[{"given":"Roger Z.","family":"R\u00edos-Mercado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan F.","family":"Bard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5149234_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan, \u201cAreviewof scheduling research involving setup considerations,\u201d Omega, vol. 27, no. 2, pp. 219-239, 1999.","journal-title":"Omega"},{"key":"5149234_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BFb0121051","volume":"24","author":"E. Balas","year":"1985","unstructured":"E. Balas, \u201cOn the facial structure of scheduling polyhedra,\u201d Mathematical Programming Study, vol. 24, pp. 179-218, 1985.","journal-title":"Mathematical Programming Study"},{"issue":"4","key":"5149234_CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"E. Balas, \u201cThe asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph,\u201d SIAM Journal on Discrete Mathematics, vol. 2, no. 4, pp. 425-451, 1989.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"5149234_CR4","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1287\/moor.17.4.1001","volume":"17","author":"E. Balas","year":"1992","unstructured":"E. Balas and M. Fischetti, \u201cThe fixed-outdegree 1-arborescence polytope,\u201d Mathematics of Operations Research, vol. 17, no. 4, pp. 1001-1018, 1992.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"5149234_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti, \u201cA lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets,\u201d Mathematical Programming, vol. 58, no. 3, pp. 325-352, 1993.","journal-title":"Mathematical Programming"},{"issue":"3","key":"5149234_CR6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/nav.3800210311","volume":"21","author":"B.D. Corwin","year":"1974","unstructured":"B.D. Corwin and A.O. Esogbue, \u201cTwo machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach,\u201d Naval Research Logistics Quarterly, vol. 21, no. 3, pp. 515-524, 1974.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5149234_CR7","unstructured":"CPLEX Optimization, Inc., Incline Village, NV. Using the CPLEX Callable Library, Version 4.0, 1995."},{"key":"5149234_CR8","volume-title":"The Art and Theory of Dynamic Programming","author":"S.E. Dreyfus","year":"1977","unstructured":"S.E. Dreyfus and A.M. Law, The Art and Theory of Dynamic Programming, Academic Press, Orlando, 1977."},{"issue":"1","key":"5149234_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","volume":"16","author":"M. Fischetti","year":"1991","unstructured":"M. Fischetti, \u201cFacets of the asymmetric traveling salesman polytope,\u201d Mathematics of Operations Research, vol. 16, no. 1, pp. 42-56, 1991.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"5149234_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0165-4896(92)90038-7","volume":"23","author":"P.C. Fishburn","year":"1992","unstructured":"P.C. Fishburn, \u201cInduced binary probabilities and the linear ordering polytope: A status report.\u201d Mathematical Social Sciences, vol. 23, no. 1, pp. 67-80, 1992.","journal-title":"Mathematical Social Sciences"},{"key":"5149234_CR11","first-page":"251","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"N. Gr\u00f6tschell","year":"1985","unstructured":"N. Gr\u00f6tschell and M.W. Padberg, \u201cPolyhedral theory,\u201d in E.L. Lawler, J.K. Lenstra, A.H. G. Rinnoy Kan, and D.B. Shmoys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester, pp. 251-305, 1985."},{"issue":"3","key":"5149234_CR12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","volume":"24","author":"J.N.D. Gupta","year":"1986","unstructured":"J.N.D. Gupta and W.P. Darrow, \u201cThe two-machine sequence dependent flowshop scheduling problem,\u201d European Journal of Operational Research, vol. 24, no. 3, pp. 439-446, 1986.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5149234_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1080\/00207548208947793","volume":"20","author":"S.K. Gupta","year":"1982","unstructured":"S.K. Gupta, \u201cn jobs and m machines job-shop problems with sequence-dependent set-up times,\u201d International Journal of Production Research, vol. 20, no. 5, pp. 643-656, 1982.","journal-title":"International Journal of Production Research"},{"key":"5149234_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"G.L. Nemhauser, M.W.P. Savelsbergh, and G.C. Sigismondi, \u201cMINTO, a Mixed INTeger Optimizer,\u201d Operations Research Letters, vol. 15, pp. 48-59, 1994.","journal-title":"Operations Research Letters"},{"key":"5149234_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988."},{"key":"5149234_CR16","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1995."},{"key":"5149234_CR17","volume-title":"Polyhedral approaches to machine scheduling","author":"M. Queyranne","year":"1994","unstructured":"M. Queyranne and A.S. Schulz, \u201cPolyhedral approaches to machine scheduling,\u201d Preprint 408\/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1994. Available at ftp:\/\/ftp.math.tuberlin. de\/pub\/Preprints\/combi\/Report-408-1994.ps.Z."},{"issue":"4","key":"5149234_CR18","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1287\/moor.20.4.838","volume":"20","author":"M. Queyranne","year":"1995","unstructured":"M. Queyranne and Y. Wang, \u201cSymmetric inequalities and their composition for asymmetric travelling salesman polytopes,\u201d Mathematics of Operations Research, vol. 20, no. 4, pp. 838-863, 1995.","journal-title":"Mathematics of Operations Research"},{"key":"5149234_CR19","volume-title":"Optimization of the flowshop scheduling problem with setup times","author":"R.Z. R\u00edos-Mercado","year":"1997","unstructured":"R.Z. R\u00edos-Mercado, \u201cOptimization of the flowshop scheduling problem with setup times,\u201d PhD thesis, University of Texas, Austin, August 1997."},{"issue":"1","key":"5149234_CR20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0377-2217(97)00213-0","volume":"110","author":"R.Z. R\u00edos-Mercado","year":"1998","unstructured":"R.Z. R\u00edos-Mercado and J.F. Bard, \u201cHeuristics for the flow line problem with setup costs,\u201d European Journal of Operational Research, vol. 110, no. 1, pp. 76-98, 1998.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"5149234_CR21","first-page":"721","volume":"31","author":"R.Z. R\u00edos-Mercado","year":"1999","unstructured":"R.Z. R\u00edos-Mercado and J.F. Bard, \u201cA branch-and-bound algorithm for permutation flow shops with sequencedependent setup times,\u201d IIE Transactions, vol. 31, no. 8, pp. 721-731, 1999.","journal-title":"IIE Transactions"},{"issue":"1","key":"5149234_CR22","first-page":"57","volume":"5","author":"R.Z. R\u00edos-Mercado","year":"1999","unstructured":"R.Z. R\u00edos-Mercado and J.F. Bard, \u201cAn enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times,\u201d Journal of Heuristics, vol. 5, no. 1, pp. 57-74, 1999.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"5149234_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0305-0483(92)90075-I","volume":"20","author":"J.V. Simons Jr.","year":"1992","unstructured":"J.V. Simons Jr., \u201cHeuristics in flow shop scheduling with sequence dependent setup times,\u201d Omega, vol. 20, no. 2, pp. 215-225, 1992.","journal-title":"Omega"},{"issue":"6","key":"5149234_CR24","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","volume":"24","author":"B.N. Srikar","year":"1986","unstructured":"B.N. Srikar and S. Ghosh, \u201cA MILP model for the n-job, m-stage flowshop with sequence dependent set-up times,\u201d International Journal of Production Research, vol. 24, no. 6, pp. 1459-1474, 1986.","journal-title":"International Journal of Production Research"},{"issue":"10","key":"5149234_CR25","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1080\/00207549008942836","volume":"28","author":"E.F. Stafford","year":"1990","unstructured":"E.F. Stafford and F.T. Tseng, \u201cOn the Srikar-Ghosh MILP model for the N \u00d7 M SDST flowshop problem,\u201d International Journal of Production Research, vol. 28, no. 10, pp. 1817-1830, 1990.","journal-title":"International Journal of Production Research"},{"issue":"5","key":"5149234_CR26","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1002\/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B","volume":"34","author":"W. Szwarc","year":"1987","unstructured":"W. Szwarc and J.N.D. Gupta, \u201cA flow-shop with sequence-dependent additive setup times,\u201d Naval Research Logistics, vol. 34, no. 5, pp. 619-627, 1987.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027372722187.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027372722187\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027372722187.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:43:46Z","timestamp":1751283826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027372722187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149234"],"URL":"https:\/\/doi.org\/10.1023\/a:1027372722187","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}