Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

被引：1
作者：
N. Shivasankaran
P. Senthil Kumar
K. Venkatesh Raja
机构：
[1] K. S. R. College of Engineering,Department of Mechanical Engineering
来源：
International Journal of Computational Intelligence Systems | 2015年 / 8卷
关键词：
Scheduling; Sorting; Immune Simulated Annealing Technique; Flexible Job Shop; Multi-objective Optimization; Make span;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Hybrid sorting immune simulated annealing technique (HSISAT), a Meta - heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the critical machines and immune simulated annealing (ISA) is applied to increase the convergence speed. Several case studies have been taken from the literature to demonstrate the convergence speed of the proposed algorithm. The computational results have proved that the proposed hybrid algorithm is an effective approach to solve the multi-objective FJSP.
引用
收藏
页码：455 / 466
页数：11
相关论文
共 75 条
[1]  
Orji JIM(2013)Project Scheduling Under Resource Constraints: a Recent Survey Int. J. Eng. Res. Technol. 2 1-20
[2]  
Wei S(2013)An Agent-Based Distributed scheduling for crisis management Supply Chain Int. J. Comput. Int. Sys. 6 156-173
[3]  
Kaddoussi A(2013)Resource-constraint multi-project scheduling with priorities and uncertain activity durations Int. J. Comput. Int. Sys. 6 530-547
[4]  
Zoghlami N(2014)A critical chains based distributed multi-project scheduling approach Neurocomputing 143 282-293
[5]  
Hammadi S(2001)An effective hybrid optimization strategy for job-shop scheduling problems Comput. Oper. Res. 28 585-596
[6]  
Zgaya H(1992)Job shop scheduling by Simulated Annealing Oper. Res. 40 113-125
[7]  
Zheng Z(2010)A hybrid immune simulated annealing algorithm for the job shop scheduling problem Appl. Soft. Comput. 10 79-89
[8]  
Shumin L(1999)A simulated annealing algorithm for job shop scheduling Prod. Plan. Control 10 767-777
[9]  
Ze G(2007)A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling Eur. J. Oper. Res. 177 1894-1910
[10]  
Yueni Z(2009)‘A simulated annealing algorithm for flexible job-shop scheduling problem’ J. Appl. Sci. 9 662-670
12345678