✦ LIBER ✦

Minimizing flow-time on a single machine with integer batch sizes

✍ Scribed by Gur Mosheiov; Daniel Oron; Yaacov Ritov

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 157 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.09.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing makespan on a single batch pr

Minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Guochuan Zhang; Xiaoqiang Cai; C.-Y Lee; C.K Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

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.

Minimizing flow time on a single machine

Minimizing flow time on a single machine with job classes and setup times

✍ A. J. Mason; E. J. Anderson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

Mixed integer formulation to minimize ma

Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

✍ P. Damodaran; K. Srihari 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Minimizing total completion time on a ba

Minimizing total completion time on a batch processing machine with job families

✍ Vijaya Chandru; Chung-Yee Lee; Reha Uzsoy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Minimizing flow time on a constant numbe

Minimizing flow time on a constant number of machines with preemption

✍ Nikhil Bansal 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 180 KB