JACKSON PSEUDO PREEMPTIVE SCHEDULE FOR THE PM R(I), Q(I)/C-MAX SCHEDULING PROBLEM/

The aim of this paper is to introduce Jackson's Pseudo Preemptive Sche dule (JPPS) for the m parallel and identical processor scheduling prob lem Pm/r(i), q(i)/C-max. JPPS generalizes Jackson's Preemptive Schedul e (JPS) which was introduced for the one-processor sequencing problem 1/r(i), q(i)/C-max. JPS can be computed in O(n log 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(n log n + nm log m) time, and is a tight lower bound for the Pm/r(i), q( i)/C-max problem. So JPPS could also play a central role in solving th e Resource Constrained Project Scheduling Problem.