Skip to Main content Skip to Navigation
Journal articles

Single machine scheduling with forbidden start times

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas
Contributor : Jean-Charles Billaut <>
Submitted on : Tuesday, January 18, 2011 - 6:01:40 PM
Last modification on : Tuesday, November 19, 2019 - 4:46:09 PM



Jean-Charles Billaut, Francis Sourd. Single machine scheduling with forbidden start times. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2009, 7 (1), pp.37-50. ⟨10.1007/s10288-007-0061-5⟩. ⟨hal-00557265⟩



Record views