汽车装配车间生产计划与调度的同时优化方法  

APPROACHES TO SIMULTANEOUS PRODUCTION PLANNING AND SCHEDULING IN AUTOMOBILE ASSEMBLY WORKSHOPS

作　　者：严洪森[1] 夏琦峰[1] 朱旻如[1] 刘霞玲[1] 

机构地区：[1]东南大学自动化研究所,南京210096

出　　处：《自动化学报》2002年第6期911-919,共9页Acta Automatica Sinica

基　　金：国家"8 6 3"/ CIMS主题项目 ( 86 3- 511- 70 8- 0 0 8和 86 3- 511- 94 3- 0 0 5);教育部高等学校骨干教师资助计划资助

摘　　要：文中提出三种新方法来解决汽车装配车间生产计划与调度的同时优化问题 .首先将汽车装配线简化为一个 Flow shop问题 ,并建立其混合整数规划模型 ,以求得使各装配工位的准备成本和空闲时间尽可能少并尽可能满足产品需求的粗生产计划 .然后在粗生产计划的基础上考虑装配线的细节 ,用 Tabu搜索法与快速调度仿真相结合的三种不同启发式算法使生产计划与调度同时得到优化 ,并给出了三种算法的复杂性 .大量算例的比较研究表明了这些算法的有效性和适用性 .Three new approaches is presented to the simultaneous production planning and scheduling problem in automobile assembly workshops. First of all, an automobile assembly line is simplified into a flow shop, its mixed integer programming model is formulated to obtain a rough production plan by minimizing the overproduction, underproduction, set-up and leisure time. On the basis of the obtained rough production plan, three different heuristic algorithms combining Tabu search with quick schedule simulation are used to optimize the production plans and schedules simultaneously, with more detail of the assembly line being considered. The computational complexity of each algorithm is also given. Comparison between many computational examples of these algorithms is carried out, the result confirms their effectiveness and adaptability.

关 键 词：汽车装配车间 生产计划 优化方法 生产调度 混合整数规划 TABU搜索 

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