Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2015 | 25 | nr 4 | 71--87
Tytuł artykułu

Reducing the Number of Paths in a Minimized Project-Network With Given Bounds on the Durations of Activities

Treść / Zawartość
Warianty tytułu
Języki publikacji
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)
Opis fizyczny
  • Belarusian State University of Informatics and Radio-Electronics
  • [1] BRUCKER F., DREXL A., MÖHRING R., NEUMANN K., PESCH E., Resource-constrained project scheduling: notation, classification, models, and methods, European Journal of Operation Research, 1999, 112 (1), 3.
  • [2] BURILLO P., BUSTINCE H., Entropy on intuitionistic fuzzy sets and on interval-valued fuzzy sets, Fuzzy Sets and Systems, 1996, 78 (3), 305.
  • [3] GRZEGORZEWSKI P., Distances between intuitionistic fuzzy sets and/or interval-valued fuzzy sets based on Hausdorff metric, Fuzzy Sets and Systems, 2004, 148 (2), 319.
  • [4] JU H., YUAN X.H., Similarity measures on interval-valued fuzzy sets and application to pattern recognition, [in:] D.Y. Cao (Ed.), Fuzzy Information and Engineering, Springer-Verlag, Heidelberg 2007, 384.
  • [5] KAUFMANN A., Introduction to the Theory of Fuzzy Subsets, Academic Press, New York 1975.
  • [6] KREINOVICH V., KOSHELEVA O., Towards dynamical systems approach to fuzzy clustering, [in:] D.A. Viattchenin (Ed.), Developments in Fuzzy Clustering, VEVER Publishing House, Minsk 2009, 10.
  • [7] LAI T.-C., SOTSKOV Y.N., Sequencing with uncertain numerical data for makespan minimization, Journal of the Operations Research Society, 1999, 50 (3), 230.
  • [8] ORLOVSKY S.A., Problems of Decision Making for Fuzzy Initial Information, Nauka, Moscow 1981 (in Russian).
  • [9] SOTSKOV Y.N., SHILAK A.N., Minimization of project-network with given bounds on permissible values of activity durations, Technical Report No. 2, Institute of Engineering Cybernetics of the National Academy of Sciences of Belarus, Minsk 2000 (in Russian).
  • [10] SOTSKOV Y.N., SHILAK A.N., Minimization of project-network with given bounds on activity durations, [in:] B. Fleischmann, R. Lasch, U. Dengs, W. Domschke (Eds.), Operations Research Proceedings 2000, Springer-Verlag, Heidelberg 2001, 384.
  • [11] VIATTCHENIN D.A., Detecting outliers in interval-valued data using heuristic possibilistic clustering, Journal of Computer Science and Control Systems, 2012, 5 (2), 39.
  • [12] VIATTCHENIN D.A., A Heuristic Approach to Possibilistic Clustering. Algorithms and Applications, Springer-Verlag, Heidelberg 2013.
Typ dokumentu
Identyfikator YADDA

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.