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.

Highlights

  • Hybrid flowshop scheduling problem usually involves several stages, each of which contains a certain number of parallel machines and each job passes through all the stages only once in sequence

  • The results show that improved Multi-Objective Multi-Verse Optimizer (IMOMVO) algorithm can solve the reentrant hybrid flowshop scheduling problem (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

  • The average (Avg), the standard deviations (Std), and the minimum values (Min) for the six small-sized and six large-sized problems are reported in Tables 6 and 8

Read more

Summary

Introduction

Hybrid flowshop scheduling problem usually involves several stages, each of which contains a certain number of parallel machines and each job passes through all the stages only once in sequence. Kim and Lee [6] studied the RHFSP of uncorrelated parallel machines at each stage and proposed CDS and NEH heuristic algorithms to minimize the Mathematical Problems in Engineering maximum completion time under certain delay constraints. Choi and Kim et al [14] studied the real-time dynamic RHFSP with multiple optimization objectives, including maximum system output, minimum average running time, minimum average delay time, and minimum number of total lost jobs using a real-time scheduling mechanism based on decision tree which is applied to a real TFT-LCD panel production line at last. Mansouri and Aktas et al [19] solved the flowshop scheduling problem considering maximum completion time and total energy consumption by mixed integer multi-objective programming model and heuristic algorithm.

Problem Description
Objective
The Proposed IMOMVO Algorithm
Computational Results
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call