Article ID Journal Published Year Pages File Type
1143202 Operations Research Letters 2008 6 Pages PDF
Abstract
We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of 52 for the non-identical job size model will be derived.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
Authors
, , ,