IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-27744-8_10.html
   My bibliography  Save this book chapter

An O(N log N) Stable Algorithm for Immediate Selections Adjustments

In: Multidisciplinary Scheduling: Theory and Applications

Author

Listed:
  • Laurent Péridy

    (Université Catholique de I'Ouest)

  • David Rivreau

    (Université Catholique de I'Ouest)

Abstract

Using local operations within branch-and-bound methods for job-shop scheduling problems has been proved to be very effective. In this paper, we present an efficient algorithm that applies ascendant set-like adjustments for the immediate selections. This procedure is given within an original framework that guarantees a good convergence process and an easy integration of other classical disjunctive elimination rules.

Suggested Citation

  • Laurent Péridy & David Rivreau, 2005. "An O(N log N) Stable Algorithm for Immediate Selections Adjustments," Springer Books, in: Graham Kendall & Edmund K. Burke & Sanja Petrovic & Michel Gendreau (ed.), Multidisciplinary Scheduling: Theory and Applications, pages 205-222, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-27744-8_10
    DOI: 10.1007/0-387-27744-7_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-27744-8_10. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.