Task scheduling by guided simulated annealing

This paper presents an algorithm to schedule tasks in work orders for a man ufacturing company in a job-shop environment. The algorithm is a modified f orm of simulated annealing, where each perturbation is guided by several fa ctors, one of which is the cruciality of each day in the current solution s tate. This approach is found to be generally superior to the ordinary annea ling algorithm.