Journal of Computational Design and Engineering

Society for Computational Design and Engineering (한국CDE학회)
권호 표지
DOI QR코드

DOI QR Code

Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem

  • Received : 2016.01.19
  • Accepted : 2016.05.11
  • Published : 2016.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

Keywords

References

  1. Grabowski J, Pempera J. The permutation flow shop problem with blocking. A tabu search approach. OMEGA The International Journal of Management Science 2007;35:302-11. https://doi.org/10.1016/j.omega.2005.07.004
  2. Grabowski J, Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 2000;125:535-50. https://doi.org/10.1016/S0377-2217(99)00224-6
  3. Hall NG, Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 1996;44:510-25. https://doi.org/10.1287/opre.44.3.510
  4. Abadi INK, Hall NG, Sriskandarajah C. Minimizing cycle time in a blocking flowshop. Operations Research 2000;48:177-80. https://doi.org/10.1287/opre.48.1.177.12451
  5. Liu SQ, Kozan E. Scheduling a flow shop with combined buffer conditions. International Journal of Production Economics 2009;117:371-80. https://doi.org/10.1016/j.ijpe.2008.11.007
  6. Levner EM. Optimal planning of parts machining on a number of machines. Automation and Remote Control 1969;12:1972-8.
  7. Suhami I, Mah RSH. An implicit enumeration scheme for the flowshop problem with no intermediate storage. Computers and Chemical Engineering 1981;5: 83-91. https://doi.org/10.1016/0098-1354(81)87003-2
  8. Ronconi DP. A branch and bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research 2005;138:53-65. https://doi.org/10.1007/s10479-005-2444-3
  9. Companys R, Mateo M. Different behaviour of a double branch and bound algorithm on Fm\prmu\Cmax and Fm\block\cmax problems. Computers and Operations Research 2007;34:938-53. https://doi.org/10.1016/j.cor.2005.05.018
  10. McCormick ST, Pinedo ML, Shenker S, Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 1989;37:925-35. https://doi.org/10.1287/opre.37.6.925
  11. Leistein R. Flowshop sequencing with limited buffer storage. International Journal of Production Research 1990;28:2085-100. https://doi.org/10.1080/00207549008942855
  12. Ronconi DP, Armentano VA. Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society 2001;52: 1289-97. https://doi.org/10.1057/palgrave.jors.2601220
  13. Ronconi DP. A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 2004;87:39-48. https://doi.org/10.1016/S0925-5273(03)00065-3
  14. Caraffa V, Ianes S, Bagchi TP, Sriskandarajah C. Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics 2001;70:101-15. https://doi.org/10.1016/S0925-5273(99)00104-8
  15. Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers and Operations Research 2010;37:509-20. https://doi.org/10.1016/j.cor.2008.12.004
  16. Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, vol. 4; 1995; p. 1942-8.
  17. Jarboui B, Ibrahim S, Siarry P, Rebai A. A combinatorial particle swarm optimization for solving permutation flowshop problems. Computers and Industrial Engineering 2008;54:526-38. https://doi.org/10.1016/j.cie.2007.09.006
  18. Sha DY, Hsu C-Y. A new particle swarm optimization for the open shop scheduling problem. Computers and Operations Research 2008;35:3243-61. https://doi.org/10.1016/j.cor.2007.02.019
  19. Pan QK, Tasgetiren MF, Liang YC. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research 2008;35:2807-39. https://doi.org/10.1016/j.cor.2006.12.030
  20. Lourenc HR, Martin O, Stutzle T. Iterated local search. In: Glover F, Kochenberger G, editors. Handbook of metaheuristics, international series in operations research and management science, vol. 57. Norwell, MA: Kluwer Academic Publishers; 2002; p. 321-53.
  21. Jarboui B, Eddaly M, Siarry P, Rebai A. An estimation of distribution algorithm for minimizing the makespan in blocking flowshop scheduling problems. Studies in computational intelligence. Computational Intelligence in Flow Shop and Job Shop Scheduling 2009;230:151-67.
  22. Pan QK, Wang L, Tasgetiren MF, Zhao BH. A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology 2008;38:337-47. https://doi.org/10.1007/s00170-007-1099-4
  23. Tseng LY, Lin YTA. Hybrid genetic algorithm for no-wait flowshop scheduling problem. International Journal of Production Economics 2010;128:144-52. https://doi.org/10.1016/j.ijpe.2010.06.006
  24. Jarboui B, Eddaly M, Siarry P. A hybrid genetic algorithm for solving no-wait flowshop scheduling problems. International Journal, Advanced Manufacturing Technology 2011;54:1129-43. https://doi.org/10.1007/s00170-010-3009-4
  25. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979;5:287-326.
  26. Jarboui B, Cheikh M, Siarry P, Rebai A. Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Applied Mathematics and Computation 2007;192:337-45. https://doi.org/10.1016/j.amc.2007.03.010
  27. Jarboui B, Damak N, Siarry P, Rebai A. A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation 2008;195:299-308. https://doi.org/10.1016/j.amc.2007.04.096
  28. Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 2007;177:1930-47. https://doi.org/10.1016/j.ejor.2005.12.024
  29. Nawaz M, Enscore EE, Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Science 1983;11:91-5. https://doi.org/10.1016/0305-0483(83)90088-9
  30. Stutzle T. Iterated local search for the quadratic assignment problem. European Journal of Operational Research 2006;174:1519-39. https://doi.org/10.1016/j.ejor.2005.01.066
  31. Caramia M, Dell'Olmo P. Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discrete Applied Mathematics 2008;156: 201-17. https://doi.org/10.1016/j.dam.2006.07.013
  32. Ibarakia T, Imahorib S, Nonobec K, Sobued K, Unoe T, Yagiuraf M. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics 2008;156:2050-69. https://doi.org/10.1016/j.dam.2007.04.022
  33. Dong X, Huang H, Chen P. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Computers and Operations Research 2009;36:1664-9. https://doi.org/10.1016/j.cor.2008.04.001
  34. Taillard E. Some efficient heuristic methods for the flow shop sequencing problems. European Journal of Operational Research 1990;47:65-74. https://doi.org/10.1016/0377-2217(90)90090-X
  35. Nowicki E, Smutncki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 1996;91:160-75. https://doi.org/10.1016/0377-2217(95)00037-2
  36. Nowicki E. The permutation flow shop with buffers: a tabu search approach. European Journal of Operational Research 1999;116:205-19. https://doi.org/10.1016/S0377-2217(98)00017-4
  37. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64:278-85. https://doi.org/10.1016/0377-2217(93)90182-M
  38. Akrout H, Jarboui B, Siarry P, Rebai A.A GRASP based on DE to solve single machine scheduling problem with SDST. ComputationalOptimizationand Applications 2012;51:411-35.
  39. Montgomery DC. Design and analysis of experiments, 5th ed., New York: Wiley; 2000.

Cited by

  1. A multi-class classification MCLP model with particle swarm optimization for network intrusion detection vol.42, pp.5, 2016, https://doi.org/10.1007/s12046-017-0626-8
  2. Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with Makespan Criterion vol.8, pp.12, 2016, https://doi.org/10.3390/app8122621
  3. Combinatorial versus Priority Based Optimization in Resource Constrained Project Scheduling Problems by Nature Inspired Metaheuristics vol.19, pp.1, 2016, https://doi.org/10.4316/aece.2019.01003
  4. An evolutionary clustering search for the total tardiness blocking flow shop problem vol.30, pp.4, 2016, https://doi.org/10.1007/s10845-017-1358-7
  5. Metaheuristics-based Multi-objective Design of Global Robust Optimal Sliding Mode Control of Discrete Uncertain Systems vol.17, pp.6, 2016, https://doi.org/10.1007/s12555-018-0486-y
  6. A modified Ant Colony Optimization algorithm to solve a dynamic traveling salesman problem: A case study with drones for wildlife surveillance vol.6, pp.3, 2019, https://doi.org/10.1016/j.jcde.2018.10.004
  7. Enhancing smart shop floor management with ubiquitous augmented reality vol.58, pp.8, 2016, https://doi.org/10.1080/00207543.2019.1629667
  8. Tasks mapping in the network on a chip using an improved optimization algorithm vol.16, pp.2, 2016, https://doi.org/10.1108/ijpcc-07-2019-0053
  9. Parallel Hybrid Particle Swarm Algorithm for Workshop Scheduling Based on Spark vol.14, pp.9, 2016, https://doi.org/10.3390/a14090262
  10. Minimize makespan of permutation flowshop using pointer network vol.9, pp.1, 2016, https://doi.org/10.1093/jcde/qwab068
  11. Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems vol.15, pp.1, 2016, https://doi.org/10.3390/a15010009