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

Laurent Péridy () and David Rivreau ()
Additional contact information
Laurent Péridy: Université Catholique de I'Ouest
David Rivreau: Université Catholique de I'Ouest

A chapter in Multidisciplinary Scheduling: Theory and Applications, 2005, pp 205-222 from Springer

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

Keywords: disjunctive scheduling; edge finding; local adjustments; elimination rule; job-shop (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-27744-8_10

Ordering information: This item can be ordered from
http://www.springer.com/9780387277448

DOI: 10.1007/0-387-27744-7_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().