{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:39:22Z","timestamp":1772757562803,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0377-2217(00)00140-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:00:41Z","timestamp":1027616441000},"page":"224-242","source":"Crossref","is-referenced-by-count":132,"title":["A memetic algorithm for the total tardiness single machine scheduling problem"],"prefix":"10.1016","volume":"132","author":[{"given":"Paulo M","family":"Fran\u00e7a","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Mendes","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Moscato","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00140-5_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: A review","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB2","series-title":"New Ideas in Optimization","first-page":"261","article-title":"The number partitioning problem: An open challenge for evolutionary computation?","author":"Berretta","year":"1999"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","article-title":"A memetic algorithm for university exam timetabling","volume":"1153","author":"Burke","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"10.1016\/S0377-2217(00)00140-5_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","article-title":"A multi-stage evolutionary algorithm for the timetable problem","volume":"3","author":"Burke","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB5","doi-asserted-by":"crossref","unstructured":"E.K. Burke, A.J. Smith, Hybrid Evolutionary Techniques for the Maintenance Scheduling Problem, IEEE Power Engineering Society Transactions, to appear","DOI":"10.1109\/59.852110"},{"issue":"3-4","key":"10.1016\/S0377-2217(00)00140-5_BIB6","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0360-8352(97)00247-7","article-title":"Parallel machine scheduling problems using memetic algorithms","volume":"33","author":"Cheng","year":"1997","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB7","series-title":"New Ideas in Optimization","author":"Corne","year":"1999"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB9","series-title":"Genetic Algorithms and Engineering Design","author":"Gen","year":"1997"},{"issue":"2\u20133","key":"10.1016\/S0377-2217(00)00140-5_BIB10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01719256","article-title":"Scatter search and star-paths \u2013 beyond the genetic metaphor","volume":"17","author":"Glover","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB11","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB12","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: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB13","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/opre.29.4.646","article-title":"A review of production scheduling","volume":"29","author":"Graves","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB14","unstructured":"J. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI, 1975"},{"issue":"6","key":"10.1016\/S0377-2217(00)00140-5_BIB15","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","article-title":"The total tardiness problem: review and extensions","volume":"42","author":"Koulamas","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB16","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 Transactions"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB17","doi-asserted-by":"crossref","unstructured":"P. Merz, B. Freisleben, A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem, in: Proceedings of the International Congress of Evolutionary Computation (CEC'99), 1999, to appear","DOI":"10.1109\/CEC.1999.785529"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB18","unstructured":"P. Merz, B. Freisleben, Fitness landscapes and memetic algorithm design, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, New York, 1999, pp. 245\u2013260, to appear"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB19","doi-asserted-by":"crossref","unstructured":"P. Merz, B. Freisleben, Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, in: A.-E. Eiben, T. B\u00e4ck, M. Schoenauer, H.-P. Schwefel (Eds.), Proceedings of the Fifth International Conference on Parallel Problem Solving From Nature, Lecture Notes in Computer Science 1498, Springer, Berlin, 1998, pp. 765\u2013774","DOI":"10.1007\/BFb0056918"},{"issue":"1\u20134","key":"10.1016\/S0377-2217(00)00140-5_BIB20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02022564","article-title":"An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of Tabu Search","volume":"41","author":"Moscato","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB21","unstructured":"P. Moscato, On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms, Technical Report, Caltech Concurrent Computation Program, C3P Report 826, 1989"},{"issue":"1","key":"10.1016\/S0377-2217(00)00140-5_BIB22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA \u2013 International Journal of Management Science"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB23","doi-asserted-by":"crossref","unstructured":"B. Paechter, A. Cumming, M.G. Norman, H. Luchian, Extensions to a memetic timetabling system, in: E.K. Burke, P. Ross (Eds.), The Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1153, Springer, Berlin, 1996, pp. 251\u2013265","DOI":"10.1007\/3-540-61794-9_64"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB24","unstructured":"G.L. Ragatz, A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times, in: Proceedings of the 24th Annual Meeting of the Decision Sciences Institute, 1993, pp. 1375\u20131377"},{"key":"10.1016\/S0377-2217(00)00140-5_BIB25","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0377-2217(89)90332-9","article-title":"Real time scheduling of an automated manufacturing center","volume":"40","author":"Raman","year":"1989","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(00)00140-5_BIB26","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":"Computers and Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(00)00140-5_BIB27","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0305-0483(97)00024-8","article-title":"Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach","volume":"25","author":"Tan","year":"1997","journal-title":"OMEGA \u2013 International Journal of Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T11:22:54Z","timestamp":1556191374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0377221700001405"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00140-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}