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.
KeywordsOne-machine scheduling Operator non-availability Complexity List algorithms Performance analysis
MSC classification (2000)90B35 68W25 68Q17
- Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, BerlinGoogle Scholar
- Lebacque V, Brauner N, Celse B, Finke G, Rapine C (2007) Planification d’expériences dans l’industrie chimique, Chap. 1, pp 21–32. Dans Les systèmes de production applications interdisciplinaires et mutations sous la direction de Boujut J-F, Llerena D, Brissaud D, Hermès-Lavoisier, ISBN 978-2-7462-1819-2Google Scholar
- Lee C-Y (2004) Machine scheduling with availability constraints. In: Leung JYT(eds) Handbook of scheduling: algorithms, models and performance analysis. Chapman & Hall/CRC, London, pp 22-1–22-13Google Scholar