A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds
2012
Advances in Operations Research
Preserved Fulltext
We mainly study the problem of schedulingngroups of jobs onnspecial-purpose processors andmgeneral-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 solutionT* under two different conditions.
doi:10.1155/2012/748597
fatcat:snwwxzw325gpthzckgfeetgymq