The Stocking Cost Constraint

Houndji, Vinasetan Ratheil;Schaus, Pierre;Wolsey, Laurence;Deville, Yves
(2014) International Conference on Principles and Practice of Constraint Programming (CP2014) — Location: Lyon

Files

cp2014_stocking.pdf
  • Open Access
  • Adobe PDF
  • 369.75 KB
Download

Details

Authors
Abstract
Many production planning problems call for the minimiza- tion of stocking/storage costs. This paper introduces a new global con- straint StockingCost([X1,...,Xn],[d1,...,dn],H,c) that holds when each item Xi is produced on or before its due date di, the capacity c of the machine is respected, and H is an upper bound on the stocking cost. We propose a linear time algorithm to achieve bound consistency on the StockingCost constraint. On a version of the Discrete Lot Sizing Problem, we demonstrate experimentally the pruning and time efficiency of our algorithm compared to other state-of-the-art approaches.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Houndji, V. R., Schaus, P., Wolsey, L., & Deville, Y. (2014). The Stocking Cost Constraint. International Conference on Principles and Practice of Constraint Programming (CP2014), Lyon. https://hdl.handle.net/2078.5/230346