SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Critical path analysis in the network with fuzzy activity times · Study

ArticleShelves

ArticleCritical path analysis in the network with fuzzy activity times

Stefan Chanas A2001

Article2001

Critical path analysis in the network with fuzzy activity times

Stefan Chanas A · Paweł Zieliński

236 citations·0/0 files stored·Fuzzy Sets and Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Resource-Constrained Project Scheduling Multi-Criteria Decision Making Fuzzy Systems and Optimization

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 236 citations exist upstream.

References

1959Application of a Technique for Research and Development Program Evaluation 1961Critical-Path Planning and Scheduling: Mathematical Basis 1981The use of fuzzy variables in pert

Cited by

2012Discrete time–cost–environment trade-off problem for large-scale construction systems with multiple modes under fuzzy uncertainty and its application to Jinping-II Hydroelectric Project 2016Are complexity and uncertainty distinct concepts in project management? A taxonomical examination from literature 2013A model of resilient supply chain network design: A two-stage programming with fuzzy shortest path 2007Applying fuzzy method for measuring criticality in project network 2006Analysis of critical paths in a project network with fuzzy activity times 2007A simple approach to fuzzy critical path analysis in project networks 2003On latest starting times and floats in activity networks with ill-known durations 2002The computational complexity of the criticality problems in a network with interval activity times

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2002The computational complexity of the criticality problems in a network with interval activity timesarticle · 3 shared references 2002On the sure criticality of tasks in activity networks with imprecise durationsarticle · 3 shared references 2009Computing latest starting times of activities in interval-valued networks with minimal time lagsarticle · 3 shared references 2010Criticality analysis of activity networks under interval uncertaintyarticle · 3 shared references 1959Critical-path planning and schedulingother · 2 shared references 2010Project scheduling with finite or infinite number of activity processing modes – A surveyarticle · 2 shared references

Details

Year2001

Typearticle

Published2001-09-01

VenueFuzzy Sets and Systems

ISSN-L0165-0114

Languageen

Citations236

Files0 public / 0

ShelfResource-Constrained Project Scheduling

Identifiers

doi10.1016/s0165-0114(00)00076-2

openalex_workW2009479118

Links

Imported from OpenAlex (CC0) — nothing here is generated.