✦ LIBER ✦

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints

✍ Scribed by V. S. Anil Kumar; Madhav V. Marathe; Srinivasan Parthasarathy; Aravind Srinivasan

Book ID: 106148744
Publisher: Springer
Year: 2007
Tongue: English
Weight: 499 KB
Volume: 55
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9004-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for unrelated machine schedul

Heuristics for unrelated machine scheduling with precedence constraints

✍ Jeffrey Herrmann; Jean-Marie Proth; Nathalie Sauer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A comment on scheduling on uniform machi

A comment on scheduling on uniform machines under chain-type precedence constraints

✍ Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 68 KB

Optimal scheduling of unit-time tasks on

Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints

✍ W. Kubiak 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 621 KB

Scheduling preemptive jobs with preceden

Scheduling preemptive jobs with precedence constraints on parallel machines

✍ Khaled Djellab 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Single machine scheduling with decreasin

Single machine scheduling with decreasing linear deterioration under precedence constraints

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 538 KB

This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. I

A polynomial algorithm to optimally sche

A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints

✍ Philippe Chretienne 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 380 KB