An absolute approximation algorithm for scheduling unrelated machines

Evgeny Shchepin and Nodari Vakhania

Naval Research Logistics (NRL), 2006, vol. 53, issue 6, 502-507

Abstract: Non‐preemptive scheduling of n independent jobs on m unrelated machines so as to minimize the maximal job completion time is considered. A polynomial algorithm with the worst‐case absolute error of min{(1 − 1/m)pmax, p max′} is presented, where pmax is the largest job processing time and p max′ is the mth element from the non‐increasing list of job processing times. This is better than the earlier known best absolute error of pmax. The algorithm is based on the rounding of acyclic multiprocessor distributions. An O(nm2) algorithm for the construction of an acyclic multiprocessor distribution is also presented. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006

Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20157

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:53:y:2006:i:6:p:502-507

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 ().