具有成组约束的柔性同序加工车间的排序算法  

Algorithm for Scheduling Flexible Flow Shop with Group Constraints

作　　者：黄锦钿[1] 陈庆新[1] 毛宁[1] 

机构地区：[1]广东工业大学机电工程学院,广东广州510090

出　　处：《工业工程》2011年第2期112-117,共6页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(50675039);国家863计划CIMS资助项目(2006AA04Z132);广东省自然科学基金团队资助项目(05200197);广东省科技攻关资助项目(2004B10201030)

摘　　要：针对轮胎模具的生产调度特点,研究了具有成组约束的两阶段柔性同序加工车间(FF2)的调度问题,建立了目标函数为最小化最大完成时间的调度数学模型,基于Johnson准则提出一种新的启发式算法,并应用企业的实际算例,说明了数学模型和求解方法的可靠性和有效性。Tire mold production is characterized as flow shop with group constraints.In this paper,the scheduling problem of two-stage flexible flow shop for tire mold production is addressed.A mathematical model is put forward for the problem with makespan as objective.Based on Johnson polynomial algorithm,a new heuristic is presented to solve the problem.The reliability and effectiveness of the new algorithm is demonstrated by an example from the industrial practice.

关 键 词：模具 柔性流水车间 成组调度 启发式算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]