PUB - Publikationen an der Universität Bielefeld

This paper considers dynamic multi-objective machine scheduling problems in response to continuous arrival of new jobs, under the assumption that jobs can be rejected and job processing time is controllable. The operational cost and the cost of deviation from the baseline schedule need to be optimized simultaneously. To solve these dynamic scheduling problems, a directed search strategy (DSS) is introduced into the elitist non-dominated sorting genetic algorithm (NSGA-II) to enhance its capability of tracking changing optimums while maintaining fast convergence. The DSS consists of a population re-initialization mechanism (PRM) to be adopted upon the arrival of new jobs and an offspring generation mechanism (OGM) during evolutionary optimization. PRM re-initializes the population by repairing the non-dominated solutions obtained before the disturbances occur, modifying randomly generated solutions according to the structural properties, as well as randomly generating solutions. OGM generates offspring individuals by fine-tuning a few randomly selected individuals in the parent population, employing intermediate crossover in combination with Gaussian mutations to generate offspring, and using intermediate crossover together with a differential evolution based mutation operator. Both PRM and OGM aim to strike a good balance between exploration and exploitation in solving the dynamic multi-objective scheduling problem. Comparative studies are performed on a variety of problem instances of different sizes and with different changing dynamics. Experimental results demonstrate that the proposed DSS is effective in handling the dynamic scheduling problems under investigation.