{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:44:03Z","timestamp":1761709443888,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T00:00:00Z","timestamp":1525046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KN 512\/7-1","KN 512\/7-1"],"award-info":[{"award-number":["KN 512\/7-1","KN 512\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KN 512\/7-1"],"award-info":[{"award-number":["KN 512\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00291-018-0520-8","type":"journal-article","created":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T04:08:24Z","timestamp":1525061304000},"page":"809-829","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Flow shop scheduling with flexible processing times"],"prefix":"10.1007","volume":"40","author":[{"given":"Matthias","family":"Bultmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2647-3645","authenticated-orcid":false,"given":"Stefan","family":"Waldherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,30]]},"reference":[{"issue":"5","key":"520_CR1","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1080\/00207549408956996","volume":"32","author":"A Bolat","year":"1994","unstructured":"Bolat A (1994) Sequencing jobs on an automobile assembly line: objectives and procedures. Int J Prod Res 32(5):1219\u20131236","journal-title":"Int J Prod Res"},{"issue":"12","key":"520_CR2","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1057\/palgrave.jors.2601245","volume":"52","author":"RL Burdett","year":"2001","unstructured":"Burdett RL, Kozan E (2001) Sequencing and scheduling in flowshops with task redistribution. J Oper Res Soc 52(12):1379\u20131389","journal-title":"J Oper Res Soc"},{"key":"520_CR3","volume-title":"Flow shop scheduling: theoretical results, algorithms, and applications","author":"H Emmons","year":"2012","unstructured":"Emmons H, Vairaktarakis G (2012) Flow shop scheduling: theoretical results, algorithms, and applications, vol 182. Springer, New York"},{"issue":"2","key":"520_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"5","key":"520_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655\u2013679","journal-title":"Oper Res"},{"issue":"2","key":"520_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(2):287\u2013326","journal-title":"Ann Discrete Math"},{"key":"520_CR7","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"JND Gupta","year":"2006","unstructured":"Gupta JND, Stafford EF (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169:699\u2013711","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"520_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/B:ANOR.0000030687.72169.c7","volume":"129","author":"JND Gupta","year":"2004","unstructured":"Gupta JND, Koulamas CP, Kyparisis GJ, Potts CN, Strusevich VA (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Ann Oper Res 129(1\u20134):171\u2013185","journal-title":"Ann Oper Res"},{"issue":"3","key":"520_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"key":"520_CR10","unstructured":"Huang K-L (2008) Flow shop scheduling with synchronous and asynchronous transportation times. Ph.D. thesis, The Pennsylvania State University"},{"issue":"6","key":"520_CR11","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1080\/00207548808947920","volume":"26","author":"A Janiak","year":"1988","unstructured":"Janiak A (1988) General flow-shop scheduling with resource constraints. Int J Prod Res 26(6):1089\u20131103","journal-title":"Int J Prod Res"},{"issue":"1","key":"520_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61\u201368","journal-title":"Nav Res Logist Q"},{"key":"520_CR13","unstructured":"Knust S, Shakhlevich NV, Waldherr S, Wei\u00df C (2017) Shop scheduling problems with pliable jobs. Technical report, University of Osnabr\u00fcck"},{"issue":"8","key":"520_CR14","first-page":"709","volume":"31","author":"P Kouvelis","year":"1999","unstructured":"Kouvelis P, Karabati S (1999) Cyclic scheduling in synchronous production lines. IIE Trans 31(8):709\u2013719","journal-title":"IIE Trans"},{"issue":"1","key":"520_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \n                    \n                      \n                    \n                    $$m$$\n                    \n                      \n                        m\n                      \n                    \n                  -machine, \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"key":"520_CR16","unstructured":"N\u00e9ron E, Tercinet F, Eloudou Biloa A (2000) An exact method for a farming problem. In: Informs conference, San Antonio, Texas (USA)"},{"issue":"2","key":"520_CR17","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0377-2217(88)90355-4","volume":"34","author":"E Nowicki","year":"1988","unstructured":"Nowicki E, Zdrza\u0142ka S (1988) A two-machine flow shop scheduling problem with controllable job processing times. Eur J Oper Res 34(2):208\u2013220","journal-title":"Eur J Oper Res"},{"issue":"2","key":"520_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki E, Zdrza\u0142ka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26(2):271\u2013287","journal-title":"Discrete Appl Math"},{"issue":"2","key":"520_CR19","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck H (1984) The three-machine no-wait flow shop is NP-complete. J ACM 31(2):336\u2013345","journal-title":"J ACM"},{"issue":"13","key":"520_CR20","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155(13):1643\u20131666","journal-title":"Discrete Appl Math"},{"issue":"15","key":"520_CR21","doi-asserted-by":"publisher","first-page":"3311","DOI":"10.1080\/00207540600621672","volume":"45","author":"B Soylu","year":"2007","unstructured":"Soylu B, Kirca \u00d6, Azizo\u011flu M (2007) Flow shop-sequencing problem with synchronous transfers and makespan minimization. Int J Prod Res 45(15):3311\u20133331","journal-title":"Int J Prod Res"},{"issue":"2","key":"520_CR22","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"key":"520_CR23","unstructured":"Waldherr S (2015) Scheduling of flow shops with synchronous movement. Ph.D. thesis, Department of Mathematics and Computer Science, University of Osnabr\u00fcck"},{"issue":"1","key":"520_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2014.09.053","volume":"242","author":"S Waldherr","year":"2015","unstructured":"Waldherr S, Knust S (2015) Complexity results for flow shop problems with synchronous movement. Eur J Oper Res 242(1):34\u201344","journal-title":"Eur J Oper Res"},{"key":"520_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45:119\u2013135","journal-title":"Omega"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0520-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0520-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0520-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T08:57:55Z","timestamp":1556614675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0520-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,30]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0520-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2018,4,30]]},"assertion":[{"value":"16 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}