{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:42:41Z","timestamp":1749494561477},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T00:00:00Z","timestamp":1391731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10951-014-0369-x","type":"journal-article","created":{"date-parts":[[2014,2,6]],"date-time":"2014-02-06T08:42:43Z","timestamp":1391676163000},"page":"353-370","source":"Crossref","is-referenced-by-count":19,"title":["Flow shop batching and scheduling with sequence-dependent setup times"],"prefix":"10.1007","volume":"17","author":[{"given":"Liji","family":"Shen","sequence":"first","affiliation":[]},{"given":"Jatinder N. D.","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Udo","family":"Buscher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,7]]},"reference":[{"key":"369_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega International Journal of Management Science, 27, 219\u2013239.","journal-title":"Omega International Journal of Management Science"},{"key":"369_CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., & Kovalyov, Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"369_CR3","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.camwa.2010.12.028","volume":"61","author":"F Angel-Bello","year":"2011","unstructured":"Angel-Bello, F., Alvarez, A., Pacheco, J., & Martnez, I. (2011a). A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Computers and Mathematics with Applications, 61, 797\u2013808.","journal-title":"Computers and Mathematics with Applications"},{"key":"369_CR4","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1016\/j.apm.2010.11.017","volume":"35","author":"F Angel-Bello","year":"2011","unstructured":"Angel-Bello, F., Alvarez, A., Pacheco, J., & Martnez, I. (2011b). A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Applied Mathematical Modelling, 35, 2041\u20132050.","journal-title":"Applied Mathematical Modelling"},{"issue":"2","key":"369_CR5","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R., & Giampietro, T. (1994). The reactive tabu search. ORSA Journal on Computing, 6(2), 126\u2013140.","journal-title":"ORSA Journal on Computing"},{"key":"369_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2008.11.046","volume":"199","author":"U Buscher","year":"2009","unstructured":"Buscher, U., & Shen, L. (2009). An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operational Research, 199, 385\u2013399.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"369_CR7","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"H Campbell","year":"1970","unstructured":"Campbell, H., Dudek, R., & Simth, M. (1970). A heuristic algorithm for the n job m machine sequencing problem. Management Science, 16(10), B630\u2013B637.","journal-title":"Management Science"},{"key":"369_CR8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","volume":"9","author":"T Cheng","year":"2000","unstructured":"Cheng, T., Gupta, J., & Wang, G. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management, 9, 262\u2013282.","journal-title":"Production and Operations Management"},{"key":"369_CR9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"P Franca","year":"2005","unstructured":"Franca, P., Gupta, J., Mendes, A., Moscato, P., & Veltink, K. (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering, 48, 491\u2013506.","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"369_CR10","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1080\/00207549608904945","volume":"34","author":"G Frazier","year":"1996","unstructured":"Frazier, G. (1996). An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34(4), 959\u2013976.","journal-title":"International Journal of Production Research"},{"key":"369_CR11","unstructured":"Gupta, J. (1979). A review of flowshop scheduling research. In Disaggregation problems in manufacturing and service organizations (pp. 363\u2013388). The Hague: Martin Nijhoff."},{"key":"369_CR12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","volume":"24","author":"J Gupta","year":"1986","unstructured":"Gupta, J., & Darrow, W. (1986). The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research, 24, 439\u2013446.","journal-title":"European Journal of Operational Research"},{"key":"369_CR13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"J Gupta","year":"2006","unstructured":"Gupta, J., & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169, 699\u2013711.","journal-title":"European Journal of Operational Research"},{"key":"369_CR14","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ijpe.2007.02.031","volume":"111","author":"S Hendizadeh","year":"2008","unstructured":"Hendizadeh, S., Faramarzi, H., Mansouri, S., Gupta, J., & Eimekkawy, T. (2008). Mata-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics, 111, 593\u2013605.","journal-title":"International Journal of Production Economics"},{"key":"369_CR15","doi-asserted-by":"crossref","unstructured":"Lin, S., Gupta, J., Ying, K. & Lee, Z. (2009). Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times. International Journal of Production Research, 47, 3205\u20133217.","DOI":"10.1080\/00207540701813210"},{"key":"369_CR16","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1016\/j.cor.2007.12.010","volume":"36","author":"S Lin","year":"2009","unstructured":"Lin, S., Ying, K., & Lee, Z. (2009). Metaheuristics for scheduling a non-permutation flowshop manufacturing cell with sequence dependent family setup times. Computers and Operations Research, 36, 1110\u20131121.","journal-title":"Computers and Operations Research"},{"key":"369_CR17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ijpe.2005.02.006","volume":"102","author":"R Logendran","year":"2006","unstructured":"Logendran, R., de Szoeke, P., & Barnard, F. (2006). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102, 66\u201386.","journal-title":"International Journal of Production Economics"},{"key":"369_CR18","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C Monma","year":"1989","unstructured":"Monma, C., & Potts, C. (1989). On the complexity of scheduling with batch setups. Operations Research, 37, 798\u2013804.","journal-title":"Operations Research"},{"key":"369_CR19","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1002\/nav.20028","volume":"51","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D., & Ritov, Y. (2004). Flow-shop batching scheduling with identical processing-time jobs. Naval Research Logistics, 51, 783\u2013799.","journal-title":"Naval Research Logistics"},{"key":"369_CR20","doi-asserted-by":"crossref","unstructured":"Nawaz, M., Enscore, E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA International Journal of Management Science, 11, 91\u201395.","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"369_CR21","doi-asserted-by":"crossref","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797\u2013813.","DOI":"10.1287\/mnsc.42.6.797"},{"key":"369_CR22","doi-asserted-by":"crossref","unstructured":"Pacheco, J., Angel-Bello, F., Alvarez, A. (2013). A multi-start tabu search method for a single machine scheduling problem with periodic maintenance and sequence-dependent setup times. Journal of Scheduling, 16(6), 661\u2013673. doi: 10.1007\/s10951-012-0280-2 .","DOI":"10.1007\/s10951-012-0280-2"},{"key":"369_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1080\/00207540210163973","volume":"41","author":"V Reddy","year":"2003","unstructured":"Reddy, V., & Narendran, T. (2003). Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. International Journal of Production Research, 41, 193\u2013206.","journal-title":"International Journal of Production Research"},{"key":"369_CR24","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1080\/00207549308956795","volume":"31","author":"R Ruben","year":"1993","unstructured":"Ruben, R., Mosier, C., & Mahmoodi, F. (1993). A comprehensive analysis of group scheduling heuristics in a job shop cell. International Journal of Production Research, 31, 1343\u20131369.","journal-title":"International Journal of Production Research"},{"key":"369_CR25","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","volume":"125","author":"J Schaller","year":"2000","unstructured":"Schaller, J., Gupta, J., & Vakharia, A. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125, 324\u2013339.","journal-title":"European Journal of Operational Research"},{"key":"369_CR26","doi-asserted-by":"crossref","unstructured":"Shen, L., M\u00f6nch, L., Buscher, U. (2013a). A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. Journal of Scheduling. doi: 10.1007\/s10951-013-0315-3 .","DOI":"10.1007\/s10951-013-0315-3"},{"key":"369_CR27","doi-asserted-by":"crossref","unstructured":"Shen, L., M\u00f6nch, L., Buscher, U. (2013b). An iterative approach for the serial batching problem with parallel machines and job families. Annals of Operations Research, 206(1), 425\u2013448. doi: 10.1007\/s10479-013-1339-y .","DOI":"10.1007\/s10479-013-1339-y"},{"key":"369_CR28","doi-asserted-by":"crossref","unstructured":"Ying, K., Gupta, J., Lin, S. & Lee, Z. (2010). Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48(8), 2169\u20132184.","DOI":"10.1080\/00207540802534707"},{"key":"369_CR29","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s00170-011-3419-y","volume":"58","author":"K Ying","year":"2012","unstructured":"Ying, K., Lin, S., & Lee, Z. (2012). Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence dependent family setups. International Journal of Advanced Manufacturing Technology, 58, 671\u2013682.","journal-title":"International Journal of Advanced Manufacturing Technology"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0369-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0369-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0369-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0369-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,7]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["369"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0369-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,7]]}}}