A new dispatching rule based genetic algorithm for the multi-objective job shop problem

  • Authors:

  • José Antonio Vázquez-Rodríguez;Sanja Petrovic

  • Affiliations:

  • Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, UK NG8 1BB;Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, UK NG8 1BB

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

Hyper-heuristics or "methodologies to choose heuristics" are becoming increasingly popular given their suitability to solve hard real world combinatorial optimisation problems. Their distinguishing feature is that they operate in the space of heuristics or heuristic components rather than in the solution space. In Dispatching Rule Based Genetic Algorithms (DRGA) solutions are represented as sequences of dispatching rules which are called one at a time and used to sequence a number of operations onto machines. The number of operations that each dispatching rule in the sequence handles is a parameter to which DRGA is notoriously sensitive. This paper proposes a new hybrid DRGA which searches simultaneously for the best sequence of dispatching rules and the number of operations to be handled by each dispatching rule. The investigated DRGA uses the selection mechanism of NSGA-II when handling multi-objective problems.The proposed representation was used to solve different variants of the multi-objective job shop problem as well as the single objective problem with the sum of weighted tardiness objective. Our results, supported by the statistical analysis, confirm that DRGAs that use the proposed representation obtained better results in both the single and multi-objective environment overall and on each particular set of instances than DRGAs using the conventional dispatching rule representation and a GA that uses the more common permutation representation.