Parallel Single-Thread Strategies in Scheduling

Authors:
Wojciech Bożejko;Jarosław Pempera;Adam Smutnicki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372
Venue:
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 2
Cited 1

State of the Art in Parallel Search Techniques for Discrete Optimization Problems

IEEE Transactions on Knowledge and Data Engineering
Parallel Single-Thread Strategies in Scheduling

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing

Parallel Single-Thread Strategies in Scheduling

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper, as well as coupled paper [2], deal with various aspects of scheduling algorithms dedicated for processing in parallel computing environments. In this paper, for the exemplary problem, namely the flow-shop scheduling problem with makespan criterion, there are proposed original methods for parallel analysis of a solution as well as a group of concentrated and/or distributed solutions, recommended for the use in metaheuristic approaches with single-thread trajectory. Such methods examine in parallel consecutive local sub-areas of the solution space, or a set of distributed solutions called population, located along the singletrajectory passed through the space. Supplementary multi-thread search techniques applied in metaheuristics have been discussed in complementary our paper [2].