Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking

International Journal of Operational Research

Volumn 16, Issue 1, 2013, Pages 14-37

  AitZai, Abdelhakim ^a   Boudhar, Mourad ^a  

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

Author keywords

Alternative graphs; Blocking constraints; Job shop scheduling; Operational research; Parallel branch and bound; Parallel PSO algorithm

Indexed keywords

EID: 84870691290     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2013.050538     Document Type: Review

References (41)

1. AitZai, A., Benmedjdoub, B. and Boudhar, M. (forthcoming) 'A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking', Int. J. Operational Research.
2. Ben Mabrouk, B., Hasni, H. and Mahjoub, Z. (2009) 'On a parallel genetic-tabu search based algorithm for solving the graph colouring problem', European Journal of Operational Research, Vol. 197, pp.1192-1201.
3. Brucker, P., Jurisch, B. and Sievers, B. (1994) 'A branch and bound algorithm for the job-shop scheduling problem', Discrete Applied Mathematics - DAM, Vol. 49, Nos. 1-3, pp.107-127.
4. Caraffa, V., Ianes, S., Bagchi, T.P. and Sriskandarajah, C. (2001) 'Minimizing makespan in a blocking flowshop using genetic algorithms', Int. J. Production Economics, Vol. 70, pp.101-115. (Pubitemid 32264325)
5. Carlier, J. and Pinson, E. (1989) 'An algorithm for solving the job-shop problem', Management Science, Vol. 35, No. 2, pp.164-176.
6. Carlier, J. and Pinson, E. (1994) 'Adjustment of heads and tails for the job-shop problem', European Journal of Operational Research, Vol. 78, pp.238-251.
7. Dorndorf, U. and Pesch, E. (1995) 'Evolution based learning in a job shop environment', Computers and Operations Research, Vol. 22, pp.25-40.
8. Fahmy, S.A., ElMekkawy, T.Y. and Balakrishnan, S. (2010) 'Mathematical formulations for scheduling in manufacturing cells with limited capacity buffers', Int. J. Operational Research, Vol. 7, No. 4, pp.463-486.
9. Fisher, H. and Thompson, G.L. (1963) 'Probabilistic learning combinations of local job-shop scheduling rules', in J.F. Muth and G.L. Thompson (Eds.), Industrial Scheduling. Englewood Cliffs: Prentice-Hall, pp.225-251.
10. Garey, M.R., Johnson, D.S. and Sethi, R. (1976) 'The complexity of flowshop and job shop scheduling', Mathematics of Operations Research, Vol. 1, No. 2, pp.117-129.
11. Gilmore, P.C. and Gomory, R.E. (1965) 'Multistage cutting stock problems of two and more dimensions', Operations Research, Vol. 13, pp.94-120.
12. Gorges-Schleuter, M. (1989) 'ASPARAGOS: an asynchronous parallel genetic optimization strategy', Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann Publishers, pp.422-427.
13. Grabowski, J. and Pempera, J. (2007) 'The permutation flow shop problem with blocking: a tabu search approach', Omega, Vol. 35, pp.302-311. (Pubitemid 44317633)
14. Graham, R., Lawler, E., Lenstra, J.K. and Rinnooy-Kan, A. (1979) 'Optimization and approximation in deterministic sequencing and scheduling theory: a survey', Annals of Discrete Mathematics, Vol. 5, pp.287-326.
15. Gröflin, H. and Klinkert, A. (2005) 'A tabu search for the generalized blocking job shop', MIC2005: The Sixth Meta-Heuristics International Conference.
16. Gröflin, H. and Klinkert, A. (2009) 'A new neighbourhood and tabu search for the blocking job shop', Discrete Applied Mathematics, Vol. 157, No. 17, pp.3643-3655.
17. Gruau, F. (1994) 'Neural network synthesis using cellular encoding and the genetic algorithm', PhD Thesis, Ecole Normale Supérieure de Lyon.
18. Hall, N.G. and Sriskandarajah, C. (1996) 'A survey of machine scheduling problems with blocking and no-wait process', Operations Research, Vol. 44, No. 3, pp.510-525. (Pubitemid 126669516)
19. Lee, W.C., Shiau, Y-R., Chen, S-K. and Wu, C-C. (2010) 'A two-machine flow shop scheduling problem with deteriorating jobs and blocking', Int. J. Production Economics, Vol. 124, pp.188-197.
20. Liu, B., Wang, L. and Jin, Y. (2007) 'An effective hybrid particle swarm optimization for no-wait flow shop scheduling', Int. J. Advanced Manufacturing Technology, Vol. 31, pp.1001-1011. (Pubitemid 46092501)
21. Liu, S.Q. and Kozan, E. (2009) 'Scheduling a flow shop with combined buffer conditions', Int. J. Production Economics, Vol. 117, pp.371-380.
22. Manderick, B. and Spiessens, P. (1989) 'Fine-grained parallel genetic algorithms', in J. David Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann Publishers, pp.428-433.
23. Martinez, S., Dauzère-Pérès, S., Guéret, C., Mati, Y. and Sauer, N. (2006) 'Complexity of flowshop scheduling problems with a new blocking constraint', European Journal of Operational Research, Vol. 169, pp.855-864. (Pubitemid 41492019)
24. Mascis, A. and Pacciarelli, D. (2002) 'Job shop scheduling with blocking and no-wait constraints', European Journal of Operational Research, Vol. 143, pp.498-517.
25. Mati, Y., Rezg, N. and Xie, X. (2001) 'Scheduling problem of job-shop with blocking: a taboo search approach', Extended Abstracts, 4th Meta-Heuristics International Conference (MIC2001), Portugal, pp.643-648.
26. Mühlenbein, H. (1989) 'Parallel genetic algorithms, population genetics and combinatorial optimization', Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann Publishers, pp.416-421.
27. Ng, C.T., Allahverdi, A., Al-Anzi, F.S. and Edwin Cheng, T.C. (2007) 'The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times', Int. J. Operational Research, Vol. 2, No. 2, pp.135-155.
28. Omkumar, M., Shahabudeen, P., Gughan, S. and Azad, A. (2009) 'GA based static scheduling of multilevel assembly job shops', Int. J. Operational Research, Vol. 4, No. 2, pp.197-213.
29. Perregaard, M. and Clausen, J. (1998) 'Parallel branch-and-bound methods for the job-shop scheduling problem', Annals of Operations Research, Vol. 83, pp.137-160.
30. Pham, D. and Klinkert, A. (2008) 'Surgical case scheduling as a generalized job shop scheduling problem', European Journal of Operational Research, Vol. 185, pp.1011-1025. (Pubitemid 47498795)
31. Reddi, S.S. and Ramamoorthy, C.V. (1972) 'On flowshop sequencing problem with no-wait in process', Operational Research Quarterly, Vol. 23, pp.323-331.
32. Ribas, I., Companys, R. and Tort-Martorell, X. (2011) 'An iterated greedy algorithm for the flow shop scheduling problem with blocking', Omega, Vol. 39, pp.293-301.
33. Ronconi, D.P. (2004) 'A note on constructive heuristics for the flowshop problem with blocking inprocess', Int. J. Production Economics, Vol. 87, No. 1, pp.39-48.
34. Ronconi, D.P. and Henriques, L.R.S. (2009) 'Some heuristic algorithms for total tardiness minimization in a flowshop with blocking', Omega, Vol. 37, pp.272-281.
35. Soukhal, A. and Martineau, P. (2005) 'Resolution of a scheduling problem in a flowshop robotic cell', European Journal of Operational Research, Vol. 161, pp.62-72.
36. Soukhal, A., Oulamara, A. and Martineau, P. (2005) 'Complexity of flow shop scheduling problems with transportation constraints', European Journal of Operational Research, Vol. 161, pp.32-41.
37. Thornton, H.W. and Hunsucker, J.L. (2004) 'A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage', European Journal of Operational Research, Vol. 152, No. 1, pp.96-114.
38. Tseng, L-Y. and Lin, Y-T. (2010) 'A genetic local search algorithm for minimizing total flow time in the permutation flow shop scheduling problem', Int. J. Production Economics, Vol. 127, pp.121-128.
39. Wang, L., Pan, Q-K., Suganthan, P.N., Wang, W-H. and Wang, Y-M. (2010) 'A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems', Computers and Operations Research, Vol. 37, pp.509-520.
40. Wang, L. and Zheng, D-Z. (2003) 'An effective hybrid heuristic for flow shop scheduling', Int. J. Advanced Manufacturing Technology, Vol. 21, pp.38-44.
41. Wang, X. and Tang, L. (2009) 'A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers', Computers and Operations Research, Vol. 36, No. 3, pp.907-918.