Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups
- 94 Downloads
We propose a new method of sequential and parallel speeding up of the process of solving a single machine scheduling problem with total tardiness cost function. This improvement is done on two levels: generating a neighborhood inside path relinking method (basing on new approach—blocks in solutions) and parallelization of generating paths. The obtained results are compared to the benchmark ones taken from the literature. It was possible to find new the best solutions for many benchmark instances by using the proposed method.
KeywordsScatter search Single machine Setups
Unable to display preview. Download preview PDF.
- Bożejko, W., & Wodecki, M. (2004). Parallel genetic algorithm for minimizing total weighted completion time. In Lecture Notes in Computer Science No. 3070 (pp. 400–405). Springer.Google Scholar
- Cicirello, V. A. (2006). Non-wrapping order crossover: An order preserving crossover operator that respect absolute position. In 8th Annual genetic and evolutionary computation conference GECCO 2006 (pp. 1125–1131). ACM Press.Google Scholar
- Crainic, T. G., & Toulouse, M. (1998). Parallel metaheuristics. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics (pp. 205–251). Kluwer.Google Scholar
- James T., Rego C., Glover F. (2005) Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems 20(4): 58–65Google Scholar
- Reeves C.R., Yamada T. (1998) Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search. IEEE International Conference on Evolutionary Computation 1998: 230–234Google Scholar