Please use this identifier to cite or link to this item:
Title: Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm
Authors: Gao, Kaizhou
Yang, Fajun
Zhou, MengChu
Pan, Quanke
Suganthan, Ponnuthurai Nagaratnam
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2018
Source: Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N. (2019). Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm. IEEE Transactions on Cybernetics, 49(5), 1944-1955. doi:10.1109/TCYB.2018.2817240
Journal: IEEE Transactions on Cybernetics
Abstract: Rescheduling is a necessary procedure for a flexible job shop when newly arrived priority jobs must be inserted into an existing schedule. Instability measures the amount of change made to the existing schedule and is an important metrics to evaluate the quality of rescheduling solutions. This paper focuses on a flexible job-shop rescheduling problem (FJRP) for new job insertion. First, it formulates FJRP for new job insertion arising from pump remanufacturing. This paper deals with bi-objective FJRPs to minimize: 1) instability and 2) one of the following indices: a) makespan; b) total flow time; c) machine workload; and d) total machine workload. Next, it discretizes a novel and simple metaheuristic, named Jaya, resulting in DJaya and improves it to solve FJRP. Two simple heuristics are employed to initialize high-quality solutions. Finally, it proposes five objective-oriented local search operators and four ensembles of them to improve the performance of DJaya. Finally, it performs experiments on seven real-life cases with different scales from pump remanufacturing and compares DJaya with some state-of-the-art algorithms. The results show that DJaya is effective and efficient for solving the concerned FJRPs.
ISSN: 2168-2267
DOI: 10.1109/TCYB.2018.2817240
Rights: © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at:
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm.pdf1.56 MBAdobe PDFView/Open

Citations 5

Updated on Mar 10, 2021

Citations 5

Updated on Mar 9, 2021

Page view(s)

Updated on Dec 4, 2021

Download(s) 50

Updated on Dec 4, 2021

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.