{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:35:34Z","timestamp":1761896134003,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223476"},{"type":"electronic","value":"9783319223483"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22348-3_8","type":"book-chapter","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T06:26:43Z","timestamp":1438237603000},"page":"131-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search"],"prefix":"10.1007","author":[{"given":"Matheus N.","family":"Haddad","sequence":"first","affiliation":[]},{"given":"Luciano P.","family":"Cota","sequence":"additional","affiliation":[]},{"given":"Marcone J. F.","family":"Souza","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"MJP Lopes","year":"2007","unstructured":"Lopes, M.J.P., de Carvalho, J.M.: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur. J. Oper. Res. 176, 1508\u20131527 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"40","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complex. Comput. Comput. 40, 85\u2013103 (1972)","journal-title":"Complex. Comput. Comput."},{"key":"8_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of Np-Completeness.","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of Np-Completeness., vol. 174. WH Freeman & Co., San Francisco (1979)"},{"key":"8_CR5","series-title":"International Series in Operations Research and Management Science","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2003)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.ejor.2010.05.031","volume":"207","author":"M Souza","year":"2010","unstructured":"Souza, M., Coelho, I., Ribas, S., Santos, H., Merschmann, L.: A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207, 1041\u20131051 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR8","unstructured":"de Optimizaci\u00f3n Aplicada, S.: A web site that includes benchmark problem data sets and solutions for scheduling problems (2011). http:\/\/soa.iti.es\/problem-instances"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-5273(00)00066-9","volume":"70","author":"MX Weng","year":"2001","unstructured":"Weng, M.X., Lu, J., Ren, H.: Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Econ. 70, 215\u2013226 (2001)","journal-title":"Int. J. Prod. Econ."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"DW Kim","year":"2003","unstructured":"Kim, D.W., Na, D.G., Chen, F.F.: Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot. Comput. Integr. Manuf. 19, 173\u2013181 (2003)","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"34","author":"R Logendran","year":"2007","unstructured":"Logendran, R., McDonell, B., Smucker, B.: Scheduling unrelated parallel machines with sequence-dependent setups. Comput. Oper. Res. 34, 3420\u20133438 (2007)","journal-title":"Comput. Oper. Res."},{"key":"8_CR12","first-page":"177","volume":"17","author":"A Al-Salem","year":"2004","unstructured":"Al-Salem, A.: Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times. Eng. J. Univ. Qatar 17, 177\u2013187 (2004)","journal-title":"Eng. J. Univ. Qatar"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10845-005-5514-0","volume":"17","author":"G Rabadi","year":"2006","unstructured":"Rabadi, G., Moraga, R.J., Al-Salem, A.: Heuristics for the unrelated parallel machine scheduling problem with setup times. J. Intell. Manuf. 17, 85\u201397 (2006)","journal-title":"J. Intell. Manuf."},{"key":"8_CR14","first-page":"182","volume":"3","author":"M Helal","year":"2006","unstructured":"Helal, M., Rabadi, G., Al-Salem, A.: A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. Int. J. Oper. Res. 3, 182\u2013192 (2006)","journal-title":"Int. J. Oper. Res."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","volume":"21","author":"J Arnaout","year":"2010","unstructured":"Arnaout, J., Rabadi, G., Musa, R.: A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 21, 693\u2013701 (2010)","journal-title":"J. Intell. Manuf."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1007\/s10845-010-0483-3","volume":"23","author":"KC Ying","year":"2012","unstructured":"Ying, K.C., Lee, Z.J., Lin, S.W.: Makespan minimisation for scheduling unrelated parallel machines with setup times. J. Intell. Manuf. 23, 1795\u20131803 (2012)","journal-title":"J. Intell. Manuf."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.asoc.2010.03.003","volume":"11","author":"P Chang","year":"2011","unstructured":"Chang, P., Chen, S.: Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl. Soft Comput. 11, 1263\u20131274 (2011)","journal-title":"Appl. Soft Comput."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1007\/s10845-011-0522-8","volume":"23","author":"K Fleszar","year":"2011","unstructured":"Fleszar, K., Charalambous, C., Hindi, K.: A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J. Intell. Manuf. 23, 1949\u20131958 (2011). doi:10.1007\/s10845-011-0522-8","journal-title":"J. Intell. Manuf."},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","volume":"211","author":"E Vallada","year":"2011","unstructured":"Vallada, E., Ruiz, R.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211, 612\u2013622 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR20","first-page":"287","volume-title":"Search Methodologies","author":"MGC Resende","year":"2013","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP: greedy randomized adaptive search procedures. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, 2nd edn, pp. 287\u2013312. Springer, New York (2013)","edition":"2"},{"key":"8_CR21","volume-title":"Introduction to Sequencing and Scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)"},{"key":"8_CR22","unstructured":"Bresina, J.L.: Heusistic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial intelligence, vol. 1, pp. 271\u2013278 (1996)"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37, 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1093\/biomet\/52.3-4.591","volume":"52","author":"SS Shapiro","year":"1965","unstructured":"Shapiro, S.S., Wilk, M.B.: An analysis of variance test for normality (complete samples). Biometrika 52, 591\u2013611 (1965)","journal-title":"Biometrika"},{"key":"8_CR25","volume-title":"Design and Analysis of Experiments","author":"D Montgomery","year":"2007","unstructured":"Montgomery, D.: Design and Analysis of Experiments, 5th edn. John Wiley & Sons, New York (2007)","edition":"5"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22348-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:40:47Z","timestamp":1675273247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22348-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223476","9783319223483"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22348-3_8","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"31 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}