Jorge M. S. Valente () (LIAAD - INESC Porto L. A., Faculdade de Economia, Universidade do Porto, Portugal) Maria R. A. Moreira () (EDGE, Faculdade de Economia, Universidade do Porto, Portugal) Alok Singh () (Department of Computer and Information Sciences, University of Hyderabad, Indi) Rui A. F. S. Alves () (Faculdade de Economia, Universidade do Porto, Portugal)
Abstract
In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet, and present several algorithms based on this approach. These versions differ on the generation of both the initial population and the individuals added in the migration step, as well as on the use of local search. The proposed procedures are compared with the best existing heuristics, as well as with optimal solutions for the smaller instance sizes. The computational results show that the proposed algorithms clearly outperform the existing procedures, and are quite close to the optimum. The improvement over the existing heuristics increases with both the difficulty and the size of the instances. The performance of the proposed genetic approach is improved by the initialization of the initial population, the generation of greedy randomized solutions and the addition of the local search procedure. Indeed, the more sophisticated versions can obtain similar or better solutions, and are much faster. The genetic version that incorporates all the considered features is the new heuristic of choice for small and medium size instances.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Universidade do Porto, Faculdade de Economia do Porto in its series FEP Working Papers with number
312.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: