Online inventory replenishment scheduling of temporary orders

Authors:
Haiyan Yu;Yinfeng Xu;Tengyu Wu
Affiliations:
School of Management, Xian Jiaotong University, Xian 710049, China and The State Key Laboratory for Manufacturing Systems Engineering, Xian 710049, China;School of Management, Xian Jiaotong University, Xian 710049, China and The State Key Laboratory for Manufacturing Systems Engineering, Xian 710049, China;School of Management, Xian Jiaotong University, Xian 710049, China and The State Key Laboratory for Manufacturing Systems Engineering, Xian 710049, China
Venue:
Information Processing Letters
Year:
2013

Citing 5
Cited 0

On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems

Management Science
Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem

Transportation Science
Windows Scheduling Problems for Broadcast Systems

SIAM Journal on Computing
Dynamic bin packing of unit fractions items

Theoretical Computer Science
On-line windows scheduling of temporary items

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.