Abstract
Energetic reasoning is one of the most powerful propagation algorithms in cumulative scheduling. In practice, however, it is not commonly used because it has a high running time and its success highly depends on the tightness of the variable bounds. In order to speed up energetic reasoning, we provide an easy-to-check necessary condition for energetic reasoning to detect infeasibilities.
We present an implementation of energetic reasoning that employs this condition and that can be parametrically adjusted to handle the trade-off between solving time and propagation overhead. Computational results on instances from the PSPLib are provided. These results show that using this condition decreases the running time by more than a half, although more search nodes need to be explored.
Supported by the DFG Research Center Matheon Mathematics for key technologies in Berlin.
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
Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5(1), 11–24 (1983)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems. International Series in Operations Research & Management Science, vol. 39, p. 198. Kluwer Academic Publishers, Boston (2001)
Dorndorf, U., Phan-Huy, T., Pesch, E.: 10. In: Weglarz, J. (ed.) A survey of interval capacity consistency tests for time- and resource-constrained scheduling, pp. 213–238. Kluwer Academic, Boston (1999)
Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research 112(2), 322–346 (1999)
Kooli, A., Haouari, M., Hidri, L., Néron, E.: IP-based energetic reasoning for the resource constrained project scheduling problem. Electronic Notes in Discrete Mathematics 36, 359–366 (2010); ISCO 2010 - International Symposium on Combinatorial Optimization
Hidri, L., Gharbi, A., Haouari, M.: Energetic reasoning revisited: application to parallel machine scheduling. Journal of Scheduling 11, 239–252 (2008)
PSPLib: Project Scheduling Problem LIBrary, http://129.187.106.231/psplib/
Berthold, T., Heinz, S., Lübbecke, M.E., Möhring, R.H., Schulz, J.: A constraint integer programming approach for resource-constrained project scheduling. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 313–317. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthold, T., Heinz, S., Schulz, J. (2011). An Approximative Criterion for the Potential of Energetic Reasoning. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)