A 3/2‐approximation algorithm for ki‐partitioning

A 3/2‐approximation algorithm for ki‐partitioning

0.00 Avg rating0 Votes
Article ID: iaor20119258
Volume: 39
Issue: 5
Start Page Number: 359
End Page Number: 362
Publication Date: Sep 2011
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
Abstract:

We consider multiprocessor scheduling with the objective of minimizing the makespan. The number of items on a machine is bounded by a machine dependent cardinality limit. A heuristic with worst‐case ratio 3/2 and linear running time is given.

Reviews

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