首页 | 本学科首页   官方微博 | 高级检索  
     

Ant System Based Optimization Algorithm and Its Applications in Identical Parallel Machine Scheduling
引用本文:陈义保,姚建初,钟毅芳. Ant System Based Optimization Algorithm and Its Applications in Identical Parallel Machine Scheduling[J]. 系统工程与电子技术(英文版), 2002, 13(3)
作者姓名:陈义保  姚建初  钟毅芳
作者单位:Chen Yibao,Yao Jianchu & Zhong Yifang School of Mechanical Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,P.R. China
基金项目:ThisprojectwassupportedbytheNationalNaturalScienceFoundationofChina (No .5 9990 470 - 2 )andDoctoralProgramFoundationunderMinistryofEducation (No .2 0 0 10 4870 2 4)
摘    要:1 .INTRODUCTIONIdenticalparallelmachineschedulingproblemforminimizingthemakespanhasbeenprovedtobeanNPprob lem[1,2 ] .Itwastraditionallysolvedbyoperationalmethodssuchasdynamicprogramming ,branchandboundmethod ,andintegerprogramming[3~ 7] .Thesemethodscan giveanop…


Ant System Based Optimization Algorithm and Its Applications in Identical Parallel Machine Scheduling
Chen Yibao,Yao Jianchu , Zhong Yifang School of Mechanical Science and Engineering,Huazhong University of Science and Technology,Wuhan ,P.R. China. Ant System Based Optimization Algorithm and Its Applications in Identical Parallel Machine Scheduling[J]. Journal of Systems Engineering and Electronics, 2002, 13(3)
Authors:Chen Yibao  Yao Jianchu & Zhong Yifang School of Mechanical Science  Engineering  Huazhong University of Science  Technology  Wuhan   P.R. China
Affiliation:School of Mechanical Science and Engineering , Huazhong University of Science and Technology, Wuhan 430074, P.R. China
Abstract:Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machine scheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving the combinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications. In this paper, an ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Two different scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristic procedure and simulated annealing method, as well as genetic algorithm.
Keywords:Identical parallel machine   Scheduling   Ant system   Genetic algorithm   Simulated annealing   Combinatorial optimization.
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号