An optimal algorithm for the multi-item capacitated production planning problem
DOI10.1016/0377-2217(91)90079-BzbMATH Open0732.90033OpenAlexW2024633912MaRDI QIDQ809873FDOQ809873
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90079-b
lot-sizingexact polynomial time algorithmmulti-item capacitated production planningtransportation algorithm
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)
Cites Work
- A new polynomial-time algorithm for linear programming
- Production Scheduling by the Transportation Method of Linear Programming
- Sequential production planning over time at minimum cost
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- A noniterative multiproduct multiperiod production planning method
Cited In (10)
- Rough cut capacity estimation for order production based upon finite manufacturing resources
- Generalized relax-and-fix heuristic
- Modeling industrial lot sizing problems: a review
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Multiindex optimal production planning problems
- A polynomial algorithm for a multi-item capacitated production planning problem
- An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem
- Multi-objective Pareto adaptive algorithm for capacitated lot-sizing problems in glass lens production
- Title not available (Why is that?)
- Title not available (Why is that?)
Recommendations
- A polynomial algorithm for a multi-item capacitated production planning problem 👍 👎
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups 👍 👎
- An effective algorithm for the capacitated single item lot size problem 👍 👎
- Title not available (Why is that?) 👍 👎
- An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs 👍 👎
This page was built for publication: An optimal algorithm for the multi-item capacitated production planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809873)
