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 possibilis-tic clustering are defined and methods for preprocessing interval-valued data are described. An illus-trative example is considered in detail and some conclusions are formulated.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.