A COMPOSITE HEURISTIC FOR THE IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM MAKESPAN OBJECTIVE

被引：35

作者：

FRANCA, PM

GENDREAU, M

LAPORTE, G

MULLER, FM

机构：

[1] UNIV MONTREAL,CTR RECH TRANSPORTS,MONTREAL H3C 3J7,PQ,CANADA

[2] UNIV ESTADUAL CAMPINAS,FAC ENGN ELET,CAMPINAS,SP,BRAZIL

[3] UNIV FED SANTA MARIA,SANTA MARIA,BRAZIL

来源：

COMPUTERS & OPERATIONS RESEARCH | 1994年 / 21卷 / 02期

关键词：

D O I：

10.1016/0305-0548(94)90053-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the makespan. The algorithm produces near-optimal solutions in short computation times. It outperforms alternative heuristics on a series of test problems.

引用

页码：205 / 210

页数：6

共 20 条

[1]

BLAZEWICZ J, 1987, ANN DISCRETE MATH, V31, P1

[2] SCHEDULING WITH EARLIEST START AND DUE DATE CONSTRAINTS ON MULTIPLE MACHINES [J].