A simulated annealing approach to makespan minimization on identical parallel machines
β Scribed by Wen-Chiung Lee; Chin-Chia Wu; Peter Chen
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 119 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times dep
Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain conditions to converge to a global minimum. The major disadvantage of this technique is its very slow convergence: this makes it not suitable for many complex optimization problems. Different parallel vers