Manpower scheduling with shift change constraints
Publication Type
Journal Article
Publication Date
5-1995
Abstract
Manpower scheduling is a critical operation in service organizations which operate round-the-clock. It is an active topic in operations research. In this paper, we consider a problem in manpower scheduling, called the Change Shift Assignment Problem (CSAP), which is concerned with the assignment of shifts to workers such that demands for manpower are satisfied and constraints governing the change of shifts are not violated. We show that CSAP is NP-hard in general, and propose efficient polynomial-time algorithms to solve three practical sub-problems of CSAP.
Discipline
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering
Research Areas
Intelligent Systems and Optimization
Publication
IPSJ Journal
Volume
36
Issue
5
First Page
1271
Last Page
1279
ISSN
0387-5806
Identifier
10.1007/3-540-58325-4_230
Publisher
Information Processing Society of Japan
Citation
Lau, Hoong Chuin.
Manpower scheduling with shift change constraints. (1995). IPSJ Journal. 36, (5), 1271-1279.
Available at: https://ink.library.smu.edu.sg/sis_research/184
Additional URL
https://doi.org/10.1007/3-540-58325-4_230