汽车综合性能检测线的建模与短期调度  

Modeling and short-term scheduling of synthetic vehicle performance test line

作　　者：陈昌领[1] 袁德成[2] 邵惠鹤[1] 孙鹏[3] 

机构地区：[1]上海交通大学自动化研究所,上海200030 [2]沈阳化工学院过程系统工程中心,沈阳110021 [3]上海交通大学自动化系智能工程研究所,上海200030

出　　处：《控制理论与应用》2002年第5期681-688,共8页Control Theory & Applications

摘　　要：研究了汽车综合性能检测线批次检测车辆的建模与短期调度问题 .调度的目标是使给定数量车辆检测时间最短 .该过程是一个变存储策略的序贯多目的批处理过程 .建立调度数学模型时 ,把Moon等人[1] 的工作推广到了NW ,NIS ,FIS存储策略 ,并根据汽车综合性能检测线的实际情况建立了顺序相关存储策略和人力资源约束的数学表达 .该数学模型表达为一个混合整数非线性规划 (MINLP) ,经线性化处理转化为一个混合整数线性规划问题 (MILP) ,求解使用了分枝定界法 (BAB) .计算结果对汽车综合性能检测线批次车辆检测排序和驾驶员人数安排有指导性作用 ,提高了车辆检测效率 .The modeling and short_term scheduling of synthetic vehicle performance test line are presented. The purpose of scheduling is to minimize the test time of the given number of vehicles. The process of vehicle test is a sequential multipurpose batch process with variant storage policy. When the mathematic scheduling model is built, the result of Moon and Hrymak is extended to the NW, NIS, FIS storage policies. Then the sequence_dependent storage policy as well as constraint of manpower is formulated as inequalities based on the situation of the test line. The scheduling model is formulated as a mixed integer nonlinear programming (MINLP) problem, and converted to a mixed integer linear programming (MILP) problem by linearization. The branch and bound (BAB) technique is used when the MILP problem is solved. The optimal scheduling has instructive significance for sequencing vehicles, deciding the number of drivers, and improving test efficiency when the given number of vehicles are tested.

关 键 词：汽车综合性能检测线 建模 短期调度 存储策略 混合整数线性规划 数学模型 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置]