๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimizing makespan on a single batch processing machine with dynamic job arrivals

โœ Scribed by Lee, C.-Y.

Book ID
125483339
Publisher
Taylor and Francis Group
Year
1999
Tongue
English
Weight
299 KB
Volume
37
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing makespan on a single batching
Minimizing makespan on a single batching machine with release times and non-identical job sizes
โœ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

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.