| 有限经济批量排产和运送问题的禁忌搜索算法 |
| |
| 引用本文： | 俞晶菁.有限经济批量排产和运送问题的禁忌搜索算法[J].交通科技与经济,2012(1):96-99. |
| |
| 作者姓名： | 俞晶菁 |
| |
| 作者单位： | 兰州交通大学交通运输学院,甘肃兰州,730070 |
| |
| 摘 要： | 探讨使用禁忌搜索算法解决一个简单的供应链经济批量排产和运送问题。其中供应商通过一个灵活的生产流水线生产多个组件并进行装配。假定所有参数,如组件的需求率等具有确定性,找到本研究的目标就是求解最优的生产批量和排序,使供应链的平均投入和运输费用最小。
|
| 关 键 词： | 禁忌搜索 供应链 经济批量排序 有限范围 |
A Taboo Search Algorithm for the Finite Horizon Economic Lot and Delivery Scheduling in Supply Chains |
| |
| YU Jing-jing.A Taboo Search Algorithm for the Finite Horizon Economic Lot and Delivery Scheduling in Supply Chains[J].Technology & Economy in Areas of Communications,2012(1):96-99. |
| |
| Authors: | YU Jing-jing |
| |
| Institution: | YU Jing-jing(School of Traffic ＆ Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| |
| Abstract: | In the paper,we investigate the taboo search algorithm for the finite horizon economic lot and delivery scheduling in supply chains where a single supplier produces multiple components on a flexible flow line.Hypothesis all parameters,like module＇s demand rate and so on has determinism,the main objective is to find a lot and delivery schedule that would minimize the average of holding and the cost of delivery scheduling. |
| |
| Keywords: | taboo search supply chain lot and delivery scheduling finite horizon |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
