Single-Machine Scheduling with Release Times and Tails

Nodari Vakhania ()

Annals of Operations Research, 2004, vol. 129, issue 1, 253-271

Abstract: We study the problem of scheduling jobs with release times and tails on a single machine with the objective to minimize the makespan. This problem is strongly NP-hard, however it is known to be polynomially solvable if all jobs have equal processing time P. We generalize this result and suggest an O(n 2 log nlog P) algorithm for the case when the processing times of some jobs are restricted to either P or 2P. Copyright Kluwer Academic Publishers 2004

Keywords: scheduling algorithm; release time; tail; makespan (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000030692.69147.e2 (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:129:y:2004:i:1:p:253-271:10.1023/b:anor.0000030692.69147.e2

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

DOI: 10.1023/B:ANOR.0000030692.69147.e2

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