𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for parallel machine scheduling with linear deterioration

✍ Scribed by Liu, Ming; Zheng, Feifeng; Wang, Shijin; Xu, Yinfeng

Book ID
120734115
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
193 KB
Volume
497
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms || Scheduling o
Approximation Algorithms || Scheduling on Unrelated Parallel Machines
✍ Vazirani, Vijay V. πŸ“‚ Article πŸ“… 2003 πŸ› Springer Berlin Heidelberg 🌐 English βš– 684 KB

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conΒ­ jecture that P -=/= NP, their

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