Advanced Search
MyIDEAS: Login to save this paper or follow this series

Heuristics for the single machine scheduling problem with early and quadratic tardy penalties

Contents:

Author Info

  • Jorge M. S. Valente

    ()
    (LIACC/NIAAD, Faculdade de Economia, Universidade do Porto, Portugal)

Registered author(s):

    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 several dispatching heuristics, and analyse their performance on a wide range of instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these rules. We also consider linear early / quadratic tardy dispatching rules, and a greedy-type procedure. Extensive experiments were performed to determine appropriate values for the parameters required by some of the heuristics. The computational tests show that the best results are given by the linear early / quadratic tardy dispatching rule. This procedure is also quite efficient, and can quickly solve even very large 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/06.12.27_WP234_JorgeValente.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 234.

    as in new window
    Length: 26 pages
    Date of creation: Dec 2006
    Date of revision:
    Handle: RePEc:por:fepwps:234

    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: heuristics; scheduling; single machine; early penalties; quadratic tardy penalties; no machine idle time; dispatching rules;

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. 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.

    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:234. 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.