We propose a linear time algorithm to achieve bound consistency on the StockingCost constraint.  ...  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  ...  The StockingCost Constraint The StockingCost constraint has the following form: where the variable X i is the date of production of item i on the machine, the integer d i is the due-date for item i, the  ...