Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities
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 ba...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wrocław University of Science and Technology
2015-01-01
|
| Series: | Operations Research and Decisions |
| Online Access: | http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1189 |
| id |
doaj-3759ad8024bb44ca863e22e87cdcee74 |
|---|---|
| record_format |
Article |
| spelling |
doaj-3759ad8024bb44ca863e22e87cdcee742020-11-24T23:36:29ZengWrocław University of Science and TechnologyOperations Research and Decisions2081-88582391-60602015-01-01vol. 25no. 47187171403905Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of ActivitiesDmitri Viattchenin0Belarusian State University of Informatics and Radio-ElectronicsThis 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. (original abstract)http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1189 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Dmitri Viattchenin |
| spellingShingle |
Dmitri Viattchenin Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities Operations Research and Decisions |
| author_facet |
Dmitri Viattchenin |
| author_sort |
Dmitri Viattchenin |
| title |
Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities |
| title_short |
Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities |
| title_full |
Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities |
| title_fullStr |
Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities |
| title_full_unstemmed |
Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities |
| title_sort |
reducing the number of paths in a minimized project-network with given bounds on the durations of activities |
| publisher |
Wrocław University of Science and Technology |
| series |
Operations Research and Decisions |
| issn |
2081-8858 2391-6060 |
| publishDate |
2015-01-01 |
| description |
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. (original abstract) |
| url |
http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1189 |
| work_keys_str_mv |
AT dmitriviattchenin reducingthenumberofpathsinaminimizedprojectnetworkwithgivenboundsonthedurationsofactivities |
| _version_ |
1725523304419164160 |