Title

Manpower scheduling with shift change constraints

Publication Type

Conference Proceeding Article

Publication Date

8-1994

Abstract

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.

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Decision Analytics

Publication

Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, China, August 25-27: Proceedings

Volume

834

First Page

616

Last Page

624

ISBN

9783540486534

Identifier

10.1007/3-540-58325-4_230

Publisher

Springer Verlag

City or Country

Berlin

Additional URL

http://doi.org/10.1007/3-540-58325-4_230