Abstract
Many production planning problems call for the minimization of stocking/storage costs. This paper introduces a new global constraint \(\texttt{StockingCost}([X_1,\ldots,X_n],[d_1,\ldots,d_n],H,c)\) that holds when each item X i is produced on or before its due date d i , 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 \(\texttt{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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Data structures for Disjoint Sets. In: Introduction to Algorithms, ch. 21, 2nd edn., MIT Press, Cambridge (2001)
Drexl, A., Kimms, A.: Lot sizing and scheduling - survey and extensions. European Journal of Operational Research, 221–235 (1997)
Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189–203. Springer, Heidelberg (1999)
Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving tsp through the integration of or and cp techniques. Electronic Notes in Discrete Mathematics 1, 13–25 (1999)
Jans, R., Degraeve, Z.: Modeling industrial lot sizing problems: A review. International Journal of Production Research (2006)
López-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: International Joint Conference on Artificial Intelligence, IJCAI 2003 (2003)
Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science 32(1), 12–29 (1998)
Pochet, Y., Wolsey, L.: Production Planning by Mixed Integer Programming. Springer (2005)
Quimper, C.-G., van Beek, P., López-Ortiz, A., Golynski, A., Sadjad, S.B.S.: An efficient bounds consistency algorithm for the global cardinality constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 600–614. Springer, Heidelberg (2003)
Régin, J.-C.: Cost-based arc consistency for global cardinality constraints. Constraints 7(3-4), 387–405 (2002)
OscaR Team. Oscar: Scala in or (2014), https://bitbucket.org/oscarlib/oscar
Ullah, H., Parveen, S.: A literature review on inventory lot sizing problems. Global Journal of Researches in Engineering 10, 21–36 (2010)
van Hoeve, W.-J.: Over-constrained problems. In: Hybrid Optimization, pp. 191–225. Springer (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Houndji, V.R., Schaus, P., Wolsey, L., Deville, Y. (2014). The StockingCost Constraint. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)