An effective discrete harmony search for solving bi-criteria FJSP

Proceedings of the 2011 Chinese Control and Decision Conference, CCDC 2011

Volumn , Issue , 2011, Pages 3625-3629

  Li, Junqing ^a   Pan, Quanke ^a   Xie, Shengxian ^a   Gao, Kaizhou ^a   Wang, Yuting ^a  

^a LIAOCHENG UNIVERSITY   (China)

Author keywords

Flexible job shop scheduling problem; Harmony search; Local search; Multi objective optimization; Pareto archive set

Indexed keywords

FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HARMONY SEARCH; LOCAL SEARCH; MULTI OBJECTIVE; PARETO ARCHIVE SETS;

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION;

PARETO PRINCIPLE;

EID: 80052195843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2011.5968851     Document Type: Conference Paper

References (15)

1. Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 22:158-183, 1993.
2. Gao L, Peng CY, Zhou C, Li PG. Solving flexible job shop scheduling problem using general particle swarm optimization. The 36th CIE Conference on Computers & Industrial Engineering: 3018-3027, 2006.
3. Kacem I, Hammadi S, Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60:245-276, 2002a.
4. Kacem I, Hammadi S, Borne P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man and Cybernetics, Part C, 32(1):408-419, 2002b.
5. Xia WJ, Wu ZM. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering, 48(2):409-425, 2005.
6. Zhang GH, Shao XY, Li PG, Gao L. An effective hybrid swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers and Industrial Engineering, 56(4):1309-1318, 2009.
7. Z.Geem, J.Kim, G.Loganathan, A new heuristic optimization algorithm:harmony search,Simulation76(2)(2001)60-68.
8. J.Kim, Z.Geem, E.Kim, Parameter estimation of the nonlinear Muskingum model using harmony search, Journal of American Water Resource Association 37(5) (2001) 1131-1138.
9. Li JQ, Pan QK, Liang YC. An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Computers and Industrial Engineering, 2010, 59(4):647-662.
10. Adams J., Balas E., Zawack D.: The shifting bottleneck procedure for Job Shop Scheduling. Management Science No. 34, 391-401. (1988)
11. DEB K, PARATAP A, AGARWAL S, MEYARIVAN T. A fast and elitist multiobjective genetic algorithm: NSGA-IEEE Transactions on Evolutinary Computation, 6(2):182-197, 2002.
12. PAN Q K, WANG L, QIAN B. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36(8): 2498-2511, 2009.
13. Li, J.Q., Pan, Q.K., Suganthan, P.N. and Chua, T.J., A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol., 2010, doi: 10.1007/s00170-010-2743-y.
14. Li JQ, Pan QK, Gao KZ. Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems [J]. International Journal of Advanced Manufacturing Technology. (SCI, IF: 1.128).
15. Li JQ, Pan QK, Xie SX. A Hybrid Variable Neighborhood Search Algorithm for Solving Multi-Objective Flexible Job Shop Problems [J]. ComSIS Computer Science and Information Systems. 2010,7(4):907-930.