基于规则和仿真的多机并行作业车间生产调度研究  

Rule and Simulation-Based Parallel Machine Job-Shop Scheduling

作　　者：安政[1] 苏春[1] 

机构地区：[1]东南大学机械工程学院,江苏南京211189

出　　处：《工业工程》2010年第1期64-68,共5页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(70671022)

摘　　要：资源分派和能力分派是作业车间生产调度中的重要问题,路径选择规则和分派规则是解决上述问题的有效途径。采用基于规则的仿真研究多机并行作业车间资源分派和能力分派问题,分析工件加工时间、到达率以及机器加工速率对调度结果的影响,以平均完工时间、平均延迟交货率以及平均资源利用率为评价指标,通过对4种路径选择规则和6种分派规则的仿真试验,确定不同性能指标下最佳的调度规则。仿真研究表明:调度规则的选用取决于车间资源配置和调度目标,应避免仅凭借经验或偏好选择规则的调度方法。The key for job shop scheduling is resource and capacity assignment. Routing and dispatching rules are widely used for job shop scheduling. The scheduling problem of job-shops with parallel machines is studied by combining such rules with simulation. The effect of part processing times, part arrival rate, and production rate of machines on the scheduling performance is analyzed. With mean completion time, average percentage of tardy jobs, average resource utilization as indices, optimal rules are determined for different objectives by simulation with four routing and six dispatching rules. It shows that the selection of rules is dependent on the resource configuration and objective.

关 键 词：作业车间调度 路径选择 分派 仿真 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]