Jackson's Pseudo Preemptive Schedule for the Pm/r i, q i /C max scheduling problem

J. Carlier and E. Pinson

Annals of Operations Research, 1998, vol. 83, issue 0, 58 pages

Abstract: The aim of this paper is to introduce Jackson's Pseudo Preemptive Schedule (JPPS) for the m parallel and identical processor scheduling problem Pm/r i , q i /C max . JPPS generalizes Jackson's Preemptive Schedule (JPS) which was introduced for the one-processor sequencing problem 1/r i , q i /C max . JPS can be computed in O(nlog n) time and plays a central role in solving NP-hard disjunctive scheduling problems such as the job shop problem. The make-span of JPPS can be computed in O(nlog n + nmlog m) time, and is a tight lower bound for the Pm/r i , q i /C max . So JPPS could also play a central role in solving the Resource Constrained Project Scheduling Problem. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018968332237 (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:83:y:1998:i:0:p:41-58:10.1023/a:1018968332237

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

DOI: 10.1023/A:1018968332237

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