Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach
Published Online:1 May 2005https://doi.org/10.1287/trsc.1030.0080
References
- Algorithms for the multi-item capacitated dynamic lot-sizing problem. (2004) . Working paper, Tel Aviv University, IsraelGoogle Scholar
- An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. (1978) 24:1710–1720Link, Google Scholar
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Global Optim. (1994) 4:285–300Crossref, Google Scholar
- Lower bounds in lot-sizing models: A polyhedral study. Math. Oper. Res. (1998) 23(1):101–118Link, Google Scholar
- Partitioning heuristics for the multi-item capacitated lot-sizing problem. (2002) . Working paper, Columbia University, New YorkGoogle Scholar
- Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20Link, Google Scholar
- Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26:669–679Link, Google Scholar
- A solution to the multiple set-up problem with dynamic demand. IIE Trans. (1989) 21(3):266–270Crossref, Google Scholar
- Optimal inventory policy with multiple set-up costs. Management Sci. (1969) 16:118–138Link, Google Scholar
- Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18:767–785Link, Google Scholar
- Multi-item inventory policies with capacitated delivery vehicles and deterministic demand. (2000) . Working paper, University of Michigan, Ann Arbor, MIGoogle Scholar
- An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42:142–150Link, Google Scholar
- Scheduling trains and containers with due dates and dynamic arrivals. Transportation Sci. (2001) 35(2):181–191Link, Google Scholar

