Makespan minimization on uniform parallel machines with release times

Makespan minimization on uniform parallel machines with release times

0.00 Avg rating0 Votes
Article ID: iaor20052134
Country: Netherlands
Volume: 157
Issue: 1
Start Page Number: 262
End Page Number: 266
Publication Date: Aug 2004
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

We consider the makespan minimization problem on uniform parallel machines in the presence of release times. We develop a heuristic for this NP-hard problem and derive a tight worse-case ratio bound for this heuristic independent of the machine speeds.

Reviews

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