{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:55Z","timestamp":1742913055353,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053475"},{"type":"electronic","value":"9783030053482"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05348-2_12","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T02:24:51Z","timestamp":1546223091000},"page":"141-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints"],"prefix":"10.1007","author":[{"given":"J\u00falio C. S. N.","family":"Pinheiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 E. C.","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo G.","family":"Tavares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","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.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"L-P Bigras","year":"2008","unstructured":"Bigras, L.-P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discret. Optim. 5(4), 685\u2013699 (2008)","journal-title":"Discret. Optim."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.ejor.2010.05.036","volume":"207","author":"D Briskorn","year":"2010","unstructured":"Briskorn, D., Choi, B.-C., Lee, K., Leung, J., Pinedo, M.: Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2), 605\u2013619 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10951-011-0261-x","volume":"16","author":"D Briskorn","year":"2013","unstructured":"Briskorn, D., Jaehn, F., Pesch, E.: Exact algorithms for inventory constrained scheduling on a single machine. J. Sched. 16(1), 105\u2013115 (2013)","journal-title":"J. Sched."},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., Leung, J.Y.-T.: Minimizing total tardiness on one machine is np-hard. Math. Oper. Res. 15(3), 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H Emmons","year":"1969","unstructured":"Emmons, H.: One-machine sequencing to minimize certain functions of job tardiness. Oper. Res. 17(4), 701\u2013715 (1969)","journal-title":"Oper. Res."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1), 55\u201369 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1080\/00207540601009976","volume":"46","author":"JN Gupta","year":"2008","unstructured":"Gupta, J.N., Chantaravarapan, S.: Single machine group scheduling with family setups to minimize total tardiness. Int. J. Prod. Res. 46(6), 1707\u20131722 (2008)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"SR Gupta","year":"2006","unstructured":"Gupta, S.R., Smith, J.S.: Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Oper. Res. 175(2), 722\u2013739 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ejor.2015.07.001","volume":"248","author":"O Herr","year":"2016","unstructured":"Herr, O., Goel, A.: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints. Eur. J. Oper. Res. 248(1), 123\u2013135 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.04.007","volume":"202","author":"C Koulamas","year":"2010","unstructured":"Koulamas, C.: The single-machine total tardiness scheduling problem: review and extensions. Eur. J. Oper. Res. 202(1), 1\u20137 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler, E.L.: A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Ann. Discret. Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discret. Math."},{"issue":"7","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2005.07.020","volume":"34","author":"C-J Liao","year":"2007","unstructured":"Liao, C.-J., Juan, H.-C.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34(7), 1899\u20131909 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1057\/palgrave.jors.2602434","volume":"59","author":"S Lin","year":"2008","unstructured":"Lin, S., Ying, K.: A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J. Oper. Res. Soc. 59(8), 1109\u20131119 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","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.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43(5), 395\u2013406 (1992)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.ijpe.2004.10.020","volume":"105","author":"J Schaller","year":"2007","unstructured":"Schaller, J.: Scheduling on a single machine with family setups to minimize total tardiness. Int. J. Prod. Econ. 105(2), 329\u2013344 (2007)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1016\/j.ejor.2006.06.061","volume":"187","author":"JE Schaller","year":"2008","unstructured":"Schaller, J.E., Gupta, J.N.: Single machine scheduling with family setups to minimize total earliness and tardiness. Eur. J. Oper. Res. 187(3), 1050\u20131068 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-5273(02)00265-7","volume":"83","author":"T Sen","year":"2003","unstructured":"Sen, T., Sulek, J.M., Dileepan, P.: Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. Int. J. Prod. Econ. 83(1), 1\u201312 (2003)","journal-title":"Int. J. Prod. Econ."},{"issue":"10","key":"12_CR21","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1016\/j.cor.2011.12.017","volume":"39","author":"A Sioud","year":"2012","unstructured":"Sioud, A., Gravel, M., Gagn\u00e9, C.: A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 39(10), 2415\u20132424 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"12_CR22","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1080\/00207543.2014.883472","volume":"52","author":"A Subramanian","year":"2014","unstructured":"Subramanian, A., Battarra, M., Potts, C.N.: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 52(9), 2729\u20132742 (2014)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.cor.2012.07.004","volume":"40","author":"S Tanaka","year":"2013","unstructured":"Tanaka, S., Araki, M.: An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Comput. Oper. Res. 40(1), 344\u2013352 (2013)","journal-title":"Comput. Oper. Res."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Jacob, V.V., Arroyo, J.E.C.: ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness. J. Appl. Math. 2016 (2016)","DOI":"10.1155\/2016\/9598041"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"K-C Ying","year":"2009","unstructured":"Ying, K.-C., Lin, S.-W., Huang, C.-Y.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Exp. Syst. Appl. 36(3), 7087\u20137092 (2009)","journal-title":"Exp. Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05348-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:54:00Z","timestamp":1710345240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05348-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030053475","9783030053482"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05348-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION 12","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION12\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}