Abstract
This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tasks with variable duration and heights. The resource function is no more constant but is a positive or negative piecewise linear function of time. Finally, a task is no more pre-assigned to one resource, but to a task corresponds a set of possible resource assignments. In this context, this article provides an O(p ·(logp + q)) for computing all the cumulated resource profiles where q is the number of resources and p is the total number of trapezoid sub-tasks of all the tasks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task Intervals. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge (1996)
Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling Problems. In: Weglarz, J. (ed.) Project Scheduling Recent Models, Algorithms and Applications, pp. 1–26. Kluwer Academic Publishers, Dordrecht (1998)
Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research 112, 322–346 (1999)
Lahrichi, A.: Scheduling: the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems. C. R. Acad. Sci. Paris, t. 294, pp. 209–211 (1982)
Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143, 151–188 (2003)
Maravelias, C.T., Grossmann, I.E.: A Hybrid MILP/CP Decomposition Approach for the Continuous Time Scheduling of Multipurpose Batch Plants. Computers & chemical engineering 28(10), 1921–1949 (2004)
Muscettola, N.: Computing the Envelope for Stepwise-Constant Resource Allocations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 139–153. Springer, Heidelberg (2002)
Poder, E., Beldiceanu, N., Sanlaville, E.: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. European Journal of Operational Research 153, 239–254 (2004)
Preparata, F.P., Ian Shamos, M.: Computational Geometry, An introduction. Texts and Monographs in Computer Science. Springer, New York (1995)
Sourd, F., Rogerie, J.: Continuous Filling and Emptying of Storage Systems in Constraint-Based Scheduling. In: 8th International Workshop on Project Management and Scheduling - MPS 2002, Valencia, Spain, April 3-5 (2002)
Wolf, A.: Pruning while Sweeping over Task Intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 739–753. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Beldiceanu, N., Poder, E. (2007). A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production. In: Van Hentenryck, P., Wolsey, L. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2007. Lecture Notes in Computer Science, vol 4510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72397-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72396-7
Online ISBN: 978-3-540-72397-4
eBook Packages: Computer ScienceComputer Science (R0)