{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T04:49:57Z","timestamp":1770958197702,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61100144"],"award-info":[{"award-number":["61100144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370183"],"award-info":[{"award-number":["61370183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61262011"],"award-info":[{"award-number":["61262011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"New Century Excellent Talents in University"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1016\/j.cor.2014.04.009","type":"journal-article","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T14:30:27Z","timestamp":1398868227000},"page":"47-60","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"special_numbering":"C","title":["A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times"],"prefix":"10.1016","volume":"50","author":[{"given":"Hongyun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aihua","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liji","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udo","family":"Buscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2014.04.009_bib1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1977","journal-title":"Ann Discret Math"},{"key":"10.1016\/j.cor.2014.04.009_bib2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann Discret Math"},{"key":"10.1016\/j.cor.2014.04.009_bib3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann Discret Math"},{"issue":"2","key":"10.1016\/j.cor.2014.04.009_bib4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","article-title":"A survey of algorithms for the single machine total weighted tardiness scheduling problem","volume":"26","author":"Abdul-Razaq","year":"1990","journal-title":"Discret Appl Math"},{"issue":"2","key":"10.1016\/j.cor.2014.04.009_bib5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","article-title":"A branch and bound algorithm for the total weighted tardiness problem","volume":"33","author":"Potts","year":"1985","journal-title":"Oper Res"},{"issue":"3","key":"10.1016\/j.cor.2014.04.009_bib6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","article-title":"Dynamic programming and decomposition approaches for the single machine total tardiness problem","volume":"32","author":"Potts","year":"1987","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.04.009_bib7","unstructured":"Ragatz GL, A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. In: Proceedings of twenty-fourth annual meeting of the decision sciences institute. John Wiley & Sons, Inc.; 1993. p. 1375\u20137."},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.amc.2006.05.127","article-title":"A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness","volume":"183","author":"Luo","year":"2006","journal-title":"Appl Math Comput"},{"issue":"4","key":"10.1016\/j.cor.2014.04.009_bib9","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","article-title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","volume":"5","author":"Bigras","year":"2008","journal-title":"Discret Optim"},{"key":"10.1016\/j.cor.2014.04.009_bib10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.cor.2012.07.004","article-title":"An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times","volume":"40","author":"Tanaka","year":"2013","journal-title":"Comput Oper Res"},{"issue":"8","key":"10.1016\/j.cor.2014.04.009_bib11","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","article-title":"Priority rules for job shops with weighted tardiness costs","volume":"33","author":"Vepsalainen","year":"1987","journal-title":"Manag Sci"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","article-title":"A heuristic to minimize the total weighted tardiness with sequence-dependent setups","volume":"29","author":"Lee","year":"1997","journal-title":"IIE Trans"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-005-6997-8","article-title":"Enhancing stochastic search performance by value-biased randomization of heuristics","volume":"11","author":"Cicirello","year":"2005","journal-title":"J Heuristics"},{"issue":"11\u201312","key":"10.1016\/j.cor.2014.04.009_bib14","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/s00170-006-0693-1","article-title":"Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics","volume":"34","author":"Lin","year":"2007","journal-title":"Int J Adv Manuf Technol"},{"key":"10.1016\/j.cor.2014.04.009_bib15","doi-asserted-by":"crossref","unstructured":"Cicirello VA. Non-wrapping order crossover: an order preserving crossover operator that respects absolute position. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, Seattle, WA, USA; 2006. p. 1125\u201332.","DOI":"10.1145\/1143997.1144177"},{"issue":"7","key":"10.1016\/j.cor.2014.04.009_bib16","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2005.07.020","article-title":"An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups","volume":"34","author":"Liao","year":"2007","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib17","first-page":"44","article-title":"A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem","volume":"5","author":"Anghinolfi","year":"2008","journal-title":"Int J Oper Res"},{"issue":"7","key":"10.1016\/j.cor.2014.04.009_bib18","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1016\/j.cor.2006.11.004","article-title":"Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups","volume":"35","author":"Valente","year":"2008","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","article-title":"A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times","volume":"193","author":"Anghinolfi","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"6","key":"10.1016\/j.cor.2014.04.009_bib20","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","article-title":"A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times","volume":"36","author":"Tasgetiren","year":"2009","journal-title":"Comput Oper Res"},{"issue":"7","key":"10.1016\/j.cor.2014.04.009_bib21","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","article-title":"A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine","volume":"39","author":"Kirlik","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.cor.2014.04.009_bib22","doi-asserted-by":"crossref","unstructured":"Xu H, L\u00fc Z, Cheng TCE. Iterated Local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. J Sched 2013, 10.1007\/s10951-013-0351-z.","DOI":"10.1007\/s10951-013-0351-z"},{"issue":"7","key":"10.1016\/j.cor.2014.04.009_bib23","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1080\/095372800432188","article-title":"A genetic algorithm for scheduling on a single machine with set-up times and due dates","volume":"11","author":"Armentano","year":"2000","journal-title":"Prod Plan Control"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","article-title":"A memetic algorithm for the total tardiness single machine scheduling problem","volume":"132","author":"Fran\u00e7a","year":"2001","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.04.009_bib25","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","article-title":"Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times","volume":"53","author":"Gagn\u00e9","year":"2002","journal-title":"J Oper Res Soc"},{"issue":"2","key":"10.1016\/j.cor.2014.04.009_bib26","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","article-title":"Algorithms for single machine total tardiness scheduling with sequence dependent setups","volume":"175","author":"Gupta","year":"2006","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1016\/j.cor.2014.04.009_bib27","doi-asserted-by":"crossref","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","article-title":"Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic","volume":"36","author":"Ying","year":"2009","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.cor.2014.04.009_bib28","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE congress on evolutionary computation, Oregon, Portland, vol. 2; 2004. p. 1412\u20139.","DOI":"10.1109\/CEC.2004.1331062"},{"issue":"22","key":"10.1016\/j.cor.2014.04.009_bib29","doi-asserted-by":"crossref","first-page":"4737","DOI":"10.1080\/00207540600620849","article-title":"Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem","volume":"44","author":"Tasgetiren","year":"2006","journal-title":"Int J Prod Res"},{"key":"10.1016\/j.cor.2014.04.009_bib30","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1016\/j.ejor.2005.10.030","article-title":"A tabu search algorithm for the single machine total weighted tardiness problem","volume":"176","author":"\u00dc","year":"2007","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.cor.2014.04.009_bib31","doi-asserted-by":"crossref","first-page":"3857","DOI":"10.1016\/j.eswa.2008.02.040","article-title":"An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem","volume":"36","author":"Chou","year":"2009","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.cor.2014.04.009_bib32","doi-asserted-by":"crossref","first-page":"2105","DOI":"10.1016\/j.cor.2008.07.009","article-title":"A population-based variable neighbourhood search for the single machine total weighted tardiness problem","volume":"36","author":"Wang","year":"2009","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.cor.2014.04.009_bib33","unstructured":"Nagata Y, Kobayashi S. Edge assembly crossover: a high-power genetic algorithm for the travelling salesman problem. In: Thomas Back (Ed.). Proceedings of the 7th international conference on genetic algorithms. Morgan Kaufmann, San Francisco, CA; 1997. p. 450\u20137."},{"issue":"4","key":"10.1016\/j.cor.2014.04.009_bib34","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","article-title":"Hybrid evolutionary algorithms for graph coloring","volume":"3","author":"Galinier","year":"1999","journal-title":"J Comb Optim"},{"key":"10.1016\/j.cor.2014.04.009_bib35","doi-asserted-by":"crossref","unstructured":"Moscato P, Cotta C, Mendes A. Memetic algorithms. In: New optimization techniques in engineering. Berlin, Heidelberg: Springer; 2004. p. 53\u201385.","DOI":"10.1007\/978-3-540-39930-8_3"},{"issue":"2","key":"10.1016\/j.cor.2014.04.009_bib36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1057\/jors.2010.138","article-title":"Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods","volume":"62","author":"Xu","year":"2010","journal-title":"J Oper Res Soc"},{"issue":"5","key":"10.1016\/j.cor.2014.04.009_bib37","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","article-title":"A multilevel memetic approach for improving graph k-partitions","volume":"15","author":"Benlic","year":"2011","journal-title":"IEEE Trans Evol Comput"},{"key":"10.1016\/j.cor.2014.04.009_bib38","doi-asserted-by":"crossref","unstructured":"Falkenauer E, Bouffouix S. A genetic algorithm for job shop. In: IEEE international conference on proceedings of robotics and automation. IEEE, Sacramento, California, USA; 1991. p. 824\u20139.","DOI":"10.1109\/ROBOT.1991.131689"},{"key":"10.1016\/j.cor.2014.04.009_bib39","series-title":"Handbook of genetic algorithms","first-page":"332","article-title":"Schedule optimization using genetic algorithms","author":"Syswerda","year":"1990"},{"issue":"1","key":"10.1016\/j.cor.2014.04.009_bib40","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","article-title":"Scheduling in a sequence dependent setup environment with genetic search","volume":"22","author":"Rubin","year":"1995","journal-title":"Comput Oper Res"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054814001002?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0305054814001002?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T10:53:32Z","timestamp":1538650412000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054814001002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":40,"alternative-id":["S0305054814001002"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2014.04.009","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2014.04.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}