A tabu search algorithm for the unrelated parallel machine scheduling problem with machine availability constraint and sequence-dependent setup time

---

Furugi A.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.36, sa.3, ss.1540-1549, 2021 (SCI-Expanded, Scopus, TRDizin)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 36 Sayı: 3
• Basım Tarihi: 2021
• Doi Numarası: 10.17341/gazimmfd.806641
• Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
• Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Art Source, Compendex, TR DİZİN (ULAKBİM)
• Sayfa Sayıları: ss.1540-1549
• Anahtar Kelimeler: Scheduling, unrelated parallel machines, meta-heuristic algorithms, tabu search algorithm, MINIMIZATION
• Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
• Ondokuz Mayıs Üniversitesi Adresli: Evet

Özet

Parallel machine scheduling problems have many practical and industrial applications and have recently been the subject of research by many researchers. However, sometimes machines can be unavailable for a period of time for reasons such as machine failure and maintenance operations. The lack of studies in the literature considering such restrictions has been the motivation for this study. In this study, the unrelated parallel machine scheduling problem is discussed with the assumption that the machines will not always be available and they will not be able to perform some tasks. In addition, sequence-dependent setup times between tasks were also taken into account. The objective function is to minimize total tardiness and earliness. A mixed integer mathematical model is presented for the problem and solved with the GUROBI 9.0 solver. Due to the NP-hard nature of the addressed problem, a tabu search (TS) algorithm is proposed. Experimental results show that the proposed TS algorithm has a good performance.