Material compatibility constraints for make-to-order production planning.

DOI10.1016/S0167-6377(03)00045-2zbMath1049.90020OpenAlexW1989790681MaRDI QIDQ1412704

Michael O. Ball, Zhen-Ying Zhao, Chien-Yu Chen

Publication date: 25 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00045-2

zbMATH Keywords

MatchingInteger programmingProduction planning

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30)

Related Items

A new AATP model with considering supply chain lead-times and resources and scheduling of the orders in flowshop production systems: a graph-theoretic view ⋮ Separation, dimension, and facet algorithms for node flow polyhedra ⋮ Optimization-based available-to-promise with multi-stage resource availability

Cites Work

• The perfectly matchable subgraph polytope of a bipartite graph
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms