Skip to main content

Advertisement

SpringerLink
Log in

Adaptive multimeme algorithm for flexible job shop scheduling problem

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In this paper, we propose an adaptive multimeme algorithm (AMMA) to address the flexible job shop scheduling problem (FJSP) with the objective to minimize the makespan. The search operator is modeled as a synergy of genetic and memetic mechanisms through integrating a stochastic variation and a local search procedure into a composite operator for each individual. Three effective local search methods, featured with distinctive neighborhood structures, are adopted. The stochastic variations include crossover operators and mutation operators crafted for the FJSP. A bandit based operator selection strategy is applied to select operators for individuals adaptively. So as to better suit the current stage of search process, a sliding window is used to record the recent performance achieved by the operators, thereby guiding the subsequent selection of operations. The proposed AMMA is tested on several well-known sets of benchmark problems and is compared with some existing state-of-the-art algorithms. The results show that AMMA achieves satisfactory performance in solving these different sets of problems. Furthermore, a further in-depth analysis is presented to elucidate the improved search performance generated by the adaptive mechanism.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Al Hinai N, ElMekkawy T (2011) An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem. Flex Serv Manuf J 23(1):64–85

    Article  Google Scholar 

  • Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47(2–3):235–256

    Article  MATH  Google Scholar 

  • Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541

    Article  Google Scholar 

  • Barnes J, Chambers J (1996) Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering, The University of Texas at Austin. Technical report series ORP, pp 96–09

  • Ben Hmida A, Haouari M, Huguet MJ, Lopez P (2010) Discrepancy search for the flexible job shop scheduling problem. Comput Oper Res 37(12):2192–2201

    Article  MATH  MathSciNet  Google Scholar 

  • Bozejko W, Uchroński M, Wodecki M (2010) Parallel hybrid metaheuristics for the flexible job shop problem. Comput Ind Eng 59(2):323–333

    Article  MATH  Google Scholar 

  • Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183

    Article  MATH  Google Scholar 

  • Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375

    Article  MATH  MathSciNet  Google Scholar 

  • Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112(1):3–41

    Article  MATH  Google Scholar 

  • Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. In: 1999 IEEE international conference on robotics and automation, IEEE, pp 1120–1125

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

    Article  Google Scholar 

  • Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Comput Ind Eng 36(2):343–364

    Article  Google Scholar 

  • Consoli PA, Minku LL, Yao X (2014) Dynamic selection of evolutionary algorithm operators based on online learning and fitness landscape metrics. In: Simulated evolution and learning—10th international conference, SEAL 2014, Dunedin, New Zealand, December 15–18, 2014. Springer, Proceedings, pp 359–370

  • Costa LD, Fialho Á, Schoenauer M, Sebag M (2008) Adaptive operator selection with dynamic multi-armed bandits[C]. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation. ACM, pp 913–920

  • 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. Ann Oper Res 70:281–306

    Article  MATH  MathSciNet  Google Scholar 

  • Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30

    MATH  MathSciNet  Google Scholar 

  • Fialho Á (2010) Adaptive operator selection for optimization. PhD, Ecole Doctorale Informatique, Universite Paris-Sud, Paris

  • Fialho Á, Costa LD, Schoenauer M, Sebag M (2010a) Analyzing bandit-based adaptive operator selection mechanisms. Ann Math Artif Intell 60(1–2):25–64

    Article  MATH  MathSciNet  Google Scholar 

  • Fialho Á, Schoenauer M, Sebag M (2010b) Toward comparison-based adaptive operator selection. In: Proceedings of the 12th annual conference on genetic and evolutionary computation. ACM, pp 767–774

  • Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3(2):225–251

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Gao K, Suganthan P, Pan Q, Chua T, Cai T, Chong C (2014) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27:363–374

    Article  MATH  Google Scholar 

  • García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the cec’2005 special session on real parameter optimization. J Heuristics 15(6):617–644

    Article  MATH  Google Scholar 

  • Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MATH  MathSciNet  Google Scholar 

  • Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74–94

    Article  Google Scholar 

  • Ho NB, Tay JC (2008) Solving multiple-objective flexible job shop problems by evolution and local search. IEEE Trans Syst Man Cybern C Appl Rev 38(5):674–685

    Article  Google Scholar 

  • Ho NB, Tay JC, Lai EMK (2007) An effective architecture for learning and evolving flexible job-shop schedules. Eur J Oper Res 179(2):316–333

    Article  MATH  Google Scholar 

  • Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr 15(4):205–215

    Article  MATH  MathSciNet  Google Scholar 

  • Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memet Comput 2:201–218

    Article  Google Scholar 

  • Jerald J, Asokan P, Prabaharan G, Saravanan R (2005) Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm. Int J Adv Manuf Technol 25:964–971

    Article  Google Scholar 

  • Jia H, Nee A, Fuh J, Zhang Y (2003) A modified genetic algorithm for distributed scheduling problems. J Intell Manuf 14(3–4):351–362

    Article  Google Scholar 

  • Jurisch B (1992) Scheduling jobs in shops with multi-purpose machines. PhD thesis, Fachbereich Mathematik/Informatik, Universitat Osnabruck

  • Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern C Appl Rev 32(1):1–13

    Article  MATH  Google Scholar 

  • Kobti Z et al (2012) A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memet Comput 4(3):231–245

    Article  Google Scholar 

  • Krasnogor N (2002) Studies on the theory and design space of memetic algorithms. PhD thesis, University of the West of England at Bristol

  • Krasnogor N, Gustafson S (2004) A study on the use of self-generation in memetic algorithms. Nat Comput 3(1):53–76

    Article  MATH  MathSciNet  Google Scholar 

  • Lawrence S (1984) Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie-Mellon University, Pittsburgh

  • Le MN, Ong YS, Jin Y, Sendhoff B (2012) A unified framework for symbiosis of evolutionary mechanisms with application to water clusters potential model design. IEEE Comp Intell Mag 7(1):20–35

    Article  Google Scholar 

  • Li JQ, Pan QK, Suganthan P, Chua T (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52(5–8):683–697

    Article  Google Scholar 

  • Li JQ, Pan QK, Tasgetiren MF (2014a) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38(3):1111–1132

    Article  MathSciNet  Google Scholar 

  • Li K, Fialho Á, Kwong S, Zhang Q (2014b) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114–130

    Article  Google Scholar 

  • Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3:3–20

    Article  MATH  MathSciNet  Google Scholar 

  • Maturana J, Fialho Á, Saubion F, Schoenauer M, Sebag M (2009) Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In: Proceedings of the IEEE congress on evolutionary computation, pp 365–372

  • Minku LL, Sudholt D, Yao X (2014) Improved evolutionary algorithm design for the project scheduling problem based on runtime analysis. IEEE Trans Soft Eng 40(1):83–102

    Article  Google Scholar 

  • Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms[M]. In: Handbook of metaheuristics. Springer, US, pp 105–144

  • Nayak NC, Ray PK (2012) An empirical investigation of the relationships between manufacturing flexibility and product quality. Int J Model Oper Manag 2(1):26–44

    Google Scholar 

  • Neri F, Tirronen V, Karkkainen T, Rossi T (2007) Fitness diversity based adaptation in multimeme algorithms:a comparative study. In: Proceedings of IEEE congress on evolutionary computation, pp 2374–2381

  • Oddi A, Rasconi R, Cesta A, Smith SF (2011) Iterative flattening search for the flexible job shop scheduling problem. In: Proceedings of the twenty-second international joint conference on artificial intelligence. AAAI Press, pp 1991–1996

  • Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99–110

    Article  Google Scholar 

  • Ong YS, Lim MH, Chen X (2010) Research frontier: memetic computation-past, present & future. IEEE Comp Int Mag 5(2):24–31

    Article  Google Scholar 

  • Pacino D, Hentenryck PV (2011) Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Proceedings of the 22nd international joint conference on artificial intelligence, pp 1997–2002

  • Paulli J (1995) A hierarchical approach for the FMS scheduling problem. Eur J Oper Res 86:32–42

    Article  MATH  Google Scholar 

  • Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212

    Article  MATH  Google Scholar 

  • Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224

    Article  MathSciNet  Google Scholar 

  • Tsubone H, Horikawa M (1999) A comparison between machine flexibility and routing flexibility. Int J Flex Manuf Syst 11(1):83–101

    Article  Google Scholar 

  • Wang L, Wang S, Xu Y, Zhou G, Liu M (2012a) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62(4):917–926

    Article  Google Scholar 

  • Wang L, Zhou G, Xu Y, Wang S, Liu M (2012b) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol 60:303–315

    Article  Google Scholar 

  • Xing LN, Chen YW, Wang P, Zhao QS, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888–896

    Article  Google Scholar 

  • Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37(1):678–687

    Article  MATH  Google Scholar 

  • Yuan Y, Xu H (2013a) Flexible job shop scheduling using hybrid differential evolution algorithms. Comput Ind Eng 65(2):246–260

    Article  Google Scholar 

  • Yuan Y, Xu H (2013b) An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877

    Article  MATH  MathSciNet  Google Scholar 

  • Yuan Y, Xu H, Yang J (2013c) A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl Soft Comput 13(7):3259–3272

    Article  Google Scholar 

  • 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–1318

    Article  Google Scholar 

  • Zribi N, Kacem I, El Kamel A, Borne P (2007) Assignment and scheduling in flexible job-shops by hierarchical optimization. IEEE Trans Syst Man Cybern C Appl Rev 37(4):652–661

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant No. 61273317), the National Top Youth Talents Support Program of China, and the Fundamental Research Fund for the Central Universities (Grant No. K50510020001).

Author information

Authors and Affiliations

  1. Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, International Research Center for Intelligent Perception and Computation, Xidian University, Xi’an, 710071, Shanxi Province, China

    Yi Zuo, Maoguo Gong & Licheng Jiao

  2. Department of Information Technology and Management, Hunan University of Finance and Economics, Changsha, 410205, Hunan Province, China

    Yi Zuo

Authors
  1. Yi Zuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maoguo Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Licheng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maoguo Gong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zuo, Y., Gong, M. & Jiao, L. Adaptive multimeme algorithm for flexible job shop scheduling problem. Nat Comput 16, 677–698 (2017). https://doi.org/10.1007/s11047-016-9583-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-016-9583-0

Keywords

Search

Navigation