Article ID Journal Published Year Pages File Type
1143070 Operations Research Letters 2008 4 Pages PDF
Abstract

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Unbounded parallel batch scheduling with job delivery to minimize makespan
Authors
, ,