International Journal of Electrical Engineering and Computer Science
E-ISSN: 2769-2507
Volume 4, 2022
Polynomially Solvable and NP-hard Special Cases for Scheduling with Heads and Tails
Authors: ,
Abstract: We consider a basic single-machine scheduling problem when jobs have release and delivery times and the objective is to minimize maximum job lateness. This problem is known to be strongly NP-hard. We study inherent structure of this problem exploring its special cases and the conditions when the problem can be efficiently solved.