{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:11:26Z","timestamp":1774519886398,"version":"3.50.1"},"publisher-location":"Cham","reference-count":114,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_10","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T15:09:59Z","timestamp":1534172999000},"page":"547-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Iterated Greedy"],"prefix":"10.1007","author":[{"given":"Thomas","family":"St\u00fctzle","sequence":"first","affiliation":[]},{"given":"Rub\u00e9n","family":"Ruiz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-28646-2_7","volume-title":"Ant colony optimization and swarm intelligence, 4th international workshop (ANTS 2004)","author":"A Acan","year":"2004","unstructured":"Acan A (2004) An external memory implementation in ant colony optimization. In: Dorigo M et al (eds) Ant colony optimization and swarm intelligence, 4th international workshop (ANTS 2004). Lecture notes in computer science, vol 3172. Springer, Heidelberg, pp 73\u201384"},{"key":"10_CR2","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Proceedings of EvoCOP 2005 \u2013 5th European conference on evolutionary computation in combinatorial optimization","author":"A Acan","year":"2005","unstructured":"Acan A (2005) An external partial permutations memory for ant colony optimization. In: Raidl GR, Gottlieb J (eds) Proceedings of EvoCOP 2005 \u2013 5th European conference on evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 3448. Springer, Heidelberg, pp 1\u201311"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000039511.61195.21","volume":"131","author":"S Ahmadi","year":"2004","unstructured":"Ahmadi S, Osman IH (2004) Density based problem space search for the capacitated clustering p-median problem. Ann Oper Res 131:21\u201343","journal-title":"Ann Oper Res"},{"issue":"1\u20133","key":"10_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Ergun O, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123(1\u20133):75\u2013102","journal-title":"Discret Appl Math"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Aickelin U, Burke EK, Li J (2006) Improved squeaky wheel optimisation for driver scheduling. In: Runarsson TP, Beyer HG, Burke EK, Merelo JJ, Whitley LD, Yao X (eds) (2006) Proceedings of PPSN-IX, ninth international conference on parallel problem solving from nature. Lecture notes in computer science, vol 4193. Springer, Heidelberg","DOI":"10.1007\/11844297_19"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"J Arroyo","year":"2017","unstructured":"Arroyo J, Leung JT (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84\u2013100","journal-title":"Comput Ind Eng"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math Program Study 12:37\u201360","journal-title":"Math Program Study"},{"key":"10_CR8","volume-title":"Experimental methods for the analysis of optimization algorithms","year":"2010","unstructured":"Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (eds) (2010) Experimental methods for the analysis of optimization algorithms. Springer, Berlin"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Battiti R, Brunato M, Mascia F (2008) Reactive search and intelligent optimization. Operations research\/computer science interfaces, vol 45. Springer, New York.","DOI":"10.1007\/978-0-387-09624-7"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2015.08.001","volume":"66","author":"AJ Benavides","year":"2015","unstructured":"Benavides AJ, Ritt M (2015) Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. Comput Oper Res 66:160\u2013169","journal-title":"Comput Oper Res"},{"issue":"3","key":"10_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas DP, Tsitsiklis JN, Wu C (1997) Rollout algorithms for combinatorial optimization. J Heuristics 3(3):245\u2013262","journal-title":"J Heuristics"},{"issue":"6","key":"10_CR12","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Beam-ACO\u2014hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565\u20131591","journal-title":"Comput Oper Res"},{"issue":"6","key":"10_CR13","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1016\/j.asoc.2012.02.013","volume":"12","author":"S Bouamama","year":"2012","unstructured":"Bouamama S, Blum C, Boukerram A (2012) A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl Soft Comput 12(6):1632\u20131639","journal-title":"Appl Soft Comput"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set covering problems. Ann Oper Res 86:611\u2013627","journal-title":"Ann Oper Res"},{"issue":"12","key":"10_CR15","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde MR, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724","journal-title":"J Oper Res Soc"},{"issue":"3","key":"10_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y Caseau","year":"1999","unstructured":"Caseau Y, Laburthe F (1999) Heuristics for large constrained vehicle routing problems. J Heuristics 5(3):281\u2013303","journal-title":"J Heuristics"},{"key":"10_CR17","first-page":"742","volume-title":"Proceedings of AAAI 2000 \u2013 seventeenth national conference on artificial intelligence","author":"A Cesta","year":"2000","unstructured":"Cesta A, Oddi A, Smith SF (2000) Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of AAAI 2000 \u2013 seventeenth national conference on artificial intelligence. AAAI Press\/MIT Press, Menlo Park, pp 742\u2013747"},{"issue":"2","key":"10_CR18","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","volume":"227","author":"M Ciavotta","year":"2013","unstructured":"Ciavotta M, Minella G, Ruiz R (2013) Multi-objective sequence dependent setup times flowshop scheduling: a new algorithm and a comprehensive study. Eur J Oper Res 227(2):301\u2013313","journal-title":"Eur J Oper Res"},{"key":"10_CR19","unstructured":"Culberson JC (1992) Iterated greedy graph coloring and the difficulty landscape. Tech. Rep. 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta"},{"key":"10_CR20","unstructured":"Dees WA Jr, Karger PG (1982) Automated rip-up and reroute techniques. In: Proceedings of the 19th design automation workshop (DAC\u201982). IEEE Press, pp 432\u2013439"},{"issue":"3","key":"10_CR21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/00207721.2012.723054","volume":"45","author":"G Deng","year":"2014","unstructured":"Deng G, Gu X (2014) An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Int J Syst Sci 45(3):351\u2013362","journal-title":"Int J Syst Sci"},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Gupta JND, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604\u2013613","journal-title":"Appl Soft Comput"},{"key":"10_CR23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"issue":"4","key":"10_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, St\u00fctzle T (2006) Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"8","key":"10_CR25","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/j.cor.2010.10.008","volume":"38","author":"J Dubois-Lacoste","year":"2011","unstructured":"Dubois-Lacoste J, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2011) A hybrid TP+\u2009PLS algorithm for bi-objective flow-shop scheduling problems. Comput Oper Res 38(8):1219\u20131236.","journal-title":"Comput Oper Res"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","volume":"81","author":"J Dubois-Lacoste","year":"2017","unstructured":"Dubois-Lacoste J, Pagnozzi F, St\u00fctzle T (2017) An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Comput Oper Res 81:160\u2013166","journal-title":"Comput Oper Res"},{"issue":"3","key":"10_CR27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin C, Vo\u00df S (1999) The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3):181\u2013191","journal-title":"Networks"},{"key":"10_CR28","series-title":"Annals of information systems","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-1-4419-1306-7_4","volume-title":"Matheuristics\u2014hybridizing metaheuristics and mathematical programming","author":"I Dumitrescu","year":"2009","unstructured":"Dumitrescu I, St\u00fctzle T (2009) Usage of exact algorithms to enhance stochastic local search algorithms. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics\u2014hybridizing metaheuristics and mathematical programming. Annals of information systems, vol 10. Springer, New York, pp 103\u2013134"},{"issue":"1","key":"10_CR29","doi-asserted-by":"crossref","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 (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55\u201369","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10_CR30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67\u201371","journal-title":"Oper Res Lett"},{"key":"10_CR31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013113","journal-title":"J Glob Optim"},{"key":"10_CR32","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas V, Frami\u00f1\u00e1n JM (2014) On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput Oper Res 45:60\u201367","journal-title":"Comput Oper Res"},{"issue":"4","key":"10_CR33","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 53(4):1111\u20131123","journal-title":"Int J Prod Res"},{"issue":"22","key":"10_CR34","doi-asserted-by":"crossref","first-page":"6479","DOI":"10.1080\/00207540701418960","volume":"46","author":"JM Framinan","year":"2008","unstructured":"Framinan JM, Leisten R (2008) Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. Int J Prod Res 46(22):6479\u20136498","journal-title":"Int J Prod Res"},{"issue":"12","key":"10_CR35","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Frami\u00f1\u00e1n","year":"2004","unstructured":"Frami\u00f1\u00e1n JM, Gupta JN, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12): 1243\u20131255","journal-title":"J Oper Res Soc"},{"key":"10_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-6272-8","volume-title":"Manufacturing scheduling systems: an integrated view on models, methods, and tools","author":"JM Frami\u00f1\u00e1n","year":"2014","unstructured":"Frami\u00f1\u00e1n JM, Leisten R, Ruiz R (2014) Manufacturing scheduling systems: an integrated view on models, methods, and tools. Springer, New York"},{"issue":"3","key":"10_CR37","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.ejor.2013.07.035","volume":"232","author":"C Garc\u00eda-Mart\u00ednez","year":"2014","unstructured":"Garc\u00eda-Mart\u00ednez C, Rodriguez FJ, Lozano M (2014) Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur J Oper Res 232(3): 454\u2013463","journal-title":"Eur J Oper Res"},{"key":"10_CR38","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156\u2013166","journal-title":"Decis Sci"},{"issue":"5","key":"10_CR39","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"3","key":"10_CR40","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search \u2013 part I. INFORMS J Comput 1(3):190\u2013206. https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"INFORMS J Comput"},{"key":"10_CR41","volume-title":"Handbook of metaheuristics","year":"2002","unstructured":"Glover F, Kochenberger G (eds) (2002) Handbook of metaheuristics. Kluwer Academic Publishers, Norwell"},{"key":"10_CR42","first-page":"407","volume-title":"Metaheuristics: theory & applications","author":"F Glover","year":"1996","unstructured":"Glover F, Kochenberger GA (1996) Critical even tabu search for multidimensional knapsack problems. In: Osman IH, Kelly JP (eds) Metaheuristics: theory & applications. Kluwer Academic Publishers, Norwell, pp 407\u2013427"},{"issue":"3","key":"10_CR43","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F Glover","year":"1998","unstructured":"Glover F, Kochenberger GA, Alidaee B (1998) Adaptive memory tabu search for binary quadratic programs. Manag Sci 44(3):336\u2013345","journal-title":"Manag Sci"},{"issue":"3","key":"10_CR44","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, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10_CR45","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"JP Hart","year":"1987","unstructured":"Hart JP, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6(3):107\u2013114","journal-title":"Oper Res Lett"},{"key":"10_CR46","unstructured":"Harvey WD, Ginsberg ML (1995) Limited discrepancy search. In: Mellish CS (ed) Proceedings of the fourteenth international joint conference on artificial intelligence (IJCAI-95). Morgan Kaufmann Publishers, pp 607\u2013615"},{"issue":"14","key":"10_CR47","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"SR Hejazi","year":"2005","unstructured":"Hejazi SR, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43(14):2895\u20132929","journal-title":"Int J Prod Res"},{"key":"10_CR48","volume-title":"Stochastic local search\u2014foundations and applications","author":"HH Hoos","year":"2005","unstructured":"Hoos HH, St\u00fctzle T (2005) Stochastic local search\u2014foundations and applications. Morgan Kaufmann Publishers, San Francisco"},{"issue":"1","key":"10_CR49","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2017.02.013","volume":"261","author":"DL Huerta-Mu\u00f1oz","year":"2017","unstructured":"Huerta-Mu\u00f1oz DL, R\u00edos-Mercado RZ, Ruiz R (2017) An iterated greedy heuristic for a market segmentation problem with multiple attributes. Eur J Oper Res 261(1):75\u201387","journal-title":"Eur J Oper Res"},{"issue":"7","key":"10_CR50","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"42","author":"LW Jacobs","year":"1995","unstructured":"Jacobs LW, Brusco MJ (1995) A local search heuristic for large set-covering problems. Nav Res Logist 42(7):1129\u20131140","journal-title":"Nav Res Logist"},{"key":"10_CR51","first-page":"369","volume-title":"The traveling salesman problem and its variations","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, McGeoch LA (2002) Experimental analysis of heuristics for the STSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, pp 369\u2013443"},{"key":"10_CR52","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"DE Joslin","year":"1999","unstructured":"Joslin DE, Clements DP (1999) Squeaky wheel optimization. J Artif Intell Res 10:353\u2013373","journal-title":"J Artif Intell Res"},{"issue":"8","key":"10_CR53","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.jpdc.2013.03.008","volume":"73","author":"Q Kang","year":"2013","unstructured":"Kang Q, He H, Wei J (2013) An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems. J Parallel Distrib Comput 73(8): 1106\u20131115","journal-title":"J Parallel Distrib Comput"},{"key":"10_CR54","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ins.2014.03.127","volume":"279","author":"K Karabulut","year":"2014","unstructured":"Karabulut K, Tasgetiren FM (2014) A variable iterated greedy algorithm for the traveling salesman problem with time windows. Inform Sci 279:383\u2013395","journal-title":"Inform Sci"},{"issue":"10","key":"10_CR55","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1080\/0305215X.2016.1261247","volume":"49","author":"JS Kim","year":"2017","unstructured":"Kim JS, Park JH, Lee DH (2017) Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups. Eng Optim 49(10):1719\u20131732","journal-title":"Eng Optim"},{"key":"10_CR56","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"issue":"16","key":"10_CR57","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","volume":"51","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC, Huang CY (2013) Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int J Prod Res 51(16):5029\u20135038","journal-title":"Int J Prod Res"},{"issue":"1","key":"10_CR58","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2011.04.018","volume":"214","author":"M Lozano","year":"2011","unstructured":"Lozano M, Molina D, Garc\u00eda-Mart\u00ednez C (2011) Iterated greedy for the maximum diversity problem. Eur J Oper Res 214(1):31\u201338","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10_CR59","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1080\/0740817X.2013.768785","volume":"46","author":"M Lozano","year":"2014","unstructured":"Lozano M, Glover F, Garc\u00eda-Mart\u00ednez C, Rodr\u00edguez FJ, Mart\u00ed R (2014) Tabu search with strategic oscillation for the quadratic minimum spanning tree. IIE Trans 46(4): 414\u2013428","journal-title":"IIE Trans"},{"issue":"4","key":"10_CR60","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J Comput 11(4):358\u2013369","journal-title":"INFORMS J Comput"},{"key":"10_CR61","unstructured":"Marchiori E, Steenbeek AG (1998) An iterated heuristic algorithm for the set covering problem. In: Mehlhorn K (ed) Algorithm engineering, 2nd international workshop (WAE\u201992). Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, pp 155\u2013166"},{"key":"10_CR62","series-title":"Lecture notes in computer science","first-page":"367","volume-title":"Real-world applications of evolutionary computing, EvoWorkshops 2000","author":"E Marchiori","year":"2000","unstructured":"Marchiori E, Steenbeek AG (2000) An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Cagnoni S et al (eds) Real-world applications of evolutionary computing, EvoWorkshops 2000. Lecture notes in computer science, vol 1803. Springer, Heidelberg, pp 367\u2013381"},{"key":"10_CR63","first-page":"200","volume-title":"Proceedings of the fourteenth international conference on automated planning and scheduling (ICAPS 2004)","author":"LD Michel","year":"2004","unstructured":"Michel LD, van Hentenryck P (2004) Iterative relaxations for iterative flattening in cumulative scheduling. In: Zilberstein S, Koehler J, Koenig S (eds) Proceedings of the fourteenth international conference on automated planning and scheduling (ICAPS 2004). AAAI Press\/MIT Press, Menlo Park, pp 200\u2013208"},{"issue":"11","key":"10_CR64","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.cor.2011.01.010","volume":"38","author":"G Minella","year":"2011","unstructured":"Minella G, Ruiz R, Ciavotta M (2011) Restarted iterated pareto greedy algorithm for multi-objective flowshop scheduling problems. Comput Oper Res 38(11):1521\u20131533","journal-title":"Comput Oper Res"},{"issue":"5\u20136","key":"10_CR65","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0950-7051(03)00027-3","volume":"16","author":"A Misevi\u010dius","year":"2003","unstructured":"Misevi\u010dius A (2003) Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem. Knowl Based Syst 16(5\u20136):261\u2013268","journal-title":"Knowl Based Syst"},{"key":"10_CR66","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/3-540-45105-6_71","volume-title":"Genetic and evolutionary computation \u2013 GECCO 2003, part I","author":"A Misevi\u010dius","year":"2003","unstructured":"Misevi\u010dius A (2003) Ruin and recreate principle based approach for the quadratic assignment problem. In: Cant\u00fa-Paz E et al (eds) Genetic and evolutionary computation \u2013 GECCO 2003, part I. Lecture notes in computer science, vol 2723. Springer, Heidelberg, pp 598\u2013609"},{"key":"10_CR67","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2012","unstructured":"Montgomery DC (2012) Design and analysis of experiments, 8th edn. Wiley, New York","edition":"8"},{"issue":"1","key":"10_CR68","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore E Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"5","key":"10_CR69","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.engappai.2008.03.003","volume":"21","author":"A Oddi","year":"2008","unstructured":"Oddi A, Cesta A, Policella N, Smith SF (2008) Combining variants of iterative flattening search. Eng Appl Artif Intell 21(5):683\u2013690","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"10_CR70","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10845-008-0163-8","volume":"21","author":"A Oddi","year":"2010","unstructured":"Oddi A, Cesta A, Policella N, Smith SF (2010) Iterative flattening search for resource constrained scheduling. J Intell Manuf 21(1):17\u201330","journal-title":"J Intell Manuf"},{"key":"10_CR71","first-page":"1991","volume-title":"Proceedings of the twenty-second international joint conference on artificial intelligence (IJCAI-11)","author":"A Oddi","year":"2011","unstructured":"Oddi A, Rasconi R, Cesta A, Smith SF (2011) Iterative flattening search for the flexible job shop scheduling problem. In: Walsh T (ed) Proceedings of the twenty-second international joint conference on artificial intelligence (IJCAI-11). IJCAI\/AAAI Press, Menlo Park, pp 1991\u20131996"},{"key":"10_CR72","first-page":"297","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26:297\u2013307","journal-title":"Int J Prod Res"},{"issue":"1","key":"10_CR73","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) Local search methods for the flowshop scheduling problem with flowtime minimization. Eur J Oper Res 222(1):31\u201343","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10_CR74","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","volume":"44","author":"QK Pan","year":"2014","unstructured":"Pan QK, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem. Omega 44(1):41\u201350","journal-title":"Omega"},{"issue":"7\u20138","key":"10_CR75","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","volume":"38","author":"QK Pan","year":"2008","unstructured":"Pan QK, Wang L, Zhao BH (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Tech 38(7\u20138): 778\u2013786","journal-title":"Int J Adv Manuf Tech"},{"key":"10_CR76","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/978-3-319-07617-1_51","volume-title":"Hybrid artificial intelligence systems \u2013 9th international conference (HAIS 2014), Salamanca, 11\u201313 June 2014. Proceedings","author":"JA Pedraza","year":"2014","unstructured":"Pedraza JA, Garc\u00eda-Mart\u00ednez C, Cano A, Ventura S (2014) Classification rule mining with iterated greedy. In: Polycarpou MM, de Carvalho ACPLF, Pan J, Wozniak M, Quinti\u00e1n H, Corchado E (eds) Hybrid artificial intelligence systems \u2013 9th international conference (HAIS 2014), Salamanca, 11\u201313 June 2014. Proceedings. Lecture notes in computer science, vol 8480. Springer, Heidelberg, pp 585\u2013596"},{"issue":"8","key":"10_CR77","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435","journal-title":"Comput Oper Res"},{"key":"10_CR78","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin JY (eds) (2010) Handbook of metaheuristics. International series in operations research & management science, vol 146, 2nd edn. Springer, New York, pp 399\u2013419","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"10_CR79","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.compenvurbsys.2013.01.006","volume":"39","author":"J Porta","year":"2013","unstructured":"Porta J, Parapar J, Doallo R, Barbosa V, Sant\u00e9 I, Crecente R, D\u00edaz C (2013) A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements. Comput Environ Urban Syst 39:12\u201326","journal-title":"Comput Environ Urban Syst"},{"issue":"4","key":"10_CR80","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","volume":"22","author":"M Pranzo","year":"2016","unstructured":"Pranzo M, Pacciarelli D (2016) An iterated greedy metaheuristic for the blocking job shop scheduling problem. J Heuristics 22(4):587\u2013611.","journal-title":"J Heuristics"},{"issue":"2","key":"10_CR81","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","volume":"37","author":"SF Rad","year":"2009","unstructured":"Rad SF, Ruiz R, Boroojerdian N (2009) New high performing heuristics for minimizing makespan in permutation flowshops. Omega 37(2):331\u2013345","journal-title":"Omega"},{"key":"10_CR82","unstructured":"Ramalhinho Louren\u00e7o H, Martin O, St\u00fctzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) (2002) Handbook of metaheuristics. Kluwer Academic Publishers, Norwell, pp 321\u2013353"},{"key":"10_CR83","first-page":"363","volume":"9","author":"H Ramalhinho Louren\u00e7o","year":"2010","unstructured":"Ramalhinho Louren\u00e7o H, Martin O, St\u00fctzle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin JY (eds) (2010) Handbook of metaheuristics. International series in operations research & management science, vol 146, 2nd edn. Springer, New York, chap 9, pp 363\u2013397","journal-title":"Springer, New York, chap"},{"key":"10_CR84","doi-asserted-by":"crossref","unstructured":"Resende MGC, Ribeiro CC (2010) Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau M, Potvin JY (eds) (2010) Handbook of metaheuristics. International series in operations research & management science, vol 146, 2nd edn. Springer, New York, pp 283\u2013319","DOI":"10.1007\/978-1-4419-1665-5_10"},{"issue":"3","key":"10_CR85","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293\u2013301","journal-title":"Omega"},{"issue":"2","key":"10_CR86","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/B:HEUR.0000026265.47626.23","volume":"10","author":"AJ Richmond","year":"2004","unstructured":"Richmond AJ, Beasley JE (2004) An iterative construction heuristic for the ore selection problem. J Heuristics 10(2):153\u2013167","journal-title":"J Heuristics"},{"key":"10_CR87","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-642-29124-1_15","volume-title":"Proceedings of EvoCOP 2012 \u2013 12th European conference on evolutionary computation in combinatorial optimization","author":"FJ Rodr\u00edguez","year":"2012","unstructured":"Rodr\u00edguez FJ, Blum C, Lozano M, Garc\u00eda-Mart\u00ednez C (2012) Iterated greedy algorithms for the maximal covering location problem. In: Hao JK, Middendorf M (eds) Proceedings of EvoCOP 2012 \u2013 12th European conference on evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol 7245. Springer, Heidelberg, pp 172\u2013181"},{"issue":"7","key":"10_CR88","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1016\/j.cor.2013.01.018","volume":"40","author":"FJ Rodriguez","year":"2013","unstructured":"Rodriguez FJ, Lozano M, Blum C, Garc\u00eda-Mart\u00ednez C (2013) An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Comput Oper Res 40(7):1829\u20131841","journal-title":"Comput Oper Res"},{"issue":"4","key":"10_CR89","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problme with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"key":"10_CR90","unstructured":"Rubin F (1974) An iterative technique for printed wire routing. In: Proceedings of the 11th design automation workshop (DAC\u201974). IEEE Press, pp 308\u2013313"},{"issue":"2","key":"10_CR91","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479\u2013494","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10_CR92","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10_CR93","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, St\u00fctzle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187(3):1143\u20131159","journal-title":"Eur J Oper Res"},{"key":"10_CR94","series-title":"Studies in computational intelligence","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-02836-6_2","volume-title":"Computational intelligence in flow shop and job shop scheduling","author":"R Ruiz","year":"2009","unstructured":"Ruiz R, Vallada E, Fern\u00e1ndez-Mart\u00ednez C (2009) Scheduling in flowshops with no-idle machines. In: Chakraborty UK (ed) Computational intelligence in flow shop and job shop scheduling. Studies in computational intelligence, vol 230. Springer, Berlin, pp 21\u201351"},{"issue":"2","key":"10_CR95","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J Comput Phys 159(2):139\u2013171","journal-title":"J Comput Phys"},{"key":"10_CR96","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming, CP98","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Principles and practice of constraint programming, CP98. Lecture notes in computer science, vol 1520. Springer, Heidelberg, pp 417\u2013431"},{"issue":"1","key":"10_CR97","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"\u00c9D Taillard","year":"1990","unstructured":"Taillard \u00c9D (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65\u201374","journal-title":"Eur J Oper Res"},{"issue":"4-5","key":"10_CR98","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard \u00c9D (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4-5):443\u2013455","journal-title":"Parallel Comput"},{"issue":"2","key":"10_CR99","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9D Taillard","year":"1993","unstructured":"Taillard \u00c9D (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2): 278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"7","key":"10_CR100","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"FM Tasgetiren","year":"2013","unstructured":"Tasgetiren FM, Pan QK, Suganthan PN, Buyukdagli O (2013) A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput Oper Res 40(7):1729\u20131743","journal-title":"Comput Oper Res"},{"key":"10_CR101","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK, Suganthan PN (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77: 111\u2013126","journal-title":"Comput Oper Res"},{"key":"10_CR102","doi-asserted-by":"crossref","unstructured":"Toyama F, Shoji K, Mori H, Miyamichi J (2012) An iterated greedy algorithm for the binary quadratic programming problem. In: Joint 6th international conference on soft computing and intelligent systems (SCIS) and 13th international symposium on advanced intelligent systems (ISIS), 2012. IEEE Press, pp 2183\u20132188","DOI":"10.1109\/SCIS-ISIS.2012.6505143"},{"key":"10_CR103","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/11844297_17","volume-title":"(2006) Proceedings of PPSN-IX, ninth international conference on parallel problem solving from nature","author":"S Tsutsui","year":"2006","unstructured":"Tsutsui S (2006) cAS: ant colony optimization with cunning ants. In: Runarsson TP, Beyer HG, Burke EK, Merelo JJ, Whitley LD, Yao X (eds) (2006) Proceedings of PPSN-IX, ninth international conference on parallel problem solving from nature. Lecture notes in computer science, vol 4193. Springer, Heidelberg, pp 162\u2013171"},{"key":"10_CR104","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1527\/tjsai.22.29","volume":"22","author":"S Tsutsui","year":"2007","unstructured":"Tsutsui S (2007) Ant colony optimization with cunning ants. Trans Jpn Soc Artif Intell 22: 29\u201336.","journal-title":"Trans Jpn Soc Artif Intell"},{"key":"10_CR105","doi-asserted-by":"crossref","unstructured":"Urlings T, Ruiz R (2007) Local search in complex scheduling problems. In: St\u00fctzle T, Birattari M, Hoos HH (eds) Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Lecture notes in computer science, vol 4638. Springer, Brussels, Belgium, pp 202\u2013206","DOI":"10.1007\/978-3-540-74446-7_18"},{"issue":"1","key":"10_CR106","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1504\/IJMHEUR.2010.033122","volume":"1","author":"T Urlings","year":"2010","unstructured":"Urlings T, Ruiz R, Sivrikaya-\u015eerifo\u011flu F (2010) Genetic algorithms for complex hybrid flexible flow line problems. Int J Metaheuristics 1(1):30\u201354","journal-title":"Int J Metaheuristics"},{"issue":"2","key":"10_CR107","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.ejor.2010.05.041","volume":"207","author":"T Urlings","year":"2010","unstructured":"Urlings T, Ruiz R, St\u00fctzle T (2010) Shifting representation search for hybrid flexible flowline problems. Eur J Oper Res 207(2):1086\u20131095.","journal-title":"Eur J Oper Res"},{"key":"10_CR108","unstructured":"Walsh T (1997) Depth-bounded discrepancy search. In: Pollack ME (ed) Proceedings of the fifteenth international joint conference on artificial intelligence (IJCAI-97). Morgan Kaufmann Publishers, pp 1388\u20131395"},{"key":"10_CR109","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/11839088_16","volume-title":"Ant colony optimization and swarm intelligence, 5th international workshop, ANTS 2006","author":"W Wiesemann","year":"2006","unstructured":"Wiesemann W, St\u00fctzle T (2006) Iterated ants: an experimental study for the quadratic assignment problem. In: Dorigo M, et al. (eds) Ant colony optimization and swarm intelligence, 5th international workshop, ANTS 2006. Lecture notes in computer science, vol 4150. Springer, Heidelberg, pp 179\u2013190"},{"issue":"6","key":"10_CR110","first-page":"810","volume":"60","author":"KC Ying","year":"2008","unstructured":"Ying KC (2008) An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. IEEE Trans Evol Comput 60(6):810\u2013817","journal-title":"IEEE Trans Evol Comput"},{"issue":"3\u20134","key":"10_CR111","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/s00170-007-1104-y","volume":"38","author":"KC Ying","year":"2008","unstructured":"Ying KC (2008) Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. Int J Adv Manuf Tech 38(3\u20134):348\u2013354","journal-title":"Int J Adv Manuf Tech"},{"issue":"3","key":"10_CR112","doi-asserted-by":"crossref","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"KC Ying","year":"2009","unstructured":"Ying KC, Lin SW, Huang CY (2009) Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst Appl 36(3):7087\u20137092","journal-title":"Expert Syst Appl"},{"key":"10_CR113","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-540-88439-2_8","volume-title":"Hybrid metaheuristics","author":"Z Yuan","year":"2008","unstructured":"Yuan Z, F\u00fcgenschuh A, Homfeld H, Balaprakash P, St\u00fctzle T, Schoch M (2008) Iterated greedy algorithms for a real-world cyclic train scheduling problem. In: Blesa MJ, Blum C, Cotta C, Fern\u00e1ndez AJ, Gallardo JE, Roli A, Sampels M (eds) Hybrid metaheuristics. Lecture notes in computer science, vol 5296. Springer, Heidelberg, pp 102\u2013116"},{"issue":"3","key":"10_CR114","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73\u201383","journal-title":"AI Mag"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T03:21:03Z","timestamp":1571714463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":114,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_10","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}