摘要
This paper studies the online inventory replenishment scheduling problem, in which orders from retailers arrive and depart at arbitrary times at one supplier and each order needs to be replenished at least once every constant periods. The supplier needs to assign each order to some vehicle such that the maximum number of vehicles ever used over all time is minimized, while each vehicle can replenish only one order per period. We present a Combined First Fit algorithm and improve the upper bound of the competitive ratio for this problem to be 3.0913 from 5. When offline algorithm is unrestricted, the Combined First Fit algorithm is proved to be 6.1826-competitive.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 188-192 |
| 页数 | 5 |
| 期刊 | Information Processing Letters |
| 卷 | 113 |
| 期 | 5-6 |
| DOI | |
| 出版状态 | 已出版 - 2013 |
学术指纹
探究 'Online inventory replenishment scheduling of temporary orders' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver