Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics
On the complexity of preemptive open-shop scheduling problems
Operations Research Letters
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling
| Hi-index | 14.98 |
The problem of preemptively scheduling a set of n independent jobs on an m processor open shop is discussed. An algorithm to construct preemptive schedules with minimum-maximum finishing time is presented. The worst case time complexity is 0(r + min {m4, n4, r2}), where r is the number of nonzero tasks. The maximum number of preemptions introduced is 0(min {rn, rm,