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 |
| Summary: | 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) |
|---|---|
| ISSN: | 2081-8858 2391-6060 |