A lower bound for minimizing the total completion time of a three-agent scheduling problem
A lower bound for minimizing the total completion time of a three-agent scheduling problem
复制标题
DOI：
10.1016/j.ins.2016.01.031
复制
发表时间：
2016-05
期刊：
影响因子：
--
通讯作者：
Y. Shiau;Wen-Chiung Lee;Yu-Sheng Kung;Jen-Ya Wang
中科院分区：
文献类型：
--
作者：
Y. Shiau;Wen-Chiung Lee;Yu-Sheng Kung;Jen-Ya Wang
在作业调度领域，多智能体问题已经研究了很多年。大多数研究者只关注两种代理人。然而，在现实世界的调度问题中，存在着两个以上的代理人。在这项研究中，我们考虑了一个单机多智能体调度问题的释放时间和维护活动。目标是最小化第一代理的总完成时间，给定来自第二代理的作业的拖期不超过限制，并且来自第三代理的维护活动必须在指定的时间间隔内进行，即，维修窗口提出了一个下界来加速分支定界算法。计算实验表明，所提出的下界性能良好。改善率甚至达到1789%。
In the field of job scheduling, multi-agent issues have been studied for many years. Most of researchers focused their attention only on two agents. However, there are more than two agents in the real-world scheduling problems. In this study, we consider a single-machine multi-agent scheduling problem with release time and maintenance activity. The objective is to minimize the first agent's total completion time given that the tardiness of jobs from the second agent does not exceed a limit and the maintenance activity from the third agent must be conducted within a specified time interval, i.e., maintenance window. A lower bound is proposed to accelerate the branch-and-bound algorithm. Computational experiments show the proposed lower bound performs well. The improvement ratio even reaches 1789%.