✦ LIBER ✦

Semi-on-line scheduling problems for maximizing the minimum machine completion time

✍ Scribed by He Yong

Book ID: 110611704
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2001
Tongue: English
Weight: 477 KB
Volume: 17
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02669690

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi on-line scheduling problem for maxi

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

Semi On-Line Scheduling Problem for Maxi

✍ Runzi Luo; Shijie Sun; Wenping Huang 📂 Article 📅 2006 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 168 KB

Ordinal On-Line Scheduling for Maximizin

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

Semi on-line scheduling for maximizing t

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

Maximizing the minimum completion time o

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

On-line scheduling on a single machine:

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