Abstract
The personnel task scheduling problem is a subject of commercial interest which has been investigated since the 1950s. This paper proposes an effective and efficient three-phase algorithm for solving the shift minimization personnel task scheduling problem (SMPTSP). To illustrate the increased efficacy of the proposed algorithm over an existing algorithm, computational experiments are performed on a test problem set with characteristics motivated by employee scheduling applications. Experimental results show that the proposed algorithm outperforms the existing algorithm in terms of providing optimal solutions, improving upon most of the best-known solutions and revealing high-quality feasible solutions for those unsolved test instances in the literature.
Original language | English |
---|---|
Pages (from-to) | 323-334 |
Number of pages | 12 |
Journal | European Journal of Operational Research |
Volume | 237 |
Issue number | 1 |
DOIs | |
State | Published - 16 08 2014 |
Externally published | Yes |
Keywords
- Personnel task scheduling problem
- Scheduling
- Shift minimization