装配线平衡和产品排序是紧密相关而且对目标值存在交互影响作用的两个NP—hard问题。文中基于这两个问题的交互影响以及贪婪随机自适应算法(GI己AsP)比较好的收敛速度和全局满意度,设计了协同优化贪婪随机自适应算法((X)GRASP),并行协同地优化混合装配线,并用实例对此算法进行了仿真研究。此外,文中还考虑了可能存在的瓶颈工序对协同优化效果的影响,将一种基于OPT思想的关键资源调度方法融入原来的COGRASP中,通过相应实例验证,取得的效果也非常好。
Assembly line balancing and products sequencing are both NP - hard problems and they are tightly interrelated and influence each other in mixed- model assembly line. In this paper, based on the mutual influence on makespan in the mixed- model assembly line, a co-evolutionary optimization greedy randomized adaptive search procedure ((20GRASP) with better convergence rate and global satisfaction is designed to minimize makespan in parallel. The simulation example using this algorithm has been given. Further, in the assembly line, the bottleneck process may exist which will influence the collaborative optimization. Incorporate a kind of key resource scheduling based on OPT into the former COGRASP. The simulation results of corresponding example also show good efficiency.