Online cardinality constrained scheduling

Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder

doi:10.1016/j.orl.2023.08.003

Online cardinality constrained scheduling

Leah Epstein^*
, Alexandra Lassota
, Asaf Levin
, Marten Maack
, Lars Rohwedder

^*Corresponding author for this work

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

Abstract

In online load balancing problems, jobs arrive over a list. Upon arrival of a job, the algorithm is required to assign it immediately and irrevocably to a machine. We consider such a makespan minimization problem with an additional cardinality constraint, i.e., at most k jobs may be assigned to each machine, where k is a parameter of the problem. We present both upper and lower bounds on the competitive ratio of online algorithms for this problem with identical machines.

Original language	English
Pages (from-to)	533-539
Number of pages	7
Journal	Operations Research Letters
Volume	51
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2023.08.003
Publication status	Published - 1 Sept 2023

Keywords

Competitive analysis
Load balancing
Online algorithms
Scheduling

Access to Document

10.1016/j.orl.2023.08.003Licence: CC BY-NC-ND

Cite this

@article{ce1d14dbdce74923af0a4ec69a6ada29,

title = "Online cardinality constrained scheduling",

abstract = "In online load balancing problems, jobs arrive over a list. Upon arrival of a job, the algorithm is required to assign it immediately and irrevocably to a machine. We consider such a makespan minimization problem with an additional cardinality constraint, i.e., at most k jobs may be assigned to each machine, where k is a parameter of the problem. We present both upper and lower bounds on the competitive ratio of online algorithms for this problem with identical machines.",

keywords = "Competitive analysis, Load balancing, Online algorithms, Scheduling",

author = "Leah Epstein and Alexandra Lassota and Asaf Levin and Marten Maack and Lars Rohwedder",

note = "data source: no data used",

year = "2023",

month = sep,

day = "1",

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

language = "English",

volume = "51",

pages = "533--539",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Online cardinality constrained scheduling

AU - Epstein, Leah

AU - Lassota, Alexandra

AU - Levin, Asaf

AU - Maack, Marten

AU - Rohwedder, Lars

N1 - data source: no data used

PY - 2023/9/1

Y1 - 2023/9/1

N2 - In online load balancing problems, jobs arrive over a list. Upon arrival of a job, the algorithm is required to assign it immediately and irrevocably to a machine. We consider such a makespan minimization problem with an additional cardinality constraint, i.e., at most k jobs may be assigned to each machine, where k is a parameter of the problem. We present both upper and lower bounds on the competitive ratio of online algorithms for this problem with identical machines.

AB - In online load balancing problems, jobs arrive over a list. Upon arrival of a job, the algorithm is required to assign it immediately and irrevocably to a machine. We consider such a makespan minimization problem with an additional cardinality constraint, i.e., at most k jobs may be assigned to each machine, where k is a parameter of the problem. We present both upper and lower bounds on the competitive ratio of online algorithms for this problem with identical machines.

KW - Competitive analysis

KW - Load balancing

KW - Online algorithms

KW - Scheduling

U2 - 10.1016/j.orl.2023.08.003

DO - 10.1016/j.orl.2023.08.003

M3 - Article

SN - 0167-6377

VL - 51

SP - 533

EP - 539

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Online cardinality constrained scheduling

Abstract

Keywords

Access to Document

Fingerprint

Cite this