|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04)
Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems
Dresden, Germany
September 07-September 10
ISBN: 0-7695-2080-4
| ASCII Text | x | ||
| Wojciech Bozejko, Mieczyslaw Wodecki, "Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems," Parallel Computing in Electrical Engineering, 2004. International Conference on, pp. 156-161, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/PCEE.2004.54, author = {Wojciech Bozejko and Mieczyslaw Wodecki}, title = {Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems}, journal ={Parallel Computing in Electrical Engineering, 2004. International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2080-4}, pages = {156-161}, doi = {http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.54}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel Computing in Electrical Engineering, 2004. International Conference on TI - Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems SN - 0-7695-2080-4 SP156 EP161 A1 - Wojciech Bozejko, A1 - Mieczyslaw Wodecki, PY - 2004 KW - null VL - 0 JA - Parallel Computing in Electrical Engineering, 2004. International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.54
There are very many issues, where scheduling can be applied, in computer systems (single and multiprocessors) as well as in production systems. Scheduling problems belongs in most cases to NP-hard class. For most of classical scheduling problems, published in last 10 years (for example benchmarks of Taillard [Benchmarks for basic scheduling problems] for the flow shop problem), there are still no optimal solutions. In this paper we propose very effective method of construct parallel algorithms based on tabu search metaheuristic. We apply block properties, which enable parallel algorithm to distribute calculations and reduce communication between processors. Algorithms are implemented in Ada95 and MPI.
Citation:
Wojciech Bozejko, Mieczyslaw Wodecki, "Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems," parelec, pp.156-161, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.