Abstract
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at the problem with only one resource. We show how to adapt the procedure by Van den Akker et al. [1] for the problem of minimizing maximum lateness on a set of identical, parallel machines such that it can be used to solve these RCPS problems. We then consider a number of variants of the RCPS problem with one or more resources and show how these can be solved by our approach. Because of the close relation between RCPS and the cumulative constraint in constraint programming, our method can be used as an efficient filtering algorithm for the cumulative constraint as well.
Supported by BSIK grant 03018 (BRICKS: Basic Research in Informatics for Creating the Knowledge Society).
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
van den Akker, J.M., Hoogeveen, J.A., van Kempen, J.W.: Parallel machine scheduling through column generation: Minimax objective functions. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 648–659. Springer, Heidelberg (2006)
van den Akker, J.M., Hoogeveen, J.A., Van de Velde, S.L.: Applying column generation to machine scheduling. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 303–330. Springer, Heidelberg (2005)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: Applying constraint programming to scheduling problems. Kluwer Academic Publishers, Dordrecht (2001)
Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. Wiley, New York (1990)
Beldiceanu, N., Demassey, S.: Global Constraint Catalog (2007), http://www.emn.fr/x-info/sdemasse/gccat/index.html
Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112, 3–41 (1999)
Brucker, P., Knust, S.: A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127, 355–362 (2000)
Brucker, P., Knust, S.: Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149, 302–313 (2003)
Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. Journal of Heuristics 8, 109–136 (2002)
Pereira Lopes, M.J., Valério de Carvalho, J.M.: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research 176, 1508–1527 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
van den Akker, J.M., Diepen, G., Hoogeveen, J.A. (2007). A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. 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_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_27
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)