.png){kind=icon}
返回
The minimum shift design problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-007-0221-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The min-Shift Design problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize the deviation from workforce requirements. Our research considers both theoretical and practical aspects of the min-Shift Design problem. This problem is closely related to the minimum edge-cost flow problem (MECF), a network flow variant that has many applications beyond shift scheduling. We show that MSD reduces to a special case of MECF and, exploiting this reduction, we prove a logarithmic hardness of approximation lower bound for MSD. On the basis of these results, we propose a hybrid heuristic for the problem, which relies on a greedy heuristic followed by a local search algorithm. The greedy part is based on the network flow analogy, and the local search algorithm makes use of multiple neighborhood relations. An experimental analysis on structured random instances shows that the hybrid heuristic clearly outperforms our previous commercial implementation. Furthermore, it highlights the respective merits of the composing heuristics for different performance parameters.
Keyword:
workforce scheduling
hybrid algorithms
local search
greedy heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏Finite Element Simulation on Behavior of the High-Strength Concrete Filled High-Strength Square Steel Tube Middle-Long Columns under Axial Compressive Load基于有限元模拟的高强混凝土填充高强方钢管中长柱在轴向压缩荷载作用下的行为研究
PREAI
分享收藏
查看更多内容