An optimal algorithm for the multi-item capacitated production planning problem

DOI10.1016/0377-2217(91)90079-BzbMath0732.90033OpenAlexW2024633912MaRDI QIDQ809873

Vahid Lotfi, Wun-Hwa Chen

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

zbMATH Keywords

lot-sizingexact polynomial time algorithmmulti-item capacitated production planningtransportation algorithm

Mathematics Subject Classification ID

Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Solving mixed integer programming production planning problems with setups by shadow price information. ⋮ Modeling industrial lot sizing problems: a review ⋮ Generalized relax-and-fix heuristic

Cites Work

• A new polynomial-time algorithm for linear programming
• A noniterative multiproduct multiperiod production planning method
• Sequential Production Planning Over Time at Minimum Cost
• Production Scheduling by the Transportation Method of Linear Programming
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: An optimal algorithm for the multi-item capacitated production planning problem