In this paper, we consider a production system in which the items are produced by batch. For a production planning of the system, we formulate a lot-sizing problem in which each production should be a multiple of a given unit batch and backlogging is allowed. We propose an optimal dynamic programming algorithm for the plan whose complexity is O(T2) where T is the maximum number of periods in a plan.