Manpower scheduling with shift change constraints
Conference Proceeding Article
We consider a problem in manpower scheduling, called the Change Shift Assignment Problem (CSAP) which is concerned with the construction of workers' schedules which satisfy demand and shift change constraints. We show that CSAP is NP-hard in general, and present polynomial-time algorithms to solve three practical cases of CSAP.
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, China, August 25-27: Proceedings
City or Country
LAU, Hoong Chuin.
Manpower scheduling with shift change constraints. (1994). Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, China, August 25-27: Proceedings. 834, 616-624. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1602