Use of metric spaces in optimal calendar planning

D. I. Golenko-Ginzburg, S. M. Lyubkin, V. S. Rezer, S. L. Sitnyakovskij

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Solution of the optimal calendar planning problem with n components and m machines is an optimal scheduling of components putting onto machines. The scheduling is governed by optimal set of m permutations from n objects, i.e. by the vector-permutation π = (π1, ..., πm). To find the optimal calendar scheduling, the conception of metric space in admissible schedules set and the substantiated methodology of the optimal schedule search are used.

Original languageEnglish
Pages (from-to)164-173
Number of pages10
JournalAvtomatika i Telemekhanika
Issue number9
StatePublished - 1 Jan 2002
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering


Dive into the research topics of 'Use of metric spaces in optimal calendar planning'. Together they form a unique fingerprint.

Cite this