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

全面介紹

Saved in:
書目詳細資料
主要作者: LAU, Hoong Chuin
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 1996
主題:
在線閱讀: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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English