Parallel estimation of the cost function for the flexible scheduling problemI

AbstractThe aim of this paper is to show how to determine the neighborhood of the complex discrete optimization problem and how to search it in the parallel environment, this being illustrated by an example of the hybrid scheduling, more precisely a flexible job shop problem. We present a parallel single-walk approach in this respect. A theoretical analysis based on PRAM model of parallel computing has been made. We propose a cost-optimal method of neighborhood generation parallelization