کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
427533 | 686517 | 2013 | 5 صفحه PDF | دانلود رایگان |

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.
► Present CFF algorithm to solve the online inventory replenishment scheduling problem of temporary orders.
► Improve the competitive ratio of online inventory replenishment scheduling problem to be 3.0913 from 5 when offline algorithm is restricted.
► For general case, we present a fact of any offline algorithmʼs maximal load, and prove CFF to be 6.1826-competitive.
Journal: Information Processing Letters - Volume 113, Issues 5–6, 15 March 2013, Pages 188–192