A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse

References

  • Aggarwal A., Park J. K. Improved algorithms for economic lot-size problems. Oper. Res. (1993) 41:549–571LinkGoogle Scholar
  • Alp O., Erkip N., Güllü R. Optimal lot sizing/vehicle dispatching policies under stochastic lead times and stepwise fixed costs. Oper. Res. (2003) 51:160–166LinkGoogle Scholar
  • Arntzen B. C., Brown G. G., Harrison T. P., Trafton L. L. Global supply chain management at digital equipment corporation. Interfaces (1995) 25(1):69–93LinkGoogle Scholar
  • Bitran G. R., Magnanti T. L., Yanasse H. H. Approximation methods for the uncapacitated dynamic lot size problem. Management Sci. (1984) 30:1121–1140LinkGoogle Scholar
  • Bramel J., Simchi-Levi D.The Logic of Logistics (1997) (Springer, New York) CrossrefGoogle Scholar
  • Burns L. D., Hall R. W., Blumenfeld D. E., Daganzo C. F. Distribution strategies that minimize transportation and inventory. Oper. Res. (1985) 33:469–490LinkGoogle Scholar
  • Campbell J. F. Designing logistics systems by analyzing transportation, inventory and terminal cost tradeoffs. J. Bus. Logist. (1990) 11:159–179Google Scholar
  • Çetinkaya S., Bookbinder J. H. Stochastic models for the dispatch of consolidated shipments. Transportation Res. B. (2002) (Forthcoming)Google Scholar
  • Çetinkaya S., Lee C.-Y. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. (2000) 46:217–232LinkGoogle Scholar
  • Çetinkaya S., Lee C.-Y. Outbound transportation: Modeling inventory and cargo capacity. Naval Res. Logist. (2002) 49(6):531–556CrossrefGoogle Scholar
  • Çetinkaya S., Tekin E., Lee C.-Y. A stochastic model for joint inventory replenishment and outbound shipment release decisions. MSOM Conference Proc. (2000) JuneAnn Arbor, MI:26–27Google Scholar
  • Chan L. M. A., Muriel A., Simchi-Levi D. Production/distribution planning problems with piece-wise linear and concave cost structures. (1999) (Northwestern University, Evanston, IL) Google Scholar
  • Chen H.-D., Hearn D. W., Lee C.-Y. A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Global Optimiz. (1994) 4:285–300CrossrefGoogle Scholar
  • Chung C. S., Lin C. H. M. An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. (1988) 34:420–426LinkGoogle Scholar
  • Croxton K. L., Gendron B., Magnanti T. L. Models and methods for merge-in-transit operations. (2000) (Massachusetts Institute of Technology, Cambridge, MA) Google Scholar
  • Daganzo C. F. Shipment composition enhancement at a consolidation center. Transportation Res. (1988) 22B:103–124CrossrefGoogle Scholar
  • Federgruen A., Tzur M. A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(nlog n) or O(n) time. Management Sci. (1991) 37:909–925LinkGoogle Scholar
  • Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning algorithm and complexity. Management Sci. (1980) 26:669–679LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computer and Intractability—A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, San Francisco, CA) Google Scholar
  • Graves S., Schwarz L. Multi-stage lot-sizing: An iterative procedure. Multi-Level Production/Inventory Control Systems: Theory and Practice (1981) (North-Holland Publishing Company, New York) Google Scholar
  • Gupta O. K. A lot size model with discrete transportation costs. Comput. Industrial Engrg. (1992) 22:397–402CrossrefGoogle Scholar
  • Gupta Y. P., Bagchi P. K. Inbound freight consolidation under just-in-time procurement: Application of clearing models. J. Bus. Logist. (1987) 8:74–94Google Scholar
  • Hadley G., Whitin T. M.Analysis of Inventory System (1963) (Prentice-Hall Inc., Englewood Cliffs, NJ) Google Scholar
  • Hahm J., Yano C. A. The economic lot and delivery scheduling problem: The single item case. Internat. J. Production Econom. (1992) 28:235–252CrossrefGoogle Scholar
  • Hahm J., Yano C. A. The economic lot and delivery scheduling problem: The common cycle case. IIE Trans. (1995a) 27:113–125CrossrefGoogle Scholar
  • Hahm J., Yano C. A. The economic lot and delivery scheduling problem: Models for nested schedules. IIE Trans. (1995b) 27:126–139CrossrefGoogle Scholar
  • Higginson J. K., Bookbinder J. H. Policy recommendations for a shipment consolidation program. J. Bus. Logist. (1994) 15:87–112Google Scholar
  • Jackson G. C. Evaluating order consolidation strategies using simulation. J. Bus. Logist. (1981) 2:110–138Google Scholar
  • Lawler E.Combinatorial Optimization: Networks and Matroids (1976) (Holt Rinehart and Winston, New York) Google Scholar
  • Lee C.-Y. The economic order quantity for freight discount costs. IIE Trans. (1986) 18:318–320CrossrefGoogle Scholar
  • Lee C.-Y. A solution to the multiple set-up problem with dynamic demand. IIE Trans. (1989) 21:266–270CrossrefGoogle Scholar
  • Lee C.-Y., Denardo E. V. Rolling planning horizon: Error bounds for the dynamic lot size model. Math. Oper. Res. (1986) 11:423–432LinkGoogle Scholar
  • Lee C.-Y., Çetinkaya S., Jaruphongsa W. A dynamic model for inventory lot-sizing and outbound shipment scheduling at a third party warehouse: The generalized problem. (2002) . The Hong Kong University of Science and Technology, Hong Kong, ChinaGoogle Scholar
  • Lee C.-Y., Çetinkaya S., Wagelmans A. Dynamic lot size model with demand time windows. Management Sci. (2001) 47:1384–1395LinkGoogle Scholar
  • Lee H., Billington C. Managing supply-chain inventory. Sloan Management Rev. (1992) 65–73Google Scholar
  • Lee H., So K. C., Tang C. S. The value of information sharing in a two-level supply chain. Management Sci. (2000) 46:626–643LinkGoogle Scholar
  • Masters J. M. The effects of freight consolidation on customer service. J. Bus. Logist. (1980) 2:55–74Google Scholar
  • Nahmias S.Production and Operations Analysis (1997) 3rd ed.(Richard D. Irwin Inc., Homewood, IL) Google Scholar
  • Newbourne M. J., Barrett C. Freight consolidation and the shipper, parts 1 to 5. Transportation and Distribution Management (1972) 12:2–6Google Scholar
  • Pollock T. A management guide to LTL consolidation. Traffic World (1978) April 3):29–35Google Scholar
  • Pooley J., Stenger A. J. Modeling and evaluating shipment consolidation in a logistics system. J. Bus. Logist. (1992) 13:153–174Google Scholar
  • Popken D. A. An algorithm for the multi-attribute, multi-commodity flow problem with freight consolidation and inventory costs. Oper. Res. (1994) 42:274–286LinkGoogle Scholar
  • Powell W. B. Analysis of vehicle holding and cancellation strategies in bulk arrival, bulk service queues. Transportation Sci. (1985) 19:352–377LinkGoogle Scholar
  • Silver E. A., Pyke D. F., Peterson R.Inventory Management and Production Planning and Scheduling (1998) 3rd ed.(John Wiley and Sons, New York) Google Scholar
  • Tersine R. J., Barman S. Economic inventory/transport lot sizing with quantity and freight rate discounts. Decision Sci. (1991) 22:1171–1179CrossrefGoogle Scholar
  • Van Eijs M. J. G. Multi-item inventory systems with joint ordering and transportation decisions. Internat. J. Production Econom. (1994) 35:285–292CrossrefGoogle Scholar
  • Wagelmans A., Van Hoesel S., Kolen A. Economic lotsizing: An O(nlog n)-algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. (1992) 40:S145–S156LinkGoogle Scholar
  • Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle Scholar
  • Yano C. A., Newman A. M. Scheduling trains and containers with due dates and dynamic arrivals. Transportation Sci. (2001) 35:181–191LinkGoogle Scholar
  • Zangwill W. I. A backlogging model and a multiechelon model of a dynamic economic lot size production system—A network approach. Management Sci. (1969) 15:506–527LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.