Single machine scheduling with forbidden start times
Résumé
This paper addresses a single machine scheduling problem in which the following simple constraint is added: a set of time slots is forbidden for starting a task, that is no task can start at any forbidden time point. We show that the single machine problem with makespan minimization is stronglyNP-complete and we give polynomial algorithms to solve the problems with a small number of forbidden start times.