Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results 针对job - shop调度问题求最优解算法这一npc问题，本文以充分发挥多产品、多设备加工所具有并发性、异步性、分布性和并行性的加工优势，从而提高产品的加工效率为目标，对job - shop调度问题的工艺图进行适当分解，使工序在一定时间段或是为具有唯一紧前、紧后相关工序或是为独立工序，即将工序分两类，再结合操作系统中内存调度的最佳适应( bf )调度方法和首次适应( ff )调度方法的先进思想，通过分析提出了一种解决一般job - shop调度问题的全新近优解方案：在考虑关键设备上工序尽量紧凑的前提下，将工序分类、对这两类工序分批采用拟关键路径法( acpm )和最佳适应调度方法( bfsm )安排工序的算法，用实例加以验证，并给出结果甘特图。
