Variable-separating-based Space Decomposition Algorithm of Production Scheduling

Gao Yongchao、 Li Qiqiang、 Ding Ran、 Guo Qingqiang

Strategic Study of CAE ›› 2006, Vol. 8 ›› Issue (9) : 61-64.

PDF(2221 KB)
PDF(2221 KB)
Strategic Study of CAE ›› 2006, Vol. 8 ›› Issue (9) : 61-64.
Academic Papers

Variable-separating-based Space Decomposition Algorithm of Production Scheduling

  • Gao Yongchao、 Li Qiqiang、 Ding Ran、 Guo Qingqiang

Author information +
History +

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.

Keywords

production scheduling / space decomposition / sub-definite method

Cite this article

Download citation ▾
Gao Yongchao,Li Qiqiang,Ding Ran,Guo Qingqiang. Variable-separating-based Space Decomposition Algorithm of Production Scheduling. Strategic Study of CAE, 2006, 8(9): 61‒64
AI Summary AI Mindmap
PDF(2221 KB)

Accesses

Citations

Detail

Sections
Recommended

/