An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Wang L. Shop scheduling with genetic algorithms. Beijing: Tsinghua University Press, Springer; 2003 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9 Wang, 2003, A class of order-based genetic algorithm for flow shop scheduling, International Journal of Advanced Manufacture Technology, 22, 828, 10.1007/s00170-003-1689-8 Nowicki, 1996, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 160, 10.1016/0377-2217(95)00037-2 Wang, 2003, An effective hybrid heuristic for flow shop scheduling, International Journal of Advanced Manufacture Technology, 21, 38, 10.1007/s001700300005 Grabowski, 2001, New block properties for the permutation flowshop problem with application in tabu search, Journal of the Operational Research Society, 52, 210, 10.1057/palgrave.jors.2601055 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 Ronconi, 2005, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, Annals of Operations Research, 138, 53, 10.1007/s10479-005-2444-3 Papadimitriou, 1980, Flow shop scheduling with limited temporary storage, Journal of Association Computing Machine, 27, 533, 10.1145/322203.322213 Dutta, 1975, Sequencing two-machine flow-shops with finite intermediate storage, Management Science, 21, 989, 10.1287/mnsc.21.9.989 Smutnicki, 1998, A two-machine permutation flow shop scheduling problem with buffers, OR Spectrum, 20, 229, 10.1007/s002910050070 Sarper, 1996, Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop, Omega, 24, 73, 10.1016/0305-0483(95)00049-6 Soukhal, 2005, Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research, 161, 32, 10.1016/j.ejor.2003.03.002 Reddi, 1976, Sequencing with finite intermediate storage, Management Science, 23, 216, 10.1287/mnsc.23.2.216 Leisten, 1990, Flowshop sequencing problems with limited buffer storage, International Journal of Production Research, 28, 2085, 10.1080/00207549008942855 Nowicki, 1999, The permutation flow shop with buffers: a tabu search approach, European Journal of Operational Research, 116, 205, 10.1016/S0377-2217(98)00017-4 Grabowski, 1983, On flow shop scheduling with release and due dates to minimize maximum lateness, Journal of Operational Research Society, 34, 615, 10.1057/jors.1983.142 Brucker, 2003, Flow-shop problems with intermediate buffers, OR Spectrum, 25, 549, 10.1007/s00291-003-0133-7 McCormick, 1989, Sequencing in an assembly line with blocking to minimize cycle time, Operations Research, 37, 925, 10.1287/opre.37.6.925 Wang, 2006, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Computers and Operations Research, 33, 2960, 10.1016/j.cor.2005.02.028 Norman, 1999, Scheduling flowshops with finite buffers and sequence-dependent setup times, Computers and Industrial Engineering, 36, 163, 10.1016/S0360-8352(99)00007-8 Sikora, 1996, A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line, Computers and Industrial Engineering, 30, 969, 10.1016/0360-8352(96)00046-0 Wardono, 2004, A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, European Journal of Operational Research, 155, 380, 10.1016/S0377-2217(02)00873-1 Agnetis, 1998, An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer, Naval Research Logistics, 45, 141, 10.1002/(SICI)1520-6750(199803)45:2<141::AID-NAV2>3.0.CO;2-8 Pranzo, 2004, Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times, European Journal of Operational Research, 153, 581, 10.1016/S0377-2217(03)00264-9 Sawik, 2002, An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers, Mathematical and Computer modelling, 36, 461, 10.1016/S0895-7177(02)00176-0 Gourgand, 2005, Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity, European Journal of Operational Research, 161, 126, 10.1016/j.ejor.2003.08.032 Kennedy, 2001 Liu, 2006, Directing orbits of chaotic systems by particle swarm optimization, Chaos, Solitons & Fractals, 29, 454, 10.1016/j.chaos.2005.08.034 Liu, 2005, Improved particle swarm optimization combined with chaos, Chaos, Solitons & Fractals, 25, 1261, 10.1016/j.chaos.2004.11.095 Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G. Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Lecture Notes in Computer Science, vol. 3172. Berlin: Springer; 2004. p. 382–9. Bean, 1994, Genetic algorithms and random keys for sequencing and optimization, ORSA Journal of Computing, 6, 154, 10.1287/ijoc.6.2.154 Hansen, 2001, Variable neighborhood search: principles and applications, European Journal of Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4 Ong, 2004, Meta-Lamarckian learning in memetic algorithms, IEEE Transactions on Evolutionary Computation, 8, 99, 10.1109/TEVC.2003.819944 Ong, 2006, Classification of adaptive memetic algorithms: a comparative study, EEE Transactions on Systems, Man and Cybernetics: B, 36, 141, 10.1109/TSMCB.2005.856143 Wang, 2001, An effective hybrid optimization strategy for job-shop scheduling problems, Computers and Operations Research, 28, 585, 10.1016/S0305-0548(99)00137-9 Carlier, 1978, Ordonnancements a contraintes disjonctives, RAIRO-Operations Research, 12, 333, 10.1051/ro/1978120403331 Reeves, 1995, A genetic algorithm for flowshop sequencing, Computers and Operations Research, 22, 5, 10.1016/0305-0548(93)E0014-K Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M