Article ID Journal Published Year Pages File Type
10524052 Operations Research Letters 2005 8 Pages PDF
Abstract
We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2+ε, where ε>0 can be made arbitrarily small.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Authors
, , , ,