Journal Home Online First Current Issue Archive For Authors Journal Information 中文版

Strategic Study of CAE >> 2006, Volume 8, Issue 9

Variable-separating-based Space Decomposition Algorithm of Production Scheduling

School of Control Science and Engineering, Shandong University, Jinan 250061, China

Funding project:“八六三”高技术研究发展计划资助项目(2001AA413420);山东省自然科学基金资助项目(Y2003G01) Received: 2005-04-27 Revised: 2005-06-06 Available online: 2006-09-20

Next Previous

Abstract

Most static production scheduling problems are formulated in MILP ( mixed integer linear programming) or MINLP(mixed integer non-linear programming) . It is difficult to find solutions of scheduling because of its large scale and combinatorial characters. According to the features of MIP (mixed integer programming), integral variables and continuous variables are separated and the searching space is decomposed naturally into many continuous subspaces of less scale. Taking a typical batch production scheduling as a case, the analysis shows that variable-separating strategy decreases the scale of continuous searching problem greatly and makes it easy to solve, which can improve the speed and efficiency of optimization.

Figures

图1 混合整数规划搜索空间示意

图2 整数变量松弛后空间示意

图3 状态-任务网络

图4 设备-任务网络

Related Research