×

Ein adaptives stochastisches Suchverfahren für spezielle Reihenfolgeprobleme. (An adaptive random search method for special sequencing problems). (German) Zbl 0637.90054

Summary: Various machine scheduling problems, where the set of solutions is given by the set of permutations of m elements, belong to the class of NP-hard problems. Therefore, the construction of efficient approximation methods is necessary. In this paper we present an adaptive stochastic search procedure for the considered problem which is based on the application of biological evolution principles. The evolution strategy of this paper includes the known thermodynamical strategy. Finally, the computational results on a special machine scheduling problem, the \([m/n/P/C_{\max}]\) permutation flow shop problem, are presented.

MSC:

90B35 Deterministic scheduling theory in operations research
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite