Abstract
In the paper we consider strongly NP-hard flow shop problem with the criterion of minimization of the sum of job’s finishing times. We present the parallel algorithm based on the scatter search method. Obtained results are compared to the best known from the literature. Superlinear speedup has been observed in the parallel calculations.
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.
References
Bożejko, W., Wodecki, M.: Solving the flow shop problem by parallel tabu search. In: Proceedings of PARELEC 2004, pp. 189–194. IEEE Computer Society, Los Alamitos (2004)
Bożejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 566–571. Springer, Heidelberg (2004)
Bożejko, W., Wodecki, M.: A fast parallel dynasearch algorithm for some scheduling problems. In: Proceedings of PARELEC 2006, pp. 275–280. IEEE Computer Society, Los Alamitos (2006)
Grabowski, J., Pempera, J.: New block properties for the permutation flow-shop problem with application in TS. Journal of Operational Research Society 52, 210–220 (2001)
Holland, J.H.: Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press (1975)
James, T., Rego, C., Glover, F.: Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems 20(4), 58–65 (2005)
Liu, J.: A new heuristic algorithm for csum flowshop scheduling problems, Personal Communication (1997)
OR-Library: http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Reeves, C.R., Yamada, T.: Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search. In: IEEE International Conference on Evolutionary Computation, pp. 230–234 (1998)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Wang, C., Chu, C.: Proth J., Heuristic approaches for n/m/F/ΣC i scheduling problems. European Journal of Operational Research, 636–644 (1997)
Wodecki, M., Bożejko, W.: Solving the flow shop problem by parallel simulated annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 236–247. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bożejko, W., Wodecki, M. (2008). Parallel Scatter Search Algorithm for the Flow Shop Sequencing Problem. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)