• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals
【24h】

Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals

机译：启发式调度具有动态作业到达时间的统一并行批处理机器

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper aims at minimising the makespan on uniform parallel batch processing machines in the presence of dynamic job arrivals. A batch processing machine can process several jobs simultaneously as long as its capacity is not exceeded. The processing times and sizes of jobs are non-identical. The processing time of a batch is given by the longest job in the batch. Machines have different speeds and each machine works at a consistent rate. The problem under study is NP-hard. Thus, several heuristics are proposed. An algorithm batching rule (BR) is designed to balance the release times and processing times when it is employed to form batches. After the batches are formed, a heuristic Assignment Rule for Uniform parallel Machines is developed to schedule them on uniform parallel machines. A lower bound is also presented to evaluate the performance of the algorithms via computational experiments. The results show that the problem can be solved effectively and the heuristic Best Fit Longest Processing Time improved by BR outperforms other heuristics.
机译：本文旨在在存在动态作业到达的情况下，最小化统一并行批处理机器上的制造周期。只要不超过其处理能力，批处理机就可以同时处理多个作业。作业的处理时间和大小不相同。批次的处理时间由该批次中最长的作业确定。机器具有不同的速度，每台机器均以一致的速度工作。研究中的问题是NP难题。因此，提出了几种试探法。设计算法批处理规则（BR）来平衡发布时间和处理时间（当用于形成批处理时）。批次形成后，制定了统一并行机的启发式分配规则，以将其调度到统一并行机上。还提出了一个下限，以通过计算实验来评估算法的性能。结果表明，该问题可以得到有效解决，BR改进的启发式最佳拟合最长处理时间优于其他启发式算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号