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

Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes

โœ Scribed by Bayi Cheng; Shanlin Yang; Xiaoxuan Hu; Bo Chen

Book ID
113461146
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
241 KB
Volume
36
Category
Article
ISSN
0307-904X

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.