Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time point or only at integral time points. We shall show that the former problem can be solved in polynomial time, and provide sufficient conditions under which the latter problem is tractable. Applications to course scheduling and hypergraph edge coloring are also discussed.