✦ LIBER ✦

Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data

✍ Scribed by Zhiyi Tan; Yong He; Leah Epstein

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ordinal scheduling problem and its asymp

✍ Zhiyi Tan; Yong He 📂 Article 📅 2004 🏛 Science in China Press (SCP) 🌐 English ⚖ 137 KB

Optimal algorithms for semi-online preem

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

Ordinal On-Line Scheduling for Maximizin

✍ Yong He; Zhiyi Tan 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 75 KB

Optimal on-line algorithms for schedulin

✍ ZHANG, GUOCHUAN; CAI, XIAOQIANG; WONG, C. K. 📂 Article 📅 2003 🏛 Taylor and Francis Group 🌐 English ⚖ 156 KB

Optimal on-line algorithms for one batch

✍ Yang Fang; Peihai Liu; Xiwen Lu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 307 KB

Optimal Preemptive Online Algorithms for

✍ Yong He; Yi Wei Jiang; Hao Zhou 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 189 KB