.png){kind=icon}
返回
An integer programming model for hierarchical workforce scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.10.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an integer programming model for the hierarchical workforce problem under the compressed workweeks is developed. The model is based on the integer programming formulation developed by Billionnet [A. Billionnet, Integer programming to schedule a hierarchical workforce with variable demands, European Journal of Operational Research 114 (1999) 105-114] for the hierarchical workforce problem. In our model, workers can be assigned to alternative shifts in a day during the course of a week, whereas all workers are assigned to one shift type in Billionnet's model. The main idea of this paper is to use compressed workweeks in order to save worker costs. This case is also suitable for the practice. The proposed model is illustrated on the Billionnet's example problem and the obtained results are compared with the Billionnet's model results. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
integer programming
personnel
scheduling
hierarchical workforce
compressed workweek
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Integer programming to schedule a hierarchical workforce with variable demands整数规划，以安排具有可变需求的分层劳动力
PREAI
分享收藏
没有更多内容
没有更多内容