𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine

✍ Scribed by Davis, James M.; Gandhi, Rajiv; Kothari, Vijay H.

Book ID
120075097
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
208 KB
Volume
41
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fully combinatorial 2-approximation al
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
✍ N.N. Pisaruk πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 217 KB

We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The ΓΏrst combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact