Multi‐Objective Reentrant Hybrid Flowshop Scheduling with Machines Turning on and off Control Strategy Using Improved Multi‐Verse Optimizer Algorithm

Abstract

This paper focuses on the multi-objective optimization of the reentrant hybrid flowshop scheduling problem (RHFSP) with machines turning on and off control strategy. RHFSP exhibits significance in many industrial applications, but scheduling with both energy consumption consideration and reentrant concept is relatively unexplored at present. In this study, an improved Multi-Objective Multi-Verse Optimizer (IMOMVO) algorithm is proposed to optimize the RHFSP with objectives of makespan, maximum tardiness, and idle energy consumption. To solve the proposed model more effectively, a series of improved operations are carried out, including population initialization based on Latin hypercube sampling (LHS), individual position updating based on Lévy flight, and chaotic local search based on logical self-mapping. In addition, a right-shift procedure is used to adjust the start time of operations aiming to minimize the idle energy consumption without changing the makespan. Then, Taguchi method is utilized to study the influence of different parameter settings on the scheduling results of the IMOMVO algorithm. Finally, the performance of the proposed IMOMVO algorithm is evaluated by comparing it with MOMVO, MOPSO, MOALO, and NSGA-II on the same benchmark set. The results show that IMOMVO algorithm can solve the RHFSP with machines turning on and off control strategy effectively, and in terms of convergence and diversity of non-dominated solutions, IMOMVO is obviously superior to other algorithms. However, the distribution level of the five algorithms has little difference. Meanwhile, by turning on and off the machine properly, the useless energy consumption in the production process can be reduced effectively.

Multi-Operator Hybrid Genetic Algorithm-Simulated Annealing for Reentrant Permutation Flow-Shop Scheduling

“…Recent studies show that metaheuristics are still the preferred methods to solve the complex problem of the RFS. Recently, various metaheuristics have been developed, such as iterated greedy algorithm [27], Improved Multi-Verse Optimizer Algorithm [28]. The latest studies also indicate that the hybrid method gains more concerns, as found in the study by Amrouche et al [29] which combined a simulated annealing and lower bounds, and Lin et al [30] which proposed a hybrid harmony search and genetic algorithm.…”

Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs

“…On the basis of literature studies [10,29], a bi-objective RHFSP mathematical model is proposed in this paper. Formulas (1) and (2) represent the two objective functions.…”

A new mathematical formulation and a hybrid evolutionary algorithm for re-entrant flow-shop problem with release date

“…Table1. Researches on RFSS problem up to 2021 [15,16] In this subsection, the different models of RFSS are reviewed and classified into three aforementioned groups. In the lowest class, many works on single objective RFSS were done without using the important parameters such as sequence-dependent setup time or release date [17][18][19]5,20,21,4,22].…”