Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach

Published Online:https://doi.org/10.1287/trsc.1030.0080

References

  • Anily S., Tzur M. Algorithms for the multi-item capacitated dynamic lot-sizing problem. (2004) . Working paper, Tel Aviv University, IsraelGoogle Scholar
  • Baker K. R., Dixon P., Magazine M. J., Silver E. A. An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. (1978) 24:1710–1720LinkGoogle 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 Optim. (1994) 4:285–300CrossrefGoogle Scholar
  • Constantino M. Lower bounds in lot-sizing models: A polyhedral study. Math. Oper. Res. (1998) 23(1):101–118LinkGoogle Scholar
  • Federgruen A., Meissner J., Tzur M. Partitioning heuristics for the multi-item capacitated lot-sizing problem. (2002) . Working paper, Columbia University, New YorkGoogle Scholar
  • Florian M., Klein M. Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20LinkGoogle Scholar
  • Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26:669–679LinkGoogle Scholar
  • Lee C. Y. A solution to the multiple set-up problem with dynamic demand. IIE Trans. (1989) 21(3):266–270CrossrefGoogle Scholar
  • Lippman S. Optimal inventory policy with multiple set-up costs. Management Sci. (1969) 16:118–138LinkGoogle Scholar
  • Pochet Y., Wolsey L. A. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18:767–785LinkGoogle Scholar
  • Pryor K., White C. C., Kapuscinski R. Multi-item inventory policies with capacitated delivery vehicles and deterministic demand. (2000) . Working paper, University of Michigan, Ann Arbor, MIGoogle Scholar
  • Van Hoesel S. S., Wagelmans A. An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42:142–150LinkGoogle Scholar
  • Yano C. A., Newman A. M. Scheduling trains and containers with due dates and dynamic arrivals. Transportation Sci. (2001) 35(2):181–191LinkGoogle 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.