.png){kind=icon}
返回
Constrained network-based column generation for the multi-activity shift scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2012.06.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Real applications in shift scheduling often require handling rules such as multiple breaks, flexible shift lengths, overtime, multiple activities, among others. Because these rules demand a high level of flexibility, we model the problem as a Multi-Activity Shift Scheduling Problem (MASSP), where multiple activities can be scheduled in a shift. To solve the MASSP, we propose a column generation-based approach. The auxiliary problem is modeled as a Shortest Path Problem with Resource Constraints (SPPRC), where most difficult constraints are embedded in the underlying graph. To illustrate the solution approach, we present our experience solving a real-world problem from a large parking lot operator that schedules security staff and cashiers among several parking lots in Bogota (Colombia). The results show a significant reduction on the staffing total costs and on man-hours used. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Shift scheduling
Column generation
Shortest path with resource constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
查看更多内容