{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:11:15Z","timestamp":1729613475508,"version":"3.28.0"},"reference-count":52,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/cec.2016.7744157","type":"proceedings-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T17:22:49Z","timestamp":1480526569000},"page":"2911-2918","source":"Crossref","is-referenced-by-count":9,"title":["A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times"],"prefix":"10.1109","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yucel","family":"Ozturkoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angela H. L","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.030"},{"key":"ref38","first-page":"490","article-title":"A new GRASP and path relinking for single machine scheduling with sequence dependent setups. In Control and Automation (ICCA)","author":"luo","year":"2013","journal-title":"2013 10th IEEE International Conference On IEEE"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-006-0693-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.10.044"},{"key":"ref31","first-page":"30","article-title":"A Max-Min Ant System to Minimize Total Tardiness on a Single Machine with Sequence Dependent Setup Times Implementing a Limited Budget Local Search","volume":"6","author":"mandahawi","year":"2011","journal-title":"International Journal of Research and Reviews in Applied Sciences"},{"key":"ref30","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":"International Journal of Operations Research"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-009-0253-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.11.022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.08.033"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.06.007"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-005-6997-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(98)00042-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.020"},{"article-title":"Decision theory: an introduction to the mathematics of rationality","year":"1986","author":"french","key":"ref2"},{"key":"ref1","first-page":"141.1","article-title":"The Single Machine Total Weighted Tardiness Problem-Is it (for Metaheuristics) a Solved Problem?","author":"geiger","year":"2009","journal-title":"Proceedings of the 8th Metaheuristics International Conference MIC 2009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(97)00024-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00140-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/095372800432188"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/07408179908969810"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(99)00050-X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.11.004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601390"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1999.6413"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow shop scheduling","volume":"17","author":"osman","year":"1989","journal-title":"Omega"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.2.363"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(87)80008-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.08.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.33.8.1035"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/07408179708966311"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/07408179108963868"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(98)00072-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(95)00084-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90185-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0021-K"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70742-8"},{"journal-title":"Operations Scheduling with Applications in Manufacturing and Services","year":"1999","author":"pinedo","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00117-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.483"},{"key":"ref7","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 Discrete Math"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90103-J"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2012.723054"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.883472"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.01.043"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.04.009"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.07.050"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.05.017"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0351-z"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.004"}],"event":{"name":"2016 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2016,7,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2016,7,29]]}},"container-title":["2016 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7636124\/7743769\/07744157.pdf?arnumber=7744157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:55:06Z","timestamp":1498352106000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7744157\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/cec.2016.7744157","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}