Optimization model for flexible flow shop scheduling problem: Case study of telecommunication equipment industry

Le résumé fourni par la source

The flexible flow shop (FFS) scheduling problem represents a critical challenge in optimizing production processes, especially within the telecommunication equipment manufacturing (TEM) sector. Effective scheduling is important for minimizing production time, reducing costs, and ensuring timely delivery. Through extensive research on related work in FFS scheduling problems and the algorithms used to address this complex issue, a significant research gap has been identified. There is an increasing need for multi-objective models and application studies that can address the unique constraints and requirements of modern manufacturing environments. This study proposed an optimization approach for solving FFS scheduling problems by using genetic algorithm (GA), aiming at optimizing two primary objectives: makespan and job tardiness. The model considers workforce constraint, due date constraint and job sequencing. By employing an optimization model and a GA, an optimized scheduling model has been developed to meet the specific requirements of the company in TEM sector. The optimized scheduling model resulted in a significant reduction in makespan, improving the overall production timeline. Additionally, the model enhanced resource utilization, ensuring that machines and workforce are employed more efficiently. Particularly, the optimized scheduling model helped decrease the makespan by 33% and eliminate job tardiness.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.