scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199008)37:4<539::AID-NAV3220370408>3.0.CO;2-H" /><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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch and boundmulti-item production planning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

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

This page was built for publication: