The item dependent stocking cost constraint
(2019) Constraints : an international journal — Vol. 24, n° 2, p. 183-209 (2019)
Files
Houndji2019_Article_TheItemDependentStockingcostCo.pdf
Open Access - Adobe PDF
- 1.9 MB
Details
- Authors
Houndji, Vinasetan Ratheil 
- Abstract
- In a previous work we introduced a global StockingCost constraint to compute the total number of periods between the production periods and the due dates in a multi-order capacitated lot-sizing problem. Here we consider a more general case in which each order can have a different per period stocking cost and the goal is to minimise the total stocking cost. In addition the production capacity, limiting the number of orders produced in a given period, is allowed to vary over time.We propose an efficient filtering algorithm in O(n log n) where n is the number of orders to produce. On a variant of the capacitated lot-sizing problem, we demonstrate experimentally that our new filtering algorithm scales well and is competitive wrt the StockingCost constraint when the stocking cost is the same for all orders.
- Affiliations
Citations
Houndji, V. R., Schaus, P., & Wolsey, L. (2019). The item dependent stocking cost constraint. Constraints : an international journal, 24(2), 183-209. https://doi.org/10.1007/s10601-018-9300-y (Original work published 2019)