论文标题
对集成班和任务调度问题的有效算法
An Efficient Algorithm to the Integrated Shift and Task Scheduling Problem
论文作者
论文摘要
本文介绍了用于集成班次和任务调度问题的操作模型。员工安排问题是一个特殊情况，其人员要求是对问题的投入。当考虑灵活的转变时，这两个问题都难以解决。当前有关这些问题的文献为潜在的研究留下了良好的范围。在本文中，我们提出了一种解决集成问题及其特殊情况（人员安排问题）的新方法。我们认为这些问题具有广泛的灵活性 - 在现有文献中以有限的方式解决的功能。我们引入了一种新技术，以有效地解决问题。当目标函数是工人的数量时，我们提供了一个易于计算的紧密下限。通过实时和模拟问题实例的许多数值实验，我们证明了解决方案时间比现有时间的巨大节省。
This paper deals with operational models for integrated shift and task scheduling problem. Staff scheduling problem is a special case of this with staff requirements as given input to the problem. Both problems become hard to solve when the problems are considered with flexible shifts. Current literature on these problems leaves good scope for potential research. In this article, we propose a new method to solve the integrated problem and its special case, the staff scheduling problem. We consider these problems with wide flexibility - a feature that is addressed in a limited way in the existing literature. We introduce a new technique to solve the problem with large demand efficiently. When the objective function is the number of workers, we provide a tight lower bound that is easily computable. Through a number of numerical experiments with live and simulated problem instances, we demonstrate huge savings in the solution times over the existing ones.
