摘要
车间作业调度与排序是生产管理与组合优化领域研究的重要课题，由于其内在的复杂性（ＮＰ－Ｈａｒｄ），很难利用经典方法求出最优解．遗传算法对于这类问题具有较强的寻优能力．本文针对流水车间的作业排序问题（ｎ／ｍ／Ｐ／Ｃｍａｘ）设计了一种遗传算法的实现形式，对现有的遗传算子进行了改进，通过算例分析表明，该算法具有良好的收敛特性与运算效率．
Studies on scheduling and sequencing in job shops are important branches in the fields of both production management and combinatorial optimization.It is hard to obtain the optimal solutions by classical methods due to their computational complexity (NP Hard).However,Genetic Algorithms (GA) have been proved advantageous for such problems.A kind of GA implementation is made for solving the flow shop sequencing problems with the form of n/m/P/C max and the genetic operators are improved suitable to the problems.The algorithm is proved effective and efficient both in computation and covergence by analyzing the results of some experiments on it.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
1997年第4期440-445,共6页
Journal of Beijing University of Aeronautics and Astronautics
基金
国家自然科学基金
关键词
排序
生产规划
组合规划
遗传算法
生产线
sequencing
production planning
combinatorial progamming
genetic algorithm
