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

A note on the modelling of project networks with time constraints

Author

Listed:
  • Caramia, Massimiliano
  • Guerriero, Francesca

Abstract

In this note we show how to manage, by means of Generalized Precedence Relationships, some kinds of temporal constraints introduced by Chen et al. (1997) in project networks.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:211:y:2011:i:3:p:666-670
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00886-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Chen, Yen-Liang & Rinks, Dan & Tang, Kwei, 1997. "Critical path in an activity network with time constraints," European Journal of Operational Research, Elsevier, vol. 100(1), pages 122-133, July.
    Full references (including those not matched with items on IDEAS)

    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. Eugene Shragowitz & Habib Youssef & Bing Lu, 2003. "Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 5-22, March.
    3. Laslo, Zohar & Keren, Baruch & Ilani, Hagai, 2008. "Minimizing task completion time with the execution set method," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1513-1519, June.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Yang, Hsu-Hao & Chen, Yen-Liang, 2000. "Finding the critical path in an activity network with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 120(3), pages 603-613, February.
    16. 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.
    17. Chauhan, Satyaveer S. & Gordon, Valery & Proth, Jean-Marie, 2007. "Scheduling in supply chain environment," European Journal of Operational Research, Elsevier, vol. 183(3), pages 961-970, December.
    18. 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.
    19. 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.
    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:211:y:2011:i:3:p:666-670. 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.