基于定制产品结构型谱的作业规划启发式算法

在大规模定制生产模式下,定制产品族制造作业的快捷、有效规划可降低成本、缩短交货期、增强企业竞争力.基于定制产品族的结构型谱和作业规划的次序相关性分析,构建了定制产品族制造作业规划的成本优化模型;提出了基于定制产品族结构型谱的作业规划启发式算法(CPSHA);随后,计算实例验证了CPSHA求解的快捷;并从转换次数、转换成本、转换时间三个方面的理论分析证实了CPSHA解的优异;基于仿真,通过CPSHA与路径枚举法、自适应遗传算法的对比,例证了CPSHA能获得优异近似最优解.最后,将CPSHA拓展到系列产品的作业规划.快捷、直观、有效的CPSHA不仅可获得优良的制造作业规划,更便于实际生产现场的使用.     

A LAGRANGIAN RELAXATION APPROACH FOR SUPPLY CHAIN PLANNING WITH ORDER／SETUP COSTS AND CAPACITY CONSTRAINTS

A heuristic approach is developed for supply chain planning modeled as multi-item multi-levelcapacitated lot sizing problems. The heuristic combines Lagrangian relaxation(LR) with local search.Different from existing LR approaches that relax capacity constraints and/or inventory balanceconstraints, our approach only relaxes the technical constraints that each 0-1 setup variable must takevalue 1 if its corresponding continuous variable is positive. The relaxed problem is approximatelysolved by using the simplex algorithm for linear programming, while Lagrange multipliers are updatedby using a surrogate subgradient method that ensures the convergence of the dual problem in case ofthe approximate resolution of the relaxed problem. At each iteration, a feasible solution of the originalproblem is constructed from the solution of the relaxed problem. The feasible solution is furtherimproved by a local search that changes the values of two setup variables at each time. By taking theadvantages of a special stru