✦ LIBER ✦

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan

✍ Scribed by Jacek Błażewicz; Maciej Machowiak; Jan Węglarz; Mikhail Y. Kovalyov; Denis Trystram

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SCHEDULING TO MINIMIZE MAKESPAN ON UNEQU

✍ Prabuddha De; Thomas E. Morton 📂 Article 📅 1980 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 718 KB

Scheduling parallel jobs to minimize the

✍ Berit Johannes 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 412 KB

Scheduling in n-job, m-stage flowshop wi

✍ Chandrasekharan Rajendran; Dipak Chaudhuri 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Scheduling to minimize maximum lateness

✍ Prabuddha De; Thomas E. Morion 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 965 KB

Randomized On-Line Scheduling Similar Jo

✍ Dong-lei Du 📂 Article 📅 2005 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 108 KB

Online scheduling on two uniform machine

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