Combinatorial approaches for hard problems in manpower scheduling

• المؤلف الرئيسي: LAU, Hoong Chuin
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 1996
• الموضوعات: Artificial Intelligence and Robotics; Operations Research, Systems Engineering and Industrial Engineering
• الوصول للمادة أونلاين: 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

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