...
首页> 外文期刊>International Journal of Production Research >Towards robustness of response times: minimising the maximum inter-completion time on parallel machines
【24h】

Towards robustness of response times: minimising the maximum inter-completion time on parallel machines

机译:增强响应时间的鲁棒性:最小化并行计算机上的最大内部完成时间

获取原文
获取原文并翻译 | 示例
           

摘要

Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as possible without preempting any in-processing jobs, this paper considers a deterministic identical parallel machine scheduling problem to achieve robustness with regard to a worst-case response time. To the best of our knowledge, this paper is the first to study the objective of minimising the maximum inter-completion time, i.e. the maximum time difference between any two consecutive completion times of jobs. For this novel scheduling problem, we first show its NP-hardness, and then propose an integer linear programming formulation and three heuristic approaches. Numerical experiments demonstrate the efficiency of our solution methods.
机译:由于调度实践要求尽快对计划外的高优先级作业做出响应而又不抢占任何正在处理的作业,因此,本文考虑了确定性相同的并行机调度问题,以在最坏情况下的响应时间上实现鲁棒性。据我们所知,本文是第一个研究最小化最大完成时间的目标,即完成工作的任何两个连续完成时间之间的最大时间差。对于这个新颖的调度问题,我们首先显示其NP硬度,然后提出整数线性规划公式和三种启发式方法。数值实验证明了我们求解方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号