期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 140, 期 1, 页码 466-472出版社
ELSEVIER
DOI: 10.1016/j.ijpe.2012.06.030
关键词
Shift scheduling; Column generation; Shortest path with resource constraints
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据