Parallel single-thread strategies in scheduling

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 single trajectory passed through the space. Supplementary multi-thread search techniques applied in metaheuristics have been discussed in complementary our paper [2]. © 2008 Springer-Verlag Berlin Heidelberg.