.png){kind=icon}
返回
Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2011.11.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we introduce the Personnel Task Scheduling Problem (FTSP) and provide solution algorithms for a variant of this problem known as the Shift Minimisation Personnel Task Scheduling Problem (SMPTSP). The PTSP is a problem in which a set of tasks with fixed start and finish times have to be allocated to a heterogenous workforce. Personnel work in shifts with fixed start and end times and have skills that enable them to perform some, but not all tasks. In other words, some personnel are qualified to only perform a subset of all tasks. The objective is to minimise the overall cost of personnel required to perform the given set of tasks. In this paper we introduce a special case in which the only cost incurred is due to the number of personnel (shifts) that are used. This variant of the PTSP is referred to as the Shift Minimisation Personnel Task Scheduling Problem (SMPTSP). While our motivation is a real-life Personnel Task Scheduling Problem, the formulation may also be applied to machine shop scheduling. We review the existing literature, provide mathematical formulations, and develop a heuristic approach for the SMPTSP. (C) 2011 Elsevier B.V All rights reserved.
Keyword:
Scheduling
Lagrangean relaxation
Task Scheduling
Machine scheduling
Personnel scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Vaccines as a tool to estimate the burden of severe influenza in children of low-resourced areas (November 30–December 1, 2012, Les Pensieres, Veyrier-du-Lac, France).png)
Vaccine
VaccineIF0
PREAI
分享收藏
查看更多内容