论文部分内容阅读
Ｊｏｂｓｈｏｐ中的零件排序问题是生产作业计划安排与调度中的重要内容之一，作业已证明，这类问题属于ＮＰ难题，不存在有效的解析解．本文针对一般作业车间的具体情况，考虑到零件在工序间的批移动方式，提出了平行顺序移动方式下以极小化零件生产周期为目标的启发式算法，并设计了相应的计算机程序，它可以方便地进行作业计划安排，对于实际生作业计划与调度具有重意义
Part ordering problem in Jobshop is one of the most important contents in scheduling and scheduling of production jobs. It has been proved that this kind of problem belongs to NP problem and there is no valid analytical solution. In this paper, aiming at the specific situation of general work shop and taking into account the batch movement of parts between processes, a heuristic algorithm aimed at minimizing the production cycle of parts is proposed. The corresponding computer program is designed. Work scheduling can be easily carried out for the actual work plan and scheduling has a heavy meaning