SchedulingNproducts on a single facility with allowed backordering

From MaRDI portal
Publication:3682220





There are N products, each with a fixed demand per period, and a single machine which can produce one type of product at a time. The problem is to construct a production schedule that minimizes inventory and backordering costs over a finite planning horizon. A branch and bound algorithm is developed, incorporating a lower bound based on combining the optimal solution for single-product problems as well as various dominance rules. Computational experience is reported.











This page was built for publication: SchedulingNproducts on a single facility with allowed backordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682220)