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

DOI10.1016/0377-2217(91)90079-BMaRDI QIDQ809873zbMATH OpenOpenAlexFDO

Authors 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

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

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
• scientific article; zbMATH DE number 4022999
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs

Cites work

• A new polynomial-time algorithm for linear programming
• A noniterative multiproduct multiperiod production planning method
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Production scheduling by the transportation method of linear programming
• Sequential production planning over time at minimum cost

Cited in

(16)

• Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
• Rough cut capacity estimation for order production based upon finite manufacturing resources
• scientific article; zbMATH DE number 4022999 (Why is no real title available?)
• Generalized relax-and-fix heuristic
• Computational complexity of uncapacitated multi-echelon production planning problems
• Solving mixed integer programming production planning problems with setups by shadow price information.
• Modeling industrial lot sizing problems: a review
• A transportation type aggregate production model with bounds on inventory and backordering
• 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
• Multifacility in-series production-planning model with capacity constraints
• L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• scientific article; zbMATH DE number 1757964 (Why is no real title available?)
• scientific article; zbMATH DE number 822146 (Why is no real title available?)

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)