Operator Non-Availability Periods

Nadia Brauner (1) , Gerd Finke (1) , Vassilissa Lehoux-Lebacque (1) , Christophe Rapine (1) , Chris Potts (2) , Vitaly Strusevich (3)

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
2 University de Southampton
3 University of Greenwich

In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to a new type of scheduling problems, namely problems of finding schedules that respect the operator non-availability periods. These problems are analyzed on a single machine with the makespan as criterion. Properties are described and performance ratios are given for list scheduling algorithms.

Mots clés: One-machine scheduling; operator non-availability; complexity; list algorithms

Domaines: Recherche opérationnelle [math.OC]

Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Chris Potts, et al.. Operator Non-Availability Periods. 2007. ⟨hal-00165817⟩