A dynamic programming algorithm for single machine scheduling with ready times

Sylvie Gélinas and Francois Soumis

Annals of Operations Research, 1997, vol. 69, issue 0, 135-156

Abstract: We propose a dynamic programming algorithm for the single machine scheduling problem with ready times and deadlines to minimize total weighted completion time. Weights may be positive or negative and the cost function may be non-regular. This problem appears as a subproblem in the Dantzig-Wolfe decomposition of the job-shop scheduling problem. We show that the algorithm is polynomial if time window length is bounded by a constant and times are integer-valued. We present computational results for problems with up to 200 jobs. Copyright Kluwer Academic Publishers 1997

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018972726534 (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:69:y:1997:i:0:p:135-156:10.1023/a:1018972726534

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

DOI: 10.1023/A:1018972726534

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 ().