Abstract
The matter of using scheduling algorithms in parallel computing environments is discussed in the paper. A parallel path-relinking approach based on scatter search metaheuristics is proposed for the flow shop problem with C max and C sum criteria. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alab, E.: Parallel Metaheuristics. Wiley & Sons Inc., Chichester (2005)
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)
Garey, M.R., Johnson, D.S., Seti, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Grabowski, J.: A new algorithm of solving the flow-shop problem, Operations Research in Progress, pp. 57–75. D. Reidel Publishing Company (1982)
Grabowski, J., Pempera, J.: New block properties for the permutation flow shop problem with application in tabu search. Journal of Operational Research Society 52, 210–220 (2000)
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)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91, 160–175 (1996)
Nowicki, E., Smutnicki, C.: Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research 169, 654–666 (2006)
OR-Library: http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6, 45–60 (1998)
Smutnicki, C.: Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research 109(1), 66–87 (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 Path-Relinking Method for the Flow Shop Scheduling Problem. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2008. ICCS 2008. Lecture Notes in Computer Science, vol 5101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69384-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-69384-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69383-3
Online ISBN: 978-3-540-69384-0
eBook Packages: Computer ScienceComputer Science (R0)