Author:
AitZai Abdelhakim,Benmedjdoub Brahim,Boudhar Mourad
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Industrial and Manufacturing Engineering,Software
Reference32 articles.
1. AitZai, A., Benmedjdoub, B., & Boudhar, M. (2012). A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking. International Journal of Operational Research, 14(3), 343–365.
2. AitZai, A., & Boudhar, M. (2013). Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking. International Journal of Operational Research, 16(1), 343–365.
3. Bertolissi, E. (2000). Heuristic algorithm for scheduling in the no-wait fow-hop. Journal of Materials Processing Technology, 107, 459–465.
4. Bouquard, J. L., Billaut, J. C., Kubzin, M. A., & Strusevich, V. A. (2005). Two-machine flowshop scheduling problems with no-wait jobs. Operations Research Letters, 33, 255–262.
5. Bozejko, W., & Makuchowski, M. (2008). A fast hybrid tabu search algorithm for the no-wait job shop problem. Janiszewskiego 11–17, 50–372 Wrocław, Poland.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献