✦ LIBER ✦

Improved semi-online makespan scheduling with a reordering buffer

✍ Scribed by Sun, Hongyang; Fan, Rui

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Max-min Online Allocations with a Reorde

✍ Epstein, Leah; Levin, Asaf; van Stee, Rob 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 243 KB

Semi-online hierarchical scheduling prob

✍ Chen, Xin; Xu, Zhenzhen; Dósa, György; Han, Xin; Jiang, He 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Online scheduling with a buffer on relat

✍ György Dósa; Leah Epstein 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 468 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

Optimal algorithms for online scheduling

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

A hybrid variable neighborhood search al

✍ Moslehi, Ghasem; Khorasanian, Danial 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 666 KB