Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 53, Issue 4, Pages 1065-1076Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2014.942011
Keywords
multi-point; multi-objective; simulated annealing; parallel machine; scheduling
Categories
Funding
- National Science Council of the Republic of China (Taiwan) [NSC 102-2221-E-027-056, NSC 101-2410-H-182-004-MY2]
Ask authors/readers for more resources
This study considers the problem of job scheduling on unrelated parallel machines. A multi-objective multi-point simulated annealing (MOMSA) algorithm was proposed for solving this problem by simultaneously minimising makespan, total weighted completion time and total weighted tardiness. To assess the performance of the proposed heuristic and compare it with that of several benchmark heuristics, the obtained sets of non-dominated solutions were assessed using four multi-objective performance indicators. The computational results demonstrated that the proposed heuristic markedly outperformed the benchmark heuristics in terms of the four performance indicators. The proposed MOMSA algorithm can provide a new benchmark for future research related to the unrelated parallel machine scheduling problem addressed in this study.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available