Hybrid Flow Shop Scheduling Problem with Energy Utilization using Non-Dominated Sorting Genetic Algorithm-III (NSGA-III) Optimization
Open Access
- 26 December 2023
- journal article
- research article
- Published by Universiti Malaysia Pahang Al-Sultan Abdullah Press (UMPSA Press) in International Journal of Automotive and Mechanical Engineering
- Vol. 20 (4) , 10862-10877
Abstract
Hybrid flow shop scheduling (HFS) is an on sought problem modelling for production manufacturing. Due to its impact on productivity, researchers from different backgrounds have been attracted to solve its optimum solution. The HFS is a complex dilemma and provides ample solutions, thus inviting researchers to propose niche optimization methods for the problem. Recently, researchers have moved on to multi-objective solutions. In real-world situations, HFS is known for multi-objective problems, and consequently, the need for optimum solutions in multi-objective HFS is a necessity. Regarding sustainability topic, energy utilization is mainly considered as one of the objectives, including the common makespan criteria. This paper presents the existing multi-objective approach for solving energy utilization and makespan problems in HFS scheduling using Non-Dominated Sorting Genetic Algorithm-III (NSGA-III), and a comparison to other optimization models was subjected for analysis. The model was compared with the most sought algorithm and latest multi-objective algorithms, Strength Pareto Evolutionary Algorithm 2 (SPEA -II), Multi-Objective Algorithm Particle Swarm Optimization (MOPSO), Pareto Envelope-based Selection Algorithm II (PESA-II) and Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D). The research interest starts with problem modelling, followed by a computational experiment with an existing multi-objective approach conducted using twelve HFS benchmark problems. Then, a case study problem is presented to assess all models. The numerical results showed that the NSGA-III obtained 50% best overall for distribution performance metrics and 42% best in convergence performance metrics for HFS benchmark problems. In addition, the case study results show that NSGA-III obtained the best overall convergence and distribution performance metrics. The results show that NSGA-III can search for the best fitness solution without compromising makespan and total energy utilization. In the future, these multi-objective algorithms’ potential can be further investigated for hybrid flow shop scheduling problems.Keywords
This publication has 12 references indexed in Scilit:
- Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation effortsJournal of Cleaner Production, 2022
- Energy-efficient flexible flow shop scheduling with worker flexibilityExpert Systems with Applications, 2020
- The mixed production mode considering continuous and intermittent processing for an energy-efficient hybrid flow shop schedulingJournal of Cleaner Production, 2020
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objectiveComputers & Operations Research, 2019
- A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop schedulingJournal of Cleaner Production, 2019
- Energy-Oriented Scheduling for Hybrid Flow Shop With Limited Buffers Through Efficient Multi-Objective OptimizationIEEE Access, 2019
- Type II robotic assembly line balancing problem: An evolution strategies algorithm for a multi-objective modelJournal of Manufacturing Systems, 2012
- MOEA/D: A Multiobjective Evolutionary Algorithm Based on DecompositionIEEE Transactions on Evolutionary Computation, 2007
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- An Exact Method for Solving the Multi-Processor Flow-ShopRAIRO - Operations Research, 2000