This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Jorge M. S. Valente () (LIAAD, Faculdade de Economia, Universidade do Porto, Portugal)
José Fernando Gonçalves () (LIAAD, Faculdade de Economia, Universidade do Porto, Portugal)
Abstract

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet. Several genetic algorithms based on this approach are presented. These versions differ on the generation of the initial population, as well as on the use of local search. The proposed procedures are compared with the best existing heuristic, as well as with optimal solutions for the smaller instance sizes. The computational results show that the performance of the proposed genetic approach is improved by the addition of a local search procedure, as well as by the insertion of simple heuristic solutions in the initial population. Indeed, the genetic versions that include either or both of these features not only provide significantly better results, but are also much faster. The genetic versions that use local search are clearly superior to the best existing heuristic, and the improvement in performance increases with both the size and difficulty of the instances. These procedures are also quite close to the optimum, and provided an optimal solution for most of the test 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 file. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.fep.up.pt/investigacao/workingpapers/08.01.29_wp264.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Universidade do Porto, Faculdade de Economia do Porto in its series FEP Working Papers with number 264.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length: 28 pages
Date of creation: Jan 2008
Date of revision:
Handle: RePEc:por:fepwps:264

Contact details of provider:
Postal: Rua Dr. Roberto Frias, 4200 PORTO
Phone: 351-22-5571100
Fax: 351-22-5505050
Email:
Web page: http://www.fep.up.pt/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Sandra Silva).

Related research
Keywords: scheduling single machine linear earliness quadratic tardiness genetic algorithms

Other versions of this item:

This paper has been announced in the following NEP Reports: 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.:
  1. Su, Ling-Huey & Chang, Pei-Chann, 1998. "A heuristic to minimize a quadratic function of job lateness on a single machine," International Journal of Production Economics, Elsevier, vol. 55(2), pages 169-175, July. [Downloadable!] (restricted)
  2. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November. [Downloadable!] (restricted)
  3. Schaller, Jeffrey, 2002. "Minimizing the sum of squares lateness on a single machine," European Journal of Operational Research, Elsevier, vol. 143(1), pages 64-79, November. [Downloadable!] (restricted)
  4. Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto. [Downloadable!]
Full references

Statistics
Access and download statistics

Did you know? You can create your own reading lists on IDEAS.

This page was last updated on 2008-10-3.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.