Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

10 references·2 citing·30 second hop

FromToDepth

this work references cited by second hop

References

1958Dynamic Version of the Economic Lot Size Model2,068 cited
2004Dynamic Version of the Economic Lot Size Model2,055 cited
1969A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach509 cited
1973Bounded Production and Inventory Models with Piecewise Concave Costs196 cited
1975Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results192 cited
1978An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints167 cited
1975A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs79 cited
1974Planning Horizons for the Dynamic Lot Size Model with Backlogging74 cited
1978A capacity constrained single-facility dynamic lot-size model46 cited
1988Multiproduct dynamic lot-sizing model with coordinated replenishments35 cited

Cited by

1994A dynamic programming algorithm for dynamic lot size models with piecewise linear costs22 cited
2022Two-stage risk-averse stochastic programming approach for multi-item single source ordering problem: CVaR minimisation with transportation cost18 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work