Computational study of the multiechelon production planning problem
DOI10.1002/(SICI)1520-6750(199702)44:1%3C1::AID-NAV1%3E3.0.CO;2-EzbMATH Open0882.90058OpenAlexW2019091296MaRDI QIDQ4346863FDOQ4346863
Authors:
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1%3C1::aid-nav1%3E3.0.co;2-e
Recommendations
- Computational complexity of uncapacitated multi-echelon production planning problems
- Multiindex optimal production planning problems
- A polyhedral study of multiechelon lot sizing with intermediate demands
- scientific article; zbMATH DE number 44978
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
branch and boundbranch and cutLagrangean relaxationmulticommodity flow problemsmultiechelon production planning
Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Production models (90B30)
Cited In (9)
- Finite horizon planning with fixed-interval deliveries and no shortage
- A multivariate complexity analysis of the material consumption scheduling problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Multiindex optimal production planning problems
- MIP modelling of changeovers in production planning and scheduling problems
- Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers
- On the polyhedral structure of a multi-item production planning model with setup times
- Title not available (Why is that?)
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods
This page was built for publication: Computational study of the multiechelon production planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346863)
