An improved algorithm for online machine minimization

Yossi Azar; Sarel Cohen

doi:10.1016/j.orl.2017.11.013

An improved algorithm for online machine minimization

Yossi Azar, Sarel Cohen

Tel Aviv University

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

Abstract

The online machine minimization problem seeks to design a preemptive scheduling algorithm on multiple machines — each job j arrives at its release time r_j, has to be processed for p_j time units, and must be completed by its deadline d_j. The goal is to minimize the number of machines the algorithm uses. We improve the O(logm)-competitive algorithm by Chen, Megow and Schewior (SODA 2016) and provide an O([Formula presented])-competitive algorithm.

Original language	English
Pages (from-to)	128-133
Number of pages	6
Journal	Operations Research Letters
Volume	46
Issue number	1
DOIs	https://doi.org/10.1016/j.orl.2017.11.013
State	Published - Jan 2018

Keywords

Analysis of algorithms
Competitive ratio
Online machine minimization
Scheduling

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2017.11.013

Cite this

@article{5a5a673c886145688836701e5329fef3,

title = "An improved algorithm for online machine minimization",

abstract = "The online machine minimization problem seeks to design a preemptive scheduling algorithm on multiple machines — each job j arrives at its release time rj, has to be processed for pj time units, and must be completed by its deadline dj. The goal is to minimize the number of machines the algorithm uses. We improve the O(logm)-competitive algorithm by Chen, Megow and Schewior (SODA 2016) and provide an O([Formula presented])-competitive algorithm.",

keywords = "Analysis of algorithms, Competitive ratio, Online machine minimization, Scheduling",

author = "Yossi Azar and Sarel Cohen",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2018",

month = jan,

doi = "10.1016/j.orl.2017.11.013",

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

volume = "46",

pages = "128--133",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - An improved algorithm for online machine minimization

AU - Azar, Yossi

AU - Cohen, Sarel

PY - 2018/1

Y1 - 2018/1

N2 - The online machine minimization problem seeks to design a preemptive scheduling algorithm on multiple machines — each job j arrives at its release time rj, has to be processed for pj time units, and must be completed by its deadline dj. The goal is to minimize the number of machines the algorithm uses. We improve the O(logm)-competitive algorithm by Chen, Megow and Schewior (SODA 2016) and provide an O([Formula presented])-competitive algorithm.

AB - The online machine minimization problem seeks to design a preemptive scheduling algorithm on multiple machines — each job j arrives at its release time rj, has to be processed for pj time units, and must be completed by its deadline dj. The goal is to minimize the number of machines the algorithm uses. We improve the O(logm)-competitive algorithm by Chen, Megow and Schewior (SODA 2016) and provide an O([Formula presented])-competitive algorithm.

KW - Analysis of algorithms

KW - Competitive ratio

KW - Online machine minimization

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=85038911655&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2017.11.013

DO - 10.1016/j.orl.2017.11.013

M3 - مقالة

SN - 0167-6377

VL - 46

SP - 128

EP - 133

JO - Operations Research Letters

JF - Operations Research Letters

IS - 1

ER -

An improved algorithm for online machine minimization

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this