2000 character limit reached
EPTAS for parallel identical machine scheduling with time restrictions (2111.06692v1)
Published 12 Nov 2021 in cs.DS, cs.DM, math.CO, and math.OC
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.