Finding the best versions of schedule for order fulfillment at food companies

dc.contributor.authorHrybkov, Serhii
dc.contributor.authorKharkyanen, Olena
dc.contributor.authorGladka, Yuliya
dc.date.accessioned2021-01-20T14:17:57Z
dc.date.available2021-01-20T14:17:57Z
dc.date.issued2020
dc.description.abstractThe article suggests a mathematical model of the multicriteria problem of formation of production tasks and operational-calendar plans at food companies, taking into account their specific features. The research was carried out, the bat algorithm and its modifications were adjusted and tested. The choice of the bat algorithm based on the Levy flight random search strategy is substantiated. This approach provides the formation of new and alternative plans for orders fulfillment at a food company, taking into account the proposed mathematical model.uk_UA
dc.identifier.citationHrybkov, S. Finding the best versions of schedule for order fulfillment at food companies / S. Hrybkov, О. Kharkianen, Y. Gladka // MIND JOURNAL. – 2020. – № 9. – P. 1–12.uk_UA
dc.identifier.urihttps://dspace.nuft.edu.ua/handle/123456789/32432
dc.language.isoenuk_UA
dc.subjectmathematical modeluk_UA
dc.subjectматематична модельuk_UA
dc.subjectplanning of the orders fulfillmentuk_UA
dc.subjectпланування виконання замовленьuk_UA
dc.subjectthe bat algorithmuk_UA
dc.subjectалгоритм кажанаuk_UA
dc.subjectкафедра інформаційних технологій, штучного інтелекту і кібербезпекиuk_UA
dc.titleFinding the best versions of schedule for order fulfillment at food companiesuk_UA
dc.typeArticleuk_UA

Файли

Контейнер файлів

Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
Hrybkov1.pdf
Розмір:
601.45 KB
Формат:
Adobe Portable Document Format
Опис:

Ліцензійна угода

Зараз показуємо 1 - 1 з 1
Ескіз недоступний
Назва:
license.txt
Розмір:
1.71 KB
Формат:
Item-specific license agreed upon to submission
Опис:

Колекції