✦ LIBER ✦

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

✍ Scribed by Vijaya Chandru; Chung-Yee Lee; Reha Uzsoy

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 420 KB
Volume: 13
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(93)90030-k

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

Total completion time minimization in tw

Total completion time minimization in two-machine job shops with unit-time operations

✍ Wieslaw Kubiak; Vadim Timkovsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 802 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 integer batch sizes

✍ Gur Mosheiov; Daniel Oron; Yaacov Ritov 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 157 KB

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

A memetic algorithm for minimizing the t

A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration

✍ Jalil Layegh; Fariborz Jolai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 698 KB