Redirigiendo al acceso original de articulo en 17 segundos...
Inicio  /  Algorithms  /  Vol: 15 Par: 10 (2022)  /  Artículo
ARTÍCULO
TITULO

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

Emiro Antonio Campo    
Jose Alejandro Cano    
Rodrigo Gómez-Montoya    
Elkin Rodríguez-Velásquez and Pablo Cortés    

Resumen

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 deterministic setup and processing times. Likewise, several industries present restrictions when changing from one reference to another in the production system, incurring variable and sequence-dependent setup times. Therefore, this article aims to solve the flexible job shop scheduling problem (FJSSP) considering due windows, sequence-dependent setup times, and uncertainty in processing and setup times. A genetic algorithm is proposed to solve the FJSSP by integrating fuzzy logic to minimize the weighted penalties for tardiness/earliness. The proposed algorithm is implemented in a real-world case study of a fabric finishing production system, and it is compared with four heuristics adapted to the FJSSP such as earliest due date, critical reason, shortest processing time, and Monte Carlo simulation. Results show that the performance of the proposed algorithm provides efficient and satisfactory solutions concerning the objective function and computing time since it overperforms (more than 30%) the heuristics used as benchmarks.

 Artículos similares

       
 
Jian Li, Huankun Li, Pengbo He, Liping Xu, Kui He and Shanhui Liu    
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 pro... ver más
Revista: Applied Sciences

 
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