✦ LIBER ✦

Online scheduling on two uniform machines subject to eligibility constraints

✍ Scribed by Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo

Book ID: 108281561
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 545 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.06.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Online scheduling on two uniform machine

Online scheduling on two uniform machines to minimize the makespan

✍ Ming Liu; Yinfeng Xu; Chengbin Chu; Feifeng Zheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Scheduling jobs with equal processing ti

Scheduling jobs with equal processing times subject to machine eligibility constraints

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 400 KB

Uniform machine scheduling of unit-time

Uniform machine scheduling of unit-time jobs subject to resource constraints

✍ Mikhail Y. Kovalyov; Yakov M. Shafransky 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 350 KB

The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is t

Online algorithms for scheduling with ma

Online algorithms for scheduling with machine activation cost on two uniform machines

✍ Shu-guang Han; Yi-wei Jiang; Jue-liang Hu 📂 Article 📅 2007 🏛 SP Zhejiang University Press 🌐 English ⚖ 242 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