A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem

Scientia Iranica - Tập 18 - Trang 759-764 - 2011
D. Hajinejad1, N. Salmasi2, R. Mokhtari1
1Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, P.O. Box 84156-83111, Iran
2Department of Industrial Engineering, Sharif University of Technology, Tehran, P.O. Box 11365-11155, Iran

Tài liệu tham khảo

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110

Schaller, 2000, Scheduling a flow line manufacturing cell with sequence dependent family setup time, European Journal of Operational Research, 125, 324, 10.1016/S0377-2217(99)00387-2

Franca, 2005, Evolutionary algorithms for scheduling a flow shop manufacturing cell with sequence dependent family setups, Computers and Industrial Engineering, 48, 491, 10.1016/j.cie.2003.11.004

Logendran, 2006, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Computers & Operations Research, 33, 158, 10.1016/j.cor.2004.07.004

Hendizadeh, 2008, Meta-heuristics for scheduling a flow shop manufacturing cell with sequence dependent family setup times, International Journal of Production Economics, 111, 593, 10.1016/j.ijpe.2007.02.031

Lin, 2009, Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times, International Journal of Production Research, 47, 3205, 10.1080/00207540701813210

Salmasi, 2010, Total flow time minimization in a flowshop sequence-dependent group scheduling problem, Computers & Operations Research, 37, 199, 10.1016/j.cor.2009.04.013

Kennedy, J. and Eberhart, R. “Particle swarm optimization”, Proceeding of IEEE International Conference on Neural Network, 4, Australia, pp. 1942–1948 (1995).

Lian, 2006, A similar particle swarm optimization for permutation flow shop scheduling to minimize makespan, Applied Mathematics and Computation, 175, 773, 10.1016/j.amc.2005.07.042

Lian, 2008, A novel particle swarm optimization algorithm for per-mutation flow shop scheduling to minimize makespan, Chaos, Solutions and Fractals, 35, 851, 10.1016/j.chaos.2006.05.082

Fatih Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flow time minimization in the permutation flow shop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024

Liu, 2008, An effective hybrid pso-based algorithm for flow shop scheduling with limited buffers, Computers & Operations Research, 35, 2791, 10.1016/j.cor.2006.12.013

Pinedo, 2008

Kuo, 2009, An effective flow shop scheduling algorithm based on a hybrid particle swarm optimization model, Expert Systems with Application, 36, 7027, 10.1016/j.eswa.2008.08.054

Thông tin
Thông tin xuất bản

Scientia Iranica

Tập 18

759-764

Thông tin tác giả