|
|||||
|
|
| 有限预知信息的集装箱搬卸占线问题 | |
| 引用本文： | 郑斐峰,徐寅峰. 有限预知信息的集装箱搬卸占线问题[J]. 系统管理学报, 2004, 13(5): 390-394 |
| 作者姓名： | 郑斐峰 徐寅峰 |
| 作者单位： | 1. 西安交通大学管理学院,西安,710049 2. 西安交通大学机械制造系统工程国家重点实验室,西安,710049 |
| 基金项目： | 国家自然科学基金会优秀创新群体基金支持(70121001) |
| 摘 要： | 提出了有限预知信息的集装箱搬卸占线问题,即每一个服务请求到达时预先知道后续一部分请求信息的占线问题。建立并分析相应的数学模型,针对模型中预知信息的特征提出了贪婪移位策略。运用最坏情形分析方法研究了贪婪移位策略的竞争性能,证明其具有竞争比:(b w-2)/w。 |
| 关 键 词： | 占线问题 贪婪移位策略 竞争比 |
| 文章编号： | 1005-2542(2004)05-0390-05 |
| 修稿时间： | 2003-08-20 |
Study on the Online Container Shipment Problem with Limited Prevision Information |
|
| ZHENG Fei-fenga,XU Yin-fengbring,Xi'an Jiaotong Univ.,Xi'an ,China). Study on the Online Container Shipment Problem with Limited Prevision Information[J]. Systems Engineering Theory·Methodology·Applications, 2004, 13(5): 390-394 | |
| Authors: | ZHENG Fei-fenga XU Yin-fengbring Xi'an Jiaotong Univ. Xi'an China) |
| Affiliation: | ZHENG Fei-feng~a,XU Yin-feng~bring,Xi'an Jiaotong Univ.,Xi'an 710049,China) |
| Abstract: | The paper puts forward the online container shipment problem with limited prevision information, in which an online algorithm gets to know several requests in future when each request arrives. The relevant mathematic model is set up and analyzed. The Greedy hift strategy is brought forward accoding to the trait of the model. With the analysis method of worst case performance, it is proved that the Greedy shift strategy has a competitive ratio of (b w-2)w. |
| Keywords: | online problem Greedy shift strategy competitive ratio |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |