|
This article is cited in 4 scientific papers (total 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.
Citation:
A. M. Magomedov, “Chain structures in schedules tasks”, Prikl. Diskr. Mat., 2016, no. 3(33), 67–77
Linking options:
https://www.mathnet.ru/eng/pdm555 https://www.mathnet.ru/eng/pdm/y2016/i3/p67
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 201 | References: | 31 |
|