✦ LIBER ✦

Optimal algorithms for online scheduling with bounded rearrangement at the end

✍ Scribed by Xin Chen; Yan Lan; Attila Benko; György Dósa; Xin Han

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online scheduling with one rearrangement

✍ Yuxin Wang; Attila Benko; Xin Chen; György Dósa; He Guo; Xin Han; Cecilia Sik La 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Optimal semi-online algorithm for schedu

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 KB

Optimal algorithms for online single mac

✍ Ming Liu; Feifeng Zheng; Shijin Wang; Jiazhen Huo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 221 KB

An optimal online algorithm for two-mach

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Feifeng Zheng 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

Optimal semi-online algorithms for preem

✍ Yiwei Jiang; Yong He 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

An optimal semi-online algorithm for 2-m

✍ Hongying Li; Chunjie Su 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 444 KB