- Tytuł:
- Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
- Autorzy:
- Viattchenin, D.
- Powiązania:
- https://bibliotekanauki.pl/articles/406450.pdf
- Data publikacji:
- 2015
- Wydawca:
- Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
- Tematy:
-
project-network
dominant path
heuristic possibilistic clustering
interval-valued data
stationary clustering structure
typical point - Opis:
- This paper deals in a preliminary way with the problem of selecting the smallest possible number of dominant paths in a minimized project-network with given bounds on the permissible values of the durations of activities. For this purpose, a classification technique is proposed. This technique is based on a heuristic possibilistic clustering of interval-valued data. The basic concepts of heuristic possibilistic clustering are defined and methods for preprocessing interval-valued data are described. An illustrative example is considered in detail and some conclusions are formulated.
- Źródło:
-
Operations Research and Decisions; 2015, 25, 4; 71-87
2081-8858
2391-6060 - Pojawia się w:
- Operations Research and Decisions
- Dostawca treści:
- Biblioteka Nauki
Artykuł