{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:11:28Z","timestamp":1761808288445,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T00:00:00Z","timestamp":1554163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["KN 512\/7-1"],"award-info":[{"award-number":["KN 512\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100015072","name":"TUM Institute for Advanced Study","doi-asserted-by":"crossref","award":["Hans Fischer Senior Fellowship"],"award-info":[{"award-number":["Hans Fischer Senior Fellowship"]}],"id":[{"id":"10.13039\/501100015072","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K041274\/1"],"award-info":[{"award-number":["EP\/K041274\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10951-019-00607-9","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T06:40:23Z","timestamp":1554187223000},"page":"635-661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Shop scheduling problems with pliable jobs"],"prefix":"10.1007","volume":"22","author":[{"given":"S.","family":"Knust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5225-4008","authenticated-orcid":false,"given":"N. V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Waldherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Wei\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"key":"607_CR1","doi-asserted-by":"publisher","first-page":"4043","DOI":"10.1080\/00207540600707372","volume":"44","author":"R Anuar","year":"2006","unstructured":"Anuar, R., & Bukchin, Y. (2006). Design and operation of dynamic assembly lines using work-sharing. International Journal of Production Research, 44, 4043\u20134065.","journal-title":"International Journal of Production Research"},{"key":"607_CR2","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ejor.2004.07.033","volume":"168","author":"RG Askin","year":"2006","unstructured":"Askin, R. G., & Chen, J. (2006). Dynamic task assignment for throughput maximization with worksharing. European Journal of Operational Research, 168, 853\u2013869.","journal-title":"European Journal of Operational Research"},{"key":"607_CR3","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., & Zemel, E. (1980). An algorithm for large zero-one knapsack problems. Operations Research, 28, 1130\u20131154.","journal-title":"Operations Research"},{"key":"607_CR4","unstructured":"Baptiste, P. (2000). Preemptive scheduling of identical machines. UTC research report 2000\/314, Univ. de Tech. de Compi\u00e8gne, F-60200 Compi\u00e8gne, France."},{"key":"607_CR5","unstructured":"Baranski, T. (2011). Task scheduling with restricted preemptions. In Proceedings of the federated conference on computer science and information systems (pp. 231\u2013238)."},{"key":"607_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10878-005-1414-7","volume":"9","author":"N Brauner","year":"2005","unstructured":"Brauner, N., Crama, Y., Grigoriev, A., & van de Klundert, J. (2005). A framework for the complexity of high-multiplicity scheduling problems. Journal of Combinatorial Optimization, 9, 313\u2013323.","journal-title":"Journal of Combinatorial Optimization"},{"key":"607_CR7","unstructured":"Bruno, J., & Gonzalez, T. (1976). Scheduling independent tasks with release dates and due dates on parallel machines. Technical Report 213, Pennsylvania State University."},{"key":"607_CR8","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Heidelberg: Springer.","edition":"5"},{"key":"607_CR9","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s00291-018-0520-8","volume":"40","author":"M Bultmann","year":"2018","unstructured":"Bultmann, M., Knust, S., & Waldherr, S. (2018). Flow shop scheduling with flexible processing times. OR Spectrum, 40, 809\u2013829.","journal-title":"OR Spectrum"},{"key":"607_CR10","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2018.04.024","volume":"270","author":"M Bultmann","year":"2018","unstructured":"Bultmann, M., Knust, S., & Waldherr, S. (2018). Synchronous flow shop scheduling with pliable jobs. European Journal of Operational Research, 270, 943\u2013956.","journal-title":"European Journal of Operational Research"},{"key":"607_CR11","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1057\/palgrave.jors.2601245","volume":"52","author":"RL Burdett","year":"2001","unstructured":"Burdett, R. L., & Kozan, E. (2001). Sequencing and scheduling in flowshops with task redistribution. Journal of the Operational Research Society, 52, 1379\u20131389.","journal-title":"Journal of the Operational Research Society"},{"key":"607_CR12","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1080\/00207540412331325396","volume":"43","author":"JH Chang","year":"2005","unstructured":"Chang, J. H., & Chiu, H. N. (2005). A comprehensive review of lot streaming. International Journal of Production Research, 43, 1515\u20131536.","journal-title":"International Journal of Production Research"},{"key":"607_CR13","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling (p. 1967). Reading, MA: Addison-Welsey."},{"key":"607_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10951-008-0096-2","volume":"13","author":"Y Crama","year":"2010","unstructured":"Crama, Y., & Gultekin, H. (2010). Throughput optimization in two-machine flowshops with flexible operations. Journal of Scheduling, 13, 227\u2013243.","journal-title":"Journal of Scheduling"},{"key":"607_CR15","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-56891-3_37","volume":"694","author":"K Ecker","year":"1993","unstructured":"Ecker, K., & Hirschberg, R. (1993). Task scheduling with restricted preemptions. Lecture Notes in Computer Science, 694, 464\u2013475.","journal-title":"Lecture Notes in Computer Science"},{"key":"607_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and job shop scheduling. Mathematics of Operations Research, 1, 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"607_CR17","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23, 665\u2013679.","journal-title":"Journal of the ACM"},{"key":"607_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, J. N. D., Koulamas, C. P., Kyparisis, G. J., Potts, C. N., & Strusevich, V. A. (2004). Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Annals of Operations Research, 129, 171\u2013185.","DOI":"10.1023\/B:ANOR.0000030687.72169.c7"},{"key":"607_CR19","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ijpe.2012.07.011","volume":"140","author":"H Gultekin","year":"2012","unstructured":"Gultekin, H. (2012). Scheduling in flow shops with flexible operations: Throughput optimization and benefits of flexibility. International Journal of Production Economics, 140, 900\u2013911.","journal-title":"International Journal of Production Economics"},{"key":"607_CR20","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1002\/nav.3800290316","volume":"29","author":"N Hefetz","year":"1982","unstructured":"Hefetz, N., & Adiri, I. (1982). A note on the influence of missing operations on scheduling problems. Naval Research Logistics Quarterly, 29, 535\u2013539.","journal-title":"Naval Research Logistics Quarterly"},{"key":"607_CR21","doi-asserted-by":"publisher","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 set-up times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"607_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2014.11.037","volume":"243","author":"C Koulamas","year":"2015","unstructured":"Koulamas, C., & Kyparisis, G. J. (2015). The three-machine proportionate open shop and mixed shop minimum makespan problems. European Journal of Operational Research, 243(1), 70\u201374.","journal-title":"European Journal of Operational Research"},{"key":"607_CR23","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1111\/j.1540-5915.1990.tb01244.x","volume":"21","author":"DH Kropp","year":"1990","unstructured":"Kropp, D. H., & Smunt, T. L. (1990). Optimal and heuristic models for lot splitting in a flow shop. Decision Sciences, 21, 691\u2013709.","journal-title":"Decision Sciences"},{"key":"607_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in combinatorial optimization","author":"J Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1984). Preemptive scheduling of uniform machines subject to release dates. In H. R. Pulleybank (Ed.), Progress in combinatorial optimization (pp. 245\u2013261). New York: Academic Press."},{"key":"607_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical programming the state of the art","author":"EL Lawler","year":"1983","unstructured":"Lawler, E. L. (1983). Recent results in the theory of machine scheduling. In A. Bachem, M. Gr\u00f6tschel, & B. Korte (Eds.), Mathematical programming the state of the art (pp. 202\u2013234). Berlin: Springer."},{"key":"607_CR26","doi-asserted-by":"crossref","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993) Sequencing and scheduling: algorithms and complexity. Handbook in Operations Research and Management Science (Vol. 4, 445\u2013522). Amsterdam.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"607_CR27","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.37.2.314","volume":"37","author":"EL Lawler","year":"1989","unstructured":"Lawler, E. L., & Martel, C. U. (1989). Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research, 37, 314\u2013318.","journal-title":"Operations Research"},{"key":"607_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10951-016-0493-x","volume":"20","author":"BMT Lin","year":"2016","unstructured":"Lin, B. M. T., Hwang, F. J., & Gupta, J. N. D. (2016). Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. Journal of Scheduling, 20, 293\u2013302.","journal-title":"Journal of Scheduling"},{"key":"607_CR29","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0925-5273(92)90102-D","volume":"27","author":"JO McLain","year":"1992","unstructured":"McLain, J. O., Thomas, L. J., & Sox, C. (1992). \u201cOn-the-fly\u201d line balancing with very little WIP. International Journal of Production Economics, 27, 283\u2013289.","journal-title":"International Journal of Production Economics"},{"key":"607_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"12","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 12, 1\u201312.","journal-title":"Management Science"},{"key":"607_CR31","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"607_CR32","first-page":"105","volume":"3","author":"J Ostolaza","year":"1990","unstructured":"Ostolaza, J., McLain, J. O., & Sox, C. (1990). The use of dynamic (state-dependent) assembly-line balancing to improve throughput. Journal of Manufacturing and Operations Management, 3, 105\u2013133.","journal-title":"Journal of Manufacturing and Operations Management"},{"key":"607_CR33","first-page":"58","volume":"2015","author":"K Pienkosz","year":"2015","unstructured":"Pienkosz, K., & Prus, A. (2015). Task scheduling with restricted preemptions on two parallel processors. International Conference on Methods and Models in Automation and Robotics, 2015, 58\u201361.","journal-title":"International Conference on Methods and Models in Automation and Robotics"},{"key":"607_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M. (2016). Scheduling: Theory, algorithms, and systems (6th ed.). Berlin: Springer.","edition":"6"},{"key":"607_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6377(91)90014-G","volume":"10","author":"CN Potts","year":"1991","unstructured":"Potts, C. N., Shmoys, D. B., & Williamson, D. P. (1991). Permutation vs. non-permutation flow shop schedules. Operations Research Letters, 10, 281\u2013284.","journal-title":"Operations Research Letters"},{"key":"607_CR36","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ejor.2013.05.041","volume":"231","author":"D Prot","year":"2013","unstructured":"Prot, D., Bellenguez-Morineau, O., & Lahlou, C. (2013). New complexity results for parallel identical machine scheduling. European Journal of Operational Research, 231, 282\u2013287.","journal-title":"European Journal of Operational Research"},{"key":"607_CR37","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.cor.2009.04.018","volume":"37","author":"AJ Ruiz-Torres","year":"2010","unstructured":"Ruiz-Torres, A. J., Ablanedo-Rosas, J. H., & Ho, J. C. (2010). Minimizing the number of tardy jobs in the flow shop problem with operation and resource flexibility. Computers and Operations Research, 37, 291\u2013292.","journal-title":"Computers and Operations Research"},{"key":"607_CR38","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.omega.2010.07.004","volume":"39","author":"AJ Ruiz-Torres","year":"2011","unstructured":"Ruiz-Torres, A. J., Ho, J. C., & Ablanedo-Rosas, J. H. (2011). Makespan and workstation utilization minimization in a flowshop with operations flexibility. Omega, 39, 273\u2013282.","journal-title":"Omega"},{"key":"607_CR39","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.27.5.925","volume":"27","author":"S Sahni","year":"1979","unstructured":"Sahni, S. (1979). Preemptive scheduling with due dates. Operations Research, 27, 925\u2013934.","journal-title":"Operations Research"},{"key":"607_CR40","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P Serafini","year":"1996","unstructured":"Serafini, P. (1996). Scheduling jobs on several machines with the job splitting property. Operations Research, 44, 617\u2013628.","journal-title":"Operations Research"},{"key":"607_CR41","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"NV Shakhlevich","year":"1998","unstructured":"Shakhlevich, N. V., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1, 157\u2013168.","journal-title":"Journal of Scheduling"},{"key":"607_CR42","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1287\/opre.41.6.1065","volume":"41","author":"D Trietsch","year":"1993","unstructured":"Trietsch, D., & Baker, K. R. (1993). Basic techniques for lot streaming. Operations Research, 41, 1065\u20131076.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00607-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00607-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00607-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T04:34:30Z","timestamp":1590035670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00607-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,2]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["607"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00607-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2019,4,2]]},"assertion":[{"value":"2 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}