RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
Prikl. Diskr. Mat.,
2016
Number 3(33),
Pages
67–77
(Mi pdm555)
This article is cited in
4
papers
Applied Graph Theory
Chain structures in schedules tasks
A. M. Magomedov
Dagestan State University, Makhachkala, Russia
Abstract:
Some algorithms for constructing the following shedules are developed: 1) one-processor schedule with a partial precedence, 2) a multiprocessor schedule without idle time and conditions of partial precedence.
Keywords:
schedule, graph, algorithm, colors, complexity.
UDC:
681.142.1+621.316
DOI:
10.17223/20710410/33/5
Fulltext:
PDF file (854 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026