Skip to main content

Advertisement

SpringerLink
Log in

Integration of genetic algorithm and Monte Carlo to analyze the effect of routing flexibility

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Flexibility is an important task for effectively utilizing resources in a manufacturing system and responding demands rapidly. In manufacturing systems, there exist different types of flexibility levels. In this study, the stochastic flexible job shop scheduling problem is considered to measure the impact of routing flexibility on shop performance. Thus, an integrated genetic algorithm-Monte Carlo method is proposed to analyze the effect of routing flexibility. To make the problem more realistic, system parameters (processing times, operation sequences, etc.) are generated randomly via Monte Carlo. An experimental design is utilized to analyze main and interaction effects of the factors considered (i.e., number of parts, number of machines, number of operations, and flexibility levels) by using a genetic algorithm which is specifically designed for the stochastic flexible job shop scheduling problem. In developed genetic algorithm, different initial strategies which not only improve solution quality but also decrease solution time are used. Makespan is specified as the objective function to be minimized. Results are analyzed with a full factorial analysis of variance. Comprehensive discussions of results are given case by case.

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.

Similar content being viewed by others

References

  1. Jain A, Jain PK, Chan FTS (2013) A review on manufacturing flexibility. Int J Prod Res 51(19):5946–5970

    Article  Google Scholar 

  2. Browne J, Dubois D, Sethi RK, Stecke KE (1984) Classification of flexible manufacturing systems. FMS Mag 2(2):114–117

    Google Scholar 

  3. Sethi AK, Sethi SP (1990) Flexibility in manufacturing: a survey. Int J Flex Manuf Syst 2:289–328

    Article  Google Scholar 

  4. Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38:3563–3573

    Article  Google Scholar 

  5. Rossi A, Dini G (2007) Flexible job shop scheduling with routing flexibility and separable setup times using ant colony optimization method. Robot Cim Int Manuf 23:503–516

    Article  Google Scholar 

  6. Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling. Comput Oper Res 35:2892–2907

    Article  MathSciNet  MATH  Google Scholar 

  7. Baykasoglu A, Ozbakır L (2008) Analyzing the effect of flexibility on manufacturing systems performance. J Manuf Tech Manag 19(2):172–193

    Article  Google Scholar 

  8. Li J-Q, Pan Q-K, Suganthan PN (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52:683–697

    Article  Google Scholar 

  9. Shivasankaran N, Senthilkumar P, Raja KV (2014, January) Hybrid non-dominated sorting simulated annealing Algorithm for flexible job shop scheduling problems. In ICT and critical infrastructure: proceedings of the 48th annual convention of computer society of India, Springer International PublishingVol I pp. 101–107

  10. Shivasankaran N, Senthil Kumar P, Venkatesh Raja K (2015) Hybrid sorting immune simulated annealing algorithm for flexible job shop scheduling. Int J Comput Intell Syst 8(3):455–466

    Article  Google Scholar 

  11. Yoshitomi Y (2002) A genetic algorithm approach to solving stochastic job shop scheduling problems. Int Trans Oper Res 9:479–495

    Article  MathSciNet  MATH  Google Scholar 

  12. Yoshitomi Y, Yamaguchi R (2003) A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling. Int. Trans. Oper. Res. 10: 577–596. doi: 10.1111/1475-3995.00429

  13. Magalhães-Mendes J (2011) A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method. Recent researches in artificial intelligence, knowledge engineering and data bases

  14. Gu J, Gu M, Cao C, Gu X (2010) A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput Oper Res 37:927–937

    Article  MathSciNet  MATH  Google Scholar 

  15. Lei D-M, Xiong H-J (2008) Job shop scheduling with stochastic processing time through genetic algorithm. Machine learning and cybernetics, 2008 international conference, Vol. 2. IEEE, 2008

  16. Lei D (2011) Scheduling stochastic job shop subject to random breakdown to minimize makespan. Int J Adv Manuf Technol 55:1183–1192

    Article  Google Scholar 

  17. Lei D (2012) Minimizing makespan for scheduling stochastic job shop with random breakdowns. Appl Math Comput 218:11851–11858

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang R, Wu C (2011) An artificial bee colony algorithm for the job shop scheduling problem with random processing times. Entropy 13:1708–1729

    Article  MATH  Google Scholar 

  19. Lei D (2011) Population-based neighborhood search for job shop scheduling with interval processing time. Comput Ind Eng 61:1200–1208

    Article  Google Scholar 

  20. Lei D (2011) Simplified multi-objective genetic algorithms for stochastic job shop scheduling. Appl Soft Comput 11:4991–4996

    Article  Google Scholar 

  21. Horng S, Lin S, Yang F (2012) Evolutionary algorithm for stochastic job shop scheduling with random processing time. Expert Syst Appl 39:3603–3610

    Article  Google Scholar 

  22. Wang YM, Yin HL, Qin KD (2013) A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions. Int J Adv Manuf Technol 68:1317–1326

    Article  Google Scholar 

  23. Gu J, Gu X, Gu M (2009) A novel parallel quantum genetic algorithm for stochastic job shop scheduling. J Math Anal Appl 355:63–81

    Article  MathSciNet  MATH  Google Scholar 

  24. Zhang R, Song S, Wu C (2012) A two-stage hybrid particle swarm optimization algorithm for the stochastic job shop scheduling problem. Knowl-Based Syst 27:393–406

    Article  MathSciNet  Google Scholar 

  25. Xiong J, Xing L-n, Chen Y-w (2013) Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns. Int J Production Econ 141:112–126

    Article  Google Scholar 

  26. Moradi E, Fatemi Ghomi SMT, Zandieh M (2010) An efficient architecture for scheduling flexible job-shop with machine availability constraints. Int J Adv Manuf Technol 51:325–339

    Article  Google Scholar 

  27. Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. The Int J Adv Manuf Technol 51(5-8):757–767

  28. Golmakani HR, Namazi A (2012) An artificial immune algorithm for multiple-route job shop scheduling problem. Int J Adv Manuf Technol 63(1–4):77–86

    Article  Google Scholar 

  29. Pinedo M (2002) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Gaziantep University, 27310, Gaziantep, Turkey

    Ayşe Tuğba Dosdoğru & Faruk Geyik

  2. Industrial Engineering Department, Adana Science and Technology University, Adana, Turkey

    Mustafa Göçken

Authors
  1. Ayşe Tuğba Dosdoğru
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mustafa Göçken
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Faruk Geyik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ayşe Tuğba Dosdoğru.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dosdoğru, A.T., Göçken, M. & Geyik, F. Integration of genetic algorithm and Monte Carlo to analyze the effect of routing flexibility. Int J Adv Manuf Technol 81, 1379–1389 (2015). https://doi.org/10.1007/s00170-015-7247-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-7247-3

Keywords

Search

Navigation