✦ LIBER ✦

Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability

✍ Scribed by Imed Kacem; Vangelis Th. Paschos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two simple constant ratio approximation

✍ Hans Kellerer; Mikhail A. Kubzin; Vitaly A. Strusevich 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Approximation algorithms for the makespa

✍ Imed Kacem 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 675 KB

Fast approximation algorithms to minimiz

✍ Imed Kacem; Hans Kellerer 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 565 KB

Erratum to “Fully polynomial time approx

✍ I. Kacem 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Minimizing total weighted completion tim

✍ Hasani, Keramat; Kravchenko, Svetlana A.; Werner, Frank 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 193 KB

MINIMIZING TOTAL WEIGHTED COMPLETION TIM

✍ Reha Uzsoy; Yaoyu Yang 📂 Article 📅 2009 🏛 Production and Operations Management Society 🌐 English ⚖ 344 KB