Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 485-504 |
| Number of pages | 20 |
| Journal | Archives of Control Sciences |
| Volume | 35 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2025 |
Keywords
- dispatch rules
- flexible job-shop scheduling problem (FJSP)
- heuristic method
- machine efficiency
- sequence-dependent setup times
- transportation times
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization
Fingerprint
Dive into the research topics of 'A novel heuristic method for flexible job-shop scheduling problem with sequence-dependent setup time, transportation time and machine efficiency constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver