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

Finding the critical path in an activity network with time-switch constraints

Author

Listed:
  • Yang, Hsu-Hao
  • Chen, Yen-Liang

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:120:y:2000:i:3:p:603-613
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00390-7
    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. Soroush, H. M., 1994. "The most critical path in a PERT network: A heuristic approach," European Journal of Operational Research, Elsevier, vol. 78(1), pages 93-105, October.
    2. Magott, Jan & Skudlarski, Kamil, 1993. "Estimating the mean completion time of PERT networks with exponentially distributed durations of activities," European Journal of Operational Research, Elsevier, vol. 71(1), pages 70-79, November.
    3. Kamburowski, Jerzy, 1985. "An upper bound on the expected completion time of PERT networks," European Journal of Operational Research, Elsevier, vol. 21(2), pages 206-212, August.
    4. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    5. Donald L. Keefer & William A. Verdini, 1993. "Better Estimation of PERT Activity Time Parameters," Management Science, INFORMS, vol. 39(9), pages 1086-1091, September.
    6. Pierre Robillard & Michel Trahan, 1977. "The Completion Time of PERT Networks," Operations Research, INFORMS, vol. 25(1), pages 15-29, February.
    7. Soroush, Hossein, 1993. "Risk taking in stochastic PERT networks," European Journal of Operational Research, Elsevier, vol. 67(2), pages 221-241, June.
    8. 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.
    9. 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)

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    4. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    5. 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.
    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.

    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. 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.
    2. 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.
    3. Yousry Abdelkader, 2010. "Adjustment of the moments of the project completion times when activity times are exponentially distributed," Annals of Operations Research, Springer, vol. 181(1), pages 503-514, December.
    4. 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.
    5. Abdelkader, Yousry H., 2004. "Evaluating project completion times when activity times are Weibull distributed," European Journal of Operational Research, Elsevier, vol. 157(3), pages 704-715, September.
    6. Dharma Kwon, H. & Lippman, Steven A. & Tang, Christopher S., 2011. "Sourcing decisions of project tasks with exponential completion times: Impact on operating profits," International Journal of Production Economics, Elsevier, vol. 134(1), pages 138-150, November.
    7. Lee, Heejung & Suh, Hyo-Won, 2008. "Estimating the duration of stochastic workflow for product development process," International Journal of Production Economics, Elsevier, vol. 111(1), pages 105-117, January.
    8. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    9. Kamburowski, J., 1997. "New validations of PERT times," Omega, Elsevier, vol. 25(3), pages 323-328, June.
    10. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    11. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    12. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    13. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    14. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    15. Robert K. Hammond & J. Eric Bickel, 2013. "Reexamining Discrete Approximations to Continuous Distributions," Decision Analysis, INFORMS, vol. 10(1), pages 6-25, March.
    16. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    17. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    18. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    19. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    20. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.

    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:120:y:2000:i:3:p:603-613. 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.