Operator non-availability periods |
| |
Authors: | N Brauner G Finke V Lehoux-Lebacque C Rapine H Kellerer C Potts V Strusevich |
| |
Institution: | 1. G-SCOP, INPGrenoble, UJF, CNRS, University of Grenoble, 46 avenue Félix Viallet, 38031, Grenoble Cedex, France 2. Institute for Statistics and Operations Research, University of Graz, 8010, Graz, Austria 3. School of Mathematics, University of Southampton, Southampton, SO17 1BJ, UK 4. School of Computing and Mathematical Sciences, University of Greenwich, London, SE10 9LS, UK
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|