Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm

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.

The Comparison of Lately Proposed Harris Hawks Optimization and Jaya Optimization in Solving Directional Overcurrent Relays Coordination Problem

“…is competitive advantage makes it popularly applied in various real-world problems [25]. e applications including boosted regression trees (BRT) of the data-driven approaches [26], photovoltaic cell and module [27], economic load dispatch problems [28], Li-ion battery model [29], isolated microgrid with electric vehicle battery swapping stations [30], urban traffic light scheduling problem [31], maximum power point tracking (MPPT) problem of PV systems [32], parameter estimation of proton-exchange membrane fuel cells [33], flexible job-shop rescheduling problem (FJRP) [34], discrete optimization of truss structures [35], abrasive waterjet machining process [36], and so on.…”

Query Rewriting and Semantic Annotation in Semantic-Based Image Retrieval under Heterogeneous Ontologies of Big Data

“…Bayesian classifier and support vector machine (SVM) are the most popular methods for semantic mapping. With solid theoretical foundation, the SVM has been successfully applied in image retrieval [8]. In the training phase of semantic mapping, image clustering technology is often adopted to classify target images into meaningful groups.…”

Flow Shop Providing Frequency Regulation Service in Electricity Market

“…Meanwhile, the way to improve solving algorithm is intensively studied recently [30][31][32][33][34]. In the literature, new algorithms or methods are proposed for more optimal scheduling results or more efficient computation.…”

“…Analysis and discussion are presented below. Give that most research [26][27][28][29][30][31][32][33][34] defines both optimizations to be nonlinear programming and addresses them by heuristic algorithms, we also adopted genetic algorithm to solve them.…”