Approximation algorithms for the graph balancing problem with two speeds and two job lengths

Daniel R. Page () and Roberto Solis-Oba ()
Additional contact information
Daniel R. Page: Western University
Roberto Solis-Oba: Western University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 15, 1045-1070

Abstract: Abstract Consider a set of n jobs and m uniform parallel machines, where each job has a length $$p_j \in {\mathbb {Q}}^+$$pj∈Q+ and each machine has a speed $$s_i \in {\mathbb {Q}}^+$$si∈Q+. The goal of the graph balancing problem with speeds is to schedule each job j non-preemptively on one of a subset $${\mathcal {M}}_j$$Mj of at most 2 machines so that the makespan is minimized. This is a $$\textsf {NP}$$NP-hard special case of the makespan minimization problem on unrelated parallel machines, where for the latter a longstanding open problem is to find an approximation algorithm with approximation ratio better than 2. Our main contribution is an approximation algorithm for the graph balancing problem with two speeds and two job lengths with approximation ratio $$(\sqrt{65}+7)/8 \approx 1.88278$$(65+7)/8≈1.88278. In addition, we consider when every $${\mathcal {M}}_j$$Mj has no cardinality constraints, this is the restricted assignment problem in the uniform parallel machine setting. We present a simple $$(2-\alpha /\beta )$$(2-α/β)-approximation algorithm in this case when every job has one of two job lengths $$p_j \in \{\alpha , \beta \}$$pj∈{α,β} where $$\alpha

Keywords: Makespan minimization; Unrelated parallel machines; Approximation algorithms; Graph balancing problem; Restricted assignment problem; Scheduling theory; 68W25; 90B35 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0339-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0339-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0339-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().