|
Computer science
Mathematical model of the integrated supply chain
V. M. Burea, V. V. Karelina, L. N. Polyakovaa, A. V. Flegontovab a St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation
b Herzen State Pedagogical University of Russia, 48, nab. r. Moika, St. Petersburg, 191186, Russian Federation
Abstract:
Supply chain management occupies a very
important place in the activities of any company in a globalized
economy and increasing competition in the market. The main goal of
supply chain management is to coordinate the work of firms —
suppliers of raw materials, firms-manufacturers and trading
companies selling goods on the market. The article studies a
continuous mathematical model describing the interaction of the
listed firms under conditions of a non-constant rate of supply of
some kind of raw materials. It is assumed that the speed of supply
of these raw materials can take two possible values, the choice of
which is determined by the manufacturer, the manufacturer, the
higher rate of supply of raw materials corresponds to the
intensive production variant of the product, the slower speed
corresponds to the usual production variant. Mathematical modeling
is carried out using differential equations. An optimization
problem is formulated, which consists in choosing the time point
for switching the mode of supply of raw materials from the
intensive version to the normal version in order to maximize the
income of the manufacturer-manufacturer.
Keywords:
stock level of the goods, multi-echelon supply chain, production.
Received: May 15, 2019 Accepted: June 6, 2019
Citation:
V. M. Bure, V. V. Karelin, L. N. Polyakova, A. V. Flegontov, “Mathematical model of the integrated supply chain”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 15:3 (2019), 353–361
Linking options:
https://www.mathnet.ru/eng/vspui413 https://www.mathnet.ru/eng/vspui/v15/i3/p353
|
Statistics & downloads: |
Abstract page: | 128 | Full-text PDF : | 23 | References: | 17 | First page: | 4 |
|