Combinatorial approaches for hard problems in manpower scheduling

Manpower scheduling is concerned with the construction of a workers' schedule which meets demands while satisfying given constraints. We consider a manpower scheduling Problem, called the Change Shift Assignment Problem(CSAP). In previous work, we proved that CSAP is NP-hard and presented greed...

Full description

Saved in:
Bibliographic Details
Main Author: LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 1996
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/2
https://ink.library.smu.edu.sg/context/sis_research/article/1001/viewcontent/CombinatorialApproachesHardProblemsManpowerScheduling_1996_pvoa.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English