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
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
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