Title: A dynamic programming approach for solving the economic lot scheduling problem with batch shipments

Authors: Fabian G. Beck; Christoph H. Glock

Addresses: Institute of Production and Supply Chain Management, Technische Universität Darmstadt, Hochschulstr. 1, 64289 Darmstadt, Germany ' Institute of Production and Supply Chain Management, Technische Universität Darmstadt, Hochschulstr. 1, 64289 Darmstadt, Germany

Abstract: This note investigates the economic lot scheduling problem (ELSP) with batch shipments. It first modifies an existing formulation of the ELSP to account both for the cases of equal-sized and geometrically increasing batch shipments, and it then adapts the popular dynamic programming approach of Bomberger to the new planning situation. In addition, the paper specifies some steps of Bomberger's solution procedure that had been formulated imprecisely in the original publication of the author. The paper compares the solution approach proposed in this note to the popular methods of Hanssmann as well as Haessler and Hogue in a numerical experiment and highlights the influence of the batch shipments on the relative performance of the solution procedures. Our results show that the proposed modification reduces the performance disadvantage of Bomberger's basic period approach, which may be interesting especially for practitioners that are interested in an easy-to-apply procedure for solving the ELSP in practice. Our changes to Bomberger's solution procedure support finding the lowest total cost solution that had not always been obtained in earlier publications.

Keywords: economic lot scheduling problem; ELSP; Bomberger's method; basic period approach; BPA; batch shipments; dynamic programming.

DOI: 10.1504/IJOR.2021.114305

International Journal of Operational Research, 2021 Vol.40 No.3, pp.366 - 379

Received: 31 Jan 2018
Accepted: 24 May 2018
Published online: 16 Apr 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article