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 | |
| 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
Fingerprint
Dive into the research topics of 'EPTAS for parallel identical machine scheduling with time restrictions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver