4.3 Article

Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic

期刊

JOURNAL OF SCHEDULING
卷 18, 期 2, 页码 207-223

出版社

SPRINGER
DOI: 10.1007/s10951-014-0383-z

关键词

Shift scheduling; Multi-activity context; Multi-day planning horizon; Heterogeneous workforce; Hybrid heuristic; Tabu search; Integer programming

资金

  1. Fonds de recherche du Quebec Nature et Technologie (FRQNT)

向作者/读者索取更多资源

This paper addresses a multi-activity multi-day shift scheduling problem in a continuous and flexible environment including a heterogeneous workforce. Given days-off schedules associated with each employee, our objective is to construct and assign admissible multi-activity shifts to employees on their work days in a way that minimizes under-staffing and over-staffing with a restricted budget on workforce cost. A hybrid heuristic which combines tabu search with a branch-and-bound procedure is proposed to solve the problem. The computational experiments prove that our method provides good schedules in relatively short computing times.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据