Skip to main content

Advertisement

SpringerLink
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation. Natural Computing Series. Springer, Berlin (2006)

    MATH  Google Scholar 

  • Bierwirth, C.: A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spektrum 17, 87–92 (1995)

    Article  MATH  Google Scholar 

  • Bierwirth, C., Mattfeld, D.C., Kopfer, H.: On permutation representations for scheduling problems. In: Voigt, H., Ebeling, W., Rechenberg, I., Schwefel, H. (eds.) Parallel Problem Solving from Nature—PPSN IV. Lecture Notes in Computer Science, vol. 1141. Springer, Berlin (1996)

    Chapter  Google Scholar 

  • Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. J. Heuristics 9, 451–470 (2003)

    Article  Google Scholar 

  • Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A survey of hyper-heuristics. Tech. Rep. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham (2009a)

  • Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.: A classification of hyper-heuristics approaches. Tech. Rep. NOTTCS-TR-SUB-0907061259-5808, School of Computer Science and Information Technology, University of Nottingham (2009b)

  • Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms—i. Representation. Comput. Ind. Eng. 30(4), 983–997 (1996)

    Article  Google Scholar 

  • Chiang, T., Fu, L.: Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment. In: IEEE Congress on Evolutionary Computation, pp. 3266–3273 (2006)

  • Chiang, T.C., Shen, Y.S., Fu, L.C.: A new paradigm for rule-based scheduling in the wafer probe centre. Int. J. Prod. Res. 46(15), 4111–4133 (2008)

    Article  MATH  Google Scholar 

  • Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E.K., Erben, W. (eds.) Practice and Theory of Automated Timetabling III: Third International Conference, PATAT 2000. LNCS, vol. 2079, pp. 176–190. Springer, Berlin (2000)

    Chapter  Google Scholar 

  • Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Proceedings of Parallel Problem Solving from Nature Conference, 7th International Conference. LNCS, vol. 2439, pp. 851–860. Springer, Berlin (2002)

    Chapter  Google Scholar 

  • Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  • Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Comput. Oper. Res. 22, 25–40 (1995)

    Article  MATH  Google Scholar 

  • Fang, H., Ross, P., Corne, D.: A promising hybrid GA/Heuristic approach for open-shop scheduling problems. In: Cohn, A. (ed.) 11th European Conference on Artificial Intelligence (ECAI 94), pp. 590–594. Wiley, New York (1994)

    Google Scholar 

  • Fayad, C., Petrovic, S.: Genetic algorithm for the real world fuzzy job-shop scheduling. In: Proceedings of the International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems IEA/AIE-2005. Lecture Notes in Computer Science, vol. 3533, pp. 524–533. Springer, Berlin (2005)

    Google Scholar 

  • Fenton, P., Walsh, P.: Improving the performance of the repeating permutation representation using morphogenic computation and generalised modified order crossover. In: Proceedings of the Congress on Evolutionary Computation (CEC 2005), vol. 2, pp. 1372–1379 (2005)

  • Geiger, C.D., Uzsoy, R., Aytŭg, H.: Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. J. Sched. 9, 7–34 (2006)

    Article  MATH  Google Scholar 

  • Hart, E., Ross, P.: A heuristic combination method for solving job-shop scheduling problems. In: Lecture Notes in Computer Sciences, vol. 1498, pp. 845–854. Springer, Berlin (1998)

    Google Scholar 

  • Knowles, J., Thiele, L., Zitzler, E.: A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. 214, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland, revised version (2006)

  • Liu, M., Wu, C.: Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line. Robot. Comput.-Integr. Manufact. 20, 225–236 (2004)

    Article  Google Scholar 

  • Mattfeld, D.C., Bierwirth, C., Kopfer, H.: A search space analysis of the job shop scheduling problem. Ann. Oper. Res. 86, 441–453 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley, New York (2005)

    MATH  Google Scholar 

  • Petrovic, S., Fayad, C., Petrovic, D., Burke, E., Kendall, G.: Fuzzy job shop scheduling with lot-sizing. Ann. Oper. Res. 159(1), 275–292 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • Ponnambalam, S.G., Ramkumar, V., Jawahar, N.: A multiobjective genetic algorithm for job shop scheduling. Prod. Plan. Control 12(8), 764–774 (2001)

    Article  Google Scholar 

  • Ross, P., Schulenburg, S., Marín-Blázquez, J.G., Hart, E.: Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In: Genetic and Evolutionary Computation Conference (GECCO 2002) (2002)

  • Silva, J.D.L., Burke, E.K., Petrovic, S.: An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux, X., Sevaux, M., Sorensen, K., T’kindt, V. (eds.) Metaheuristic for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol. 535, pp. 91–129. Springer, Berlin (2004)

    Google Scholar 

  • Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manag. Sci. 38(10), 1495–1509 (1992)

    Article  MATH  Google Scholar 

  • Streeter, M.J., Smith, S.F.: How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines. J. Artif. Intell. Res. 26, 247–287 (2006)

    MATH  MathSciNet  Google Scholar 

  • Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54, 453–473 (2008)

    Article  Google Scholar 

  • T’kindt, V., Billaut, J.C.: Multicriteria Scheduling. Springer, Berlin (2002)

    MATH  Google Scholar 

  • Vázquez-Rodríguez, J.A., Petrovic, S.: Analysis of parameters of dispatching rule based genetic algorithms for the multi-objective job shop scheduling problem (2009, under review)

  • Vázquez-Rodríguez, J.A., Petrovic, S., Salhi, A.: A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines. In: Baptiste, P., Kendall, G., Munier-Kordon, A., Sourd, F. (eds.) Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications, Paris, France, pp. 506–513 (2007a)

  • Vázquez-Rodríguez, J.A., Petrovic, S., Salhi, A.: An investigation of hyper-heuristic search spaces. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pp. 3776–3783 (2007b)

  • Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) Parallel Problem Solving from Nature (PPSN VIII). Lecture Notes in Computer Science, vol. 3242, pp. 832–842. Springer, Berlin (2004)

    Chapter  Google Scholar 

  • Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, UK

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

Authors
  1. José Antonio Vázquez-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanja Petrovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Antonio Vázquez-Rodríguez.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vázquez-Rodríguez, J.A., Petrovic, S. A new dispatching rule based genetic algorithm for the multi-objective job shop problem. J Heuristics 16, 771–793 (2010). https://doi.org/10.1007/s10732-009-9120-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-009-9120-8

Search

Navigation