✦ LIBER ✦

Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem

✍ Scribed by Fabrice Tercinet; Emmanuel Néron; Christophe Lenté

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight bounds for the identical parallel

✍ Mohamed Haouari; Anis Gharbi; Mahdi Jemmali 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

Improved Bounds on Relaxations of a Para

✍ Cynthia A. Phillips; Andreas S. Schulz; David B. Shmoys; Cliff Stein; Joel Wein 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 131 KB

Heuristic algorithms for a complex paral

✍ Zoltán Blázsik; Csanád Imreh; Zoltán Kovács 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 145 KB

Tight bounds for the identical parallel

✍ Mohamed Haouari; Mahdi Jemmali 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

A linear time algorithm for restricted b

✍ J. Baewicz; K. Ecker 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Two branch-and-bound algorithms for the

✍ Mohammad Ranjbar; Morteza Davari; Roel Leus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB