...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers & Industrial Engineering >An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times
【24h】

An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times

机译：处理时间可控的柔性作业车间调度问题的有效多目标离散病毒优化算法

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

摘要

The scheduling problems with controllable processing times (CPT) are commonly encountered in some manufacturing industries. CPT means the processing times of operations can be controlled by allocating additional resources. However the flexible job-shop scheduling problem (FJSP) with CPT is seldom explored due to its essential complexity. In addition, FJSP usually involves several conflicting objectives in the practical production. Therefore, the multi-objective FJSP with CPT (MOFJSP-CPT) is highly important in terms of theoretical research and practical application. Thus, this paper focuses on the MOFJSP-CPT. Firstly, this study formulates a mathematical model with the objectives of minimizing both the makespan and the total additional resource consumption. Then, to solve this problem, we propose a new multi-objective discrete virus optimization algorithm (M0DVOA) with a three-part representation for each virus, an improved method for yielding the initial population, and an ensemble of operators for updating each virus. To further improve the exploitation, a problem-specific exploitation mechanism is implemented in the later stage of the search process. Finally, to evaluate the effectiveness of the M0DVOA, the M0DVOA is compared with other well-known multi-objective evolutionary algorithms including NSGA-II and SPEA2. Experimental results on randomly generated instances and a real-world case demonstrate that the proposed M0DV0A can achieve a better performance than other algorithms for solving the MOFJSP-CPT.
机译：具有可控处理时间（CPT）的调度问题在某些制造业中通常会遇到。 CPT意味着可以通过分配其他资源来控制操作的处理时间。但是，由于CPT的本质复杂性，很少探讨带有CPT的灵活的作业车间调度问题（FJSP）。此外，FJSP在实际生产中通常涉及几个相互矛盾的目标。因此，带有CPT的多目标FJSP（MOFJSP-CPT）在理论研究和实际应用方面都非常重要。因此，本文重点关注MOFJSP-CPT。首先，本研究建立了一个数学模型，其目标是最小化制造期和总的额外资源消耗。然后，为解决此问题，我们提出了一种新的多目标离散病毒优化算法（M0DVOA），其中每种病毒由三部分表示，一种改进的产生初始种群的方法，以及一组运算符来更新每种病毒。为了进一步提高利用水平，在搜索过程的后期阶段实施了针对特定问题的利用机理。最后，为了评估M0DVOA的有效性，将M0DVOA与其他著名的多目标进化算法（包括NSGA-II和SPEA2）进行了比较。在随机生成的实例和实际案例中的实验结果表明，所提出的M0DV0A可以比解决MOFJSP-CPT的其他算法获得更好的性能。

著录项

  • 来源
    《Computers & Industrial Engineering》 |2017年第2期|156-174|共19页
  • 作者

    Chao Lu; Xinyu Li; Liang Gao; Wei Liao; Jin Yi;

  • 作者单位

    State Key Laboratory of Digital Manufacturing Equipment & Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China;

    State Key Laboratory of Digital Manufacturing Equipment & Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China;

    State Key Laboratory of Digital Manufacturing Equipment & Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China;

    State Key Laboratory of Digital Manufacturing Equipment & Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China;

    State Key Laboratory of Digital Manufacturing Equipment & Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Flexible job-shop scheduling problem; Controllable processing times; Virus optimization algorithm; Multi-objective optimization;

    机译：灵活的车间调度问题;可控的处理时间;病毒优化算法;多目标优化;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号