Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility

ORIGINAL ARTICLE

Abstract

This paper presents the results of a simulation study of a typical flexible manufacturing system that consists of seven machining centres, a loading and an unloading area, and six different part types. Owing to the existence of identical machining centres, the part types have alternative routings (their number varies between two and eight). One of the objectives of this work is to show how the following metaheuristics: ant colony optimisation, genetic algorithms, simulated annealing, tabu search, particle swarm optimisation and electromagnetism-like method, are adapted for solving the alternative routing selection problem in real time in order to reduce the congestion in the system by selecting a routing for each part among its alternative routings. The other goal is to highlight the impact of the real-time rescheduling of parts contained in the loading station on system performances when these metaheuristics are applied. The simulation results jugged by the production rate, machines and material handling utilisation rate show that for an overloaded system, the real-time rescheduling outperforms the case without rescheduling, but it has a negative impact on the work in process.

Keywords

Flexible manufacturing systems Alternative routing Real-time routing selection method Metaheuristics adaptation Rescheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Raj T, Shankar R, Suhaib M (2007) A review of some issues and identification of some barriers in the implementation of FMS. Int J Flex Manuf Syst 19(1):1–40. doi:10.1007/s10696-007-9015-7 MATHCrossRefGoogle Scholar
  2. 2.
    Bilge Ü, Fırat M, Albey E (2008) A parametric fuzzy logic approach to dynamic part routing under full routing flexibility. Comput Ind Eng 55(1):15–33CrossRefGoogle Scholar
  3. 3.
    Yu MC, Greene TJ (2009) An operational measure of routing flexibility in a multi-stage multi-product production system. Int J Adv Manuf Technol 43(3–4):357–364CrossRefGoogle Scholar
  4. 4.
    Garey MR, Johson DS (1979) Computers and intractability a guide of the theory of NP-completeness. Freeman, San FransiscoMATHGoogle Scholar
  5. 5.
    Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, CambridgeGoogle Scholar
  7. 7.
    Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 5(5):533–549MathSciNetCrossRefGoogle Scholar
  8. 8.
    Colorni A, Dorigo M, Maniezzo V (1992) Distributed optimization by ant colonies. In: Varela FJ, Bourgine P (eds) Proceedings of the First European Conference on Artificial Life (pp. 134–142). MIT Press, CambridgeGoogle Scholar
  9. 9.
    Eberhart RC, Kennedy J (1995) New optimizer using particle swarm theory. Proceedings of the sixth IEEE international symposium on micro machine and human science, Nagoya, Japan, pp. 39–43Google Scholar
  10. 10.
    Hassam A, Sari Z (2010) Selection of alternative routings in real time: DMM and modified DMM rules. International Journal of Product Development 10(1/2/3): 241–258Google Scholar
  11. 11.
    Souier M, Hassam A, Sari Z (2010) Meta-heuristics for real time routing selection in FMS. Book chapter in: Benyoucef L, Grabot B (eds) Artificial intelligence techniques for networked manufacturing enterprises management, ch. 8, pp 222–270, 2010. ISBN 978-1-84996-118-9, Springer-VerlagGoogle Scholar
  12. 12.
    Jerald J, Asokan P, Saravanan R, Delphin Carolina Rani A (2006) Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm. Int J Adv Manuf Technol 29(5–6):584–589Google Scholar
  13. 13.
    Chan FTS, Chan HK (2004) A comprehensive survey and future trend of simulation study on FMS scheduling. J Intell Manuf 15(1):87–102CrossRefGoogle Scholar
  14. 14.
    Saygin C, Kilic SE (2004) Dissimilarity maximization method for real-time routing of parts in random flexible manufacturing systems. Int J Flex Manuf Syst 16(2):169–182MATHCrossRefGoogle Scholar
  15. 15.
    ElMekkawy TY, ElMaraghy HA (2003) Real-time scheduling with deadlock avoidance in flexible manufacturing systems. Int J Adv Manuf Technol 22(3–4):259–270CrossRefGoogle Scholar
  16. 16.
    Sabuncuoglu I, Lahmar M (2003) An evaluative study of operation grouping policies in an FMS. Int J Flex Manuf Syst 15(3):217–239CrossRefGoogle Scholar
  17. 17.
    Liu PH, Makis V, Jardine AKS (2001) Scheduling of the optimal tool replacement times in a flexible manufacturing system. IIE Trans 33(6):487–495Google Scholar
  18. 18.
    Joseph OA, Sridharan R (2011) Evaluation of routing flexibility of a flexible manufacturing system using simulation modelling and analysis. Int J Adv Manuf Technol 56(1–4):273–289CrossRefGoogle Scholar
  19. 19.
    Ozmutlu S, Harmonosky CM (2005) A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: Threshold-based alternate routing. Eur J Oper Res 166(2):369–384MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    Buyurgan N, Saygin C (2008) Application of the analytical hierarchy process for real-time scheduling and part routing in advanced manufacturing systems. J Manuf Syst 27(3):101–110CrossRefGoogle Scholar
  21. 21.
    Buyurgan N, Mendoza A (2006) A multi-objective scheduling framework for flexible manufacturing systems. Int J Prod Res 44(7):1273–1295CrossRefGoogle Scholar
  22. 22.
    Buyurgan N, Saygin C (2006) An integrated control framework for flexible manufacturing systems. Int J Adv Manuf Technol 27(11–12):1248–1259CrossRefGoogle Scholar
  23. 23.
    Joseph OA, Sridharan R (2011) Effects of routing flexibility, sequencing flexibility and scheduling decision rules on the performance of a flexible manufacturing system. Int J Adv Manuf Technol 56(1–4):291–306CrossRefGoogle Scholar
  24. 24.
    Saygin C, Kilic SE (1999) Integrating flexible manufacturing systems with scheduling in flexible manufacturing system. Int J Adv Manuf Technol 15(4):268–280CrossRefGoogle Scholar
  25. 25.
    Saygin C, Chen FF, Singh J (2001) Real-time manipulation of alternative routings in flexible manufacturing systems: a simulation study. Int J Adv Manuf Technol 18(10):755–763CrossRefGoogle Scholar
  26. 26.
    Zhang G, Gao L, Li X, Li P (2008) Variable neighborhood genetic algorithm for the flexible job shop scheduling problems. Lecture Notes in Computer Science 5315:503–512CrossRefGoogle Scholar
  27. 27.
    Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic algorithm- based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36:156–168CrossRefGoogle Scholar
  28. 28.
    Zhang C, Rao Y, Li P (2008) An effective hybrid genetic algorithm for the job shop scheduling problem. Int J Adv Manuf Technol 39:965–974CrossRefGoogle Scholar
  29. 29.
    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. Int J Adv Manuf Technol 51(5–8):757–767CrossRefGoogle Scholar
  30. 30.
    Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job shop scheduling problem. Expert Syst Appl 38(4):3563–3573CrossRefGoogle Scholar
  31. 31.
    Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34:3229–3242MathSciNetMATHCrossRefGoogle Scholar
  32. 32.
    Vilcot G, Billaut J (2008) A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur J Oper Res 190:398–411MathSciNetMATHCrossRefGoogle Scholar
  33. 33.
    Suresh RK, Mohanasundaram KM (2006) Pareto archived simulated annealing for job shop scheduling with multiple objectives. Int J Adv Manuf Technol 29:184–196CrossRefGoogle Scholar
  34. 34.
    Kang K, Zhang R, Yang Y (2007) MAS equipped with ant colony applied into dynamic job shop scheduling, book chapter In: Advanced intelligent computing theories and applications. With aspects of artificial intelligence, book series: Lecture Notes in Computer Science 4682: 823–835Google Scholar
  35. 35.
    Eswaramurthy VP, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manuf Technol 40(9–10):1004–1015CrossRefGoogle Scholar
  36. 36.
    Lei D (2008) A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Comput Ind Eng 54:960–971CrossRefGoogle Scholar
  37. 37.
    Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309–1318CrossRefGoogle Scholar
  38. 38.
    Zhang R, Wu C (2008) An immune genetic algorithm based on bottleneck jobs for the job shop scheduling problem. Book chapter in: Evolutionary computation in combinatorial optimization. Book series: Lecture Notes in Computer Science 4972: 147–157Google Scholar
  39. 39.
    Tsai J, Liu T, Ho W, Chou J (2008) An improved genetic algorithm for job shop scheduling problems using Taguchi-based crossover. Int J Adv Manuf Technol 38:987–994CrossRefGoogle Scholar
  40. 40.
    Huang R, Yang C (2008) Ant colony system for job shop scheduling with time windows. Int J Adv Manuf Technol 39:151–157CrossRefGoogle Scholar
  41. 41.
    Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570CrossRefGoogle Scholar
  42. 42.
    Liaw C (2008) An efficient simple metaheuristic for minimizing the makespan in two machine no-wait job shops. Comput Oper Res 35:3276–3283MATHCrossRefGoogle Scholar
  43. 43.
    Zhao C, Wu Z (2001) A genetic algorithm approach to the scheduling of FMSs with multiple routes. Int J Flex Manuf Syst 13(1):71–88CrossRefGoogle Scholar
  44. 44.
    Rossi A, Dini G (2007) Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method. Robotics and Computer-Integrated Manufacturing 23(5):503–516CrossRefGoogle Scholar
  45. 45.
    Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. The IEEE Transactions on Systems, Man and Cybernetics, Part B 26(1):29–41CrossRefGoogle Scholar
  46. 46.
    Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21(6):1087–1091CrossRefGoogle Scholar
  47. 47.
    Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley Professional, ReadingMATHGoogle Scholar
  48. 48.
    Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. Comput Oper Res 35(9):2807–2839MathSciNetMATHCrossRefGoogle Scholar
  49. 49.
    Birbil SI, Fang S (2003) An electromagnetism-like mechanism for global optimization. J Glob Optim 25(3):263–282MathSciNetMATHCrossRefGoogle Scholar
  50. 50.
    Chen S, Chang P, Chan C, Mani V (2007) A hybrid electromagnetism-like algorithm for single machine scheduling problem. In: Huang D, Heutte L, Loog M (eds) Advanced intelligent computing theories and applications. With Aspects of Artificial Intelligence (pp 543–552), Springer Berlin/HeidelbergGoogle Scholar
  51. 51.
    Souier M, Sari Z (2011) A software tool for performance metaheuristics evaluation in real time alternative routing selection in random FMSs, 1st IEEE 2011 International Conference on Communications, Computing and Control Applications (CCCA'11), Hammamet Tunisia, 3–5 March 2011Google Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Manufacturing Engineering Laboratory of Tlemcen (MELT)Abou bekr Belkaïd University of TlemcenTlemcenAlgeria
  2. 2.Tlemcen Preparatory School of EconomicsTlemcenAlgeria

Personalised recommendations