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

Wei Ding | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Wei Ding

Publication year - 2012

Publication title -

advances in operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.379

H-Index - 14

eISSN - 1687-9155

pISSN - 1687-9147

DOI - 10.1155/2012/748597

Subject(s) - scheduling (production processes) , computer science , job shop scheduling , mathematical optimization , parallel computing , mathematics , embedded system , routing (electronic design automation)

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research