On the Complexity of Manpower Shift Scheduling

On the Complexity of Manpower Shift Scheduling

We consider the shift assignment problem in manpower scheduling, and show that a restricted version of it is NP-hard by a reduction from 3SAT. We then present polynomial algorithms to solve special cases of the problem and show how they can be deployed to solve more complex versions of the shift ass...

Full description

Saved in:
Bibliographic Details
Main Author: LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 1996
Subjects:
Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/37
https://ink.library.smu.edu.sg/context/sis_research/article/1036/viewcontent/cor96.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/37
https://ink.library.smu.edu.sg/context/sis_research/article/1036/viewcontent/cor96.pdf

Similar Items