𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ACO Algorithm for Scheduling Complex Unrelated Parallel Machine

✍ Scribed by Liu, Guo Bao; Zhu, Qiong; Zhang, Jie

Book ID
120816699
Publisher
Trans Tech Publications, Ltd.
Year
2011
Tongue
English
Weight
286 KB
Volume
268-270
Category
Article
ISSN
1662-8958

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