Advertisement

Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem

  • Seyed Habib A. Rahmati
  • M. Zandieh
  • M. Yazdani
ORIGINAL ARTICLE

Abstract

The aim of this paper is to study multi-objective flexible job shop scheduling problem (MOFJSP). Flexible job shop scheduling problem is a modified version of job shop scheduling problem (JSP) in which an operation is allowed to be processed by any machine from a given set of capable machines. The objectives that are considered in this study are makespan, critical machine work load, and total work load of machines. In the literature of the MOFJSP, since this problem is known as an NP-hard problem, most of the studies have developed metaheuristic algorithms to solve it. Most of them have integrated their objective functions and used an integrated single-objective metaheuristic algorithm though. In this study, two new version of multi-objective evolutionary algorithms including non-dominated sorting genetic algorithm and non-dominated ranking genetic algorithm are adapted for MOFJSP. These algorithms use new multi-objective Pareto-based modules instead of multi-criteria concepts to guide their process. Another contribution of this paper is introducing of famous metrics of the multi-objective evaluation to literature of the MOFJSP. A new measure is also proposed. Finally, through using numerous test problems, calculating a number of measures, performing different statistical tests, and plotting different types of figures, it is shown that proposed algorithms are at least as good as literature’s algorithm.

Keywords

Scheduling Flexible job shop Multiobjective evolutionary algorithm Non-dominated sorting genetic algorithm Non-dominated ranking genetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Al Jadaan O, Rao CR, Rajamani L (2008) Non-dominated ranked genetic algorithm for solving multi-objective optimization problems: NRGA. J Theor Appl Inf Technol 2008:60–67Google Scholar
  2. 2.
    Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations Research and Industrial Engineering, University of Texas, Austin, Technical Report Series, ORP96-09Google Scholar
  3. 3.
    Brandimarte P (1993) Routing and scheduling in a flexible job shop by taboo search. Annu Oper Res 41:157–183zbMATHCrossRefGoogle Scholar
  4. 4.
    Chen JC, Chen KH, Wu JJ, Chen CW (2008) A study of the flexible job shop scheduling problem with parallel machines and reentrant process. Int J Adv Manuf Technol 39(3–4):344–354CrossRefGoogle Scholar
  5. 5.
    Coello Coello CA (2001) A short tutorial on evolutionary multiobjective optimization. In: Zitzler E, Deb K, Thiele L, Coello CAC, Corne D (eds) First International Conference on Evolutionary Multi-Criterion Optimization (1993). Springer, Berlin, pp 21–40, Lecture Notes in Computer ScienceCrossRefGoogle Scholar
  6. 6.
    Dauzère-Pérès S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annu Oper Res 70(3):281–306zbMATHCrossRefGoogle Scholar
  7. 7.
    Deb K (2001) Multiobjective optimization using evolutionary algorithms. Wiley, Chichester, U.KGoogle Scholar
  8. 8.
    Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Proceedings of The Parallel Problem Solving From Nature VI (PPSN-VI) Conference, 849–858Google Scholar
  9. 9.
    Fattahi P (2009) A hybrid multi objective algorithm for flexible job shop scheduling. International Journal of Computational and Mathematical Sciences 3:215–220, PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 38 FEBRUARY 2009, Malaysia, ISSN: 2070–3740Google Scholar
  10. 10.
    Fattahi P, Fallahi A (2010) Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability. CIRP J Manuf Sci Technol 2:114–123CrossRefGoogle Scholar
  11. 11.
    Fattahi P, Saidi Mehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. Int J Adv Manuf Technol 18:331–342Google Scholar
  12. 12.
    Fattahi P, Jolai F, Arkat J (2009) Flexible job shop scheduling with overlapping in operations. Appl Math Model 33:3076–3087zbMATHCrossRefGoogle Scholar
  13. 13.
    Frutos M, Olivera AC, Tohmé F (2010) A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Annu Oper Res. doi: 10.1007/s10479-010-0751-9
  14. 14.
    Gao J, Gen M, Sun LY, Zhao XH (2007) A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput Ind Eng 53(1):149–162zbMATHCrossRefGoogle Scholar
  15. 15.
    Garey MR, Johnson DS (1979) A guide to the theory of NP-completeness. Freeman, San FranciscozbMATHGoogle Scholar
  16. 16.
    Ho NB, Tay JC, Lai E (2007) An effective architecture for learning and evolving flexible job-shop schedules. Eur J Oper Res 179:316–333zbMATHCrossRefGoogle Scholar
  17. 17.
    Hollander M, Wolfe DA (1973) Nonparametric statistical methods. Wiley, New YorkzbMATHGoogle Scholar
  18. 18.
    Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machine. Oper Res Spectr 15(4):205–215MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Kacem I, Hammadi S, Borne P (2002) Approach by localization multi-objective evolutionary optimization for flexible job-shops scheduling problems. IEEE Trans Syst Man Cybern Part C Appl Rev 32(1):1–13CrossRefGoogle Scholar
  20. 20.
    Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern Part C Appl Rev 32(1):13CrossRefGoogle Scholar
  21. 21.
    Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3–5):245–276MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Karimi N, Zandieh M, Karamooz HR (2010) Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Syst Appl 37:4024–4032CrossRefGoogle Scholar
  23. 23.
    Liu HB, Abraham A, Choi O, Moon SH (2006) Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. Lect Notes Comput Sci 4247:197–204CrossRefGoogle Scholar
  24. 24.
    Mastrolilli M, Gambardella LM (2000) Effective neighborhood functions for the flexible job shop problem. J Sched 3(1):3–20MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Mati Y, Rezg N, Xie XL (2001) An integrated greedy heuristic for a flexible job shop scheduling problem. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics 4:2534–2539, 7–10 Oct 2001; Tucson, AZ, USAGoogle Scholar
  26. 26.
    Rahmati SHA, Zandieh M (2012) A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int J Adv Manuf Technol (2012) 58:1115–1129Google Scholar
  27. 27.
    Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with Tabu search algorithms. Int J Adv Manuf Technol 32(5–6):563–570CrossRefGoogle Scholar
  28. 28.
    Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithms optimization. Master's thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  29. 29.
    Scrich CR, Armentano VA, Laguna M (2004) Tardiness minimization in a flexible job shop: a tabu search approach. Int J Adv Manuf Technol 15(1):103–115Google Scholar
  30. 30.
    Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248CrossRefGoogle Scholar
  31. 31.
    Wang X, Gao L, Zhang G, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Technol 51(5–8):757–767CrossRefGoogle Scholar
  32. 32.
    Xia WJ, Wu ZM (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computer and Industrial Engineering 48(2):409–425MathSciNetCrossRefGoogle Scholar
  33. 33.
    Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37:678–687CrossRefGoogle Scholar
  34. 34.
    Zitzler E (1999) Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD. Thesis, Dissertation ETH No. 13398, Swiss Federal Institute of Technology (ETH), Zürich, SwitzerlandGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  • Seyed Habib A. Rahmati
    • 1
  • M. Zandieh
    • 2
  • M. Yazdani
    • 3
  1. 1.Young Researchers Club, Qazvin BranchIslamic Azad UniversityQazvinIran
  2. 2.Department of Industrial Management, Management and Accounting FacultyShahid Beheshti University, G.C.TehranIran
  3. 3.Department of Industrial and Mechanical EngineeringQazvin Islamic Azad UniversityQazvinIran

Personalised recommendations