✦ LIBER ✦

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

✍ Scribed by Mikhail Y. Kovalyov; Wieslaw Kubiak

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan Minimization in Job Shops: A Li

✍ Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 167 KB

Makespan minimization in open shops: A p

✍ Sergey V. Sevastianov; Gerhard J. Woeginger 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 510 KB

Makespan Minimization in No-Wait Flow Sh

✍ Sviridenko, M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 149 KB

A fully polynomial approximation scheme

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A New Fully Polynomial Time Approximatio

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 76 KB

A fully polynomial time approximation sc

✍ Sakib A. Mondal 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 339 KB