Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22916
Title: Logistics scheduling to minimize inventory and transport costs
Authors: Wang, X
Cheng, TCE 
Keywords: Algorithms
Inventory and transportation
Logistics scheduling
Issue Date: 2009
Publisher: Elsevier
Source: International journal of production economics, 2009, v. 121, no. 1, p. 266-273 How to cite?
Journal: International journal of production economics 
Abstract: We study a logistics scheduling problem where a manufacturer receives raw materials from a supplier, manufactures products in a factory, and delivers the finished products to a customer. The supplier, factory and customer are located at three different sites. The objective is to minimize the sum of work-in-process inventory cost and transport cost, which includes both supply and delivery costs. For the special case of the problem where all the jobs have identical processing times, we show that the inventory cost function can be unified into a common expression for various batching schemes. Based on this characteristic and other optimal properties, we develop an O(n) algorithm to solve this case. For the general problem, we examine several special cases, identify their optimal properties, and develop polynomial-time algorithms to solve them optimally.
URI: http://hdl.handle.net/10397/22916
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2009.05.007
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

18
Last Week
0
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
Citations as of Aug 13, 2017

Page view(s)

44
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.