{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T20:38:15Z","timestamp":1762375095567},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p> In this paper, we present a hybrid genetic algorithm for a version of the early\/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys. The genetic algorithm is used to establish the order in which the jobs are initially scheduled, and a local search procedure is subsequently applied to detect possible improvements. The approach is tested on a set of randomly generated problems and compared with existing efficient heuristic procedures based on dispatch rules and local search. The computational results show that this new approach, although requiring slightly longer computational times, is better than the previous algorithms in terms of solution quality. <\/jats:p>","DOI":"10.1142\/s0217595906000978","type":"journal-article","created":{"date-parts":[[2006,8,22]],"date-time":"2006-08-22T11:15:02Z","timestamp":1156245302000},"page":"393-405","source":"Crossref","is-referenced-by-count":18,"title":["A HYBRID GENETIC ALGORITHM FOR THE EARLY\/TARDY SCHEDULING PROBLEM"],"prefix":"10.1142","volume":"23","author":[{"given":"JORGE M. S.","family":"VALENTE","sequence":"first","affiliation":[{"name":"Faculdade de Economia da Universidade do Porto, Rua Dr. Roberto Frias, 4200-464 Porto, Portugal"}]},{"given":"JOS\u00c9 FERNANDO","family":"GON\u00c7ALVES","sequence":"additional","affiliation":[{"name":"Faculdade de Economia da Universidade do Porto, Rua Dr. Roberto Frias, 4200-464 Porto, Portugal"}]},{"given":"RUI A. F. S.","family":"ALVES","sequence":"additional","affiliation":[{"name":"Faculdade de Economia da Universidade do Porto, Rua Dr. Roberto Frias, 4200-464 Porto, Portugal"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1988.26"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00067-2"},{"key":"rf3","first-page":"27","volume":"14","author":"Bailey R. N.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.1.22"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"rf6","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"Goldberg D. E.","year":"1989"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00021-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"rf11","first-page":"546","volume":"96","author":"Li G.","journal-title":"European Journal of Operational Research"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00081-1"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.2.177"},{"key":"rf15","first-page":"121","volume":"18","author":"Tan K. C.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.08.003"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601865"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595906000978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:41:56Z","timestamp":1565131316000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595906000978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1142\/S0217595906000978"],"URL":"https:\/\/doi.org\/10.1142\/s0217595906000978","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}