Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31026
Title: Scheduling of multi-buyer joint replenishments
Authors: Chan, CK 
Li, LYO 
Ng, CT 
Cheung, BKS
Langevin, A
Keywords: Co-ordinated replenishments
Deliveries scheduling
Network flow problems
Issue Date: 2006
Publisher: Elsevier
Source: International journal of production economics, 2006, v. 102, no. 1, p. 132-142 How to cite?
Journal: International journal of production economics 
Abstract: It is a common practice for a multi-branch firm to have its branches ordering a group of items from a single supplier. Obviously, co-ordinating the replenishments among the branches would reduce the firm's ordering and inventory costs. In response to the co-ordinated replenishments of buyers (i.e., the branches), the supplier faces a problem of how to schedule the deliveries according to the buyers' basic order cycle time, and the number of basic order cycles that an item in a branch will be replenished. This supplier's scheduling problem has received little attention in the literature. This paper addresses the deliveries scheduling issue, once the optimal replenishment cycles are determined, by formulating four problems according to four different objectives in cost and resource minimisation. The problems are large integer programming problems which are not easy to solve. This paper proposes to convert the problems into network flow problems whose sizes can be reduced dramatically and hence solved readily.
URI: http://hdl.handle.net/10397/31026
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2005.02.005
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

21
Last Week
0
Last month
1
Citations as of Oct 23, 2017

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Oct 23, 2017

Page view(s)

73
Last Week
7
Last month
Checked on Oct 22, 2017

Google ScholarTM

Check

Altmetric



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