Showing 1 - 10 of 33
Persistent link: https://www.econbiz.de/10011344159
Persistent link: https://www.econbiz.de/10012254032
We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start. In this...
Persistent link: https://www.econbiz.de/10014501648
Persistent link: https://www.econbiz.de/10009503671
Persistent link: https://www.econbiz.de/10010339581
Persistent link: https://www.econbiz.de/10010364566
Persistent link: https://www.econbiz.de/10011445324
Persistent link: https://www.econbiz.de/10012589299
Persistent link: https://www.econbiz.de/10012792458
Persistent link: https://www.econbiz.de/10012300888