An Algorithm Development for Solving a Flexible Job Shop Problem (FJSP)

Scheduling has been a prominent area of research for decades, involving the expression, classification, and resolution of various scheduling problems. Many of these problems are computationally challenging, demanding sophisticated algorithms for effective solutions. In this paper, we present a study of the scheduling problem on machines with downtime, with the primary objective of reducing the makespan. We propose a flexible job shop scheduling system equipped with six machines capable of producing six types of parts. To evaluate this system, we utilize modeling and simulation techniques within LEKIN and ARENA software. In the subsequent sections, we introduce our novel algorithm to address machine unavailability and optimize the scheduling process. By comparing the results obtained through simulation experiments, we assess the effectiveness of our proposed algorithm and its impact on the makespan reduction.