Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

  • Authors:
  • Y. K. Lin;M. E. Pfund;J. W. Fowler

  • Affiliations:
  • Department of Industrial Engineering and Systems Management, Feng Chia University, P.O. Box 25-097, Taichung 40724, Taiwan, ROC;Department of Supply Chain Management, Arizona State University, P.O. Box 873406, Tempe, AZ 85287, USA;School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, P.O. Box 878809, Tempe, AZ 85287-8809, USA

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

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.