Skip to main content

A Pareto-Based Differential Evolution Algorithm for Multi-Objective Job Shop Scheduling Problems

  • Conference paper
  • First Online:
Proceedings of the Institute of Industrial Engineers Asian Conference 2013

Abstract

This paper presents a multi-objective differential evolution algorithm (MODE) and its application for solving multi-objective job shop scheduling problems. Five mutation strategies with different search behaviors proposed in the MODE are used to search for the Pareto front. The performances of the MODE are evaluated on a set of benchmark problems and the numerical experiments show that the MODE is a highly competitive approach which is capable of providing a set of diverse and high-quality non-dominated solutions compared to those obtained from existing algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Abbass HA, Sarker R, Newton C (2001) PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems. In: Proceedings of the 2001 congress on evolutionary computation, vol 2, pp 971–978

    Google Scholar 

  • Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154–160

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Chiang TC, Fu LC (2006) Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment. In: Proceedings of 2006 IEEE congress on evolutionary computation. Vancouver, Canada. 16–21 July 2006, pp 3266–3273

    Google Scholar 

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

    Article  Google Scholar 

  • Lei D (2008) A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Com Ind Eng 54(4):960–971

    Article  Google Scholar 

  • Lei D, Wu Z (2006) Crowding–measure-based multiobjective evolutionary algorithm for job shop scheduling. Int J Adv Manuf Tech 30(1–2):112–117

    Article  Google Scholar 

  • Lei DM, Xiong HJ (2007) An efficient evolutionary algorithm for multi-objective stochastic job shop scheduling. In: Proceedings of the 6th international conference on machine learning and, cybernetics. 19–22 August 2007, pp 867–872

    Google Scholar 

  • Madavan NK (2002) Multiobjective optimization using a Pareto differential evolution approach. In: Proceedings of the, evolutionary computation. 12–17 May 2002, pp 1145–1150

    Google Scholar 

  • Ripon KSN, Tsang CH, Kwong S (2006) Multi-objective evolutionary job-shop scheduling using jumping genes genetic algorithm. In: Proceeding of international joint conference on neural networks. 16–21 July 2006, pp 3100–3107

    Google Scholar 

  • Storn R, Price K (1995) Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, Berkeley, CA: International Computer Science

    Google Scholar 

  • Wisittipanich W, Kachitvichyanukul V (2010) Two enhanced differential evolution algorithms for job shop scheduling problems. Int J Prod Res 50(10):2757–2773

    Article  Google Scholar 

  • Wisittipanich W, Kachitvichyanukul V (2012) Mutation strategies toward Pareto front for multi-objective differential evolution algorithm. Int J Oper Res (article in press)

    Google Scholar 

  • Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Warisa Wisittipanich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Singapore

About this paper

Cite this paper

Wisittipanich, W., Kachitvichyanukul, V. (2013). A Pareto-Based Differential Evolution Algorithm for Multi-Objective Job Shop Scheduling Problems. In: Lin, YK., Tsao, YC., Lin, SW. (eds) Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4451-98-7_133

Download citation

  • DOI: https://doi.org/10.1007/978-981-4451-98-7_133

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4451-97-0

  • Online ISBN: 978-981-4451-98-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics