{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:12:25Z","timestamp":1771877545860,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T00:00:00Z","timestamp":1363219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-013-1339-y","type":"journal-article","created":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T09:39:20Z","timestamp":1363167560000},"page":"425-448","source":"Crossref","is-referenced-by-count":19,"title":["An iterative approach for the serial batching problem with parallel machines and job families"],"prefix":"10.1007","volume":"206","author":[{"given":"Liji","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"M\u00f6nch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udo","family":"Buscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,14]]},"reference":[{"key":"1339_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. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27, 219\u2013239.","journal-title":"Omega"},{"issue":"3","key":"1339_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. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"1339_CR3","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). Metaheuristics for scheduling jobs with incompatible families on parallel batching machines. Journal of the Operational Research Society, 62(12), 2083\u20132096.","journal-title":"Journal of the Operational Research Society"},{"key":"1339_CR4","doi-asserted-by":"crossref","first-page":"395","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, 395\u2013399.","journal-title":"European Journal of Operational Research"},{"key":"1339_CR5","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1080\/15458830.1996.11770748","volume":"28","author":"T. C. E. Cheng","year":"1996","unstructured":"Cheng, T. C. E., Chen, Z.-L., Kovalyov, M. Y., & Lin, B. M. T. (1996). Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions, 28, 953\u2013956.","journal-title":"IIE Transactions"},{"key":"1339_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.37.3.426","volume":"37","author":"E. G. Coffman","year":"1989","unstructured":"Coffman, E. G., Nozari, A., & Yannakakis, M. (1989). Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37, 426\u2013436.","journal-title":"Operations Research"},{"key":"1339_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(95)00349-5","volume":"90","author":"H. A. J. Crauwels","year":"1996","unstructured":"Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1996). Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. European Journal of Operational Research, 90, 200\u2013213.","journal-title":"European Journal of Operational Research"},{"key":"1339_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018978322417","volume":"70","author":"H. A. J. Crauwels","year":"1997","unstructured":"Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1997). Local search heuristics for single-machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research, 70, 261\u2013279.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1339_CR9","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 & Industrial Engineering, 61(2), 336\u2013345.","journal-title":"Computers & Industrial Engineering"},{"key":"1339_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic machine scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"1339_CR11","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":"1339_CR12","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1016\/j.cor.2008.08.001","volume":"36","author":"F. Jin","year":"2009","unstructured":"Jin, F., Song, S., & Wu, C. (2009). A simulated annealing algorithm for single machine scheduling problems with family setups. Computers & Operations Research, 36, 2133\u20132138.","journal-title":"Computers & Operations Research"},{"key":"1339_CR13","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"},{"issue":"3","key":"1339_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1080\/09537280110065517","volume":"13","author":"D. T. Luu","year":"2002","unstructured":"Luu, D. T., Bohez, E. L. J., & Techanitisawad, A. (2002). A hybrid genetic algorithm for the batch sequencing problem on identical parallel machines. Production Planning & Control, 13(3), 243\u2013252.","journal-title":"Production Planning & Control"},{"key":"1339_CR15","first-page":"165","volume":"30","author":"S. V. Mehta","year":"1998","unstructured":"Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165\u2013178.","journal-title":"IIE Transactions"},{"key":"1339_CR16","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 & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"1339_CR17","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":"1339_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.orl.2004.09.007","volume":"33","author":"G. Mosheiov","year":"2005","unstructured":"Mosheiov, G., Oron, D., & Ritov, Y. (2005). Minimizing flow-time on a single-machine with integer size batches. Operations Research Letters, 33, 497\u2013501.","journal-title":"Operations Research Letters"},{"key":"1339_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","volume":"21","author":"D. Naddef","year":"1988","unstructured":"Naddef, D., & Santos, C. (1988). One-pass batching algorithms for the one-machine problem. Discrete Applied Mathematics, 21, 133\u2013145.","journal-title":"Discrete Applied Mathematics"},{"key":"1339_CR20","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: theory, algorithms, and systems (3rd ed.). New York: Springer.","edition":"3"},{"key":"1339_CR21","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C. N. Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"1339_CR22","volume-title":"Machine scheduling problems: classification, complexity and computations","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: classification, complexity and computations. The Hague: Nijhoff."},{"key":"1339_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"M. L. 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":"1339_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(85)90011-2","volume":"4","author":"C. A. Santos","year":"1985","unstructured":"Santos, C. A., & Magazine, M. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99\u2013103.","journal-title":"Operations Research Letters"},{"key":"1339_CR25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","volume":"11","author":"D. Shallcross","year":"1992","unstructured":"Shallcross, D. (1992). A polynomial algorithm for a one machine batching problem. Operations Research Letters, 11, 213\u2013218.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1339_CR26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0925-5273(99)00105-X","volume":"68","author":"G. Wang","year":"2000","unstructured":"Wang, G., & Cheng, T. C. E. (2000). Parallel machine scheduling with batch delivery costs. International Journal of Production Economics, 68(2), 177\u2013183.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"1339_CR27","doi-asserted-by":"crossref","first-page":"2105","DOI":"10.1016\/j.cor.2008.07.009","volume":"36","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 & Operations Research, 36(6), 2105\u20132110.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1339-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1339-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1339-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:41Z","timestamp":1559138981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1339-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,14]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1339"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1339-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,14]]}}}