EPTAS for parallel identical machine scheduling with time restrictions

期刊论文
出版模式：

开放获取
发表日期：

2024年2月22日

查看全文

G. Jaykrishnan,
Asaf Levin

摘要

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.