Branch-and-bound and PSO algorithms for no-wait job shop scheduling

Journal of Intelligent Manufacturing

Volumn 27, Issue 3, 2016, Pages 679-688

  AitZai, Abdelhakim ^a   Benmedjdoub, Brahim ^a   Boudhar, Mourad ^a  

^a UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

Author keywords

Branch and bound; Job shop; No wait; PSO; Scheduling

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING;

BRANCH-AND-BOUND ALGORITHMS; DIFFERENT RESOLUTIONS; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; NO WAIT; PSO ALGORITHMS; SWARM OPTIMIZATION; VELOCITY STRUCTURE;

JOB SHOP SCHEDULING;

EID: 84897357733     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-014-0906-7     Document Type: Article

References (32)

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.
6. Çaliş, B., & Bulkan, S. (2013). A research survey: Review of AI solution strategies of job shop scheduling problem. Journal of Intelligent Manufacturing. doi:10.1007/s10845-013-0837-8.
7. Carlier, J., & Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2), 164–176.
8. Carlier, J., & Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78, 238–251.
9. Framinan, J. M., & Schuster, C. (2006). An enhancedtimetabling procedure for the no-wait job shop problem: A complete local search approach. Computers and Operations Research, 331, 1200–1213.
10. Chang, J., Gong, D., & Xiao-ping, M. A. (2007). A heuristic genetic algorithm for no-wait flowshop scheduling problem. Journal of China University of Mining and Technology, 17(4), 0582–0586.
11. Gilmor, P., & Gomory, R. (1964). Sequencing a one state-variable machine: A solvable case of the travelling salesman problem. Operations Research, 12, 655–679.
12. Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait process. Operations Research, 44(3), 510–525.
13. Kachitvichyanukul, V., & Sitthitham, S. (2011). A two-stage genetic algorithm for multi-objective job shop scheduling problems. Journal of Intelligent Manufacturing, 22(3), 355–365.
14. Kalczynski, P. J., & Kamburowski, J. (2007). On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, 178, 677–685.
15. Kravchenko, S. A. (1998). A polynomial algorithm for a two-machine no-wait job-shop scheduling problem. European Journal of Operational Research, 106, 101–107.
16. Lawrence, S. (1984). Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement). Carnegie Mellon University, Pittsburgh, Pennsylvania: Graduate School of Industrial Administration.
17. Lennartz, P. (2006). No-wait job shop scheduling a constraint propagation approach.
18. Liaw, C. F. (2008). An efficient simple metaheuristic for the makespan in two machines no-wait job shops. Computers and Operations Research, 35(10), 3276–3283.
19. Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143, 498–517.
20. Mati, Y., Rezg, N., & Xie, X. (2001). A taboo search approach for deadlock-free scheduling of automated manufacturing systems. Journal of Intelligent Manufacturing, 12(5—-6), 535–552.
21. Meeran, S., & Morshed, M. S. (2012). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: A case study. Journal of Intelligent Manufacturing, 23(4), 1063–1078.
22. Pan, J. C. H., & Huang, H. C. (2009). A hybrid genetic algorithm for no-wait job shop scheduling problems. Expert Systems with Applications, 36, 5800–5806.
23. Pan, Q. K., Wang, L., Tasgetiren, M. F., & Zhao, B. H. (2008). A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. The International Journal of Advanced Manufacturing Technology, 38(3—-4), 337–347.
24. Pezhman, R., Meysam, R., & Fariborz, J. (2013). No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: A hybrid meta-heuristic approach. Journal of Intelligent Manufacturing. doi:10.1007/s10845-013-0830-2.
25. Qiu, X., & Henry, Y. K. L. (2012). An AIS-based hybrid algorithm for static job shop scheduling problem. Journal of Intelligent Manufacturing,. doi:10.1007/s10845-012-0701-2.
26. Sahni, S., & Cho, Y. (1979). Complexity of scheduling shops with no wait in process. Mathematics of Operations Reasearch, 4(4), 448–457.
27. Samarghandi, H., & ElMekkawy, T. Y. (2013). Two-machine, no-wait job shop problem with separable setup times and single-server constraints. The International Journal of Advanced Manufacturing Technology, 65(1—-4), 295–308.
28. Shuster, C. J. (2006). No-wait job shop scheduling: Tabu search and complexity of sub problems. Mathematical Methods of Operations Research, 63, 473–491.
29. Ventura, J. A., & Yoon S. H. (2012). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing. doi:10.1007/s10845-012-0650-9.
30. Vijay chakaravarthy, G., & Marimuthu, S. (2013). Performance evaluation of proposed differential evolution and particle swarm optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Intelligent Manufacturing, 24(1), 175–191.
31. Xing, L., Chen, Y., & Yang, K. (2009). An efficient search method for multi-objective flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 20(3), 283–293.
32. Zhu, J., Li, X. & Wang, Q. (2008). Complete local search with limited memory algorithm for job shops to minimize makespan. Key laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education, 210096 Nanjing, PR China.