✦ LIBER ✦

Approximation Schemes for Scheduling a Batching Machine with Nonidentical Job Size

✍ Scribed by Xianzhao Zhang; Yuzhong Zhang; Zhigang Cao; Zengxia Cai

Book ID: 107347044
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2007
Tongue: English
Weight: 239 KB
Volume: 20
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-007-9057-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Flow shop scheduling with two batch proc

✍ H. S. Mirsanei; B. Karimi; F. Jolai 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 436 KB

Minimizing makespan on a single batch pr

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

An asymptotic PTAS for batch scheduling

✍ Yuzhong Zhang; Zhigang Cao 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 261 KB

Scheduling an unbounded batching machine

✍ A. Bellanger; A. Janiak; M.Y. Kovalyov; A. Oulamara 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 276 KB

A note on minimizing makespan on a singl

✍ Ali Husseinzadeh Kashan; Behrooz Karimi; S.M.T. Fatemi Ghomi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Scheduling parallel batch processing mac

✍ Koh *, Shie-Gheun; Koo, Pyung-Hoi; Ha, Jae-Won; Lee, Woon-Seek 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 173 KB