𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A monotone approximation algorithm for scheduling with precedence constraints

✍ Scribed by Sven O. Krumke; Anne Schwahn; Rob van Stee; Stephan Westphal

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
123 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximation algorithm for the prece
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude KΓΆnig πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori