A nonidentical parallel processor scheduling problem

Nicholas G. Hall, K. Anthony Rhee and Wansoo T. Rhee

Naval Research Logistics (NRL), 1988, vol. 35, issue 3, 419-424

Abstract: The problem considered in this article is a generalization of the familiar makespan problem, in which n jobs are allocated among m parallel processors, so as to minimize the maximum time (or cost) on any processor. Our problem is more general, in that we allow the processors to have (a) different initial costs, (b) different utilization levels before new costs are incurred, and (c) different rates of cost increase. A heuristic adapted from the bin‐packing problem is shown to provide solutions which are close to optimal as the number of iterations is allowed to increase. Computational testing, over a large number of randomly generated problem instances, suggests that heuristic errors are, on average, very small.

Date: 1988
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198806)35:33.0.CO;2-5

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:wly:navres:v:35:y:1988:i:3:p:419-424

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().