论文部分内容阅读
针对某电器企业的一个瓶颈工序来制定调度方案，该问题归纳为平行机台具有模具约束，目标为最小拖期和的调度问题．本文提出了如下的启发式算法：根据模具情况运用成组技术对工作成组并生成运行表：按运行表顺序对各个运行中的工作进行指派机台，设置禁忌模具集合，避免对运行的短视性；根据工作的交货期和加工时间选择适当的机台进行加工；在各个机台运用ＮＢＲ（ＮｅｔＢｅｎｅｆｉｔｏｆＲｅｌｏｃａｔｉｏｎ）算法调节顺序以减少拖期和．该算法在厂家的实际测试中，通过三个不同的实例与手工排程进行了比较，各项指标均有明显优势．
Aiming at a bottleneck process of a certain electrical appliance enterprise, a scheduling scheme is formulated. The problem can be summarized as the scheduling problem that the parallel machine has the mold constraint and the goal is the minimum tardiness. In this paper, the following heuristic algorithm is proposed: Grouping work into groups and generating a running table according to the situation of the mold: assigning a machine to each running work according to a running table sequence, setting a contraindication mold set to avoid running shortsighted Select the appropriate machine according to the delivery date and processing time of the job, and adjust the order by using NBR (NetBenefitofRelocation) algorithm on each machine to reduce the tardiness. The algorithm in the manufacturer’s actual test, compared with manual scheduling through three different examples, the indicators have obvious advantages.