𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation analysis of nonpreemptive EDF scheduling

✍ Scribed by Masaki Hanada; Hidenori Nakazato

Book ID
102160380
Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
351 KB
Volume
89
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the approximability of an interval sc
On the approximability of an interval scheduling problem
✍ Frits C. R. Spieksma πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 148 KB πŸ‘ 2 views

In this paper we consider a general interval scheduling problem. The problem is a natural generalization of "nding a maximum independent set in an interval graph. We show that, unless P"NP, this maximization problem cannot be approximated in polynomial time within arbitrarily good precision. On the