MULTI-OBJECTIVE SCHEDULING BY MAXIMIZING MACHINE PREFERENCES FOR UNRELATED PARALLEL MACHINES

SARIÇİÇEK İ.

SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, cilt.38, sa.1, ss.405-420, 2020 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 38 Sayı: 1
  • Basım Tarihi: 2020
  • Dergi Adı: SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Academic Search Premier, Directory of Open Access Journals
  • Sayfa Sayıları: ss.405-420
  • Anahtar Kelimeler: Unrelated parallel machine scheduling, sequence dependent setup times, machine preferences, simulated annealing, tabu search, ELIGIBILITY RESTRICTIONS, SETUP TIMES, ALGORITHM, SEARCH
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

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.