主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2006, Vol. ›› Issue (5): 73-80.

• 论文 • 上一篇    下一篇

面向成套订单问题的工艺规划与排序的集成研究

周水银, 盛培锋   

  1. 华中科技大学管理学院, 湖北, 武汉, 430074
  • 收稿日期:2005-12-12 修回日期:2006-09-29 出版日期:2006-10-28 发布日期:2012-03-07
  • 基金资助:
    国家自然科学基金资助项目(70572032);国家自然科学基金重点资助项目(70332001)

Integrated Process Planning and Scheduling with Maximizing the Weighted Number of Whole set orders

ZHOU Shui-yin, SHENG Pei-feng   

  1. Management College, Huazhong University of S&T, Wuhan 430074, China
  • Received:2005-12-12 Revised:2006-09-29 Online:2006-10-28 Published:2012-03-07

摘要: 本文从工艺规划与排序的集成优化角度研究了成套订单问题[1],克服了单独研究工艺规划和排序局部优化的局限性.文章中考虑了同一工件内部各道工序之间存在的优先加工限制,以及工件在不同机器上加工需要转移时间和工序间接连加工需要机器调整时间的情况,建立了成套订单问题的集成排序模型,并提出了针对求解大规模问题的基于遗传算法的启发式算法,最后通过一个算例对所研究的集成排序问题和所提出的算法进行了说明,计算结果表明了算法的有效性.

关键词: 工艺规划, 集成排序, 机器选择, 成套订单问题, 遗传算法

Abstract: In this paper,we propose an integrated process planning and scheduling model with maximizing the weighted number of whole set orders,one of the most important merits of this model is for supporting the global optimization.This paper has added such consideration: precedence constraints between operations in the same job,transition time and setup time.Then we propose a 0-1 integer progra ming model,and design a heuristic approach based on GA.Anumeric example is given in the end of the text to prove the efficiency of the algorithm which has been designed to solve the whole set order problem in the text.

Key words: process planning, scheduling, machine selection, whole set order, genetic algorithm

中图分类号: