A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems

Authors:
Wojciech Boyzejko;Mieczyslaw Wodecki
Affiliations:
Wroclaw University of Technology, Poland;University of Wroclaw, Poland
Venue:
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
Year:
2006

Citing 0
Cited 2

Parallel scatter search algorithm for the flow shop sequencing problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Characterization and automation of matching-based neighborhoods

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a parallel dynasearch algorithm to solve the single machine total weighted tardiness problem. Nowadays dynasearch method is the most powerful heuristic method for the single machine total weighted scheduling problem. The neighborhood is generated by executing series of swap moves. Using dynamic programming such a neighborhood, which has exponential size, is explored in polynomial time. Here we propose parallel dynasearch algorithm for the parallel mainframe computers which significantly improves results of the sequential dynasearch algorithm.