针对求Job-Shop调度最优解这一复杂问题,对产品加工树进行分解,将产品加工工序分为惟一紧前、紧后相关工序和独立工序,当这两类工序分批采用拟关键路径法(ACPM)和最佳适应调度法(BFSM)调度时,提出了关键设备工序紧凑性的新调度算法.通过分析与实例验证,所提出的新调度方法不仅简练而且获得了满意的结果. In order to solve the complicated problem of finding the optimal solution of Job-Shop, the product processing tree is decomposed, and the product processing process is divided into the only immediate, immediate related processes and independent processes. When these two types of processes are adopted in a critical way (ACPM) and Best Adaptive Scheduling (BFSM) scheduling, a new scheduling algorithm for the compactness of key equipment processes is proposed.Through the analysis and case validation, the proposed new scheduling method is not only concise but also obtains satisfactory results.