{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:25:37Z","timestamp":1759667137591,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19754-3_14","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:22:38Z","timestamp":1301289758000},"page":"127-138","source":"Crossref","is-referenced-by-count":6,"title":["MIP Formulations for Flowshop Scheduling with Limited Buffers"],"prefix":"10.1007","author":[{"given":"Janick V.","family":"Frasch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven Oliver","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)","edition":"5"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C.H. Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM\u00a027, 533\u2013549 (1980)","journal-title":"Journal of the ACM"},{"key":"14_CR3","unstructured":"Frasch, J.: Algorithms and Complexity for Steel Production Scheduling. Master\u2019s thesis, Technical University of Kaiserslautern (2009)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-61310-2_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"H. Hoogeveen","year":"1996","unstructured":"Hoogeveen, H., Kawaguchi, T.: Minimizing total completion time in a two-machine flowshop: Analysis of special cases. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 374\u2013388. Springer, Heidelberg (1996)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"H.M. Wagner","year":"1959","unstructured":"Wagner, H.M.: An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly\u00a06(2), 131\u2013140 (1959)","journal-title":"Naval Research Logistics Quarterly"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1989.58","volume":"40","author":"J.M. Wilson","year":"1989","unstructured":"Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. Journal of the Operational Research Society\u00a040, 395\u2013399 (1989)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"A.S. Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Operations Research\u00a08(2), 219\u2013223 (1960)","journal-title":"Operations Research"},{"key":"14_CR8","first-page":"33","volume":"85","author":"C.H. Pan","year":"1995","unstructured":"Pan, C.H.: A study of integer programming formulations for scheduling problems. International Journal of Systems Science\u00a085, 33\u201341 (1995)","journal-title":"International Journal of Systems Science"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/0377-2217(94)00029-C","volume":"28","author":"Y.D. Kim","year":"1995","unstructured":"Kim, Y.D.: Minimizing total tardiness in permutation flowshops. European Journal of Operational Research\u00a028, 541\u2013555 (1995)","journal-title":"European Journal of Operational Research"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1057\/jors.1988.193","volume":"39","author":"E.F. Stafford","year":"1988","unstructured":"Stafford, E.F.: On the development of a mixed-integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society\u00a039, 1163\u20131174 (1988)","journal-title":"Journal of the Operational Research Society"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1057\/palgrave.jors.2601805","volume":"56","author":"E.F. Stafford","year":"2005","unstructured":"Stafford, E.F., Tseng, F.T., Gupta, J.N.D.: Comparative evaluation of milp flowshop models. Journal of the Operational Research Society\u00a056, 88\u2013101 (2005)","journal-title":"Journal of the Operational Research Society"},{"key":"14_CR12","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"M. Pinedo","year":"2006","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms and Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2006)","edition":"2"},{"key":"14_CR13","unstructured":"H\u00f6hn, W.: Flowshop-Scheduling in der Stahlindustrie. Master\u2019s Thesis, Technical University of Berlin (2007)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0895-7177(00)00110-2","volume":"31","author":"T. Sawik","year":"2000","unstructured":"Sawik, T.: Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling\u00a031, 39\u201352 (2000)","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T10:02:18Z","timestamp":1558519338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}