𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Approximating a Scheduling Problem

✍ Scribed by Pierluigi Crescenzi; Xiaotie Deng; Christos H. Papadimitriou

Book ID
110301560
Publisher
Springer US
Year
2001
Tongue
English
Weight
86 KB
Volume
5
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

2-Approximation algorithms for the multi
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
✍ Yoshiyuki Karuno; Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h

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