• 대한산업공학회지
• /
• 제40권2호
• /
• pp.184-194
• /
• 2014

Numerous studies have been studied to provide an efficient solution for the Nurse Rostering Problem (NRP), most of which have suffered from its complexity arising from incorporating nurse's work shift and ability. The test-bed data for the NRP is released for the public Competition in 2010. This study suggests a new mixed integer programming for Nurse Rostering Problem and develops a hybrid approach, where a hierarchical decomposition and the corresponding optimization are combined. The computation experiment is performed to show that the suggested algorithms may give a better solution in various instances, compared to the one appeared in the literature.