Abstract
The paper regards the problem of maximizing the total volume of homogeneous products delivered from the point of production to the distribution center, in the presence of a significant number of practical restrictions on the schemes of technological cycles. Considered issue allows assessing the consequences of economic downturns, caused by the spread of infections. For this task, formalization is constructed in the form of a binary linear programming problem based on discretization of the planning horizon. The adequacy of the proposed formalization is illustrated by a test example of relatively small dimension. The main approaches are described that make it possible both to obtain an exact solution of the considered problem (for special cases) and to construct approximations.
Publisher
Keldysh Institute of Applied Mathematics
Reference9 articles.
1. Лазарев А.А., Гафаров Е.Р. Теория расписаний. Задачи и алгоритмы. М.: МГУ, 2011.
2. Nouri H.E., Driss O.B., Ghédira K. A Classification Schema for the Job Shop Scheduling Problem with Transportation Resources: State-of-the-Art Review // Artificial Intelligence Perspectives in Intelligent Systems. Proceedings of the 5th Computer Science On-line Conference 2016 (CSOC2016). Vol. 1.
3. Афраймович Л.Г., Катеров А.С., Прилуцкий М.Х. Многоиндексные транспортные задачи с 1-вложенной структурой // Автоматика и телемеханика. 2016. № 11. С. 18-42.
4. Аничкин А.С., Семенов В.А. Современные модели и методы теории расписаний // Труды ИСП РАН. 2014. Т. 26, Вып. 3. С. 5-50.
5. Бахтин В.А., Богданов И.П., Осипов В.П., Рыков Ю.Г., Смирнов А.А., Судаков В.А. Оптимизация перевозок однородной продукции между оптовыми складами // Препринты ИПМ им. М.В.Келдыша. 2018. № 65. 26 с. doi:10.20948/prepr-2018-65.