摘要
Ｊｏｂｓｈｏｐ中的零件排序问题是生产作业计划安排与调度中的重要内容之一，作业已证明，这类问题属于ＮＰ难题，不存在有效的解析解．本文针对一般作业车间的具体情况，考虑到零件在工序间的批移动方式，提出了平行顺序移动方式下以极小化零件生产周期为目标的启发式算法，并设计了相应的计算机程序，它可以方便地进行作业计划安排。
Job shop scheduling problem is very important but difficult for production planning and control since the problem is NP-hard and no efficient algorithm exists to guarantee optimal solution.Based the analysis of the practical situations and lot transfer between processes,the paper presents a heuristic algorithm to minimize makespan.A computer program is also developed which is efficient to solve the problem and very useful for production planning and control.
出处
《天津理工学院学报》
1996年第4期59-64,共6页
Journal of Tianjin Institute of Technology
