ja-hoogeveen documents

Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Documents Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Documents Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Scheduling with target start times
Documents Scheduling with target start times