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

Authors
FRANCA PM GENDREAU M LAPORTE G MULLER FM
Citation
Pm. Franca et al., A COMPOSITE HEURISTIC FOR THE IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM MAKESPAN OBJECTIVE, Computers & operations research, 21(2), 1994, pp. 205-210
Citations number
20
Categorie Soggetti
Operatione Research & Management Science","Computer Applications & Cybernetics","Operatione Research & Management Science
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
21
Issue
2
Year of publication
1994
Pages
205 - 210
Database
ISI
SICI code
0305-0548(1994)21:2<205:ACHFTI>2.0.ZU;2-J
Abstract
This paper describes a new heuristic algorithm for the problem of sche duling 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.