Advanced Search
MyIDEAS: Login

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Contents:

Author Info

  • Jorge M. S. Valente

    ()
    (LIAAD, Faculdade de Economia, Universidade do Porto, Portugal)

  • Maria R. A. Moreira

    ()
    (EDGE, Faculdade de Economia, Universidade do Porto, Portugal)

Abstract

In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a final improvement step, or perform a local search after each greedy randomized construction. The proposed heuristics were compared with existing procedures, as well as with optimum solutions for some instance sizes. The computational results show that the proposed procedures clearly outperform their underlying dispatching heuristic, and the best of these procedures provide results that are quite close to the optimum. The best of the proposed algorithms is the new recommended heuristic for large instances, as well as a suitable alternative to the best existing procedure for the larger of the middle size instances.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. 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.
File URL: http://www.fep.up.pt/investigacao/workingpapers/08.08.05_wp286.pdf
Download Restriction: no

Bibliographic Info

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

as in new window
Length: 26 pages
Date of creation: Aug 2008
Date of revision:
Handle: RePEc:por:fepwps:286

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

Related research

Keywords: scheduling; single machine; early/tardy; quadratic penalties; greedy randomized dispatching rules;

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
  2. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
  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.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:por:fepwps:286. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.