Solving the Flow Shop Problem by Parallel Simulated Annealing
In this paper we present two simulated annealing algorithms (sequential and parallel) for the permutation flow shop sequencing problem with the objective of minimizing the flowtime. We propose a neighbourhood using the so-called blocks of jobs on a critical path and specific accepting function. We also use the lower bound of cost function. By computer simulations on Taillard  and other random problems, it is shown that the performance of the proposed algorithms is comparable with the random heuristic technique discussed in literature. The proposed properties can be applied in any local search procedures.
Keywordssimulated annealing flow shop sequencing critical path’s blocks parallel algorithm
Unable to display preview. Download preview PDF.
- 3.Grabowski J., A new algorithm of solving the flow-shop problem, Operations Re-search in Progress. D. Reidel Publishing Company (1982) 57–75.Google Scholar
- 10.Navaz M., E.E. Enscore Jr, and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA 11/1 (1983) 91–95.Google Scholar