Please use this identifier to cite or link to this item:
|Title:||Multi-source facility location-allocation and inventory problem||Authors:||Yao, Z.
Inventory holding cost
|Issue Date:||1-Dec-2010||Citation:||Yao, Z., Lee, L.H., Jaruphongsa, W., Tan, V., Hui, C.F. (2010-12-01). Multi-source facility location-allocation and inventory problem. European Journal of Operational Research 207 (2) : 750-762. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2010.06.006||Abstract:||We consider a joint facility location-allocation and inventory problem that incorporates multiple sources of warehouses. The problem is motivated by a real situation faced by a multinational applied chemistry company. In this problem, multiple products are produced in several plants. Warehouse can be replenished by several plants together because of capabilities and capacities of plants. Each customer in this problem has stochastic demand and certain amount of safety stock must be maintained in warehouses so as to achieve certain customer service level. The problem is to determine number and locations of warehouses, allocation of customers demand and inventory levels of warehouses. The objective is to minimize the expected total cost with the satisfaction of desired demand weighted average customer lead time and desired cycle service level. The problem is formulated as a mixed integer nonlinear programming model. Utilizing approximation and transformation techniques, we develop an iterative heuristic method for the problem. An experiment study shows that the proposed procedure performs well in comparison with a lower bound. © 2010 Elsevier B.V. All rights reserved.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/87093||ISSN:||03772217||DOI:||10.1016/j.ejor.2010.06.006|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 27, 2021
WEB OF SCIENCETM
checked on Nov 12, 2021
checked on Nov 18, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.