Abstract
This paper investigates cumulative scheduling in uncertain environments, using constraint programming. We present a new declarative characterization of robustness, which preserves solution quality. We highlight the significance of our framework on a crane assignment problem with business constraints.
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
Baptiste, P., Le Pape, C., Nuijten, W.: Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research 92, 305–333 (1999)
Beldiceanu, N., Carlsson, M.: A new multi-resource cumulatives constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63–79. Springer, Heidelberg (2002)
Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling 20(12), 97–123 (1994)
Bessiere, C.: Constraint propagation. Research report 06020. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, LIRMM, ch. 3, Elsevier (2006)
Billaut, J.-C., Moukrim, A., Sanlaville, E. (eds.): Flexibility and Robustness in Scheduling. Wiley (2010)
Choco. 3.1.0 (2013), http://choco.sourceforge.net/
Davenport, A.-J., Jefflot, C., Beck, J.-C.: Slack-based techniques for robust schedules. In: Proc. European Conference on Planning, pp. 7–18 (2001)
Derrien, A., Petit, T., Zampelli, S.: Dynamic sweep filtering algorithm for FlexC. Research report RR14/1/INFO, Mines Nantes (2014)
Hebrard, E.: Super solutions in constraint programming. In: Sattler, U. (ed.) IJCAR Doctoral Programme. CEUR Workshop Proceedings, vol. 106. CEUR-WS.org (2004)
Hebrard, E., Hnich, B., Walsh, T.: Super solutions in constraint programming. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 157–172. Springer, Heidelberg (2004)
Lahrichi, A.: The notions of Hump, Compulsory Part and their use in Cumulative Problems. C.R. Acad. Sc. 294, 20–211 (1982)
Letort, A.: Passage à l’échelle pour les contraintes d’ordonnancement multi-ressources. Ph.D dissertation (2013)
Letort, A., Beldiceanu, N., Carlsson, M.: A scalable sweep algorithm for the cumulative constraint. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 439–454. Springer, Heidelberg (2012)
Leus, R., Artigues, C., Talla Nobibon, F.: Robust optimization for resource-constrained project scheduling with uncertain activity durations. In: Proc. IEEM, pp. 101–105 (2011)
Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468–481. Springer, Heidelberg (2004)
Wu, C.W., Brown, K.N., Beck, J.C.: Scheduling with uncertain durations: Modeling beta-robust scheduling with constraints. Computers & OR 36(8), 2348–2356 (2009)
Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 880–896. Springer, Heidelberg (2013)
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
Derrien, A., Petit, T., Zampelli, S. (2014). A Declarative Paradigm for Robust Cumulative Scheduling. 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_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)