IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v4y2003p15.html
   My bibliography  Save this article

Computing efficiently floats of all activities in a series-parallel network with duration intervals

Author

Listed:
  • Paweł Zieliński

Abstract

The paper deals with the problem of computing intervals of possible values of floats for all activities in a series-parallel network with duration intervals. An O (n) time algorithm, using graph reductions, for computing the interval of possible values of floats for a single activity and an algorithm for computing the intervals for all activities in the network that runs O (n log n) time and requires a linear space for a data structure are presented.

Suggested Citation

  • Paweł Zieliński, 2003. "Computing efficiently floats of all activities in a series-parallel network with duration intervals," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 13(4), pages 185-208.
    • Handle: RePEc:wut:journl:v:4:y:2003:p:15
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/2003416%20-%20published.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chanas, Stefan & Zielinski, Pawel, 2002. "The computational complexity of the criticality problems in a network with interval activity times," European Journal of Operational Research, Elsevier, vol. 136(3), pages 541-550, February.
    2. Dubois, Didier & Fargier, Helene & Galvagnon, Vincent, 2003. "On latest starting times and floats in activity networks with ill-known durations," European Journal of Operational Research, Elsevier, vol. 147(2), pages 266-280, June.
    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. 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.
    2. Chen, Shih-Pin, 2007. "Analysis of critical paths in a project network with fuzzy activity times," European Journal of Operational Research, Elsevier, vol. 183(1), pages 442-459, November.
    3. Kasperski, Adam & Zielinski, Pawel, 2010. "Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights," European Journal of Operational Research, Elsevier, vol. 200(3), pages 680-687, February.
    4. V. Sireesha & N. Ravi Shankar, 2013. "A new approach to find project characteristics and multiple possible critical paths in a fuzzy project network," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 69-85, March.
    5. Mukesh Kumar Mehlawat & Nishtha Grover, 2018. "Intuitionistic fuzzy multi-criteria group decision making with an application to critical path selection," Annals of Operations Research, Springer, vol. 269(1), pages 505-520, October.
    6. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    7. Chen, Chen-Tung & Huang, Sue-Fen, 2006. "Order-fulfillment ability analysis in the supply-chain system with fuzzy operation times," International Journal of Production Economics, Elsevier, vol. 101(1), pages 185-193, May.
    8. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.
    9. Fernando Acebes & Javier Pajares & Jose M Gonzalez-Varona & Adolfo Lopez-Paredes, 2024. "Project Risk Management from the bottom-up: Activity Risk Index," Papers 2406.00078, arXiv.org.
    10. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
    11. Mehdi Zandebasiri & Hrald Vacik & Daniel Etongo & Yasmin Dorfstetter & Javad Soosani & Mehdi Pourhashemi, 2019. "Application of time-cost trade-off model in forest management projects: The case of Oak decline project," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 65(12), pages 481-492.
    12. Kasperski, Adam & Zielinski, Pawel, 2007. "On combinatorial optimization problems on matroids with uncertain weights," European Journal of Operational Research, Elsevier, vol. 177(2), pages 851-864, March.
    13. Li He & Qiyan Cao & Fengjun Shang, 2019. "Measuring Component Importance for Network System Using Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-11, May.
    14. Conde, Eduardo, 2009. "A minmax regret approach to the critical path method with task interval times," European Journal of Operational Research, Elsevier, vol. 197(1), pages 235-242, August.
    15. Madadi, M. & Iranmanesh, H., 2012. "A management oriented approach to reduce a project duration and its risk (variability)," European Journal of Operational Research, Elsevier, vol. 219(3), pages 751-761.
    16. Fernando Acebes & Javier Pajares & José M. González-Varona & Adolfo López-Paredes, 2021. "Project risk management from the bottom-up: Activity Risk Index," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1375-1396, December.

    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:wut:journl:v:4:y:2003:p:15. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.