{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T04:46:04Z","timestamp":1766983564984},"publisher-location":"Cham","reference-count":83,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"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_44","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"1197-1220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Heuristics"],"prefix":"10.1007","author":[{"given":"Rub\u00e9n","family":"Ruiz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391\u2013401","DOI":"10.1287\/mnsc.34.3.391"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"B\u0142a\u017cewicz J, Ecker KH, Pesch E, Schmidt G, We\u0327glarz J (2001) Scheduling computer and manufacturing processes, 2nd edn. Springer, Berlin","DOI":"10.1007\/978-3-662-04363-9"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283","DOI":"10.1287\/opre.1110.0975"},{"key":"44_CR4","unstructured":"Blackstone JH Jr, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufactuing job shop operations. Int J Prod Res 20(1):27\u201345"},{"key":"44_CR5","unstructured":"Briskorn D (2008) Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms. Lecture notes in economics and mathematical systems, vol 603. Springer, Berlin\/Heidelberg"},{"key":"44_CR6","unstructured":"Brucker P (2007) Scheduling algorithms, 5th edn. Springer, New York"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discret Appl Math 49(1\u20133):107\u2013127","DOI":"10.1016\/0166-218X(94)90204-6"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Cai X, Wu X, Zhou X (2014) Optimal stochastic scheduling. International series in operations research & management science, vol 207. Springer, New York","DOI":"10.1007\/978-1-4899-7405-1"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Carlier J (1982) The one-machine sequencing problem. Eur J Oper Res 11(1):42\u201347","DOI":"10.1016\/S0377-2217(82)80007-6"},{"key":"44_CR10","unstructured":"Chakraborty UK, Laha D (2007) An improved heuristic for permutation flowshop scheduling. Int J Inf Commun Technol 1(1):89\u201397"},{"key":"44_CR11","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.ejor.2012.12.031"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Dong XY, Huang HK, Chen P (2006) A more effective constructive algorithm for permutation flowshop problem. In: Intelligent data engineering and automated learning (IDEAL 2006). lecture notes in computer science, vol 4224. Springer, Berlin\/New York (Beijing Jiaotong Univ, Sch Comp & IT, Beijing 100044, Peoples R China), pp 25\u201332","DOI":"10.1007\/11875581_3"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Dong XY, Huang HK, Chen P (2008) An improved NEH-based heuristic for the permutation flowshop problem. Comput Oper Res 35(12):3962\u20133968","DOI":"10.1016\/j.cor.2007.05.005"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Dudek RA, Panwalkar SS, Smith ML (1992) The lessons of flowshop scheduling research. Oper Res 40(1):7\u201313","DOI":"10.1287\/opre.40.1.7"},{"key":"44_CR15","unstructured":"El-Ghazali T (2009) Metaheuristics: from design to implementation. Wiley, New York"},{"key":"44_CR16","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.ejor.2010.03.030"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Fernandez-Viagas V, Framinan JM (2014) On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput Oper Res 45:60\u201367","DOI":"10.1016\/j.cor.2013.12.012"},{"key":"44_CR18","doi-asserted-by":"crossref","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","DOI":"10.1080\/00207543.2014.948578"},{"key":"44_CR19","unstructured":"Ford FN, Bradbard DA, Ledbetter WN, Cox JF (1987) Use of operations research in production management. Prod Invent Manag 28(3):59\u201362"},{"key":"44_CR20","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"},{"key":"44_CR21","unstructured":"Framinan JM, Ruiz R (2010) Architecture of manufacturing scheduling systems: literature review and an integrated proposal. Eur J Oper Res 205(2):237\u2013246"},{"key":"44_CR22","unstructured":"Framinan JM, Ruiz R (2012) Guidelines for the deployment and implementation of manufacturing scheduling systems. Int J Prod Res 50(7):1799\u20131812"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Framinan JM, Leisten R, Rajendran C (2003) Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int J Prod Res 41(1):121\u2013148","DOI":"10.1080\/00207540210161650"},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"Framinan JM, Leisten R, Ruiz R (2014) Manufacturing scheduling systems. An integrated view on models, methods and tools. Springer, New York","DOI":"10.1007\/978-1-4471-6272-8"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","DOI":"10.1137\/0117039"},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Graves SC (1981) A review of production scheduling. Oper Res 29(4):646\u2013675","DOI":"10.1287\/opre.29.4.646"},{"key":"44_CR27","unstructured":"Grosche T (2009) Computational intelligence in integrated airline scheduling. Studies in computational intelligence, vol 173. Springer, New York"},{"key":"44_CR28","doi-asserted-by":"crossref","unstructured":"Haupt R (1989) A survey or priority rule-based scheduling. OR Spectr 11(1):3\u201316","DOI":"10.1007\/BF01721162"},{"key":"44_CR29","unstructured":"Hoos HH, St\u00fctzle T (2005) Stochastic local search: foundations and applications. Morgan Kaufmann, San Francisco"},{"key":"44_CR30","unstructured":"Hopp WJ, Spearman ML (2011) Factory physics, 3rd edn. Waveland Press Inc., Long Grove"},{"key":"44_CR31","unstructured":"Jayamohan MS, Rajendran C (2000) New dispatching rules for shop scheduling: a step forward. Int J Prod Res 38(3):563\u2013586"},{"key":"44_CR32","doi-asserted-by":"crossref","unstructured":"Jin F, Song SJ, Wu C (2007) An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems. IIE Trans 39(2):229\u2013234","DOI":"10.1080\/07408170600735553"},{"key":"44_CR33","unstructured":"Kalczynski PJ, Kamburowski J (2007) On the NEH heuristic for minimizing the makespan in permutation flow shops. OMEGA Int J Manag Sci 35(1):53\u201360"},{"key":"44_CR34","unstructured":"Kalczynski PJ, Kamburowski J (2008) An improved NEH heuristic to minimize makespan in permutation flow shops. Comput Oper Res 35(9):3001\u20133008"},{"key":"44_CR35","unstructured":"Kalczynski PJ, Kamburowski J (2009) An empirical analysis of the optimality rate of flow shop heuristics. Eur J Oper Res 198(1):93\u2013101"},{"key":"44_CR36","doi-asserted-by":"crossref","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","DOI":"10.1287\/trsc.1090.0301"},{"key":"44_CR37","unstructured":"Ledbetter WN, Cox JF (1977) Operations research in production management: an investigation of past and present utilisation. Prod Invent Manag 18(3):84\u201391"},{"key":"44_CR38","doi-asserted-by":"crossref","unstructured":"Lee YH, Bhaskaran K, Pinedo ML (1997) A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans 29(1):45\u201352","DOI":"10.1080\/07408179708966311"},{"key":"44_CR39","doi-asserted-by":"crossref","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"44_CR40","doi-asserted-by":"crossref","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","DOI":"10.1080\/00207543.2013.790571"},{"key":"44_CR41","unstructured":"MacCarthy BL, Liu J (1993) Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. Int J Prod Res 31(1):59\u201379"},{"key":"44_CR42","unstructured":"McKay KN, Wiers VCS (1999) Unifying the theory and practice of production scheduling. J Manuf Syst 18(4):241\u2013255"},{"key":"44_CR43","unstructured":"McKay KN, Wiers VCS (2004) Practical production control. A survival guide for planners and schedulers. J. Ross Publishing Inc., Boca Raton"},{"key":"44_CR44","unstructured":"McKay KN, Wiers VCS (2006) The human factor in planning and scheduling, chap 2. In: Herrmann JW (ed) Handbook of production scheduling. International series in operations research & management science, vol 89. Springer, New York, pp 23\u201357"},{"key":"44_CR45","doi-asserted-by":"crossref","unstructured":"McKay KN, Safayeni FR, Buzacott JA (1988) Job-shop scheduling theory: what is relevant? Interfaces 4(18):84\u201390","DOI":"10.1287\/inte.18.4.84"},{"key":"44_CR46","doi-asserted-by":"crossref","unstructured":"McKay KN, Pinedo ML, Webster S (2002) Practice-focused research issues for scheduling systems. Prod Oper Manag 11(2):249\u2013258","DOI":"10.1111\/j.1937-5956.2002.tb00494.x"},{"key":"44_CR47","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.cor.2011.01.010"},{"key":"44_CR48","unstructured":"Morton TE, Pentico DW (1993) Heuristic scheduling sysmtems with applications to production systems and project management. Wiley series in engineering & technology management. Wiley, Hoboken"},{"issue":"1","key":"44_CR49","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int J Manag Sci 11(1):91\u201395","journal-title":"OMEGA Int J Manag Sci"},{"issue":"1","key":"44_CR50","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1111\/j.1475-3995.1995.tb00003.x","volume":"2","author":"J Olhager","year":"1995","unstructured":"Olhager J, Rapp B (1995) Operations research techniques in manufacturing planning and control systems. Int Trans Oper Res 2(1):29\u201343","journal-title":"Int Trans Oper Res"},{"key":"44_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition methods for complex factory scheduling problems","author":"IM Ovacik","year":"1997","unstructured":"Ovacik IM, Uzsoy R (1997) Decomposition methods for complex factory scheduling problems. Springer, New York"},{"issue":"1","key":"44_CR52","doi-asserted-by":"publisher","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":"44_CR53","doi-asserted-by":"publisher","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 Int J Manag Sci 44(1):41\u201350","journal-title":"OMEGA Int J Manag Sci"},{"issue":"7\u20138","key":"44_CR54","doi-asserted-by":"publisher","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 Technol 38(7\u20138):778\u2013786","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"44_CR55","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45\u201361","journal-title":"Oper Res"},{"key":"44_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0910-7","volume-title":"Planning and scheduling in manufacturing and services","author":"ML Pinedo","year":"2009","unstructured":"Pinedo ML (2009) Planning and scheduling in manufacturing and services, 2nd edn. Springer, New York","edition":"2"},{"key":"44_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling: theory, algorithms and systems, 4th edn. Springer, New York","edition":"4"},{"issue":"2","key":"44_CR58","doi-asserted-by":"publisher","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 Int J Manag Sci 37(2):331\u2013345","journal-title":"OMEGA Int J Manag Sci"},{"key":"44_CR59","unstructured":"Randolph H (ed) (2012) Handbook of healthcare system scheduling. International series in operations research & management science, vol 168. Springer, New York"},{"issue":"3","key":"44_CR60","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/17.618173","volume":"44","author":"A Reisman","year":"1997","unstructured":"Reisman A, Kumar A, Motwani J (1997) Flowshop scheduling\/sequencing research: a statistical review of the literature, 1952\u20131994. IEEE Trans Eng Manag 44(3):316\u2013329","journal-title":"IEEE Trans Eng Manag"},{"issue":"8","key":"44_CR61","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Framinan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439\u20131454","journal-title":"Comput Oper Res"},{"issue":"3","key":"44_CR62","doi-asserted-by":"publisher","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 Int J Manag Sci 39(3):293\u2013301","journal-title":"OMEGA Int J Manag Sci"},{"key":"44_CR63","volume-title":"Machine scheduling problems: classification, complexity and computations","author":"AHG Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan AHG (1976) Machine scheduling problems: classification, complexity and computations. Martinus Nijhoff, The Hague"},{"issue":"2","key":"44_CR64","doi-asserted-by":"publisher","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":"44_CR65","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 (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":"44_CR66","doi-asserted-by":"publisher","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"},{"issue":"1","key":"44_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flowshop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"44_CR68","series-title":"Studies in computational intelligence","doi-asserted-by":"publisher","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"},{"key":"44_CR69","volume-title":"Stochastic scheduling. Expectation-variance analysis of a schedule","author":"SC Sarin","year":"2014","unstructured":"Sarin SC, Nagarajan B, Liao L (2014) Stochastic scheduling. Expectation-variance analysis of a schedule. Cambridge University Press, Cambridge"},{"issue":"1","key":"44_CR70","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen K (2015) Metaheuristics \u2013 the metaphor exposed. Int Trans Oper Res 22(1):3\u201318","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"44_CR71","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):67\u201374","journal-title":"Eur J Oper Res"},{"issue":"2","key":"44_CR72","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"key":"44_CR73","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V T\u2019Kindt","year":"2006","unstructured":"T\u2019Kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, New York","edition":"2"},{"issue":"1","key":"44_CR74","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0305-0483(87)90054-5","volume":"15","author":"S Turner","year":"1987","unstructured":"Turner S, Booth D (1987) Comparison of heuristics for flow shop sequencing. OMEGA Int J Manag Sci 15(1):75\u201378","journal-title":"OMEGA Int J Manag Sci"},{"key":"44_CR75","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-74446-7_18","volume-title":"Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics","author":"T Urlings","year":"2007","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, pp 202\u2013206"},{"issue":"1","key":"44_CR76","doi-asserted-by":"publisher","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. International Journal of Metaheuristics 1(1):30\u201354","journal-title":"International Journal of Metaheuristics"},{"issue":"2","key":"44_CR77","doi-asserted-by":"publisher","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. European Journal of Operational Research 207(2):1086\u20131095","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"44_CR78","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ejor.2007.11.049","volume":"193","author":"E Vallada","year":"2009","unstructured":"Vallada E, Ruiz R (2009) Cooperative metaheuristics for the permutation flowshop scheduling problem. Eur J Oper Res 193(2):365\u2013376","journal-title":"Eur J Oper Res"},{"issue":"8","key":"44_CR79","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen APJ, Morton TE (1987) Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs. Manag Sci 33(8):1036\u20131047","journal-title":"Manag Sci"},{"issue":"2","key":"44_CR80","first-page":"117","volume":"33","author":"A Vignier","year":"1999","unstructured":"Vignier A, Billaut JC, Proust C (1999) Les probl\u00e8mes d\u2019ordonnancement de type flow-shop hybride: \u00c9tat de l\u2019art. RAIRO Recherche op\u00e9rationnelle 33(2):117\u2013183 (in French)","journal-title":"RAIRO Recherche op\u00e9rationnelle"},{"issue":"2","key":"44_CR81","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4018\/jamc.2010040104","volume":"1","author":"D Weyland","year":"2010","unstructured":"Weyland D (2010) A rigorous analysis of the harmony search algorithm: how the research community can be misled by a \u201cnovel\u201d methodology. Int J Appl Metaheuristic Comput 1(2):50\u201360","journal-title":"Int J Appl Metaheuristic Comput"},{"issue":"6","key":"44_CR82","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":"44_CR83","doi-asserted-by":"publisher","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 Technol 38(3\u20134):348\u2013354","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:23:39Z","timestamp":1571729019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_44","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}