A Lower Bounding Structure for Lot-Size Scheduling Problems

DOI10.1287/OPRE.23.2.299MaRDI QIDQ4060714zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(10)

• Primal-dual approach to the single level capacitated lot-sizing problem
• Facets and algorithms for capacitated lot sizing
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• scientific article; zbMATH DE number 3825543 (Why is no real title available?)
• Multi-stage lot sizing in a serial production system
• Finite capacity flow control in a multi-stage/multi-product environment
• Modeling industrial lot sizing problems: a review
• 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

This page was built for publication: A Lower Bounding Structure for Lot-Size Scheduling Problems

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