Personnel Task Scheduling Problem Library. The Shift Minimisation Personnel Task Scheduling Problem (SMPTSP) belongs to the set of personnel scheduling problems. It arises when a set of tasks, fixed in time, have to be assigned to a set of shifts so that overlapping tasks are not assigned to the same shift. Each shift is associated with a given subset of assignable tasks. The objective is to minimise the number of used shifts. Note that depending on the real-life context, shifts may refer either to workers or more generally to constrained resources.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Fages, Jean-Guillaume; Lapègue, Tanguy: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (2014)
- Lapègue, Tanguy; Bellenguez-Morineau, Odile; Prot, Damien: A constraint-based approach for the shift design personnel task scheduling problem with equity (2013)