TY - GEN
T1 - The uncapacitated fixed-charge facility location problem with amulti-echelon inventory system
AU - Diabat, Ali
AU - Aouam, Tarik
AU - Al-Araidah, Omar
PY - 2009
Y1 - 2009
N2 - In this paper, we simultaneously study the uncapacitated fixed-chargelocation problem (UFLP) and a multi-echelon inventory problem. We initiallydevelop an approximate integer programming formulation for the inventoryproblem. The later problem is combined with the UFLP and the integrated model ispresented as a 0-1 integer program that we refer to as the joint facilitylocation inventory problem (JFLIP). The novel model deals with the storage andmovement of a single product from a single plant to a set of retailers though aset of candidate distribution centers (DCs). We assume single sourcing in whichthe entire demand of each retailer is served by a single distribution center.The objective of the model is to determine (1) the number of distributioncenters to establish, (2) their locations, (3) the sets of retailers that areassigned to each distribution center, and (4) the size and timing of orders foreach facility so as to minimize the sum of inventory, shipping, ordering, andlocation costs while satisfying a predetermined Type 1 service level ofend-customer demand.
AB - In this paper, we simultaneously study the uncapacitated fixed-chargelocation problem (UFLP) and a multi-echelon inventory problem. We initiallydevelop an approximate integer programming formulation for the inventoryproblem. The later problem is combined with the UFLP and the integrated model ispresented as a 0-1 integer program that we refer to as the joint facilitylocation inventory problem (JFLIP). The novel model deals with the storage andmovement of a single product from a single plant to a set of retailers though aset of candidate distribution centers (DCs). We assume single sourcing in whichthe entire demand of each retailer is served by a single distribution center.The objective of the model is to determine (1) the number of distributioncenters to establish, (2) their locations, (3) the sets of retailers that areassigned to each distribution center, and (4) the size and timing of orders foreach facility so as to minimize the sum of inventory, shipping, ordering, andlocation costs while satisfying a predetermined Type 1 service level ofend-customer demand.
KW - 0-1integer programming
KW - Distribution networks
KW - Inventory management
KW - Location problems
KW - Location-inventory problems
KW - Supply chain networks
UR - http://www.scopus.com/inward/record.url?scp=77956098213&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956098213&partnerID=8YFLogxK
U2 - 10.1109/iccie.2009.5223883
DO - 10.1109/iccie.2009.5223883
M3 - Conference contribution
AN - SCOPUS:77956098213
SN - 9781424441365
T3 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009
SP - 803
EP - 807
BT - 2009 International Conference on Computers and Industrial Engineering, CIE 2009
PB - IEEE Computer Society
T2 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009
Y2 - 6 July 2009 through 9 July 2009
ER -