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

全面介紹

Saved in:
書目詳細資料
主要作者: LAU, Hoong Chuin
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 1996
主題:
在線閱讀:https://ink.library.smu.edu.sg/sis_research/37
https://ink.library.smu.edu.sg/context/sis_research/article/1036/viewcontent/cor96.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English