A Lower Bounding Structure for Lot-Size Scheduling Problems

DOI10.1287/opre.23.2.299zbMath0304.90063OpenAlexW2105845708MaRDI QIDQ4060714

E. F. Peter Newson, Paul R. Kleindorfer

Publication date: 1975

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

Full work available at URL: https://doi.org/10.1287/opre.23.2.299

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Related Items

Multi-stage lot sizing in a serial production system ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Analysis of relaxations for the multi-item capacitated lot-sizing problem ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Primal-dual approach to the single level capacitated lot-sizing problem ⋮ Unnamed Item ⋮ Finite capacity flow control in a multi-stage/multi-product environment ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Facets and algorithms for capacitated lot sizing