{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:01Z","timestamp":1759667761701},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,3,2]],"date-time":"2013-03-02T00:00:00Z","timestamp":1362182400000},"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,10]]},"DOI":"10.1007\/s10951-013-0315-3","type":"journal-article","created":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T19:08:15Z","timestamp":1362164895000},"page":"471-487","source":"Crossref","is-referenced-by-count":15,"title":["A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups"],"prefix":"10.1007","volume":"17","author":[{"given":"Liji","family":"Shen","sequence":"first","affiliation":[]},{"given":"Lars","family":"M\u00f6nch","sequence":"additional","affiliation":[]},{"given":"Udo","family":"Buscher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,2]]},"reference":[{"key":"315_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"S Albers","year":"1993","unstructured":"Albers, S., & Brucker, P. (1993). The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87\u2013107.","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"315_CR2","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0305-0548(98)00002-1","volume":"25","author":"T Aldowaisan","year":"1998","unstructured":"Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times. Computers and Operations Research, 25(9), 757\u2013765.","journal-title":"Computers and Operations Research"},{"key":"315_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0305-0548(99)00010-6","volume":"27","author":"A Allahverdi","year":"2000","unstructured":"Allahverdi, A. (2000). Minimizing mean flowtime in a two machine flowshop with sequence independent setup times separated. Computers and Operations Research, 27, 111\u2013127.","journal-title":"Computers and Operations Research"},{"issue":"9","key":"315_CR4","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1057\/palgrave.jors.2600583","volume":"49","author":"A Allahverdi","year":"1998","unstructured":"Allahverdi, A., & Aldowaisan, T. (1998). Job lateness in flowshops with setup and removal times separated. Journal of the Operational Research Society, 49(9), 1001\u20131006.","journal-title":"Journal of the Operational Research Society"},{"key":"315_CR5","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. N. D., & 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":"315_CR6","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. T., Cheng, T. C. E., & 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":"315_CR7","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1057\/jors.2010.186","volume":"62","author":"C Almeder","year":"2011","unstructured":"Almeder, C., & M\u00f6nch, L. (2011). Scheduling jobs with incompatible families on parallel batch machines. Journal of the Operational Resarch Society, 62, 2083\u20132096.","journal-title":"Journal of the Operational Resarch Society"},{"key":"315_CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/opre.29.1.146","volume":"29","author":"JW Barnes","year":"1981","unstructured":"Barnes, J. W., & Vanston, L. K. (1981). Scheduling jobs with linear delay penalties and sequence dependent setup costs. Operations Research, 29, 146.","journal-title":"Operations Research"},{"key":"315_CR9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0305-0548(94)90001-9","volume":"21","author":"TCE Cheng","year":"1994","unstructured":"Cheng, T. C. E., Chen, Y. L., & Oguz, C. (1994). One-machine batching and sequencing of multiple-type items. Computers and Operations Research, 21, 717\u2013721.","journal-title":"Computers and Operations Research"},{"key":"315_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","volume":"9","author":"TCE Cheng","year":"2000","unstructured":"Cheng, T. C. E., Gupta, J. N. D., & 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":"315_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman, E. G., Yannakakis, M., Magazine, M. J., & Santos, C. A. (1990). Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135\u2013147.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"315_CR12","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.cie.2010.07.001","volume":"61","author":"R Driessel","year":"2011","unstructured":"Driessel, R., & M\u00f6nch, L. (2011). Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers and Industrial Engineering, 61(2), 336\u2013345.","journal-title":"Computers and Industrial Engineering"},{"key":"315_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"PM Franca","year":"2005","unstructured":"Franca, P. M., Gupta, J. N. D., Mendes, A. S., Moscato, P., & Veltink, K. J. (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"},{"key":"315_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. Rinnooy. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"315_CR15","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","volume":"77","author":"JND Gupta","year":"1994","unstructured":"Gupta, J. N. D., & Tunc, E. A. (1994). Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77(3), 415\u2013428.","journal-title":"European Journal of Operational Research"},{"key":"315_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02085643","volume":"50","author":"W Han","year":"1994","unstructured":"Han, W., & Dejax, P. (1994). An efficient heuristic based on machine workload for the flow shop scheduling problem with setup and removal times. Annals of Operations Research, 50, 263\u2013279.","journal-title":"Annals of Operations Research"},{"key":"315_CR17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"315_CR18","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ijpe.2007.02.031","volume":"111","author":"SH Hendizadeh","year":"2008","unstructured":"Hendizadeh, S. H., Faramarzi, H., Mansouri, S. A., Gupta, J. N. D., & Elmekkawy, T. Y. (2008). Meta-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":"315_CR19","doi-asserted-by":"crossref","unstructured":"Hurink, J. (1998). A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbor. Journal of Scheduling, 1, 127\u2013148.","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<127::AID-JOS11>3.0.CO;2-9"},{"key":"315_CR20","first-page":"125","volume":"31","author":"M Laguna","year":"1999","unstructured":"Laguna, M. (1999). A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times. IIE Transactions, 31, 125\u2013134.","journal-title":"IIE Transactions"},{"key":"315_CR21","doi-asserted-by":"crossref","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.","DOI":"10.1016\/j.ijpe.2005.02.006"},{"key":"315_CR22","doi-asserted-by":"crossref","unstructured":"Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165\u2013178.","DOI":"10.1080\/07408179808966448"},{"key":"315_CR23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24, 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"315_CR24","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setups. Operations Research, 37, 798\u2013804.","journal-title":"Operations Research"},{"key":"315_CR25","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":"315_CR26","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"315_CR27","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1080\/095372897234902","volume":"8","author":"C Rajendran","year":"1997","unstructured":"Rajendran, C., & Ziegler, H. (1997). Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Production Planning and Control, 8, 568\u2013576.","journal-title":"Production Planning and Control"},{"key":"315_CR28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1080\/00207540210163973","volume":"41","author":"V Reddy","year":"2003","unstructured":"Reddy, V., & Narendran, T. 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":"315_CR29","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"ML Rocha","year":"2007","unstructured":"Rocha, M. L., Ravetti, M. G., Mateus, G. R., & Pardalos, P. M. (2007). Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA Journal of Management Mathematics, 18, 101\u2013115.","journal-title":"IMA Journal of Management Mathematics"},{"key":"315_CR30","unstructured":"Shen, L., M\u00f6nch, L., & Buscher, U. (2011). An iterative scheme for parallel machine scheduling with sequence dependent family setups. In Proceedings MISTA, 2011, 519\u2013522."},{"key":"315_CR31","doi-asserted-by":"crossref","unstructured":"Shen, L., M\u00f6nch, L., & Buscher, U. (2012). An iterative approach for the serial batching problem with parallel machines and job families. Working paper, Nr. 164\/12, Technische Universitaet Dresden (in press).","DOI":"10.1596\/1813-9450-6243"},{"key":"315_CR32","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","volume":"24","author":"BN Srikar","year":"1986","unstructured":"Srikar, B. N., & Ghosh, S. (1986). A MILP model for the $$n$$ -job, $$m$$ -stage flowshop with sequence dependent set-up times. International Journal of Production Research, 24, 1459\u20131474.","journal-title":"International Journal of Production Research"},{"key":"315_CR33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","volume":"99","author":"DN Tahar","year":"2006","unstructured":"Tahar, D. N., Yalaoui, F., Chu, C., & Amodeo, L. (2006). A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. International Journal of Production Economics, 99, 63\u201373.","journal-title":"International Journal of Production Economics"},{"key":"315_CR34","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(94)90077-9","volume":"75","author":"S Hoesel van","year":"1994","unstructured":"van Hoesel, S., Wagelmans, A., & Moerman, B. (1994). Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problems and extensions. European Journal of Operational Research, 75, 312\u2013331.","journal-title":"European Journal of Operational Research"},{"key":"315_CR35","doi-asserted-by":"crossref","first-page":"2105","DOI":"10.1016\/j.cor.2008.07.009","volume":"68","author":"X Wang","year":"2009","unstructured":"Wang, X., & Tang, L. (2009). A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers and Operations Research, 68, 2105\u20132110.","journal-title":"Computers and Operations Research"},{"key":"315_CR36","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00207547708943117","volume":"16","author":"CH White","year":"1977","unstructured":"White, C. H., & Wilson, R. C. (1977). Sequence dependent set-up times and job sequencing. International Journal of Production Research, 16, 191.","journal-title":"International Journal of Production Research"},{"key":"315_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1080\/07408170304382","volume":"35","author":"F Yalaoui","year":"2003","unstructured":"Yalaoui, F., & Chu, C. (2003). An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Transactions, 35, 183\u2013190.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0315-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0315-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0315-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0315-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,2]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["315"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0315-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,2]]}}}