Advanced Search
MyIDEAS: Login

An exact approach for single machine scheduling with quadratic earliness and tardiness 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 quadratic earliness and tardiness costs, and no machine idle time. We propose two different lower bounds, as well as a lower bounding procedure that combines these two bounds. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The lower bounding procedure and the branch-and-bound algorithms are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonable computation times, instances with up to 20 jobs.

    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.09.22_WP229_silvateixeira.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 238.

    as in new window
    Length: 27 pages
    Date of creation: Feb 2007
    Date of revision:
    Handle: RePEc:por:fepwps:238

    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; quadratic earliness and tardiness; lower bounds; branch-and-bound;

    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, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, 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:238. 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.