zbMATH — the first resource for mathematics

The personnel task scheduling problem. (English) Zbl 0978.90048
Yang, Xiaoqi (ed.) et al., Optimization methods and applications. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 52, 343-368 (2001).
Summary: In this paper we introduce a group of problems called Personnel Task Scheduling Problems (PTSP). A PTSP is concerned with assigning a set of tasks with fixed start and end time to a heterogeneous workforce. Each person in the workforce works a shift with given start and end times as well as having skills that qualify the person to perform a subset of all the tasks. This type of problem arises in rostering applications. There are several variations depending on the objective and the exact nature of the constraints. The aim of this paper is to describe this class of problems together with some basic properties, to survey previous work in this area, and to introduce some data sets that may serve as a test bed for future developments in this area.
For the entire collection see [Zbl 0962.00004].

90B35 Deterministic scheduling theory in operations research