✦ LIBER ✦

Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines

✍ Scribed by Runzi Luo; Shijie Sun; Wenping Huang

Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2006
Tongue: English
Weight: 168 KB
Volume: 19
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-006-0101-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi on-line scheduling for maximizing t

✍ Luo Run-zi; Sun Shi-jie 📂 Article 📅 2005 🏛 SP Zhejiang University Press 🌐 English ⚖ 396 KB

Semi on-line scheduling problem for maxi

✍ Run-zi Luo; Shi-jie Sun 📂 Article 📅 2005 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 256 KB

Maximizing the minimum completion time o

✍ Mohamed Haouari; Mahdi Jemmali 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 KB

Optimal algorithms for semi-online preem

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

On-line scheduling on a single machine:

✍ Amos Fiat; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 65 KB

A heuristic for maximizing the number of

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views