| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142627 | Operations Research Letters | 2011 | 4 Pages |
Abstract
We consider the multiprocessor scheduling problem with the objective of minimizing the makespan such that the number of items on each machine does not exceed a machine dependent cardinality limit. We present an elementary approximation algorithm with worst-case performance ratio 3/23/2 and running time linear in the number of items.
► 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/23/2 and linear running time is given.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hans Kellerer, Vladimir Kotov,