Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities"

Wilco van den Heuvel · José M. Gutiérrez · Hark‐Chin Hwang

19 citations0/0 files storedRePub (Erasmus University Rotterdam)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Supply Chain and Inventory Management Scheduling and Optimization Algorithms Optimization and Mathematical Programming

Abstract

In a recent paper Gutierrez et al. (2008) show that the lot-sizing problem with inventory bounds can be solved in O(T log T) time. In this note we show that their algorithm does not lead to an optimal solution in general.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 19 citations exist upstream.

References

1999Inventory management and production planning and scheduling 1958Dynamic Version of the Economic Lot Size Model 2004Dynamic Version of the Economic Lot Size Model 1991A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time 1993Improved Algorithms for Economic Lot Size Problems 1973Bounded Production and Inventory Models with Piecewise Concave Costs 2002A new characterization for the dynamic lot size problem with bounded inventory

Cited by

2018Two-level lot-sizing with inventory bounds 2010A Literature Review on Inventory Lot Sizing Problems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.