Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem

Kaizhou Gao,Fajun Yang,Junqing Li,Jianping Luo,Hongyan Sang

doi:10.1109/access.2020.2992478

Abstract

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’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.

Highlights

Production scheduling and task scheduling are extremely crucial in industrial manufacturing [43], [46] and data center [47], [48]
There are some constraints existing in flexible job shop problem (FJSP), which must be well solved in real-life environment [4]
For a shop floor that is executing a schedule, when a recovered machine is added in a candidate machine set at time t, the makespan could be reduced by rescheduling the not-yet started operations

Summary

INTRODUCTION

Production scheduling and task scheduling are extremely crucial in industrial manufacturing [43], [46] and data center [47], [48]. E.g., wafer fabrication, mechanical manufacturing, and automobile assembly environment, flexible job shop problem (FJSP) is very common [3], and it consists of two parts: machine assignment and operation sequencing [1], [2]. The objectives are seen as two sides of the game and ideal Nash Equilibrium (NE) and near NE solution strategies are developed to achieve the optimal solution Based on this idea, one NE searching algorithm is proposed and benchmarks with machine breakdown are tested to verify the performance. K. Gao et al.: iJaya Algorithm for Flexible Job Shop Rescheduling Problem solve FJSP with machine breakdown with the objectives to optimize makespan and stability. The mathematical model of a flexible job shop scheduling and rescheduling problem with machine recovery is described .

RESCHEDULING AND INSTABILITY FOR MACHINE RECOVERY

Findings

CONCLUSION AND FUTURE WORKS