Abstract
This paper presents a dynamic multi-swarm particle swarm optimizer (DMS-PSO) for solving the blocking flow shop scheduling problem with the objective to minimize makespan. To maintain good global search ability, small swarms and a regrouping schedule were used in the presented DMS-PSO. Each small swarm performed searching according to its own historical information, whereas the regrouping schedule was employed to exchange information among them. A specially designed local search phase was added into the algorithm to improve its local search ability. The experiments based on the well-known benchmarks were conducted. The computational results and comparisons indicated that the proposed DMS-PSO had a better performance on the blocking flow shop scheduling problems than some other compared algorithms in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. OMEGA, The international Journal of Management Science 35:302–311
Qian B, Wang L, Huang DX, Wang WL, Wang X (2007) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res. doi:10.1016/j.cor.2007.08.007
Ronconi DP (2005) A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Ann Oper Res 138(1):53–65
Ronconi DP (2004) A note on constructive heuristics for the flowshop problem with blocking. Int J Prod Econ 87:39–48
Pan QK, Wang L (2008) No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 39(7–8):796–807
Pan Q, Wang L, Zhao B (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38(7–8):778–786
Pan Q, Wang L, Tasgetirend MF, Zhao BH (2008) A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38(3–4):337–347
Pan Q, Wang L, Gao L, Li J (In press) An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem. Int J Adv Manuf Tech
Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535–550
Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525
McCormich ST, Pinedo ML, Shenker S, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper Res 37:925–936
Leisten R (1990) Flowshop sequencing problems with limited buffer storage. Int J Prod Res 28:2085–2100
Abadi INK, Hall NG, Sriskandarajh C (2000) Minimizing cycle time in a blocking flowshop. Oper Res 48:177–180
Ronconi DP, Henriques LRS (2007) Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. OMEGA-Int J Manage S. doi:10.1016/j.omega.2007.01.003
Caraffa V, Ianes S, Bagchi TP, Sriskandarajah C (2001) Minimizing makespan in a blocking flowshop using genetic algorithms. Int J Prod Econ 70:101–115
Wang L, Pan Q, Suganthan PN, Wang W, Ya-Min (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Computers & Operations Research 37(3):509–520
Wang L, Pan Q, Tasgetiren MF (2010) Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Syst Appl 37(12):7929–7936
Liang JJ, Suganthan PN (2005) Dynamic multi-swarm particle swarm optimizer. Proceedings 2005 IEEE Int. Swarm Intelligence Symposium, pp 124–129. Pasadena, CA, USA, June 2005
Liang JJ, Suganthan PN (2005) Dynamic multi-swarm particle swarm optimizer with local search. Proceedings of IEEE Congress on Evolutionary Computation CEC 1:522–528
Liang JJ, Suganthan PN (2006) Dynamic multi-swarm particle swarm optimizer with a novel constraint-handling mechanism. Proceedings of IEEE Congress on Evolutionary Computation 1:9–16
Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. Proceedings of the Sixth International Symposium on Micromachine and Human Science, pp 39–43
Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, pp 1942–1948
Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. Proceedings of the IEEE Congress on Evolutionary Computation, pp 69–73
Nawaz M, Enscore EEJ, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11:91–95
Framinan JM, Leisten R, Ruiz-Usano R (2002) Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. Eur J Oper Res 141:559–569
Kennedy J, Mendes R (2002) Population structure and particle swarm performance. Proceedings of the IEEE Congress on Evolutionary Computation, pp 1671–1676
Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problems. Eur J Oper Res 47:65–74
Ruiz R, Maroto CA (2005) Comprehensive review and evaluation of permutation flowshops heuristics. Eur J Oper Res 165:479–494
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, J.J., Pan, QK., Tiejun, C. et al. Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer. Int J Adv Manuf Technol 55, 755–762 (2011). https://doi.org/10.1007/s00170-010-3111-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-010-3111-7