Answers are grounded in this paper and cite their sources.
Industries that can manufacture a diverse range of products tailored to customer needs are well-positioned to capitalize on market opportunities. However, managing a diverse product portfolio can place significant strain on both personnel and machinery on the manufacturing shop floor. Relying on manual or traditional scheduling methods for such a complex environment often leads to inefficiencies, as these methods struggle to optimize production schedules within constraints like machine availability and capability. This challenge is known as the Flexible Job-Shop Scheduling Problem (FJSP). This article proposes a Jaya-Tabu search Algorithm (JTA) to address the FJSP by generating optimal production schedules aimed at minimizing makespan, idle time, and tardiness. The JTA leverages the evolutionary process of the Jaya algorithm and the neighborhood search technique of the Tabu search algorithm to avoid local minima. Compared to other heuristic techniques available in literature, the proposed JTA demonstrates superior performance in minimizing key production metrics such as makespan, idle time, and tardiness, making it a robust solution for complex manufacturing environments.
No takes yet. Share an insight, caveat, or question.
Chandrasekar et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: