Optimal and heuristic algorithms for the multi-location dynamic transshipment problem with fixed transshipment costs

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 5, 2003, Pages 419-432

  Herer, Yale T ^a   Tzur, Michal ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; DISTRIBUTION OF GOODS; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; STATISTICAL METHODS; STRATEGIC PLANNING;

FIXED TRANSSHIPMENT COSTS; MULTI-LOCATION DYNAMIC TRANSSHIPMENT PROBLEM; REPLENISHMENT;

INVENTORY CONTROL;

EID: 0038031945     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304389     Document Type: Article

References (17)

1. Archibald, T.W., Sassen, S.A.E. and Thomas, L.C. (1997) An optimal policy for a two depot inventory problem with stock transfer. Management Science, 43, 173-183.
2. Arkin, E., Joneja, D. and Roundy, R. (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8, 61-66.
3. Bensoussann, A., Proth, J.M. and Queyranne, M. (1991) A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs. Naval Research Logistics, 38, 729-742.
4. Denardo, E. V. (1982). Dynamic Programming Models and Applications, Prentice Hall, Englewood Cliffs, NJ.
5. Federgruen, A. and Tzur, M. (1994a) The joint replenishment problem with time-varying parameters: efficient, asymptotic and ε-optimal solutions. Operations Research, 42(6), 1067-1086.
6. Federgruen, A. and Tzur, M. (1994b) Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: nervousness revisited. Operations Research, 42(3), 456-468.
7. Federgruen, A. and Tzur, M. (1999) Time-partitioning heuristics: application to one warehouse, multiitem, multiretailer lot-sizing problems. Naval Research Logistics, 46, 463-486.
8. Gondran, M. and Minoux, M. (1989) Graphs and Algorithms, Wiley, New York, NY.
9. Harris, F. (1915) Operations and Cost, A. W. Shaw Co., Chicago, IL, pp. 48-53.
10. Held, M. and Karp, R.M. (1962) A dynamic programming approach to sequencing problems. SIAM Journal on Applied Mathematics, 10, 196-210.
11. Herer, Y.T. and Rashit, A. (1999) Lateral stock transshipments in a two-location inventory system with fixed and joint replenishment costs. Naval Research Logistics, 46, 525-547.
12. Herer, Y.T. and Tzur, M. (2001) The dynamic transshipment problem. Naval Research Logistics, 48, 386-408.
13. Janeja, D. (1990) The joint replenishment problem: new heuristics and worst case performance bounds. Operations Research, 38, 711-723.
14. Robinson, L.W. (1990) Optimal and approximate policies in multiperiod, multilocation inventory models with transshipments. Operations Research, 38, 278-295.
15. Rudi, N., Kapur, S. and Pyke, D.F. (1998) A transshipment game. Working paper, The Wharton School, Philadelphia, PA.
16. Tagaras, G. (1999) Pooling in multi-location periodic inventory distribution systems. OMEGA-International Journal of Management Science, 27, 39-59.
17. Wagner, H.M. and Whitin, T.M. (1958) Dynamic version of the economic lot size model. Management Science, 5, 89-96.