The Cmax Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds. (6th September 2012)

• Record Type: Journal Article
• Authors: Ding, Wei
• Other Names: Liao Ching-Jong Academic Editor.
• Is Part Of: Advances in operations research. Volume 2012(2012)
• Publication Date: 2012-09-06
• Subjects: Operations research -- Periodicals; Operations research; Periodicals; 003
• DOI: 10.1155/2012/748597
• Languages: English
• ISSNs: 1687-9147

Abstract

Abstract : We mainly study the C 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 T L S to the optimal solution T * under two different conditions.