Abstract
Flow-shop scheduling is considered. The order of operations must be the same for each job to minimize the maximum completion time. The Simulated Annealing algorithm is a standard approximate solution method in scheduling and optimization in general. Since the algorithm depends on cooling as a heuristic to generate better approx- imations, choosing the strategy with which the temperature decreases can affect the final result.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
