Triangularity of the basis in linear programs for material requirements planning

DOI10.1016/0167-6377(88)90057-0MaRDI QIDQ1119175zbMATH OpenOpenAlexFDO

Authors James K. Ho, William A. McKenney

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0167-6377(88)90057-0

zbMATH Keywords

parallel processingDantzig-Wolfe decompositionmaterial requirements planninginventory holdingtriangular basis

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Theory of operating systems (68N25)

Recommendations

• Material allocation in MRP with tardiness penalties
• scientific article; zbMATH DE number 3845341
• Solution methods for material requirement planning with lot-size dependent lead times
• scientific article; zbMATH DE number 3856814
• A Method for Determining Feasible Master Production Schedules for Material Requirements Planning Systems

Cites work

• A Primal Simplex Approach to Pure Processing Networks
• Decomposition Principle for Linear Programs
• Decomposition of linear programs using parallel computation
• Extreme points of Leontief substitution systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Recent advances in the decomposition approach to linear programming

Cited in

(1)

• Decomposition of linear programs using parallel computation

This page was built for publication: Triangularity of the basis in linear programs for material requirements planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119175)