Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Operations Research and Decisions

Authors help

  1. 1 VIATTCHENIN D.

Years help

  1. 1 2015

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  typical point
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

Reducing the number of paths in a minimized project-network with given bounds on the durations of activities

100%
VIATTCHENIN D.
Operations Research and Decisions
|
2015
|
vol. 25
|
issue 4
71-87
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.