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.
Recommendations
- Scheduling N Products On A Single Facility With Back-Ordering And Eixed Terminal Inventory
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- Optimal production and setup scheduling: A one-machine, two-product system
- scientific article; zbMATH DE number 90002
- Economic scheduling of products with N components on a single machine
Cites work
Cited in
(1)
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)