IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v289y2021i3p809-824.html
   My bibliography  Save this article

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

Author

Listed:
  • de Azevedo, Guilherme Henrique Ismael
  • Pessoa, Artur Alves
  • Subramanian, Anand

Abstract

This paper deals with the resource constrained project scheduling problem (RCPSP) with generalized precedence constraints (RCPSP/Max). We propose an exact method that tackles a relaxed version of the original problem by modeling it as a satisfiability problem (SAT). Several SAT formulations are introduced, as well as workload-based procedures that were developed in order to reduce the domain of the decision variables, and custom propagators that were implemented with a view of improving the efficiency of the SAT solver. Extensive computational experiments involving different configurations of the method were carried out on 2430 RCPSP/Max benchmark instances ranging from 10 to 500 activities and with 5 resources, and on 2040 RCPSP benchmark instances ranging from 30 to 120 activities and with 4 resources. The results obtained suggest that the proposed method is extremely competitive as almost all known optima were found and 86 instances were solved to optimality for the first time. Moreover, a number of bounds were improved for those instances that still remain open.

Suggested Citation

  • de Azevedo, Guilherme Henrique Ismael & Pessoa, Artur Alves & Subramanian, Anand, 2021. "A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 809-824.
    • Handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:809-824
    DOI: 10.1016/j.ejor.2019.07.056
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719306356
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.07.056?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    2. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    3. Andrei Horbach, 2010. "A Boolean satisfiability approach to the resource-constrained project scheduling problem," Annals of Operations Research, Springer, vol. 181(1), pages 89-107, December.
    4. Cavalcante, C.C.B. & Carvalho De Souza, C. & Savelsbergh, M.W.P. & Wang , Y., 2001. "Scheduling projects with labor constraints," LIDAM Reprints CORE 1520, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    6. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    7. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    8. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    2. Mohd Shareduwan Mohd Kasihmuddin & Siti Zulaikha Mohd Jamaludin & Mohd. Asyraf Mansor & Habibah A. Wahab & Siti Maisharah Sheikh Ghadzi, 2022. "Supervised Learning Perspective in Logic Mining," Mathematics, MDPI, vol. 10(6), pages 1-35, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    2. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
    3. Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier, 2018. "A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling," Computational Optimization and Applications, Springer, vol. 69(2), pages 501-534, March.
    4. Damay, Jean & Quilliot, Alain & Sanlaville, Eric, 2007. "Linear programming based algorithms for preemptive and non-preemptive RCPSP," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1012-1022, November.
    5. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    6. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Arkhipov, Dmitry & Battaïa, Olga & Lazarev, Alexander, 2019. "An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 35-44.
    8. Tom Rihm & Norbert Trautmann & Adrian Zimmermann, 2018. "MIP formulations for an application of project scheduling in human resource management," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 609-639, December.
    9. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    10. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    11. Konstantinos G. Zografos & Michael A. Madas & Konstantinos N. Androutsopoulos, 2017. "Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs," Journal of Scheduling, Springer, vol. 20(1), pages 3-24, February.
    12. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    13. Alessandro Hill & Andrea J. Brickey & Italo Cipriano & Marcos Goycoolea & Alexandra Newman, 2022. "Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3042-3058, November.
    14. Kreter, Stefan & Rieck, Julia & Zimmermann, Jürgen, 2016. "Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars," European Journal of Operational Research, Elsevier, vol. 251(2), pages 387-403.
    15. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    16. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    17. Sciau, Jean-Baptiste & Goyon, Agathe & Sarazin, Alexandre & Bascans, Jérémy & Prud’homme, Charles & Lorca, Xavier, 2024. "Using constraint programming to address the operational aircraft line maintenance scheduling problem," Journal of Air Transport Management, Elsevier, vol. 115(C).
    18. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    20. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:809-824. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.