Research Paper


, 7:239

First online:

Operator non-availability periods

  • N. BraunerAffiliated withG-SCOP, INPGrenoble, UJF, CNRS, University of Grenoble Email author 
  • , G. FinkeAffiliated withG-SCOP, INPGrenoble, UJF, CNRS, University of Grenoble
  • , V. Lehoux-LebacqueAffiliated withG-SCOP, INPGrenoble, UJF, CNRS, University of Grenoble
  • , C. RapineAffiliated withG-SCOP, INPGrenoble, UJF, CNRS, University of Grenoble
  • , H. KellererAffiliated withInstitute for Statistics and Operations Research, University of Graz
  • , C. PottsAffiliated withSchool of Mathematics, University of Southampton
  • , V. StrusevichAffiliated withSchool of Computing and Mathematical Sciences, University of Greenwich

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In the 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 and other polynomial-time algorithms.


One-machine scheduling Operator non-availability Complexity List algorithms Performance analysis

MSC classification (2000)

90B35 68W25 68Q17