Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C. and Strusevich, V. (2009) Operator non-availability periods. 4OR: A Quarterly Journal of Operations Research, 7 (3). pp. 239-253. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:https://doi.org/10.1007/s10288-008-0084-6)

Full text not available from this repository.

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.

Item Type:	Article
Uncontrolled Keywords:	one-machine scheduling, operator non-availability, complexity, list algorithms, performance analysis
Subjects:	T Technology > T Technology (General) Q Science > QA Mathematics
Faculty / School / Research Centre / Research Group:	Faculty of Liberal Arts & Sciences
Related URLs:	Publisher Organisation
Last Modified:	14 Oct 2016 09:04
URI:	http://gala.gre.ac.uk/id/eprint/1643

Actions (login required)

View Item