Some new results on simulated annealing
β
M. Kolonko
π
Article
π
1999
π
Elsevier Science
π
English
β 256 KB
We present two results about heuristic solutions to the job shop scheduling problem (JSP). First, we show that the well-known analytical results on convergence of simulated annealing (SA) do not hold in the application to the JSP. We give a simple counterexample where the SA process converges agains