• 论文 •    

类带工艺约束的关键工序作业排序问题

周  云, 秦江涛,叶春明   

  1. 上海理工大学 管理学院,上海  200093
  • 出版日期:2005-04-15 发布日期:2005-04-25

Research on scheduling key-process with craft constrains

ZHOU Yun,QIN Jiang-tao,YE Chun-ming   

  1. Coll. of Management, Univ. of Shanghai for S & T, Shanghai  200093,China
  • Online:2005-04-15 Published:2005-04-25

摘要: 关键工序的作业排序问题是生产车间的一项重要内容,讨论了把n个带工艺约束的任务安排给m台设备加工,使得总加工时间最短的一类排序问题。在建立了该问题的数学模型的基础上,巧妙地把这个排序问题转化为指派问题,并采用匈牙利算法对该问题进行了求解。实例证明,建立的数学模型和提出的问题转换方法便于理解,求解快速有效。

关键词: 工艺约束, 排序问题, 指派问题

Abstract: Scheduling key-process problem with craft constrains is important in workshop . It is aimed to minimize total flow time. A mathematic model was presented. The scheduling problem above-mentioned was ingeniously reduced to an assignment problem, which could be easily solved by a famous method: Hungary algorithm. Finally, the effectiveness and efficiency of the method were proved by an example.

Key words: craft contains, scheduling problem, assignment problem

中图分类号: