摘要
提出一种类似于Flow-Shop调度问题(FSP)但又区别于FSP的Semi-Flow-Shop装配调度问题(SFSP),即在系列产品的装配中,某些产品可以跳过装配工艺中的几道工序而直接进入下道工序。根据实际情况,同时考虑了工件的准备时间及劳动力资源约束。针对该类问题,以最小化生产周期为目标建立数学模型,并设计了一种改进的双层自适应单亲遗传算法,实例证明该算法具有较高的有效性。
A Semi-Flow-Shop Assembly Scheduling Problem（SFSP） which is different but similar from the FSP was presented. The difference is some products can skip few processes of assembly procedure and direct proceed to the next process. According to the actual producing situation, the preparation time of parts and labor resource constraints are considered. In order to minimize the production cycle, established a mathematical model based on this problem and designed an improved two-layer adaptive Partheno Genetic Algorithm（PGA）. The example proved that the algorithm has high stability and effectiveness.
出处
《现代制造工程》
CSCD
北大核心
2011年第3期88-92,129,共6页
Modern Manufacturing Engineering
