摘要
A new heuristic for preemptive parallel machine scheduling with batch set up time is provided by modifying some recent algorithms, we prove that it has a better asymptotic performance in some sence.
A new heuristic for preemptive parallel machine scheduling with batch set up time is provided by modifying some recent algorithms, we prove that it has a better asymptotic performance in some sence.