首页> 外文会议>International Conference on Manufacturing Engineering and Technology for Manufacturing Growth >An Improved Ant Colony Algorithm Based Dynamic Scheduling Method In Job Shop With Parallel Machines
【24h】

An Improved Ant Colony Algorithm Based Dynamic Scheduling Method In Job Shop With Parallel Machines

机译:具有并行机的作业商店动态调度方法的改进蚁群算法

获取原文

摘要

In this paper, the authors analysed the impact of machine breakdowns in job shop scheduling problem with parallel machines. A mathematical model with the objective of minimizing the weighted value of make-span and early due date was established. An improved ant colony dynamic scheduling algorithm combined with elite strategy and max-min ant mechanism was designed. Simulation experiments were designed and numerical results verified the superiority of the proposed approach.
机译:本文分析了机器故障在与并联机器的作业商店调度问题中的影响。具有最小化制造跨度和早期截止日期的目标的目的的数学模型。设计了一种改进的蚁群动态调度算法,结合精英策略和MAX-MIN蚂蚁机制。设计了模拟实验,数值结果验证了所提出的方法的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号