The novel heuristic method minimizes makespan in the flexible job-shop scheduling problem, indicating better efficiency.
This paper presents a novel heuristic approach to the Flexible Job-Shop Scheduling Problem (FJSP), incorporating sequence-dependent setup and transportation times, as well as machine efficiency constraints. The objective of the optimization was to minimize the total makespan of the job scheduling process. To solve this problem, a computational tool was developed, which implemented a new heuristic method based on a sequential algorithm, alongside selected priority assignment rules (FIFO, LIFO, LPT, SPT, EDD, LWR). The effectiveness of the generated schedules was evaluated using multiple criteria. Comparative numerical results were presented for various problem parameters and priority rules, demonstrating the performance and advantages of the proposed approach.
No takes yet. Share an insight, caveat, or question.
Krysteko et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: