✦ LIBER ✦

On the minimum number of processors for scheduling problems with communicationdelays

✍ Scribed by A. Moukrim

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On single processor scheduling problems

✍ Rudek, Radosław 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Upper bound on the number of processors

✍ Aziz Moukrim 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 185 KB

ILP Formulations for Scheduling Ordered

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

Branch and bound methods for scheduling

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

On the inverse minimum spanning tree pro

✍ Bangyi Li; Zhaohan Sheng 📂 Article 📅 2003 🏛 SP Systems Engineering Society of China 🌐 English ⚖ 228 KB

New bounds on time and number of process

✍ Hao Sun; Pu Liu; Jikai Li; Dechung Peng 📂 Article 📅 1996 🏛 Wuhan University 🌐 English ⚖ 363 KB