✦ LIBER ✦

Makespan optimization in a single-machine scheduling problem with dynamic job ready times—Complexity and algorithms

✍ Scribed by Gorczyca, Mateusz; Janiak, Adam; Janiak, Wladyslaw; Dymański, Marcin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for sing

✍ Sylvie Gélinas; Francois Soumis 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 83 KB

Minimizing makespan in a single-machine

✍ Fardin Ahmadizar, Leila Hosseini 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 185 KB

MIP models and hybrid algorithm for mini

✍ Mi-Yi Kim; Young Hoon Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 839 KB

A dynamic programming algorithm for the

✍ Alberto Bosio; Giovanni Righini 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 461 KB

An approximation algorithm for a single-

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Comparative evaluation of heuristic algo

✍ Jatinder N. D. Gupta 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 740 KB