Multiproduct dynamic lot-sizing model with coordinated replenishments

DOI10.1002/nav.3220350102zbMath0637.90028OpenAlexW2073064493MaRDI QIDQ3778511

S. Selcuk Erenguc

Publication date: 1988

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3220350102

zbMATH Keywords

concave minimizationbranch and boundoptimal ordering schedulecompact polyhedral setmultiproduct dynamic lot-sizing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (9)

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ A simple heuristic for multi-product dynamic lot sizing problems ⋮ Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem ⋮ A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand ⋮ Models and algorithms for the dynamic-demand joint replenishment problem ⋮ A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints ⋮ More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ ⋮ The coordinated replenishment dynamic lot-sizing problem with quantity discounts ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem

Cites Work

• Using convex envelopes to solve the interactive fixed-charge linear programming problem

This page was built for publication: Multiproduct dynamic lot-sizing model with coordinated replenishments