Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems

International Journal of Advanced Manufacturing Technology

Volumn 37, Issue 1-2, 2008, Pages 157-165

  Lei, Deming ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

External archive; Fuzzy job shop scheduling; Multi objective optimization; Particle swarm optimization; Priority rule

Indexed keywords

DECISION MAKING; FUZZY SETS; JOB ANALYSIS; PARETO PRINCIPLE; PROBLEM SOLVING; SCHEDULING;

EXTERNAL ARCHIVES; FUZZY JOB SHOP SCHEDULING; MULTI-OBJECTIVE OPTIMIZATION; PRIORITY RULES;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 43249130971     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-0945-8     Document Type: Article

References (21)

1. Schaffer D Multiple objective optimization with vector evaluated genetic algorithm, In Proc. 1st International Conference on Genetic Algorithm 1985:93-100
2. Parsopoulos KE, Vrahatis MN Particle swam optimization method in multi-objective problems. In Proceedings of the ACM Symposium on Applied Computing 2002:603-607
3. Coello Coello CA, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 18(3):256-279
4. Knowles JD, Corne DW (2000) Approximating the non-dominated front using the Pareto archive evolutionary strategy. Evol Comput 8(2):149-172
5. Li X A non-dominated sorting particle swarm optimizer for multi-objective optimization. In: Cantu-Paz et al (eds) Genet Evol Comput Conf 2003:37-48
6. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithms: NSGA-II. IEEE Trans Evol Comput 6(2):182-197
7. Hu X, Eberhart RC (2002) Multi-objective optimization using dynamic neighborhood particle swarm optimization. In Proc Congr Evol Comput 2:1677-1681
8. Mostaghim S, Teich J Strategies for finding good local guides in Multi-Objective Particle Swarm Optimization. In Proc 2003 IEEE Swarm Intell Symp 2003:26-33
9. Salazar-Lechuga M, Rowe JE Particle swarm optimization and fitness sharing to solve multi-objective optimization problems, Proc Congress on Evol Comput 2005:1204-1211
10. Alvarez-Bentiez JE, Everson RM, Fieldsend J A MOPSO algorithm based exclusively on Pareto dominance concept. In: Coello Coello CA et al (eds) Evolutionary Multi-Criterion Optimization 2005:459-475
11. Mostaghim S, Teich J Covering Pareto-optimal fronts by sub-swarms in multi-objective particle swarm optimization, Proc Congress on Evol Comput 2004:1404-1411
12. Janson S, Merkle D A new multi-objective particle swarm optimization using clustering applied to automated docking, In: Blesa MJ et al (eds) Hybrid Meta-heuristics 2005:128-141
13. Meng HY, Zhang XH, Liu SY A co-evolutionary particle swarm optimization-based method for multi-objective optimization, In: Zhang S, Jarvis R (eds) Adv Artif Intell 2005:349-359
14. Sakawa M, Mori T (1999) An efficient genetic algorithm for job shop scheduling problems with fuzzy processing time and fuzzy due date. Comput Ind Eng 36:325-341
15. Li FM, Zhu YL, Yin CW, Song XY Fuzzy programming for multi-objective fuzzy job shop scheduling with alternative machines through genetic algorithm. In: Wang L, Chen K, Ong YS (eds) Advance in Natural Computation 2005:992-1004
16. Sakawa M, Kubota R (2000) Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm. Eur J Oper Res 120:393-407
17. Hu X, Eberhart RC, Shi Y Swarm Intelligence for Permutation Optimization: A Case Study of N-queens Problem. Proceedings of the IEEE Swarm Intelligence Symposium 2003:243-246
18. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. Swiss Federal Institute of Technology, Lausanne, Switzerland, Tech. Rep. TIK-Rep, 103
19. Lei DM, Wu ZM (2006) Crowding-measure-based multi-objective evolutionary algorithm for job shop scheduling. Int J Adv Manuf Technol 30(1-2):112-117
20. Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257-271
21. Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115-148