High Multiplicity Scheduling on One Machine with Forbidden Start and Completion Times

Michaël Gabay (1) , Christophe Rapine (2) , Nadia Brauner (1)

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
2 LGIPM - Laboratoire de Génie Industriel, de Production et de Maintenance

We are interested in a single machine scheduling problem where no task can either start or end on some dates and the input is given using a compact encoding. The aim is to minimize the makespan. We present a polynomial time algorithm for large diversity instances (when the number of different processing times is bigger than the number of forbidden dates). We also show that this problem is fixed parameter tracktable when the number of forbidden dates is fixed, regardless of tasks characteristics.

Mots clés: Scheduling; High Multiplicity; Availability Constraints; Parametrized Complexity

Domaines: Recherche opérationnelle [math.OC]

Michaël Gabay, Christophe Rapine, Nadia Brauner. High Multiplicity Scheduling on One Machine with Forbidden Start and Completion Times. 2013. ⟨hal-00850824v1⟩