Hybrid Pareto-based tabu search algorithm for solving the multi-objective flexible Job Shop scheduling problem

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 16, Issue 7, 2010, Pages 1419-1426

  Li, Jun Qing ^a   Pan, Quan Ke ^a   Wang, Yu Ting ^a  

^a LIAOCHENG UNIVERSITY   (China)

Author keywords

Flexible Job Shop scheduling; Multi objective optimization; Neighborhood structure; Pareto archives set; Tabu search

Indexed keywords

BLOCK STRUCTURES; COMPLETION TIME; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HYBRID TABU SEARCH; MAKESPAN; MULTI OBJECTIVE; NEIGHBORHOOD STRUCTURE; PARETO ARCHIVE; PARETO SET; SEARCH SPACES; SIMULATION RESULT; SPEED-UPS; TABU SEARCH ALGORITHMS;

LEARNING ALGORITHMS; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION; PARETO PRINCIPLE; SCHEDULING ALGORITHMS; STRUCTURAL OPTIMIZATION;

TABU SEARCH;

EID: 77955649729     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. BRUKER P, SCHLIE R. Job-Shop scheduling with multi-purpose machines [J]. Computing, 1990, 45 (4): 369-375.
2. XIA W J, WU Z M. An effective hybrid optimization approach for multi-objective flexible Job-Shop scheduling problems [J]. Computers and Industrial Engineering, 2005, 48 (2): 409-425.
3. YU Jianjun, SUN Shudong, HAO Jinghui. Multi objective flexible Job-Shop scheduling based on immune algorithm [J]. Computer Integrated Manufacturing Systems, 2006, 12 (10): 1643-1650 (in Chinese).
4. YUAN Kun, ZHU Jianying. Improved genetic algorithm for the flexible Job-Shop scheduling with multi-object [J]. China Mechanical Engineering, 2007, 18 (2): 156-160 (in Chinese).
5. XING Lining, CHEN Yingwu, YANG Kewei. Multi-objective flexible Job Shop schedule: Design and evaluation by simulation modeling [J]. Applied Soft Computing, 2009, 9 (1): 362-376.
6. ZHANG G H, SHAO X Y, LI P G, et al. An effective hybrid swarm optimization algorithm for multi-objective flexible Job-Shop scheduling problem [J]. Computers and Industrial Engineering, 2009, 56 (4): 1309-1318.
7. KACEM I, HAMMADI S, BORNE P. Pareto-optimality approach for flexible Job-Shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic [J]. Mathematics and Computers in Simulation, 2002, 60 (3): 245-276.
8. WU Xiuli, SUN Shudong, YU Jianjun, et al. Research on multi-objective optimization for flexible Job Shop scheduling [J]. Computer Integrated Manufacturing Systems, 2006, 12 (5): 731-736 (in Chinese).
9. WANG Ling, LIU Bo. Particle swarm optimization and scheduling algorithms [M]. Beijing: Tsinghua University Press, 2008 (in Chinese).
10. PAN Q K, WANG L, QIAN B. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems [J]. Computers & Operations Research, 2009, 36 (8): 2498-2511.
11. DEB K, PARATAP A, AGARWAL S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II [J]. IEEE Transactions on Evolutinary Computation, 2002, 6 (2): 182-197.
12. KACEM I, HAMMADI S, BORNE P. Approach by localization and multi-objective evolutionary optimization for flexible Job-Shop scheduling problems [J]. IEEE Transactions on Systems, Man and Cybernetics, Part C, 2002, 32 (1): 408-419.
13. GAO Liang, GAO Haibing, ZHOU Chi. PSO based scheduling algorithm for open shop scheduling problem [J]. Chinese Journal of Mechanical Engineering, 2006, 42 (2): 129-134 (in Chinese).