Use of metric spaces in optimal calendar planning

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

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 journal › Article › peer-review

1 Scopus citations

Abstract

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 π = (π₁, ..., π_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 language	English
Pages (from-to)	164-173
Number of pages	10
Journal	Avtomatika i Telemekhanika
Issue number	9
State	Published - 1 Jan 2002
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering

Cite this

@article{9358634948a04f1494f82bcce4f5f96e,

title = "Use of metric spaces in optimal calendar planning",

abstract = "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.",

author = "Golenko-Ginzburg, {D. I.} and Lyubkin, {S. M.} and Rezer, {V. S.} and Sitnyakovskij, {S. L.}",

year = "2002",

month = jan,

day = "1",

language = "English",

pages = "164--173",

journal = "Avtomatika i Telemekhanika",

issn = "0005-2310",

publisher = "Izdatel'stvo Nauka",

number = "9",

}

TY - JOUR

T1 - Use of metric spaces in optimal calendar planning

AU - Golenko-Ginzburg, D. I.

AU - Lyubkin, S. M.

AU - Rezer, V. S.

AU - Sitnyakovskij, S. L.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036414435&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036414435

SN - 0005-2310

SP - 164

EP - 173

JO - Avtomatika i Telemekhanika

JF - Avtomatika i Telemekhanika

IS - 9

ER -

Use of metric spaces in optimal calendar planning

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this