Author:
Azzouz Ameni,Ennigrou Meriem,Said Lamjed Ben
Reference29 articles.
1. A computational study of constraint satisfaction for multiple capacitated job shop scheduling;Nuijten;European Journal of Operational Research,1996
2. Some simplified np-complete graph problems;Garey;Theoretical computer science,1976
3. Azzouz, A., Ennigrou, M., Jlifi, B., Ghedira, K. Combining tabu search and genetic algorithm in a multi-agent system for solving flexible job shop problem. In: Proceedings of the 11th Mexican International Conference on Artificial Intelligence(MICAI) (Special Sessions). 2012, p. 83-88.
4. Ziaee, M. A heuristic algorithm for solving flexible job shop scheduling problem In: Int Adv Manuf Technol. 2014, p. 71-519.
5. A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel vns execution;Turkyllmaz;International Journal of Production Research,2014
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献