现代制造工程Issue(1)：130-135,6.DOI:10.16731/j.cnki.1671-3133.2018.01.025
约束规划求解原型样车测试排程问题
Scheduling of tests on vehicle prototypes using constraint programming
摘要
Abstract
In view of all kinds of constraints,such as the availability of vehicle prototypes,capacity of constraint resource,preced-ence constraints,applies Mixed Integer Linear Programming(MILP) and Constraint Programming(CP) to adderess a problem in the automobile industry where lots of tests must be performed on prototypes of a vehicle before starting its mass production.The objective of MILP model is to estimate the number of required prototypes and CP model aims to minimize the makespan.This study shows the scheme by the Gantt chart.The paper used CPLEX Optimization Studio to formulate and solve two models.The result fully proves that MILP easily find the estimate value and constraint programming technology has the superiority and effec-tiveness as scheduling problem.关键词
原型样车/测试/混合整数线性规划/约束规划/排程Key words
vehicle prototypes/tests/Mixed Integer Linear Programming(MILP)/Constraint Programming (CP)/scheduling分类
管理科学引用本文复制引用
冯忠魁,陈淮莉..约束规划求解原型样车测试排程问题[J].现代制造工程,2018,(1):130-135,6.基金项目
国家社会科学基金资助项目(15BGL084) （15BGL084）
上海市委科研计划项目(14DZ2280200) （14DZ2280200）
上海市哲学社会规划课题资助项目(2014BGL018) （2014BGL018）
