𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constraint programming approach for a batch processing problem with non-identical job sizes

✍ Scribed by Arnaud Malapert; Christelle Guéret; Louis-Martin Rousseau

Book ID
113584146
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
902 KB
Volume
221
Category
Article
ISSN
0377-2217

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.