Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups

DOI10.1057/jors.1995.65zbMath0830.90035OpenAlexW2077330504MaRDI QIDQ4838215

Khalil S. Hindi

Publication date: 24 July 1995

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.65

zbMATH Keywords

production planningmulti-item lot-sizingcapacitated transshipment problemminimum-cost network flow

Mathematics Subject Classification ID

Production models (90B30) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (4)

Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ A hybrid heuristic and linear programming approach to multi-product machine scheduling

Uses Software

• RELAX4

This page was built for publication: Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups