refining process;
production unit;
unit scheduling model;
heuristic-based MP algorithm;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
The production unit scheduling problem is very difficult since complex structures among production units. To get the minimum of total process cost of units, satisfy the main constraints and consider running and storage of units, take the blending components 1 for production targets of units, the production unit scheduling model is developed. A heuristic-based mathematical programming algorithm is introduced to obtain the optimum solution of such model to arrange production reasonably. The results of an example illustrate that it is effective.
机构:
Tampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, FinlandTampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, Finland
Xiong, G
Nyberg, TR
论文数: 0引用数: 0
h-index: 0
机构:
Tampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, FinlandTampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, Finland
机构:
Tampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, FinlandTampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, Finland
Xiong, G
Nyberg, TR
论文数: 0引用数: 0
h-index: 0
机构:
Tampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, FinlandTampere Univ Technol, Paper Machine Automat Automat & Control Inst, FIN-33101 Tampere, Finland