Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2024, Volume 31, Issue 4, Pages 134–150
DOI: https://doi.org/10.33048/daio.2024.31.798 (Mi da1364) 		 
An algorithm to search a solution to the production scheduling problem

N. P. Savenkovaa, A. Yu. Mokinab, A. A. Dryazhenkovab, L. A. Artemyevaab

a Lomonosov Moscow State University, 1 Bld. 52 Leninskie Gory, 119991 Moscow, Russia
b Moscow Centre of Fundamental and Applied Mathematics, 1 Leninskie Gory, 119991 Moscow, Russia
Full-text PDF (494 kB)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2024.31.798
Abstract: A mathematical model of raw materials processing is proposed. The production consists of units processing raw materials, storage tanks, and mixing units. The processing units are assumed to operate in one of two known modes. Switching from one mode to another can be carried out no more than once. The problem of finding the optimal capacity of production at each of units, as well as the time of switching units from one operating mode to another is formulated in a form of discrete optimization problem. The solution of this problem should ensure an achievement of the specified production plan. A method for its solution is proposed, including a transition to a convex statement, as well as an algorithm for discretizing the obtained control. Tab. 2, illustr. 4, bibliogr. 13.
Keywords: task scheduling, material balance, optimal control, discrete optimization, quadratic programming.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation
This research is supported by ongoing funding of the organizations designated by the authors on the first page of this paper.
Received: 22.03.2024
Revised: 27.04.2024
Accepted: 22.06.2024
Document Type: Article
UDC: 519.8
Language: Russian
Citation: N. P. Savenkova, A. Yu. Mokin, A. A. Dryazhenkov, L. A. Artemyeva, “An algorithm to search a solution to the production scheduling problem”, Diskretn. Anal. Issled. Oper., 31:4 (2024), 134–150; J. Appl. Industr. Math., 18:4 (2024), 840–850
Citation in format AMSBIB
\Bibitem{SavMokDry24}
\by N.~P.~Savenkova, A.~Yu.~Mokin, A.~A.~Dryazhenkov, L.~A.~Artemyeva
\paper An~algorithm to~search a~solution to~the~production scheduling problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2024
\vol 31
\issue 4
\pages 134--150
\mathnet{http://mi.mathnet.ru/da1364}
\transl
\jour J. Appl. Industr. Math.
\yr 2024
\vol 18
\issue 4
\pages 840--850
Linking options:
  • https://www.mathnet.ru/eng/da1364
  • https://www.mathnet.ru/eng/da/v31/i4/p134
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:84
    Full-text PDF :26
    References:16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025