单机成组调度问题的约束满足建模与求解方法  

Constraint Satisfaction Modeling and Solving Method for Single Machine Group Scheduling Problem

作　　者：姜锐[1] 陈亚绒[1,2] 管在林[2] 周宏明[1] 

机构地区：[1]温州大学,温州325035 [2]华中科技大学数字制造装备与技术国家重点实验室,武汉430074

出　　处：《中国机械工程》2013年第12期1642-1649,共8页China Mechanical Engineering

基　　金：国家自然科学基金资助重点项目(51035001);国家自然科学基金资助项目(71271156);国家杰出青年科学基金资助项目(50825503);浙江省自然科学基金资助项目(Y6110045)

摘　　要：为适应多品种小批量生产需求,企业普遍采用基于成组技术的混流生产,由此产生的成组调度需要平衡安装时间减少与满足交期之间的冲突关系。在分析安装时间是否依赖工件组排序、工件组能否分割加工等成组特征的基础上,以最小化加权流程时间与加权拖期为目标,构建了单机成组调度问题的约束满足模型,提出了以变量排序启发式搜索和前向约束传播相结合的求解方法。典型生产数据的实证分析表明,所提出的方法建模能力强,解的适应性好。Mix--flow production based on group technology was adopted generally by enterprises to meet the demands of multi--variety and small batch, and a group scheduling method was used to balance the conflict relation between setup time decreasion and delivery satisfaction. Based on the anal- ysis of group characteristics of setup time and processing batch size, the paper constructed a constraint satisfaction model for single machine group scheduling with the objective of minimizing weighted flow time and tardiness, and introduced a mix solving method with a variable and value heuristic search, and look--ahead constraint propagation. Typical empirical analysis shows the proposed method is of strong modeling capabilities and good adaptability.

关 键 词：成组调度 约束满足 启发式搜索 约束传播 

分 类 号：F406[经济管理—产业经济]