The capacitated lot sizing problem: a review of models and algorithms

By B. Karimi, S. Ghomi, John M. Wilson. 2003

716 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A survey of scheduling problems with setup times or costs (2008, background): “…or setup cost research for lot-sizing and scheduling problems in the context of inventory management, see the surveys of Drexl and Kimms (1997) and Karimi et al. (2003), for vehicle routing and scheduling problems, see the review of Laporte (1992), for lot streaming problems with continuous batch…”
Multi-objective models for lot-sizing with supplier selection (2011, background): “Interested readers are referred to Robinson et al. (2009), Ben-Daya et al. (2008) and Karimi et al. (2003) for different models and classifications of the lot-sizing problem.”
A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain (2012, methodology): “For a review of lot sizing problems, their extensions and solution approaches, please refer to Karimi et al. (2003), Brahimi et al. (2006b), Degraeve and Jans (2007), Quadt and Kuhn (2008) and Buschkühl et al. (2010).”
Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (2010, background): “( 2003 ) highlights the scarcity of literature devoted to CLSP with sequence-dependent setups and setup carryovers, and underlines the need for faster and more efficient heuristics.”