Evaluation and Improvement of Makespan Time of Flexible Job Shop Problem Using Various Dispatching Rules—A Case Study

Author(s):  
Mohan Bihari ◽  
P. V. Kane
2021 ◽  
Vol 11 (11) ◽  
pp. 5107
Author(s):  
Miguel Ortíz-Barrios ◽  
Antonella Petrillo ◽  
Fabio De Felice ◽  
Natalia Jaramillo-Rueda ◽  
Genett Jiménez-Delgado ◽  
...  

Scheduling flexible job-shop systems (FJSS) has become a major challenge for different smart factories due to the high complexity involved in NP-hard problems and the constant need to satisfy customers in real time. A key aspect to be addressed in this particular aim is the adoption of a multi-criteria approach incorporating the current dynamics of smart FJSS. Thus, this paper proposes an integrated and enhanced method of a dispatching algorithm based on fuzzy AHP (FAHP) and TOPSIS. Initially, the two first steps of the dispatching algorithm (identification of eligible operations and machine selection) were implemented. The FAHP and TOPSIS methods were then integrated to underpin the multi-criteria operation selection process. In particular, FAHP was used to calculate the criteria weights under uncertainty, and TOPSIS was later applied to rank the eligible operations. As the fourth step of dispatching the algorithm, the operation with the highest priority was scheduled together with its initial and final time. A case study from the smart apparel industry was employed to validate the effectiveness of the proposed approach. The results evidenced that our approach outperformed the current company’s scheduling method by a median lateness of 3.86 days while prioritizing high-throughput products for earlier delivery.


2012 ◽  
Vol 9 ◽  
pp. 2020-2023 ◽  
Author(s):  
Wojciech Bożejko ◽  
Zdziław Hejducki ◽  
Mariusz Uchroński ◽  
Mieczysław Wodecki

2021 ◽  
Vol 13 (23) ◽  
pp. 13016
Author(s):  
Rami Naimi ◽  
Maroua Nouiri ◽  
Olivier Cardin

The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.


Sign in / Sign up

Export Citation Format

Share Document