Application of computational graph to scheduling problems under uncertainty
Informacionnye Tehnologii · 09.05.2026 · 32 (5) · 236-242
DOI: 10.17587/it.32.236-242 ↗Kurz gefasst
Fachartikel in der Zeitschrift Informacionnye Tehnologii, online erschienen am 09.05.2026. Verfasst von M. V. Knyazeva und 2 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben.
Abstract (Originalsprache)
This paper considers the problem of deploying a computational graph under uncertainty for an example production scheduling problem with time intervals. An estimated level of demand for the product is given for each planning period, and the level of production during time interval t can be used to cover the demand, which may differ for different time periods. The approach proposed in the work allows developing a production program that minimizes the total cost of production, and satisfies demand fully and on time.
Zitieren
APA
Knyazeva, M. V., Bozhenyuk, A. V., & Rozenberg, I. N. (2026). Application of computational graph to scheduling problems under uncertainty. Informacionnye Tehnologii, 32(5), 236-242. https://doi.org/10.17587/it.32.236-242
Vancouver
Knyazeva MV, Bozhenyuk AV, Rozenberg IN. Application of computational graph to scheduling problems under uncertainty. Informacionnye Tehnologii. 2026;32(5):236-242. doi:10.17587/it.32.236-242
BibTeX
@article{Knyazeva2026,
author = {Knyazeva, M. V. and Bozhenyuk, A. V. and Rozenberg, I. N.},
title = {Application of computational graph to scheduling problems under uncertainty},
journal = {Informacionnye Tehnologii},
year = {2026},
volume = {32},
number = {5},
pages = {236--242},
doi = {10.17587/it.32.236-242}
}
EUVIMED