The ð ¶ m a x Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds

Wei Ding

Advances in Operations Research, 2012, vol. 2012, 1-9

Abstract:

We mainly study the ð ¶ m a x 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 𠑇 L S to the optimal solution T * under two different conditions.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2012/748597.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2012/748597.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:748597

DOI: 10.1155/2012/748597

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().