Issue: 2015/Vol.25/No.4, Pages 71-87
REDUCING THE NUMBER OF PATHS IN A MINIMIZED PROJECT-NETWORK WITH GIVEN BOUNDS ON THE DURATIONS OF ACTIVITIES
Dmitri Viattchenin
Cite as: D. Viattchenin. Reducing the number of paths in a minimized project-network with given bounds on the durations of activities. Operations Research and Decisions 2015: 25(4), 71-87. DOI 10.5277/ord150405
Abstract
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.
Keywords: project-network, dominant path, heuristic possibilistic clustering, interval-valued data, stationary clustering structure, typical point
Received: 23 March 2015 Accepted: 30 November 2015