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

多阶段混合Flow Shop调度问题及其遗传求解算法
引用本文:庞哈利,郑秉霖.多阶段混合Flow Shop调度问题及其遗传求解算法[J].控制与决策,1999(Z1).
作者姓名:庞哈利  郑秉霖
作者单位:东北大学信息科学与工程学院!沈阳110005
基金项目:国家自然科学基金,863 理论研究项目
摘    要:针对多阶段混合Flow Shop 调度问题的一般结构和不同的调度目标函数,提出混合整数规划模型,并基于问题的结构特点设计了遗传求解算法。计算实验结果表明,遗传算法对于不同规模和结构的问题具有良好的适应性和求解性能

关 键 词:混合FlowShop  调度  Makespan  总流程时间  遗传算法

Genetic Algorithms for Multistage Hybrid Flow Shop Scheduling Problem
Pang Hali,Zheng Binglin.Genetic Algorithms for Multistage Hybrid Flow Shop Scheduling Problem[J].Control and Decision,1999(Z1).
Authors:Pang Hali  Zheng Binglin
Affiliation:Northeastern University
Abstract:This paper considers the multistage hybrid flow shop scheduling problem. A mixed integer-programming model associated with different objective of minimizing makespan and total flow time is given. In view of complexity of the problem and limit of existent researches, an algorithm based on genetic approach is proposed to solve the problem. Some randomly generating problems and lower bounds on objective of makespan and total flow time are used to test and compare the performance of the algorithm. Computational results show that proposed algorithm is rather adaptive and efficient for the problems with different structure, size and objective function.
Keywords:hybrid flow shop  scheduling  makespan  total flow time  genetic algorithms
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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