Showing 1 - 2 of 2
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.
Persistent link: https://www.econbiz.de/10010597659
Persistent link: https://www.econbiz.de/10011290730