✦ LIBER ✦

Semi-online scheduling with known maximum job size on two uniform machines

✍ Scribed by Qian Cao; Zhaohui Liu

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 758 KB
Volume: 20
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-009-9214-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-online Machine Covering on Two Unif

Semi-online Machine Covering on Two Uniform Machines with Known Total Size

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

Semi-online scheduling on two uniform ma

Semi-online scheduling on two uniform machines with

✍ Sheng-Yi Cai; Qi-Fan Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 592 KB

Optimal Preemptive Online Algorithms for

Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines

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

Preemptive Semi–online Algorithms for Pa

Preemptive Semi–online Algorithms for Parallel Machine Scheduling with Known Total Size

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

Optimal algorithms for semi-online preem

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

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

Scheduling identical jobs with unequal r

Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

✍ Maged M. Dessouky 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 308 KB

AbstractÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that