A polynomial algorithm for a multi-item capacitated production planning problem

DOI10.1016/0167-6377(93)90051-HzbMath0801.90052MaRDI QIDQ1316097

Meltem Denizel-Sivri, S. Selcuk Erenguc

Publication date: 14 March 1994

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

manufacturingpolynomial time algorithmproduction planninglot sizingmulti-itemcomputational boundsingle machine static schedulingworst case computational bound

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

Exact solution procedures for certain planning problems in flexible manufacturing systems

Cites Work

• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• Unnamed Item

This page was built for publication: A polynomial algorithm for a multi-item capacitated production planning problem