Manpower scheduling with shift change constraints

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 so...

Full description

Saved in:

Bibliographic Details
Main Author:	LAU, Hoong Chuin
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 1994
Subjects:	Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering
Online Access:	https://ink.library.smu.edu.sg/sis_research/1602 http://doi.org/10.1007/3-540-58325-4_230
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Singapore Management University
Language:	English

id	sg-smu-ink.sis_research-2601
record_format	dspace
spelling	sg-smu-ink.sis_research-26012017-01-04T03:45:39Z Manpower scheduling with shift change constraints LAU, Hoong Chuin 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. 1994-08-01T07:00:00Z text https://ink.library.smu.edu.sg/sis_research/1602 info:doi/10.1007/3-540-58325-4_230 http://doi.org/10.1007/3-540-58325-4_230 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering
spellingShingle	Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering LAU, Hoong Chuin Manpower scheduling with shift change constraints
description	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.
format	text
author	LAU, Hoong Chuin
author_facet	LAU, Hoong Chuin
author_sort	LAU, Hoong Chuin
title	Manpower scheduling with shift change constraints
title_short	Manpower scheduling with shift change constraints
title_full	Manpower scheduling with shift change constraints
title_fullStr	Manpower scheduling with shift change constraints
title_full_unstemmed	Manpower scheduling with shift change constraints
title_sort	manpower scheduling with shift change constraints
publisher	Institutional Knowledge at Singapore Management University
publishDate	1994
url	https://ink.library.smu.edu.sg/sis_research/1602 http://doi.org/10.1007/3-540-58325-4_230
_version_	1770571345801773056

Manpower scheduling with shift change constraints

Similar Items