Solving the Flow Shop Problem by Parallel Simulated Annealing

  • Mieczysław Wodecki
  • Wojciech Bożzejko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)


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 [17] 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.


simulated annealing flow shop sequencing critical path’s blocks parallel algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Černý V., Thermodynamical approach to travelling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45 (1985) 41–51.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Garey M.R., D.S. Johnson, R. Seti, The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research1 (1976) 117–129.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 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
  4. 4.
    Grabowski J., J. Pempera, New block properties for the permutation flow-shop problem with application in TS. Journal of Oper. Res. Soc. 52 (2001) 210–220.zbMATHCrossRefGoogle Scholar
  5. 5.
    Ignall E., L.E. Schrage, Application of the branch-and-bound technique to some flow-shop scheduling problems. Operations Research 13/3 (1965) 400–412.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Ishibuchi H., S. Misaki, H. Tanaka, Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem. Eur. Jour. of Oper. Res. 81 (1995) 388–398.zbMATHCrossRefGoogle Scholar
  7. 7.
    Johnson S.M., Optimal two and three-stage production schedules with setup times included. Naval Research Logistic Quertely 1 (1954) 61–68.CrossRefGoogle Scholar
  8. 8.
    Kirkpatrick S., C.D. Gellat, M.P. Vecchi, Optimization by simulated annealing. Science 220 (1983) 671–680.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Lageweg B.J., J.K., Lenstra, A.H.G. Rinnooy Kan, A General Bouding Scheme for the Permutation Flow-Schop Problem, Opns. Res. 26 (1978) 53–67.zbMATHCrossRefGoogle Scholar
  10. 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
  11. 11.
    Nowicki E., C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research 91 (1996) 160–175.zbMATHCrossRefGoogle Scholar
  12. 12.
    Ogbu F., D. Smith, The Application of the Simulated Annealing Algorithm to the Solution of the n/m/Cmax Flowshop Problem, Comp. & Oper. Res. 17(3) (1990) 243–253.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Osman I., Potts, Simulated Annealing for Permutation Flow-Shop Scheduling. OMEGA 17(6) (1989) 551–557.CrossRefGoogle Scholar
  14. 14.
    Reeves C., Improving the Efficiency of Tabu Search for Machine Sequencing Problems. Journal of Operational Research Society 44(4) (1993) 375–382.zbMATHGoogle Scholar
  15. 15.
    Reeves C., A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research 22(1) (1995) 5–13.zbMATHCrossRefGoogle Scholar
  16. 16.
    Taillard E., Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47(1) (1990) 65–74.MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Taillard E., Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278–285.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mieczysław Wodecki
    • 1
  • Wojciech Bożzejko
    • 2
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  2. 2.Institute of EngineeringWrocław University of TechnologyWroclawPoland

Personalised recommendations