✦ LIBER ✦

A general bound on schedule length for independent tasks

✍ Scribed by Sathiamoorthy Manoharan; Nigel P. Topham

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal scheduling algorithm for mini

✍ Spyros Tzafestas; Alekos Triantafyllakis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 507 KB

ILP Formulations for Scheduling Ordered

✍ Manoel Campêlo; Ricardo Corrêa; Nelson Maculan; Fébio Protti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Scheduling independent two processor tas

✍ J. Błaz̀ewicz; M. Drozdowski; G. Schmidt; D. De Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 606 KB

A lower bound on the period length of a

✍ Yossi Malka; Shlomo Moran; Shmuel Zaks 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 886 KB

Branch and bound methods for scheduling

✍ Andreas Krämer 📂 Article 📅 1997 🏛 Springer 🌐 German ⚖ 930 KB

A greedy algorithm for scheduling tasks

✍ S. Katsavounis 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 545 KB