TY - JOUR
T1 - 2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines
AU - Azar, Yossi
AU - Champati, Jaya Prakash
AU - Liang, Ben
N1 - Publisher Copyright:
© 2018
PY - 2018/11
Y1 - 2018/11
N2 - In their seminal work [8], Lenstra, Shmoys, and Tardos proposed a 2-approximation algorithm to solve the problem of scheduling jobs on unrelated parallel machines with the objective of minimizing makespan. In contrast to their model, where a job is processed to completion by scheduling it on any one machine, we consider the scenario where each job j requires processing on kj different machines, independently. For this generalization, we propose a 2-approximation algorithm based on the ρ-relaxed decision procedure [8] and open cycles used in [3,2].
AB - In their seminal work [8], Lenstra, Shmoys, and Tardos proposed a 2-approximation algorithm to solve the problem of scheduling jobs on unrelated parallel machines with the objective of minimizing makespan. In contrast to their model, where a job is processed to completion by scheduling it on any one machine, we consider the scenario where each job j requires processing on kj different machines, independently. For this generalization, we propose a 2-approximation algorithm based on the ρ-relaxed decision procedure [8] and open cycles used in [3,2].
KW - Approximation algorithms
KW - Makespan
KW - Open cycles
KW - Scheduling
KW - Unrelated machines
UR - http://www.scopus.com/inward/record.url?scp=85049986107&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2018.07.005
DO - 10.1016/j.ipl.2018.07.005
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85049986107
SN - 0020-0190
VL - 139
SP - 39
EP - 43
JO - Information Processing Letters
JF - Information Processing Letters
ER -