Parallel Computing in Electrical Engineering, 2004. International Conference on (2006)

Bialystok, Poland

Sept. 13, 2006 to Sept. 17, 2006

ISBN: 0-7695-2554-7

pp: 275-280

Wojciech Bo?zejko , Wroclaw University of Technology, Poland

Mieczyslaw Wodecki , University of Wroclaw, Poland

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.

INDEX TERMS

null

CITATION

M. Wodecki and W. Bo?zejko, "A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems,"

*International Symposium on Parallel Computing in Electrical Engineering(PARELEC)*, Bialystok, 2006, pp. 275-280.

doi:10.1109/PARELEC.2006.3

CITATIONS