✦ LIBER ✦

On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan

✍ Scribed by Frédéric Ridouard; Pascal Richard; Patrick Martineau

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling a capacitated batch-processin

✍ Purushothaman Damodaran; Krishnaswami Srihari; Sarah S. Lam 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 182 KB

On-line scheduling on a batch machine to

✍ Ruyan Fu; Ji Tian; Jinjiang Yuan; Cheng He 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 150 KB

On-line algorithms for minimizing makesp

✍ Gouchuan Zhang; Xiaoqiang Cai; C.K. Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 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

On-line scheduling on an unbounded paral

✍ Ruyan Fu; Ji Tian; Jinjiang Yuan 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 317 KB

On-line problems of minimizing makespan

✍ Shi Yongqiang; Yao Enyu 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 348 KB