@article{Ding_Zhao_2010, title={An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed}, volume={5}, url={https://journals.lib.unb.ca/index.php/AOR/article/view/12573}, abstractNote={In the paper we mainly study the C <sub>max</sub> problem of scheduling n groups of jobs on n special-purpose processors and m general-purpose processors at the same speed provided the ready time of each job is less than α times of its processing time. We first propose an improved LS algorithm. We then show that the bound for the ratio of the approximate solution T <sup>LS</sup> to the optimal solution T* is less than (1 + α)(2 - 1 / n+m ). Moreover, we give an example to illustrate that it is tight for any α ≥ 0.}, number={1}, journal={Algorithmic Operations Research}, author={Ding, Wei and Zhao, Yi}, year={2010}, month={Apr.}, pages={Pages 34 –38} }