【作者】 唐庆国；

【导师】 张培忠；

【作者基本信息】 汕头大学 ， 机械电子工程， 2003， 硕士

【摘要】 模具企业的生产车间属于JOB SHOP(单件车间)类型，用于生产加工路线不同的专门产品。基于交货期的模具车间作业调度问题是解决不同类型工件的加工排序，使其误工最少。本文首先讨论了单件车间作业调度的几个方面问题，包括概念，数据特征，现有调度算法中存在的问题等。基于交货期的模具作业调度问题是NP问题，当问题的规模较大时，求其最优解几乎是不可能。因此，对NP类调度问题，一般采用启发式方法来求得满意解，常用优先规则法和一些专门调度算法。 考虑到模具调度算法的实用性和模具生产车间的实际情况，本研究把模具车间作业调度算法建立在OPT(Optimized Production Technology)技术基础上，结合SPT，EDD调度规则，提出一种新的调度算法，最大限度的保证模具交货期，减少车间在制品。此算法不追求车间各设备的能力平衡，而是把模具车间设备分为关键设备和非关键设备，注重解决车间的主要矛盾，即以车间瓶颈设备为中心，尽量使瓶颈设备满负荷工作，瓶颈设备前后分别采用拉动式和推动式排序方法，从系统的观点出发，全面提高车间的出产率。同时本文也提出了在模具企业中采用滚动计划法来确定企业的计划期内的生产能力，以此来确定在当前计划期内是否还可以接受新的订单。 针对本文提出的模具生产调度算法，我们开发了模具生产调度模块。本模块计算速度快，产生的结果比较理想。同时也为单件多品种生产类型的企业提供了一种新的调度方法，为进一步的研究和发展探索了一条较好的途径。更多还原

【Abstract】 The mould factory belongs to Job Shop and is a kind of workshop for manufacturing special products of different processing routes. The mould manufacture scheduling based on due date is a problem of how to schedule operation processing sequence to minimize tardiness. In this thesis, we discuss several important aspects of this problem first, including its concept, feature of data and problem of the algorithms in existence. The mould manufacture scheduling based on due date is the NP hard problem. It is impossible to find the optimal solution when the problem’s scale is very large. So the heuristic methods are often applied to job shop scheduling such as priority rule method and special algorithms.The mould manufacture scheduling is based on the Optimized Production Technology considering its application in practice and its situation. At the same time, it also adopts the dispatching rules, such as SPT (Shortest Processing Time), EDD (Earliest Due Date) and so on. The method can ensure the delivery on time and decrease the semi-manufactured goods. The algorithm doesn’t need to balance the capacities of the machines but the machines are regarded as the key machines and the general machines. When scheduling, the key machines are critical to be considered. In order to increase theefficiency, we need adopt different scheduling methods ahead and behind the key machines, namely pulling and pushing method. We also put forward a rolling scheduling in mould factory in order to calculate the capacities of the usable machines. This method can tell dispatcher ahead whether the shop accepts a new order or not.We developed a scheduling software module for mould factory based on the algorithm that is put forward in this thesis. The module calculates quickly and we get satisfactory results. At the same time,IVthe enterprises that are similar to the mould factory can use it for reference and for further research and this thesis provides a new method.更多还原