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

被引：77
|
作者：
Lin, Y. K. [2 ]
Pfund, M. E. [3 ]
Fowler, J. W. [1 ]
机构：
[1] Arizona State Univ, Sch Comp Informat & Decis Syst Engn, Tempe, AZ 85287 USA
[2] Feng Chia Univ, Dept Ind Engn & Syst Management, Taichung 40724, Taiwan
[3] Arizona State Univ, Dept Supply Chain Management, Tempe, AZ 85287 USA
来源：
COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 06期
关键词：
Unrelated parallel machine scheduling; Heuristic; Genetic algorithm;
D O I：
10.1016/j.cor.2010.08.018
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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 (BD) 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 (C) 2010 Elsevier Ltd All rights reserved
引用
收藏
页码：901 / 916
页数：16
相关论文
共 50 条
12345