Copyright © 2012 Wei Ding. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We mainly study the problem of scheduling n groups of
jobs on n special-purpose processors and m general-purpose processors at
different speeds provided that the setup time of each job is less than times of
its processing time. We first propose an improved LS algorithm. Then,
by applying this new algorithm, we obtain two bounds for the ratio of the
approximate solution to the optimal solution T* under two different