Inicio  /  Applied Sciences  /  Vol: 13 Par: 14 (2023)  /  Artículo
ARTÍCULO
TITULO

Flexible Job Shop Scheduling Optimization for Green Manufacturing Based on Improved Multi-Objective Wolf Pack Algorithm

Jian Li    
Huankun Li    
Pengbo He    
Liping Xu    
Kui He and Shanhui Liu    

Resumen

Green manufacturing has become a new production mode for the development and operation of modern and future manufacturing industries. The flexible job shop scheduling problem (FJSP), as one of the key core problems in the field of green manufacturing process planning, has become a hot topic and a difficult issue in manufacturing production research. In this paper, an improved multi-objective wolf pack algorithm (MOWPA) is proposed for solving a multi-objective flexible job shop scheduling problem with transportation constraints. Firstly, a multi-objective flexible job shop scheduling model with transportation constraints is established, which takes the maximum completion time and total energy consumption as the optimization objectives. Secondly, an improved wolf pack algorithm is proposed, which designs individual codes from two levels of process and machine. The precedence operation crossover (POX) operation is used to improve the intelligent behavior of wolves, and the optimal Pareto solution set is obtained by introducing non-dominated congestion ranking. Thirdly, the Pareto solution set is selected using the gray relational decision analysis method and analytic hierarchy process to obtain the optimal scheduling scheme. Finally, the proposed algorithm is compared with other algorithms through a variety of standard examples. The analysis results show that the improved multi-objective wolf pack algorithm is superior to other algorithms in terms of solving speed and convergence performance of the Pareto solution, which shows that the proposed algorithm has advantages when solving FJSPs.

 Artículos similares

       
 
Shenquan Huang, Ya-Chih Tsai and Fuh-Der Chou    
This paper considers the single-machine problem with job release times and flexible preventive maintenance activities to minimize total weighted tardiness, a complicated scheduling problem for which many algorithms have been proposed in the literature. H... ver más
Revista: Algorithms

 
Predrag Mitic, Suzana Petrovic Savic, Aleksandar Djordjevic, Milan Eric, Enes Sukic, Dejan Vidojevic and Miladin Stefanovic    
This research focuses on small- and medium-sized businesses that provide machining or other process services but do not produce their own products. Their daily manufacturing schedule varies according to client needs. Small- and medium-sized businesses st... ver más
Revista: Applied Sciences

 
Danial Rooyani and Fantahun Defersha    
The work in this paper is motivated by a recently published article in which the authors developed an efficient two-stage genetic algorithm for a comprehensive model of a flexible job-shop scheduling problem (FJSP). In this paper, we extend the applicati... ver más
Revista: Algorithms

 
Yajun Wang, Junyu Leng, Xiaoqi Liu, Jiajia Wang and Qiunan Meng    
Various production disturbances occurring in the flexible job shop production process may affect the production of the workshop, some of which may lead to the prolongation of production completion time. Therefore, a flexible job shop dynamic scheduling m... ver más
Revista: Applied Sciences

 
Emiro Antonio Campo, Jose Alejandro Cano, Rodrigo Gómez-Montoya, Elkin Rodríguez-Velásquez and Pablo Cortés    
The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining de... ver más
Revista: Algorithms