@article{oai:ipsj.ixsq.nii.ac.jp:00013938,
 author = {LauHoong-Chuln and Lau, Hoong-Chuln},
 issue = {5},
 journal = {情報処理学会論文誌},
 month = {May},
 note = {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 con-cerned 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., 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 con-cerned 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.},
 pages = {1271--1279},
 title = {Manpower Scheduling with Shift Change Constraints},
 volume = {36},
 year = {1995}
}