제 3 자 물류창고의 입고계획 및 출고선적 계획을 위한 롯사이징

This paper considers a dynamic lot-sizing problem with inbound and outbound transportations. For general concave replenishment and dispatch costs, we propose a pseudo-polynomial algorithm with running time of O(θ 5 T 6 ) where θ is the total demand size and T is the length of the planning horizon.