A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

0.00 Avg rating—0 Votes
Article ID: iaor19941467
Country: United Kingdom
Volume: 21
Issue: 2
Start Page Number: 205
End Page Number: 210
Publication Date: Feb 1994
Journal: Computers and Operations Research
Authors: , , ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.