Skip to main content
Erschienen in: Natural Computing 4/2017

19.09.2016

Adaptive multimeme algorithm for flexible job shop scheduling problem

verfasst von: Yi Zuo, Maoguo Gong, Licheng Jiao

Erschienen in: Natural Computing | Ausgabe 4/2017

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat 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–85CrossRef 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–85CrossRef
Zurück zum Zitat Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47(2–3):235–256CrossRefMATH Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47(2–3):235–256CrossRefMATH
Zurück zum Zitat 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–541CrossRef 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–541CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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–2201CrossRefMATHMathSciNet 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–2201CrossRefMATHMathSciNet
Zurück zum Zitat Bozejko W, Uchroński M, Wodecki M (2010) Parallel hybrid metaheuristics for the flexible job shop problem. Comput Ind Eng 59(2):323–333CrossRefMATH Bozejko W, Uchroński M, Wodecki M (2010) Parallel hybrid metaheuristics for the flexible job shop problem. Comput Ind Eng 59(2):323–333CrossRefMATH
Zurück zum Zitat Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183CrossRefMATH Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183CrossRefMATH
Zurück zum Zitat 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–41CrossRefMATH 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–41CrossRefMATH
Zurück zum Zitat 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 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
Zurück zum Zitat 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–997CrossRef 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–997CrossRef
Zurück zum Zitat 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–364CrossRef 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–364CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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–306CrossRefMATHMathSciNet 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–306CrossRefMATHMathSciNet
Zurück zum Zitat Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MATHMathSciNet Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MATHMathSciNet
Zurück zum Zitat Fialho Á (2010) Adaptive operator selection for optimization. PhD, Ecole Doctorale Informatique, Universite Paris-Sud, Paris Fialho Á (2010) Adaptive operator selection for optimization. PhD, Ecole Doctorale Informatique, Universite Paris-Sud, Paris
Zurück zum Zitat Fialho Á, Costa LD, Schoenauer M, Sebag M (2010a) Analyzing bandit-based adaptive operator selection mechanisms. Ann Math Artif Intell 60(1–2):25–64CrossRefMATHMathSciNet Fialho Á, Costa LD, Schoenauer M, Sebag M (2010a) Analyzing bandit-based adaptive operator selection mechanisms. Ann Math Artif Intell 60(1–2):25–64CrossRefMATHMathSciNet
Zurück zum Zitat 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 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
Zurück zum Zitat Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3(2):225–251 Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3(2):225–251
Zurück zum Zitat 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–2907CrossRefMATHMathSciNet 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–2907CrossRefMATHMathSciNet
Zurück zum Zitat 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–374CrossRefMATH 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–374CrossRefMATH
Zurück zum Zitat 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–644CrossRefMATH 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–644CrossRefMATH
Zurück zum Zitat 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–685CrossRef 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–685CrossRef
Zurück zum Zitat 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–333CrossRefMATH 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–333CrossRefMATH
Zurück zum Zitat Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr 15(4):205–215CrossRefMATHMathSciNet Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr 15(4):205–215CrossRefMATHMathSciNet
Zurück zum Zitat Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memet Comput 2:201–218CrossRef Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memet Comput 2:201–218CrossRef
Zurück zum Zitat 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–971CrossRef 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–971CrossRef
Zurück zum Zitat Jia H, Nee A, Fuh J, Zhang Y (2003) A modified genetic algorithm for distributed scheduling problems. J Intell Manuf 14(3–4):351–362CrossRef Jia H, Nee A, Fuh J, Zhang Y (2003) A modified genetic algorithm for distributed scheduling problems. J Intell Manuf 14(3–4):351–362CrossRef
Zurück zum Zitat Jurisch B (1992) Scheduling jobs in shops with multi-purpose machines. PhD thesis, Fachbereich Mathematik/Informatik, Universitat Osnabruck Jurisch B (1992) Scheduling jobs in shops with multi-purpose machines. PhD thesis, Fachbereich Mathematik/Informatik, Universitat Osnabruck
Zurück zum Zitat 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–13CrossRefMATH 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–13CrossRefMATH
Zurück zum Zitat 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–245CrossRef 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–245CrossRef
Zurück zum Zitat 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 (2002) Studies on the theory and design space of memetic algorithms. PhD thesis, University of the West of England at Bristol
Zurück zum Zitat Lawrence S (1984) Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie-Mellon University, Pittsburgh Lawrence S (1984) Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie-Mellon University, Pittsburgh
Zurück zum Zitat 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–35CrossRef 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–35CrossRef
Zurück zum Zitat 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–697CrossRef 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–697CrossRef
Zurück zum Zitat 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–1132CrossRefMathSciNet 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–1132CrossRefMathSciNet
Zurück zum Zitat 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–130CrossRef 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–130CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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–102CrossRef 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–102CrossRef
Zurück zum Zitat Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms[M]. In: Handbook of metaheuristics. Springer, US, pp 105–144 Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms[M]. In: Handbook of metaheuristics. Springer, US, pp 105–144
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99–110CrossRef Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99–110CrossRef
Zurück zum Zitat Ong YS, Lim MH, Chen X (2010) Research frontier: memetic computation-past, present & future. IEEE Comp Int Mag 5(2):24–31CrossRef Ong YS, Lim MH, Chen X (2010) Research frontier: memetic computation-past, present & future. IEEE Comp Int Mag 5(2):24–31CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Paulli J (1995) A hierarchical approach for the FMS scheduling problem. Eur J Oper Res 86:32–42CrossRefMATH Paulli J (1995) A hierarchical approach for the FMS scheduling problem. Eur J Oper Res 86:32–42CrossRefMATH
Zurück zum Zitat Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212CrossRefMATH Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212CrossRefMATH
Zurück zum Zitat Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood CliffsMATH Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood CliffsMATH
Zurück zum Zitat Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570CrossRef Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570CrossRef
Zurück zum Zitat Sethi AK, Sethi SP (1990) Flexibility in manufacturing: a survey. Int J Flex Manuf Syst 2(4):289–328CrossRef Sethi AK, Sethi SP (1990) Flexibility in manufacturing: a survey. Int J Flex Manuf Syst 2(4):289–328CrossRef
Zurück zum Zitat Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224CrossRefMathSciNet Shen XN, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224CrossRefMathSciNet
Zurück zum Zitat Tsubone H, Horikawa M (1999) A comparison between machine flexibility and routing flexibility. Int J Flex Manuf Syst 11(1):83–101CrossRef Tsubone H, Horikawa M (1999) A comparison between machine flexibility and routing flexibility. Int J Flex Manuf Syst 11(1):83–101CrossRef
Zurück zum Zitat 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–926CrossRef 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–926CrossRef
Zurück zum Zitat 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–315CrossRef 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–315CrossRef
Zurück zum Zitat 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–896CrossRef 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–896CrossRef
Zurück zum Zitat Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37(1):678–687CrossRefMATH Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37(1):678–687CrossRefMATH
Zurück zum Zitat Yuan Y, Xu H (2013a) Flexible job shop scheduling using hybrid differential evolution algorithms. Comput Ind Eng 65(2):246–260CrossRef Yuan Y, Xu H (2013a) Flexible job shop scheduling using hybrid differential evolution algorithms. Comput Ind Eng 65(2):246–260CrossRef
Zurück zum Zitat Yuan Y, Xu H (2013b) An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877CrossRefMATHMathSciNet Yuan Y, Xu H (2013b) An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877CrossRefMATHMathSciNet
Zurück zum Zitat 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–3272CrossRef 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–3272CrossRef
Zurück zum Zitat 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–1318CrossRef 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–1318CrossRef
Zurück zum Zitat 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–661CrossRef 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–661CrossRef
Metadaten
Titel
Adaptive multimeme algorithm for flexible job shop scheduling problem
verfasst von
Yi Zuo
Maoguo Gong
Licheng Jiao
Publikationsdatum
19.09.2016
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 4/2017
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-016-9583-0

Weitere Artikel der Ausgabe 4/2017

Natural Computing 4/2017 Zur Ausgabe

EditorialNotes

Preface