EPTAS for parallel identical machine scheduling with time restrictions

G. Jaykrishnan; Asaf Levin

doi:10.1007/s10878-024-01108-y

EPTAS for parallel identical machine scheduling with time restrictions

G. Jaykrishnan, Asaf Levin

Data and Decision Sciences

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

Abstract

We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case of non-constant values of B on one machine was not known to admit a PTAS.

Original language	English
Article number	10
Journal	Journal of Combinatorial Optimization
Volume	47
Issue number	2
DOIs	https://doi.org/10.1007/s10878-024-01108-y
State	Published - Mar 2024

Keywords

Approximation algorithms
Makespan minimization
Scheduling
Worst-case analysis

ASJC Scopus subject areas

Computer Science Applications
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1007/s10878-024-01108-y

Cite this

@article{ed99b5a2db7b4d98aa84eb3a814e43ee,

title = "EPTAS for parallel identical machine scheduling with time restrictions",

abstract = "We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case of non-constant values of B on one machine was not known to admit a PTAS.",

keywords = "Approximation algorithms, Makespan minimization, Scheduling, Worst-case analysis",

author = "G. Jaykrishnan and Asaf Levin",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2024.",

year = "2024",

month = mar,

doi = "10.1007/s10878-024-01108-y",

language = "אנגלית",

volume = "47",

number = "2",

}

TY - JOUR

T1 - EPTAS for parallel identical machine scheduling with time restrictions

AU - Jaykrishnan, G.

AU - Levin, Asaf

N1 - Publisher Copyright: © The Author(s) 2024.

PY - 2024/3

Y1 - 2024/3

N2 - We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case of non-constant values of B on one machine was not known to admit a PTAS.

AB - We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case of non-constant values of B on one machine was not known to admit a PTAS.

KW - Approximation algorithms

KW - Makespan minimization

KW - Scheduling

KW - Worst-case analysis

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

U2 - 10.1007/s10878-024-01108-y

DO - 10.1007/s10878-024-01108-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85185690054

SN - 1382-6905

VL - 47

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 2

M1 - 10

ER -

EPTAS for parallel identical machine scheduling with time restrictions

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this