Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups

Authors:
Wojciech Bożejko
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372
Venue:
Journal of Intelligent Manufacturing
Year:
2010

Citing 8
Cited 2

A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
Fast parallel heuristics for the job shop scheduling problem

Computers and Operations Research
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics

Journal of Heuristics
Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem

IEEE Intelligent Systems
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position

Proceedings of the 8th annual conference on Genetic and evolutionary computation
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research

An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.