81 Scopus citations

Abstract

This research compares the performance of various heuristics and one metaheuristic for unrelated parallel machine scheduling problems. The objective functions to be minimized are makespan, total weighted completion time, and total weighted tardiness. We use the least significant difference (LSD) test to identify robust heuristics that perform significantly better than others for a variety of parallel machine environments with these three performance measures. Computational results show that the proposed metaheuristic outperforms other existing heuristics for each of the three objectives when run with a parameter setting appropriate for the objective.

Original languageEnglish (US)
Pages (from-to)901-916
Number of pages16
JournalComputers and Operations Research
Volume38
Issue number6
DOIs
StatePublished - Jun 2011

Keywords

  • Genetic algorithm
  • Heuristic
  • Unrelated parallel machine scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems'. Together they form a unique fingerprint.

Cite this