Skip to main navigation Skip to search Skip to main content

Inventory replenishment scheduling to minimize the number of vehicles

  • Xi'an Jiaotong University
  • CAS - Institute of Applied Mathematics
  • Yuan Ze University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We deal with a vendor managed inventory system in which one supplier supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate, and each retailer has a maximal replenishment interval. A fleet of vehicles are required by the supplier to replenish the retailers. It is assumed that one vehicle can replenish only one retailer per period and shortages are not allowed. The goal is to determine the replenishment scheduling during infinite horizon that minimize the number of vehicles. By analyzing the existing condition of the feasible scheduling of multiple vehicles, we develop an approximation algorithm, and prove the approximation ratio of this algorithm to be 2.

Original languageEnglish
Title of host publicationProceedings - 2011 International Joint Conference on Service Sciences, IJCSS 2011
Pages74-78
Number of pages5
DOIs
StatePublished - 2011
Event2011 International Joint Conference on Service Sciences, IJCSS 2011 - Taipei, Taiwan, Province of China
Duration: 25 May 201127 May 2011

Publication series

NameProceedings - 2011 International Joint Conference on Service Sciences, IJCSS 2011

Conference

Conference2011 International Joint Conference on Service Sciences, IJCSS 2011
Country/TerritoryTaiwan, Province of China
CityTaipei
Period25/05/1127/05/11

Keywords

  • Approximation algorithm
  • Approximation ratio
  • Inventory
  • Replenishment scheduling

Fingerprint

Dive into the research topics of 'Inventory replenishment scheduling to minimize the number of vehicles'. Together they form a unique fingerprint.

Cite this