.png){kind=icon}
返回
Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2992478.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Machine recovery is met from time to time in real-life production. Rescheduling is often a necessary procedure to cope with it. Its instability gauges the number of changes to the existing scheduling solutions. It is a key criterion to measure a rescheduling solution & x2019;s quality. This work aims at solving a flexible job shop problem with machine recovery, which arises from the scheduling and rescheduling of pump remanufacturing systems. In their scheduling phase, the objective is to minimize makespan. In their rescheduling phase, two objectives are to minimize both instability and makespan. By introducing two novel local search operators into the original Jaya algorithm, this work proposes an improved Jaya algorithm to solve it. It performs experiments on ten different-scale cases of real-life remanufacturing environment. The results show that the improved Jaya is effective and efficient for solving a flexible job shop scheduling and rescheduling problems. It can effectively balance instability and makespan in a rescheduling phase.
Keyword:
Jaya algorithm
flexible job shop scheduling
machine recovery
remanufacturing
scheduling and rescheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion具有新作业插入的两阶段人工蜂群算法调度柔性作业车间调度问题
PREAI
分享收藏
查看更多内容