Multi-objective scheduling by maximizing machine preferences for unrelated parallel machines

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Sigma Mühendislik ve Fen Bilimleri Dergisi
Volume:38 Issue:1
Multi-objective scheduling by maximizing machine preferences for unrelated parallel machines

Multi-objective scheduling by maximizing machine preferences for unrelated parallel machines

Authors : İnci SARIÇİÇEK

Pages : 405-419

View : 41 | Download : 9

Publication Date : 2020-03-27

Article Type : Research Paper

Abstract :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.
Keywords : Unrelated parallel machine scheduling, sequence dependent setup times, machine preferences, simulated annealing, tabu search

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.