This work proposes to use the fitness scores of jobs to machines in unrelated parallel machine scheduling to maximize machine preferences by using the fitness scores of jobs. A bi-objective mathematical model for the unrelated parallel machine problem with sequence dependent setup times is designed to minimize makespan and maximize machine preferences of jobs. Bi-objective Simulated Annealing Algorithm is proposed for solving large sized problems. A Decision Support System designed for solving problems with objective function of the maximizing machine preferences in combination with other common scheduling objective functions for unrelated parallel machine scheduling problems. By using the proposed system, non-dominated solutions are compared and one solution is selected by considering trade-offs among performance measures of the solutions.
Unrelated parallel machine scheduling sequence dependent setup times machine preferences simulated annealing tabu search.
Birincil Dil | İngilizce |
---|---|
Konular | Mühendislik |
Bölüm | Research Articles |
Yazarlar | |
Yayımlanma Tarihi | 27 Mart 2020 |
Gönderilme Tarihi | 14 Mart 2019 |
Yayımlandığı Sayı | Yıl 2020 Cilt: 38 Sayı: 1 |
IMPORTANT NOTE: JOURNAL SUBMISSION LINK https://eds.yildiz.edu.tr/sigma/