Annals of Operations Research

, Volume 83, Issue 0, pp 41–58

Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem

Authors

  • J. Carlier
  • E. Pinson
Article

DOI: 10.1023/A:1018968332237

Cite this article as:
Carlier, J. & Pinson, E. Annals of Operations Research (1998) 83: 41. doi:10.1023/A:1018968332237

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/ri, qi/Cmax. JPPS generalizes Jackson's Preemptive Schedule (JPS) which was introduced for the one-processor sequencing problem 1/ri, qi/Cmax. 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/ri, qi/Cmax. So JPPS could also play a central role in solving the Resource Constrained Project Scheduling Problem.

Copyright information

© Kluwer Academic Publishers 1998