An immune genetic algorithm based on bottleneck jobs for the job shop scheduling problem

  • Authors:
  • Rui Zhang;Cheng Wu

  • Affiliations:
  • Department of Automation, Tsinghua University, Beijing, P.R. China;Department of Automation, Tsinghua University, Beijing, P.R. China

  • Venue:
  • EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

An immune genetic algorithm based on bottleneck jobs is presented for the job shop scheduling problem in which the total weighted tardiness must be minimized. Bottleneck jobs have significant impact on final scheduling performance and therefore need to be considered with higher priority. In order to describe the characteristic information concerning bottleneck jobs, a fuzzy inference system is employed to transform human knowledge into the bottleneck characteristic values which reflect the features of both the objective function and the current optimization stage. Then, an immune operator is designed based on these characteristic values and a genetic algorithm combined with the immune mechanism is devised to solve the job shop scheduling problem. Numerical computations for problems of different scales show that the proposed algorithm achieves effective results by accelerating the convergence of the optimization process.