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.
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Information Processing Society of Japan
Lau, Hoong Chuin.
Manpower scheduling with shift change constraints. (1995). IPSJ Journal. 36, (5), 1271-1279. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/184
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.