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

Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities

Author

Listed:
  • Bianco, Lucio
  • Caramia, Massimiliano
  • Giordani, Stefano

Abstract

In this paper, we illustrate a new method to overcome the failures of the theory proposed by Elmaghraby and Kamburowski (1992) and De Reyck (1998) for the analysis of activity criticalities and flexibilities in non-preemptive project scheduling with generalized precedence relations under unlimited resources. These failures, discussed in detail in this paper, call for a new approach to study this problem. We provide new definitions of criticalities and consequently new tools for their identification within a more general framework without ambiguities.

Suggested Citation

  • Bianco, Lucio & Caramia, Massimiliano & Giordani, Stefano, 2022. "Project scheduling with generalized precedence relations: A new method to analyze criticalities and flexibilities," European Journal of Operational Research, Elsevier, vol. 298(2), pages 451-462.
    • Handle: RePEc:eee:ejores:v:298:y:2022:i:2:p:451-462
    DOI: 10.1016/j.ejor.2021.07.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721006172
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.07.022?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. Salah E. Elmaghraby & Jerzy Kamburowski, 1992. "The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)," Management Science, INFORMS, vol. 38(9), pages 1245-1263, September.
    2. Vicente Valls & Pilar Lino, 2001. "Criticality Analysis in Activity-on-Node Networks with Minimal Time Lags," Annals of Operations Research, Springer, vol. 102(1), pages 17-37, February.
    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. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Alessio Salvatore, 2024. "Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm," Annals of Operations Research, Springer, vol. 338(1), pages 193-224, July.

    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. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    2. Ulrich Dorndorf & Erwin Pesch & Toàn Phan-Huy, 2000. "A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints," Management Science, INFORMS, vol. 46(10), pages 1365-1384, October.
    3. Caramia, Massimiliano & Guerriero, Francesca, 2011. "A note on the modelling of project networks with time constraints," European Journal of Operational Research, Elsevier, vol. 211(3), pages 666-670, June.
    4. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    5. Simon Micheler & Yee Mey Goh & Niels Lohse, 2021. "A transformation of human operation approach to inform system design for automation," Journal of Intelligent Manufacturing, Springer, vol. 32(1), pages 201-220, January.
    6. Wiesemann, Wolfram & Kuhn, Daniel & Rustem, Berç, 2010. "Maximizing the net present value of a project under uncertainty," European Journal of Operational Research, Elsevier, vol. 202(2), pages 356-367, April.
    7. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    8. De Reyck, Bert & Herroelen, Willy, 1999. "The multi-mode resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 119(2), pages 538-556, December.
    9. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    10. Chung-Lun Li & Nicholas G. Hall, 2019. "Work Package Sizing and Project Performance," Operations Research, INFORMS, vol. 67(1), pages 123-142, January.
    11. Levner, Eugene & Zuckerman, Dror & Meirovich, Gavriel, 1998. "Total quality management of a production-maintenance system: A network approach," International Journal of Production Economics, Elsevier, vol. 56(1), pages 407-421, September.
    12. Elmaghraby, Salah E., 1995. "Activity nets: A guided tour through some recent developments," European Journal of Operational Research, Elsevier, vol. 82(3), pages 383-408, May.
    13. Yakhchali, Siamak Haji & Ghodsypour, Seyed Hassan, 2010. "Computing latest starting times of activities in interval-valued networks with minimal time lags," European Journal of Operational Research, Elsevier, vol. 200(3), pages 874-880, February.
    14. Christos Ellinas & Neil Allan & Anders Johansson, 2016. "Exploring Structural Patterns Across Evolved and Designed Systems: A Network Perspective," Systems Engineering, John Wiley & Sons, vol. 19(3), pages 179-192, May.
    15. Inayat Ullah & Dunbing Tang & Qi Wang & Leilei Yin, 2017. "Least Risky Change Propagation Path Analysis in Product Design Process," Systems Engineering, John Wiley & Sons, vol. 20(4), pages 379-391, July.
    16. Nicole Megow & Rolf H. Möhring & Jens Schulz, 2011. "Decision Support and Optimization in Shutdown and Turnaround Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 189-204, May.
    17. Dodin, Bajis & Elimam, A. A., 1997. "Audit scheduling with overlapping activities and sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 22-33, February.
    18. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    19. Mashood Ishaque & Abbas K. Zaidi & Alexander H. Levis, 2009. "Project management using point graphs," Systems Engineering, John Wiley & Sons, vol. 12(1), pages 36-54, March.
    20. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On no-wait and no-idle flow shops with makespan criterion," European Journal of Operational Research, Elsevier, vol. 178(3), pages 677-685, May.

    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:298:y:2022:i:2:p:451-462. 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.