You are here

The StockingCost Constraint

TitleThe StockingCost Constraint
Publication TypeConference Proceedings
Year of Conference2014
AuthorsHoundji, Vinasétan Ratheil, Schaus Pierre, Wolsey Laurence, and Deville Yves
Conference NamePrinciples and Practice of Constraint Programming
Volume8656
Pagination382-397
Date Published09/2014
PublisherSpringer International Publishing
Keywordsconstraint programming, Discrete Lot Sizing, Global Constraint, Production Planning
Abstract

Many production planning problems call for the minimization of stocking/storage costs. This paper introduces a new global constraint 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.

Full text: