2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines

Yossi Azar; Jaya Prakash Champati; Ben Liang

doi:10.1016/j.ipl.2018.07.005

2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines

Yossi Azar, Jaya Prakash Champati, Ben Liang

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

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 k_j 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].

Original language	English
Pages (from-to)	39-43
Number of pages	5
Journal	Information Processing Letters
Volume	139
DOIs	https://doi.org/10.1016/j.ipl.2018.07.005
State	Published - Nov 2018

Keywords

Approximation algorithms
Makespan
Open cycles
Scheduling
Unrelated machines

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2018.07.005

Cite this

@article{b270c7015b834e4a8dac3886c64c03a9,

title = "2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines",

abstract = "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].",

keywords = "Approximation algorithms, Makespan, Open cycles, Scheduling, Unrelated machines",

author = "Yossi Azar and Champati, \{Jaya Prakash\} and Ben Liang",

note = "Publisher Copyright: {\textcopyright} 2018",

year = "2018",

month = nov,

doi = "10.1016/j.ipl.2018.07.005",

language = "الإنجليزيّة",

volume = "139",

pages = "39--43",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

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

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 - مقالة

SN - 0020-0190

VL - 139

SP - 39

EP - 43

JO - Information Processing Letters

JF - Information Processing Letters

ER -

2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this