| 经济批量排产问题的改进算法:设定最高允许高度 |
| |
| 引用本文： | 罗荣武,谢如鹤.经济批量排产问题的改进算法:设定最高允许高度[J].数学的实践与认识,2011,41(22). |
| |
| 作者姓名： | 罗荣武 谢如鹤 |
| |
| 作者单位： | 1. 中南大学 交通运输工程学院,湖南 长沙,410075
2. 广州大学经济管理学院,广东 广州,510006 |
| |
| 摘 要： | 经济批量排产问题是指在生产准备费用与库存费用最低的情况下,协调地、周期性地生产多种产品的问题.由于此问题是NP-hard的,人们一种致力于寻找快速地求解高质量的近似最优解的方法.在将生产次数舍入为2的幂次后,误差小,获得可行解的速度快.研究的经济批量排产问题考虑了产品货架存放期因素.指出了Dobson算法的不足,并提出了基于2的幂次条件的改进算法.改进算法设定了最高允许高度,首先给部分箱进行装箱.由于能获得高质量的生产排产,因此,算法能获得2的幂次条件下的高质量解.给出一个算例,计算结果显示,算法结果更优.
|
| 关 键 词： | 管理工程 改进算法 批量变动 经济批量排产问题 货架存放期 生产顺序 |
An Improved Algorithm of Economic Lot Scheduling Problem:Setting the Maximum Allowable Height |
| |
| LUO Rong-wu,XIE Ru-he.An Improved Algorithm of Economic Lot Scheduling Problem:Setting the Maximum Allowable Height[J].Mathematics in Practice and Theory,2011,41(22). |
| |
| Authors: | LUO Rong-wu XIE Ru-he |
| |
| Institution: | LUO Rong-wu~1,XIE Ru-he~2 (1.Traffic & Transportation Engineering School,Central South University,Changsha 410075,China) (2.Business School of Guangzhou University,Guangzhou 510006,China) |
| |
| Abstract: | The economic lot scheduling problem(ELSP) is such a problem that deals with accommodating several products to be produced on a single machine in a cyclical pattern with the minimal total of setup cost and inventory cost.Since ELSP is NP-hard,researchers have been devoted to search such algorithms that can quickly offer high quality near optimal solutions.When production frequency is round off to power of 2(PoT),the error is small and it is quick to get a feasible solution.The ELSP by considering shelf life ... |
| |
| Keywords: | management engineering improved algorithm time-varying lot size economic lot scheduling problem(ELSP) shelf life production sequence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
