, Volume 83, Issue 0, pp 41-58

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

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

This revised version was published online in August 2006 with corrections to the Cover Date.