Improved Jaya Algorithm for Flexible Job Shop Rescheduling Problem
Open Access
- 1 January 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 86915-86922
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.Keywords
Funding Information
- Shandong Province Colleges and Universities Youth Innovation Talent Introduction and Education Program
- National Natural Science Foundation of China (61603169, 61773192, 61503170, 61803192)
- Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology
- Alexander von Humboldt Foundation
This publication has 47 references indexed in Scilit:
- Scheduling flexible job shop problem subject to machine breakdown with game theoryInternational Journal of Production Research, 2013
- A simple and effective evolutionary algorithm for multiobjective flexible job shop schedulingInternational Journal of Production Economics, 2013
- Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategiesThe International Journal of Advanced Manufacturing Technology, 2012
- Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithmInternational Journal of Production Economics, 2011
- An efficient architecture for scheduling flexible job-shop with machine availability constraintsThe International Journal of Advanced Manufacturing Technology, 2010
- Generating robust and flexible job shop schedules using genetic algorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Linguistic-based meta-heuristic optimization model for flexible job shop schedulingInternational Journal of Production Research, 2002
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Job-shop scheduling with multi-purpose machinesComputing, 1990