✦ LIBER ✦

Semi-online scheduling on two uniform machines with

✍ Scribed by Sheng-Yi Cai; Qi-Fan Yang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-online scheduling with known maximu

✍ Qian Cao; Zhaohui Liu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 758 KB

Optimal algorithms for semi-online preem

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

Semi-online Machine Covering on Two Unif

✍ Z. Y. Tan; S. J. Cao 📂 Article 📅 2006 🏛 Springer Vienna 🌐 English ⚖ 117 KB

Semi-online scheduling with machine cost

✍ Yong He; Shengyi Cai 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 468 KB

Scheduling two agents on uniform paralle

✍ Donatas Elvikis; Horst W. Hamacher; Vincent T’kindt 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 589 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