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

Filtered and Recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Contents:

Author Info

  • Jorge M. S. Valente

    ()
    (Faculdade de Economia da Universidade do Porto)

  • Rui A. F. S. Alves

    ()
    (Faculdade de Economia da Universidade do Porto)

Registered author(s):

    Abstract

    In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present heuristic algorithms based on the filtered and recovering beam search techniques and compare them with existing neighbourhood search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem-specific properties have been considered. Extensive preliminary tests were performed to determine appropriate parameter values for the beam search algorithms and the neighbourhood search procedure. The computational results show that the recovering beam search algorithms outperform their filtered counterparts in both solution quality and computational requirements, while the priority-based filtering procedure proves superior to the rules-based alternative. The best solutions are given by the neighbourhood search algorithm, but this procedure is computationally intensive and can therefore only be applied to small or medium size instances. The recovering beam search heuristic provides results that are close in solution quality and is significantly faster, so it can be used to solve even 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/04.04.28_wp142_Jorge%20valente%201.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 142.

    as in new window
    Length: 19 pages
    Date of creation: Apr 2004
    Date of revision:
    Handle: RePEc:por:fepwps:142

    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; early/tardy; beam search; heuristics;

    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. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    2. Jorge M. S. Valente & Rui A. F. S. Alves, 2003. "Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time," FEP Working Papers 126, Universidade do Porto, Faculdade de Economia do Porto.
    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:142. 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.