✦ LIBER ✦

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval

✍ Scribed by Imed Kacem

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 675 KB
Volume: 17
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9102-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast approximation algorithms to minimiz

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

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

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t