EPTAS for the dual of splittable bin packing with cardinality constraint

G. Jaykrishnan; Asaf Levin

doi:10.1016/j.tcs.2023.114202

EPTAS for the dual of splittable bin packing with cardinality constraint

G. Jaykrishnan, Asaf Levin

Data and Decision Sciences

Technion - Israel Institute of Technology

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

Abstract

The dual of splittable bin packing with cardinality constraint is a variant of fractional scheduling on identical machines with the goal of minimizing the makespan. In this variant we are given an upper bound on the number of jobs that have fractions that are processed on a common machine. This restriction makes the problem NP-hard in the strong sense. We exhibit an EPTAS for this problem when the cardinality upper bound is part of the input. This result answers an open question raised by Epstein, Levin, and van Stee [16].

Original language	English
Article number	114202
Journal	Theoretical Computer Science
Volume	979
DOIs	https://doi.org/10.1016/j.tcs.2023.114202
State	Published - 10 Nov 2023

Keywords

Approximation schemes
Scheduling with cardinality constraint
Splittable bin packing

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2023.114202

Cite this

@article{9a15e1bb37d34943893a89b133fd6082,

title = "EPTAS for the dual of splittable bin packing with cardinality constraint",

abstract = "The dual of splittable bin packing with cardinality constraint is a variant of fractional scheduling on identical machines with the goal of minimizing the makespan. In this variant we are given an upper bound on the number of jobs that have fractions that are processed on a common machine. This restriction makes the problem NP-hard in the strong sense. We exhibit an EPTAS for this problem when the cardinality upper bound is part of the input. This result answers an open question raised by Epstein, Levin, and van Stee [16].",

keywords = "Approximation schemes, Scheduling with cardinality constraint, Splittable bin packing",

author = "G. Jaykrishnan and Asaf Levin",

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

year = "2023",

month = nov,

day = "10",

doi = "10.1016/j.tcs.2023.114202",

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

volume = "979",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - EPTAS for the dual of splittable bin packing with cardinality constraint

AU - Jaykrishnan, G.

AU - Levin, Asaf

PY - 2023/11/10

Y1 - 2023/11/10

N2 - The dual of splittable bin packing with cardinality constraint is a variant of fractional scheduling on identical machines with the goal of minimizing the makespan. In this variant we are given an upper bound on the number of jobs that have fractions that are processed on a common machine. This restriction makes the problem NP-hard in the strong sense. We exhibit an EPTAS for this problem when the cardinality upper bound is part of the input. This result answers an open question raised by Epstein, Levin, and van Stee [16].

AB - The dual of splittable bin packing with cardinality constraint is a variant of fractional scheduling on identical machines with the goal of minimizing the makespan. In this variant we are given an upper bound on the number of jobs that have fractions that are processed on a common machine. This restriction makes the problem NP-hard in the strong sense. We exhibit an EPTAS for this problem when the cardinality upper bound is part of the input. This result answers an open question raised by Epstein, Levin, and van Stee [16].

KW - Approximation schemes

KW - Scheduling with cardinality constraint

KW - Splittable bin packing

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

U2 - 10.1016/j.tcs.2023.114202

DO - 10.1016/j.tcs.2023.114202

M3 - مقالة

SN - 0304-3975

VL - 979

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 114202

ER -

EPTAS for the dual of splittable bin packing with cardinality constraint

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this