Publication:3202117

DOI<539::AID-NAV3220370408>3.0.CO;2-H 10.1002/1520-6750(199008)37:4<539::AID-NAV3220370408>3.0.CO;2-HzbMath0715.90056MaRDI QIDQ3202117

S. Selcuk Erenguc, H. Murat Mercan

Publication date: 1990

zbMATH Keywords

branch and bound; multi-item production planning

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90B35: Deterministic scheduling theory in operations research

90B30: Production models

90B05: Inventory, storage, reservoirs

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Efficient and effective heuristics for the coordinated capacitated lot-size problem, A simple heuristic for multi-product dynamic lot sizing problems