[1]王书锋,刘海成..混合整数规划和约束规划在订单排产中的应用[J].郑州大学学报(工学版),2002,23(02):13-15.[doi:10.3969/j.issn.1671-6833.2002.02.004]
　Wang Shufeng,Liu Haicheng.Application of mixed integer programming and constraint planning in order scheduling[J].Journal of Zhengzhou University (Engineering Science),2002,23(02):13-15.[doi:10.3969/j.issn.1671-6833.2002.02.004]

点击复制

混合整数规划和约束规划在订单排产中的应用()

分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:

23

期数:

2002年02期

页码:

13-15

栏目:

出版日期:

1900-01-01

文章信息/Info

Title:

Application of mixed integer programming and constraint planning in order scheduling

作者:

王书锋; 刘海成.

中国科学院自动化研究所,北京,100080, 中国人民解放军信息工程大学信息工程学院,河南,郑州,450002

Author(s):

Wang Shufeng; Liu Haicheng

关键词:

订单排产;  调整时间;  最大延期;  混合整数规划;  约束规划

Keywords:

Order scheduling;  Adjustment time;  Maximum extension;  mixed integer programming;  Constraint planning

DOI:

10.3969/j.issn.1671-6833.2002.02.004

文献标志码:

A

摘要:

实际生产中,为提高生产效率,按加工相似性把工件分为不同的批组,而不同批组工件在单机上进行加工处理时需要序独立的机器调整时间.针对这一问题,以订单的最大延期为优化目标,提出0-1混合整数规划和约束规划两种求解模型,并通过使用OPL Studio编程来验算、比较两种模型在中小问题规模下的最优解,仿真结果表明,利用约束规划模型得到的最优解更有效,同时其结果可用于验证其他启发式算法的有效性.

Abstract:

In actual production, in order to improve production efficiency, workpieces are divided into different batch groups according to processing similarity, and different batch groups of workpieces need independent machine adjustment time when processing on a single machine. To solve this problem, taking the maximum delay of the order as the optimization goal, two solution models of 0-1 mixed integer programming and constraint programming are proposed, and the optimal solution of the two models at the scale of small and medium-sized problems is verified and compared by OPL Studio programming, and the simulation results show that the optimal solution obtained by using the constraint programming model is more effective, and the results can be used to verify the effectiveness of other heuristic algorithms.

常用功能