A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems

Shih Wei Lin, Kuo Ching Ying*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

52 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1065-1076
Number of pages12
JournalInternational Journal of Production Research
Volume53
Issue number4
DOIs
StatePublished - 16 02 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2014 Taylor & Francis.

Keywords

  • Multi-objective
  • Multi-point
  • Parallel machine
  • Scheduling
  • Simulated annealing

Fingerprint

Dive into the research topics of 'A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems'. Together they form a unique fingerprint.

Cite this