A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization
Tóm tắt
Từ khóa
Tài liệu tham khảo
Goldberg DE (1989) Genetic algorithms in search optimisation and machine learning. Addison-Wesley, Reading
Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization: artificial ant as a computational intelligence technique. IRIDIA Technical Report Series, University Libre De Bruxelles, Belgium
Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manage 129(3):210–225
Kennedy J, Eberhard R (1995) Particle swarm optimization. Phys Rev B 13:5344–5348
Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimisation algorithm: harmony search. Simulation 76:60–68
Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212
Zhang GH, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38(4):3563–3573
Zhang G, Gao L, Li X (2013) Solving the flexible job-shop scheduling problem using particle swarm optimization and variable neighborhood search. Int J Adv Comput Technol 5(4):291–299
Bagheri A, Zandieh M, Mahdavia I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26:533–541
Teekeng W, Thammano A (2011) A combination of Shuffled frog leaping algorithm and fuzzy logic for flexible job-shop scheduling problems. Proc Comput Sci Complex Adapt Syst 6:69–75
Teekeng W, Thammano A (2012) Modified genetic algorithm for flexible job-shop scheduling problems. Proc Comput Sci Complex Adapt Syst 12:122–128
Yuan Y, Xu H, Yang J (2013) A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl Soft Comput 13(7):3259–3272
Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331–342