论文信息 - The Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds

The Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds

We mainly study the 𝐶max 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 𝑇LS to the optimal solution T* under two different conditions.

Wei Ding | Wei Ding

[1] Csanád Imreh,et al. Scheduling Problems on Two Sets of Identical Machines , 2003, Computing.

[2] Chen Hua-hong. Mesh Simplification Algorithm Based on Quadrangle Collapse , 2008 .

[3] Reha Uzsoy,et al. Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times , 1993, Oper. Res. Lett..

[4] Gerhard J. Woeginger,et al. Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[5] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[6] Martin Gairing,et al. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines , 2007, Theor. Comput. Sci..

[7] Yi Zhao,et al. An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed , 2010, Algorithmic Oper. Res..