![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
In this paper we present a branch and bound algorithm for solving a single-item, multi-source dynamic lot sizing problem with time-varying capacity constraints. We consider a single-item production (and/or procurement) environment where there are multiple sources of supply with different cost structures. Computational results are presented.