Publication Type

Journal Article

Version

Publisher’s Version

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 Decision Analytics

Publication

IPSJ Journal

Volume

36

Issue

5

First Page

1271

Last Page

1279

ISSN

0387-5806

Publisher

Information Processing Society of Japan

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://ci.nii.ac.jp/naid/110002721876/en

Share

COinS