Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Černý V., Thermodynamical approach to travelling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45 (1985) 41–51.
Garey M.R., D.S. Johnson, R. Seti, The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research1 (1976) 117–129.
Grabowski J., A new algorithm of solving the flow-shop problem, Operations Re-search in Progress. D. Reidel Publishing Company (1982) 57–75.
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.
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.
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.
Johnson S.M., Optimal two and three-stage production schedules with setup times included. Naval Research Logistic Quertely 1 (1954) 61–68.
Kirkpatrick S., C.D. Gellat, M.P. Vecchi, Optimization by simulated annealing. Science 220 (1983) 671–680.
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.
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.
Nowicki E., C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research 91 (1996) 160–175.
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.
Osman I., Potts, Simulated Annealing for Permutation Flow-Shop Scheduling. OMEGA 17(6) (1989) 551–557.
Reeves C., Improving the Efficiency of Tabu Search for Machine Sequencing Problems. Journal of Operational Research Society 44(4) (1993) 375–382.
Reeves C., A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research 22(1) (1995) 5–13.
Taillard E., Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47(1) (1990) 65–74.
Taillard E., Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278–285.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wodecki, M., Bożzejko, W. (2002). Solving the Flow Shop Problem by Parallel Simulated Annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_26
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive