✦ LIBER ✦

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan

✍ Scribed by Fu, Ruyan; Cheng, T.C.E.; Ng, C.T.; Yuan, Jinjiang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Bounded Single-Machine Parallel-batc

✍ Jintao Meng; Xiaoxu Lu 📂 Article 📅 2011 🏛 Elsevier ⚖ 688 KB

A best online algorithm for unbounded pa

✍ Jinjiang Yuan; Ruyan Fu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 433 KB

The bounded single-machine parallel-batc

✍ Q.Q. Nong; C.T. Ng; T.C.E. Cheng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Single-machine parallel-batching schedul

✍ Li, Shi-Sheng; Chen, Ren-Xia 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Optimal algorithms for online scheduling

✍ Ming Liu; Feifeng Zheng; Chengbin Chu; Yinfeng Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 228 KB

An optimal online algorithm for single m

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Jiazhen Huo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 335 KB