Inventory replenishment and inbound shipment scheduling under a minimum replenishment policy

Transportation Science

Volumn 43, Issue 2, 2009, Pages 244-264

  Hwang, Hark Chin ^a  

^a Chosun University   (South Korea)

Author keywords

Dynamic lot sizing; Inventory production; Logistics; Minimum replenishment quantity; Shipment consolidation

Indexed keywords

DISTRIBUTION FUNCTIONS; ECONOMICS; LOGISTICS; WAREHOUSES;

COMPUTATIONAL EXPERIMENT; DYNAMIC LOT-SIZING; DYNAMIC LOT-SIZING MODEL; INVENTORY REPLENISHMENT; INVENTORY/PRODUCTION; MINIMUM REPLENISHMENT QUANTITY; REPLENISHMENT POLICY; VENDOR MANAGED INVENTORY;

SHIPS;

EID: 70449646814     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0237     Document Type: Article

References (46)

1. Aggarwal, A., J. K. Park. 1993. Improved algorithms for economic lot-size problems. Oper. Res. 41 549-571.
2. Anily, S., M. Tzur. 2006. Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach. Transportation Sci. 39 233-248.
3. Arkin, E., D. Joneja, R. Roundy 1989. Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8 61-66.
4. Baker, K. R., P. Dixon, M. J. Magazine, E. A. Silver. 1978. An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. 24 1710-1720.
5. Bitran, G. B., H. H. Yanasse. 1982. Computational complexity of the capacitated lot size problem. Management Sci. 28 1174-1185.
6. Çetinkaya, S., C.-Y. Lee. 2000. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. 46 217-232.
7. Çetinkaya, S., C.-Y. Lee. 2002. Optimal outbound dispatch policies: Modeling inventory and cargo capacity. Naval Res. Logist. 49 531-556.
8. Chan, L. M. A., A. Muriel, Z. Shen, D. Simchi-Levi. 2002a. On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures. Oper. Res. 50 1058-1067.
9. Chan, L. M. A., A. Muriel, Z. Shen, D. Simchi-Levi, C. P. Teo. 2002b. Effective zero-inventory-ordering policies for the singlewarehouse multiretailer problem with piecewise linear cost structures. Management Sci. 11 1446-1460.
10. Chen, F. Y., D. Krass. 2001. Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands. Eur. J. Oper. Res. 131 309-323.
11. Chen, H.-D., D. W. Hearn, C.-Y. Lee. 1994. A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Global Optim. 4 285-300.
12. 2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. 34 420-426.
13. Diaby M., A. Martel. 1993. Dynamic lot sizing for multi-echelon distribution systems with purchasing and transportation price discounts. Oper. Res. 41 48-59.
14. Federgruen, A., M. Tzur. 1991. A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O (nlogn) or O (n) time. Management Sci. 37 909-925.
15. Florian, M., M. Klein. 1971. Deterministic replenishment planning with concave costs and capacity constraints. Management Sci. 18 12-20.
16. Florian, M., J. K. Lenstra, A. Rinnooy-Kan. 1980. Deterministic replenishment planning: Algorithms and complexity. Management Sci. 26 669-679.
17. Hahm, J., C. A. Yano. 1992. The economic lot and delivery scheduling problem: The single item case. Internat. J. Production Econom. 28 235-252.
18. Hahm, J., C. A. Yano. 1995a. The economic lot and delivery scheduling problem: The common cycle case. IIE Trans. 27 113-125.
19. Hahm, J., C. A. Yano. 1995b. The economic lot and delivery scheduling problem: Models for nested schedules. IIE Trans. 27 126-139.
20. Hwang, H.-C. 2007a. Dynamic lot-sizing model with production time windows. Naval Res. Logist. 54 692-701.
21. Hwang, H.-C. 2007b. Economic lot-sizing for integrated production and transportation. Technical report, Department of Industrial Engineering, Chosun University, Gwangju, South Korea.
22. Hwang, H.-C., W. Jaruphongsa. 2006. Dynamic lot-sizing model with demand time windows and speculative cost structure. Oper. Res. Lett. 34 251-256.
23. Jaruphongsa, W., S. Çetinkaya, C.-Y Lee. 2005. A dynamic lotsizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes. IIE Trans. 37 453-467.
24. Kaminsky P., D. Simchi-Levi. 2003. Production and distribution lot sizing in a two stage supply chain. IIE Trans. 35 1065-1075.
25. Lee, C.-Y. 1989. A solution to the multiple set-up problem with dynamic demand. IIE Trans. 21 266-270.
26. Lee, C.-Y. 2004. Inventory replenishment model: Lot sizing versus just-in-time delivery. Oper. Res. Lett. 32 581-590.
27. Lee, C.-Y., S. Çetinkaya, W. Jaruphongsa. 2003. A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51 735-747.
28. Lee, C.-Y., S. Çetinkaya, A. P. M. Wagelmans. 2001. A dynamic lot size model with demand time windows. Management Sci. 47 1384-1395.
29. Lippman, S. A. 1969. Optimal inventory policy with multiple set-up costs. Management Sci. 16 118-138.
30. Love, S. F. 1973. Bounded replenishment and inventory models with piecewise concave costs. Management Sci. 20 313-318.
31. Pochet, Y., L. A. Wolsey 1993. Lot-sizing with constant batches: Formulations and valid inequalities. Math. Oper. Res. 18 (4) 767-785.
32. Robinson, P., A. Narayanan, F. Sahin. 2009. Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms. Omega 37 3-15.
33. Sargut, F. Z., H. E. Romeijn. 2007. Capacitated production and subcontracting in a serial supply chain. IIE Trans. 39 1031-1043.
34. Swoveland, C. 1975. A deterministic multi-period replenishment planning model with piecewise concave replenishment and holding-backlogging costs. Management Sci. 21 1007-1013.
35. Tersine, R. J., S. Barman. 1991. Economic inventory/transport lot sizing with quantity and freight rate discounts. Decision Sci. 22 1171-1179.
36. Tompkins, M. 2005. QBP institutes minimum order policy to boost retail profitability. Bicycle Retailer Indust. News 14 11.
37. Toptal, A., S. Çetinkaya, C-Y. Lee. 2003. The buyer-vendor coordination problem: Modeling inbound and outbound cargo capacity and costs. IIE Trans. Logist. Scheduling 35 987-1002.
38. 3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. 42 142-150.
39. Van Hoesel, C. P. M., A. P. M. Wagelmans, B. Moerman. 1994. Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. Eur. J. Oper. Res. 75 312-331.
40. Van Hoesel, S., H. E. Romeijn, D. Romero Morales, A. P. M. Wagelmans. 2005. Integrated lot-sizing in serial supply chains with production capacities. Management Sci. 51 1706-1719.
41. Van Vyve, M. 2007. Algorithms for single-item lot-sizing problems with constant batch size. Math. Oper. Res. 32 594-613.
42. Wagelmans, A. P. M., S. Van Hoesel, A. Kolen. 1992. Economic lot sizing: An O (nlogn) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40 S145-S156.
43. Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot-size model. Management Sci. 5 89-96.
44. Wolsey, L. A. 2006. Lot-sizing with production and delivery time windows. Math. Programming Ser. A 107 471-489.
45. Yano, C. A., A. M. Newman. 2001. Scheduling trains and containers with due dates and dynamic arrivals. Transportation Sci. 35 181-191.
46. Zangwill, W. I. 1966. A deterministic multi-period replenishment scheduling model with backlogging. Management Sci. 13 105-119.