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

Computing latest starting times of activities in interval-valued networks with minimal time lags

Author

Listed:
  • Yakhchali, Siamak Haji
  • Ghodsypour, Seyed Hassan

Abstract

This paper deals with problems of determining possible values of earliest and latest starting times of an activity in networks with minimal time lags and imprecise durations that are represented by means of interval or fuzzy numbers. Although minimal time lags are practical in different projects, former researchers have not considered these problems. After proposing propositions which reduce the search space, a novel polynomial algorithm is presented to compute intervals of possible values of latest starting times in interval-valued networks with minimal time lags. Then, the results are extended to networks with fuzzy durations.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:200:y:2010:i:3:p:874-880
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00055-1
    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. 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.
    2. Lootsma, F. A., 1989. "Stochastic and fuzzy," European Journal of Operational Research, Elsevier, vol. 43(2), pages 174-183, November.
    3. 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.
    4. Dubois, Didier & Fargier, Helene & Fortemps, Philippe, 2003. "Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge," European Journal of Operational Research, Elsevier, vol. 147(2), pages 231-252, June.
    5. 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.
    6. Bajis Dodin, 1985. "Bounding the Project Completion Time Distribution in PERT Networks," Operations Research, INFORMS, vol. 33(4), pages 862-881, August.
    7. Ahuja, R. & Magnanti, Th., 1989. "Some Recent Advances In Network Flows," LIDAM Discussion Papers CORE 1989036, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Ragsdale, C, 1989. "The current state of network simulation in project management theory and practice," Omega, Elsevier, vol. 17(1), pages 21-25.
    9. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    10. D. G. Malcolm & J. H. Roseboom & C. E. Clark & W. Fazar, 1959. "Application of a Technique for Research and Development Program Evaluation," Operations Research, INFORMS, vol. 7(5), pages 646-669, October.
    11. 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.
    12. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    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. He-Yau Kang & Amy H. I. Lee & Tzu-Ting Huang, 2016. "Project Management for a Wind Turbine Construction by Applying Fuzzy Multiple Objective Linear Programming Models," Energies, MDPI, vol. 9(12), pages 1-15, December.

    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. 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.
    2. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    3. Zhao, Mingxuan & Zhou, Jian & Wang, Ke & Pantelous, Athanasios A., 2023. "Project scheduling problem with fuzzy activity durations: A novel operational law based solution framework," European Journal of Operational Research, Elsevier, vol. 306(2), pages 519-534.
    4. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    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. 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.
    7. 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.
    8. Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    9. 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.
    10. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    11. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    12. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "An Approach to Realizing Process Control for Underground Mining Operations of Mobile Machines," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-17, June.
    13. 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.
    14. Vaseghi, Forough & Martens, Annelies & Vanhoucke, Mario, 2024. "Analysis of the impact of corrective actions for stochastic project networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 503-518.
    15. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    16. Illana Bendavid & Boaz Golany, 2011. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 189(1), pages 25-42, September.
    17. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    18. 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.
    19. 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.
    20. Illana Bendavid & Boaz Golany, 2011. "Predetermined intervals for start times of activities in the stochastic project scheduling problem," Annals of Operations Research, Springer, vol. 186(1), pages 429-442, June.

    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:200:y:2010:i:3:p:874-880. 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.