Search
Now showing items 1-1 of 1
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
(2013 , Article)
In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, ...