𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Simulated Annealing Algorithms in Global Optimization

✍ Scribed by Esin Onbaşoğlu; Linet Özdamar


Book ID
110262661
Publisher
Springer US
Year
2001
Tongue
English
Weight
115 KB
Volume
19
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Parallel Simulated Annealing Algorithms
✍ D.Janaki Ram; T.H. Sreenivas; K.Ganapathy Subramaniam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 195 KB
Parallel simulated annealing for structu
✍ J.P.B. Leite; B.H.V. Topping 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 391 KB

The simulated annealing (SA) algorithm has proven to be a good technique for solving dicult combinatorial optimization problems. In engineering optimization the SA has emerged as an alternative tool to solve problems which are dicult to solve by conventional mathematical programming techniques. The

Optimization of job scheduling on parall
✍ Zhen-Ping Lo; B. Bavarian 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap