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

Activity nets: A guided tour through some recent developments

Author

Listed:
  • Elmaghraby, Salah E.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:82:y:1995:i:3:p:383-408
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00184-E
    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. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. 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.
    4. Elmaghraby, Salah E., 1990. "Project bidding under deterministic and probabilistic activity durations," European Journal of Operational Research, Elsevier, vol. 49(1), pages 14-34, November.
    5. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    6. Herroelen, Willy S. & Gallens, Els, 1993. "Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 65(2), pages 274-277, March.
    7. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    8. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    9. Elmaghraby, Salah E. & Herroelen, Willy S., 1980. "On the measurement of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 5(4), pages 223-234, October.
    10. Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
    11. F. Brian Talbot & James H. Patterson, 1978. "An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems," Management Science, INFORMS, vol. 24(11), pages 1163-1174, July.
    12. De Wit, Jan & Herroelen, Willy, 1990. "An evaluation of microcomputer-based software packages for project management," European Journal of Operational Research, Elsevier, vol. 49(1), pages 102-139, November.
    13. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    14. Deckro, Richard F. & Winkofsky, E. P. & E. Hebert, John & Gagnon, Roger, 1991. "A decomposition approach to multi-project scheduling," European Journal of Operational Research, Elsevier, vol. 51(1), pages 110-118, March.
    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. Grzegorz Waligóra, 2014. "Discrete-continuous project scheduling with discounted cash inflows and various payment models—a review of recent results," Annals of Operations Research, Springer, vol. 213(1), pages 319-340, February.
    2. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    3. 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.
    4. 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.
    5. Pedro Parraguez & Steven Eppinger & Anja Maier, 2016. "Characterizing Design Process Interfaces as Organization Networks: Insights for Engineering Systems Management," Systems Engineering, John Wiley & Sons, vol. 19(2), pages 158-173, March.
    6. Dodin, B. & Elimam, A.A., 2008. "Integration of equipment planning and project scheduling," European Journal of Operational Research, Elsevier, vol. 184(3), pages 962-980, February.
    7. 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.
    8. 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.
    9. Tyson R. Browning, 2002. "Process integration using the design structure matrix," Systems Engineering, John Wiley & Sons, vol. 5(3), pages 180-193.
    10. Tyson R. Browning, 2009. "The many views of a process: Toward a process architecture framework for product development processes," Systems Engineering, John Wiley & Sons, vol. 12(1), pages 69-90, March.
    11. Tavares, L. Valadares & Antunes Ferreira, J. A. & Silva Coelho, J., 1998. "On the optimal management of project risk," European Journal of Operational Research, Elsevier, vol. 107(2), pages 451-469, June.
    12. Tyson R. Browning & Ernst Fricke & Herbert Negele, 2006. "Key concepts in modeling product development processes," Systems Engineering, John Wiley & Sons, vol. 9(2), pages 104-128, June.
    13. Drexl, Andreas & Kimms, Alf, 1998. "Minimizing total weighted completion times subject to precedence constraints by dynamic programming," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 475, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    15. Tavares, L. V., 2002. "A review of the contribution of Operational Research to Project Management," European Journal of Operational Research, Elsevier, vol. 136(1), pages 1-18, January.
    16. Christos Ellinas & Christos Nicolaides & Naoki Masuda, 2022. "Mitigation strategies against cascading failures within a project activity network," Journal of Computational Social Science, Springer, vol. 5(1), pages 383-400, May.
    17. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    18. Masoud Arjmand & Amir Abbas Najafi & Majid Ebrahimzadeh, 2020. "Evolutionary algorithms for multi-objective stochastic resource availability cost problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 935-985, September.

    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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    3. 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.
    4. Ahn, Taeho & Erenguc, S. Selcuk, 1998. "The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 107(2), pages 250-259, June.
    5. 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.
    6. S. Selcuk Erenguc & Taeho Ahn & Daniel G. Conway, 2001. "The resource constrained project scheduling problem with multiple crashable modes: An exact solution method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(2), pages 107-127, March.
    7. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    8. 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.
    9. Yang, Kum Khiong & Tay, Lee Choo & Sum, Chee Chuong, 1995. "A comparison of stochastic scheduling rules for maximizing project net present value," European Journal of Operational Research, Elsevier, vol. 85(2), pages 327-339, September.
    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. Ulusoy, Gunduz & Ozdamar, Linet, 1996. "A framework for an interactive project scheduling system under limited resources," European Journal of Operational Research, Elsevier, vol. 90(2), pages 362-375, April.
    12. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    13. 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.
    14. 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.
    15. 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.
    16. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    17. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    18. 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.
    19. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.

    More about this item

    Statistics

    Access and download statistics

    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:82:y:1995:i:3:p:383-408. 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.