A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

Abadi, 2000, Minimizing cycle time in a blocking flowshop, Operations Research, 48, 177, 10.1287/opre.48.1.177.12451 Allahverdi, 2008, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, 187, 985, 10.1016/j.ejor.2006.06.060 Caraffa, 2001, Minimizing makespan in a blocking flowshop using genetic algorithms, International Journal of Production Economics, 70, 101, 10.1016/S0925-5273(99)00104-8 Cheng, 2000, A review of flowshop scheduling with setup times, Production and Operations Management, 9, 262, 10.1111/j.1937-5956.2000.tb00137.x Cheng, 2000, A permutation flow-shop scheduling problem with convex models of operation processing times, Annals of Operations Research, 96, 39, 10.1023/A:1018943300630 Cheng, 2000, Two- and three-stage flowshop scheduling with no-wait in process, Production and Operations Management, 9, 367, 10.1111/j.1937-5956.2000.tb00464.x Eberhart, R. C., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan, pp. 39–43. Framinan, 2003, An effective constructive heuristic for flowtime minimisation in permutation flow shops, OMEGA, 31, 311, 10.1016/S0305-0483(03)00047-1 Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, International Journal of Production Research, 41, 121, 10.1080/00207540210161650 Geem, 2005, Application of harmony search to vehicle routing, American Journal of Applied Sciences, 2, 1552, 10.3844/ajassp.2005.1552.1557 Grabowski, 2007, The permutation flow shop problem with blocking. A tabu search approach, OMEGA, 35, 302, 10.1016/j.omega.2005.07.004 Hall, 1996, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research, 44, 510, 10.1287/opre.44.3.510 Lee, 2005, The harmony search heuristic algorithm for discrete structural optimization, Engineering Optimization, 37, 663, 10.1080/03052150500211895 Leisten, 1990, Flowshop sequencing problems with limited buffer storage, International Journal of Production Research, 28, 2085, 10.1080/00207549008942855 Liu, 2008, An effective PSO-based algorithm for flow shop scheduling with limited buffers, Computers & Operations Research, 35, 2791, 10.1016/j.cor.2006.12.013 Mahdavi, 2007, An improved harmony search algorithm for solving optimization problems, Applied Mathematics and Computation, 188, 1567, 10.1016/j.amc.2006.11.033 McCormich, 1989, Sequencing in an assembly line with blocking to minimize cycle time, Operations Research, 37, 925, 10.1287/opre.37.6.925 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA – International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9 Omran, 2008, Global-best harmony search, Applied Mathematics and Computation, 198, 643, 10.1016/j.amc.2007.09.004 Pinedo, 2002 Ribas, 2011, An iterated greedy algorithm for the flowshop scheduling problem with blocking, OMEGA, 39, 293, 10.1016/j.omega.2010.07.007 Ronconi, 2004, A note on constructive heuristics for the flowshop problem with blocking, International Journal of Production Economics, 87, 39, 10.1016/S0925-5273(03)00065-3 Ronconi, 2005, A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking, Annals of Operations Research, 138, 53, 10.1007/s10479-005-2444-3 Ronconi, 2001, Lower bounding schemes for flowshops with blocking in-process, Journal of the Operational Research Society, 52, 1289, 10.1057/palgrave.jors.2601220 Ronconi, 2009, Some heuristic algorithms for total tardiness minimization in a flowshop with blocking, OMEGA – International Journal of Management Science, 37, 272, 10.1016/j.omega.2007.01.003 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problems, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Wang, 2006, A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups, Computers and Operations Research, 33, 1326, 10.1016/j.cor.2004.09.018 Wang, 2006, An effective genetic algorithm for flow shop scheduling with limited buffers, Computers & Operations Research, 33, 2960, 10.1016/j.cor.2005.02.028