计算机辅助作业计划的启发式方法及其应用

A HEURISTIC ALGORITHM AND ITS APPLICATION FOR FLOWSHOP SCHEDULING

分析了平行顺序移动方式下零件在工序间的运动过程和特性，据排序问题理论分析建立了数学模型，对ｎ／ｍ／Ｐ／Ｆｍａｘ（ｎ类零件、ｍ台机床、以最大流程时间最短为目标的同顺序加工的排序）问题，构造了优度较高的启发式算法，实现了计算机辅助编制作业计划．该法适于流水车间或成组单元，开发的相应软件可用以编制零件加工进度计划，机床负荷计划，同时绘制生产作业计划（Ｇａｎｔｔ）图，仿真效果较好．

ased on the analyse of the processes and characteristics of parts in the flowshop, a mathematical model and a heuristic algorithm of minimizing the maxinum flow time for the n/ m/ P/ Fmax problems are built. The algorithm can obtain near optimum, and be used for computer-aided scheduling of flowshops. A software is developed by the algorithm in C, which can effectively give the schedules of the machining of parts, the load of every machine tool, and Gantt figures.