Hybrid algorithm for flowshop scheduling problem

Zidonghua Xuebao/ Acta Automatica Sinica

Volumn 35, Issue 3, 2009, Pages 332-336

  Zhang, Chang Sheng ^a   Sun, Ji Gui ^a   Yang, Qing Yun ^b   Zheng, Li Hui ^a  

^a JILIN UNIVERSITY   (China)

^b CHANGCHUN INSTITUTE OF OPTICS   (China)

Author keywords

Flowshop scheduling; Mutation; Partical swarm optimization (PSO)

Indexed keywords

BENCHMARKING; CONSTRAINED OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING;

ALLDIFFERENT; EFFICIENT ALGORITHMS; FLOW-SHOP SCHEDULING PROBLEMS; FLOWSHOP SCHEDULING; GENETIC OPERATORS; HYBRID ALGORITHMS; HYBRID PARTICLES; LOCAL SEARCH STRATEGIES; MUTATION; PARTICAL SWARM OPTIMIZATION (PSO); PARTICLE SWARM OPTIMIZATION ALGORITHMS; SOLUTION QUALITIES;

SCHEDULING ALGORITHMS;

EID: 63749131472     PISSN: 02544156     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1004.2009.00332     Document Type: Article

References (14)

1. Garey M R, Johnson D S, Sethy R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research, 1976, 1(2): 117-129.
2. Dimopoulos C, Zalza A M S. Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and computations. IEEE Transactions on Evolutionary Computation, 2000, 4(2): 93-113.
3. Valente J M S, Alves R A F S. An exact approach to early/tardy scheduling with release dates. Computers and Operations Research, 2005, 32(11): 2905-2917.
4. Yang Q Y, Sun J G, Zhang J Y, Wang C J. A hybrid discrete particle swarm algorithm for open-shop problems. In: Proceedings of the 6th International Conference on Simulated Evolution and Learning. Hefei, China: Springer, 2006. 158-165.
5. He S, Wu Q H, Wen J Y, Saunders J R, Paton R C. A particle swarm optimizer with passive congregation. Biosystems, 2004, 78(1-3): 135-147.
6. Kao Y T, Zahara E, Kao I W. A hybridized approach to data clustering. Expert Systems with Applications: An International Journal, 2008, 34(3): 1754-1762.
7. Rameshkumar K, Suresh R K, Mohanasundaram K M. Discrete particle swarm optimization algorithm for permutation flowshop scheduling to minimize makspan. In: Proceedings of International Conference on Advances in Natural Computation. Changsha, China: Springer, 2005. 572-581.
8. Lian Z G, Gu X S, Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation, 2006, 175(1): 773-785.
9. Nearchou A C. The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economics, 2004, 88(2): 191-203.
10. Lian Z G, Gu X S, Jiao B. A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos, Solitons and Fractals, 2008, 35(5): 851-861.
11. Lauriere J L. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 1978, 10(1): 29-127.
12. van den B F. An Analysis of Particle Swarm Optimizers [Ph. D. dissertation], University of Pretoria, South Africa, 2002.
13. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 1990, 47(1): 65-74.
14. Pan Q K, Tasgetiren M F, Liang Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research, 2008, 35(9): 2807-2839.