𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Scribed by Shi Yongqiang; Yao Enyu

Book ID
107500703
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2005
Tongue
English
Weight
348 KB
Volume
20
Category
Article
ISSN
1005-1031

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.