单件车间关键工序调度问题的定界算法  

Partition algorithm for key-machine dispatch in job-shop

作　　者：刘鸿雁[1] 吕红[1] 王睿智[1] 

机构地区：[1]鞍山科技大学研究生部,辽宁鞍山114002

出　　处：《辽宁工程技术大学学报（自然科学版）》2003年第3期408-410,共3页Journal of Liaoning Technical University (Natural Science)

摘　　要：提出了一种以“定界权值”为主要参数的求解有交货期的单件车间生产调度问题的定界算法。引入“关键工序定界权值、非关键工序定界权值”的概念,并依据“关键工序排序加工,非关键工序即刻加工”的构想,确定工件各工序的加工时间范围,并根据计算结果编制机台作业计划。当关键工序加工时间发生冲突时,修正其定界权值,重新计算其加工时间范围。该方法简化问题,运算速度提高。Considering the variety of plants in manufacture, it presented a partition-dispatching algorithm. The partition weight was adopted and the 搆ey machine partition weight?and the non-key machine partition weight were introduced in this method. According to the idea 慿ey machines being prescheduled while the others not being prescheduled? the weights were calculated and the ranges of process time were fixed. Then the plant scheduling was worked out. When the jobs on key machine conflicted, the key machine partition weight was recalculated, and the ranges of process time were adjusted, the plan was made accordingly. The method can simplify the plant-scheduling problem in practice.

关 键 词：单件车间 生产调度问题 定界算法 关键工序 定界权值 排序 工序 加工时间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]