 Lot sizing problem with multi-mode replenishment and batch deliveryAyse Akbalik and Christophe Rapine Omega, 2018, vol. 81, issue C, 123-133 Abstract: We study the single-item uncapacitated lot sizing problem with multi-mode replenishment and batch deliveries (ULS-MMB). Specifically, we consider that each replenishment mode has a Full Truck Load (FTL) cost structure and incurs a fixed ordering cost plus a fixed cost per batch. This problem arises in practice when a retailer places the order with different suppliers in each period. We show that this problem is NP-hard even for a single period and under very restricted cost parameters. We then show that ULS-MMB can be transformed into a lot sizing problem with only one replenishment mode per period, that is, ULS-MMB is a special case of lot-sizing with time-varying batch sizes. This simple observation allows us to improve some results already known in the literature of multi-mode replenishment. We propose a very efficient 2-approximation algorithm and establish that the problem admits an FPTAS. Finally, we show that the problem restricted to two modes with divisible batch sizes can be solved in polynomial time. Keywords: Lot sizing; Multi-mode; Batch delivery; Approximation algorithm; Polynomial time algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:81:y:2018:i:c:p:123-133 Ordering information: This journal article can be ordered from DOI: 10.1016/j.omega.2017.10.005 Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.