loading...
A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems
Bialystok, Poland September 13-September 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.3International Symposium on Parallel C ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Wojciech Bo?zejko, Mieczyslaw Wodecki, "A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems," Parallel Computing in Electrical Engineering, International Conference on, pp. 275-280, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PARELEC.2006.3,
author = {Wojciech Bo?zejko and Mieczyslaw Wodecki},
title = {A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2554-7},
pages = {275-280},
doi = {http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.3},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems
SN - 0-7695-2554-7
SP275
EP280
A1 - Wojciech Bo?zejko,
A1 - Mieczyslaw Wodecki,
PY - 2006
KW - null
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
Wojciech Bo?zejko, Wroclaw University of Technology, Poland
Mieczyslaw Wodecki, University of Wroclaw, Poland
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.
Citation:
Wojciech Bo?zejko, Mieczyslaw Wodecki, "A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems," parelec, pp.275-280, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.