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.
|Number of pages||10|
|Journal||Avtomatika i Telemekhanika|
|State||Published - 1 Jan 2002|
ASJC Scopus subject areas
- Control and Systems Engineering