| 一类产品工序和设备最佳组合问题的规划解法 |
| |
| 引用本文： | 高玉波 刘丽萍. 一类产品工序和设备最佳组合问题的规划解法[J]. 河北理工学院学报, 2000, 22(3): 102-106 |
| |
| 作者姓名： | 高玉波 刘丽萍 |
| |
| 作者单位： | [1]河北理工学院经济管理系 [2]河北理工学院自动化系 |
| |
| 摘 要： | 产品工序和设备最佳组合问题为生产技术中的重要决策，内容，但由于较复杂，很多技术经济教科书上未涉及 此类决策。而以内容全面、方法众多的特点的教科书「１」却给出一在于费用损失指数的经验算法。本文给出这一类问题的基于规划技术的解法，特点为概念清晰，易于理解，计算简便，结果最优。
|
| 关 键 词： | 产品工序 决策 整数规划 生产管理 |
An IP approach to a type of optimal combinatory problem involved product sequence and facilities |
| |
| GAO Yu bo ,LIU Li ping. An IP approach to a type of optimal combinatory problem involved product sequence and facilities[J]. Journal of Hebei Institute of Technology, 2000, 22(3): 102-106 |
| |
| Authors: | GAO Yu bo LIU Li ping |
| |
| Affiliation: | GAO Yu bo 1,LIU Li ping 2 |
| |
| Abstract: | The optimal combinatory problem involved product sequence and facilities is one of important decisions in production technology.Because of its complexity,most technological textbooks do not cover this topic.However,the one that included various aspects and many procedures proposed an approximation procedure,based on the expense-loss-index.This paper suggests an IP-based technique.This technique has the characteristics of clear concept,easy understanding,easy computation,and optimal result. |
| |
| Keywords: | product sequence decision making integer programming(IP) |
| 本文献已被 CNKI 维普 等数据库收录！ |
