Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates

Suresh Chand, Rodney Traub and Reha Uzsoy

Annals of Operations Research, 1997, vol. 70, issue 0, 115-125

Abstract: We present a family of rolling horizon procedures for the problem of minimizing total completion time on a single machine with release times. These procedures develop solutions by using information about future job arrivals at each decision point. This approach provides an excellent compromise between the excessive computation time required by exact solution methods and the poor solution quality that myopic dispatching rules may yield. Extensive computational experiments show that these procedures consistently obtain high-quality solutions in very reasonable CPU times. Copyright Kluwer Academic Publishers 1997

Keywords: Scheduling; dynamic arrivals; heuristics; rolling horizon procedure (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018961818782 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:70:y:1997:i:0:p:115-125:10.1023/a:1018961818782

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018961818782

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().