A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
Department of Computer Science, Western University, London, ON N6A5B7, Canada
Author to whom correspondence should be addressed.
Academic Editor: Jesper Jansson
Received: 29 April 2016 / Revised: 27 May 2016 / Accepted: 2 June 2016 / Published: 8 June 2016
In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest. In the graph balancing problem each job can be non-preemptively scheduled on one of at most two machines with the same processing time on either machine. Recently, Ebenlendr, Krčál, and Sgall (Algorithmica 2014, 68
, 62–80.) presented a
-approximation algorithm for the graph balancing problem. Let
. In this paper we consider the graph balancing problem with two weights, where a job either takes r
time units or s
time units. We present a
-approximation algorithm for this problem. This is an improvement over the previously best-known approximation algorithm for the problem with approximation ratio 1.652 and it matches the best known inapproximability bound for it.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Page, D.R.; Solis-Oba, R. A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. Algorithms 2016, 9, 38.
Page DR, Solis-Oba R. A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. Algorithms. 2016; 9(2):38.
Page, Daniel R.; Solis-Oba, Roberto. 2016. "A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights." Algorithms 9, no. 2: 38.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.