Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 2020, Issue 5, Pages 26–40
DOI: https://doi.org/10.31857/S0005231020050037
(Mi at15482)
 

Topical issue

Structural-parametric optimization of a complex of intersecting sets of operations under nonstationary demand

A. B. Dolguia, G. M. Levinb, B. M. Rozinb

a IMT Atlantique, LS2N-CNRS, Nantes, France
b United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus
References:
Abstract: We consider the problem of optimizing the production planning with aggregation of operations and selection of their intensities for batch processing of a given family of products on a multi-position reconfigurable production system at specified (time) intervals under nonstationary deterministic demand. Backlog is allowed. Aggregation of operations is invariable for the entire planning period, the composition of the batch and intensities of processing operations are invariable within an interval, but can vary from interval to interval. As the objective function we use the planned profit. Investment costs are determined by the aggregation option. Time and material costs for the manufacturing of a batch of products during each interval depend on the aggregation of operations, intensities of their implementation, and costs of reconfiguring the equipment. Logistic costs include the cost of storing unclaimed products, lost added value, and penalties for unmet demand. We propose a three-level decomposition method for solving the problem.
Keywords: production system, product batch, aggregation of operations, processing intensity, nonstationary demand, profit maximization, decomposition method.
Funding agency Grant number
Région Pays de la Loire
This work was supported by the Region Pays de la Loire, France.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 17.07.2019
Revised: 12.10.2019
Accepted: 28.11.2019
English version:
Automation and Remote Control, 2020, Volume 81, Issue 5, Pages 791–802
DOI: https://doi.org/10.1134/S0005117920050021
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. B. Dolgui, G. M. Levin, B. M. Rozin, “Structural-parametric optimization of a complex of intersecting sets of operations under nonstationary demand”, Avtomat. i Telemekh., 2020, no. 5, 26–40; Autom. Remote Control, 81:5 (2020), 791–802
Citation in format AMSBIB
\Bibitem{DolLevRoz20}
\by A.~B.~Dolgui, G.~M.~Levin, B.~M.~Rozin
\paper Structural-parametric optimization of a complex of intersecting sets of operations under nonstationary demand
\jour Avtomat. i Telemekh.
\yr 2020
\issue 5
\pages 26--40
\mathnet{http://mi.mathnet.ru/at15482}
\crossref{https://doi.org/10.31857/S0005231020050037}
\elib{https://elibrary.ru/item.asp?id=43277926}
\transl
\jour Autom. Remote Control
\yr 2020
\vol 81
\issue 5
\pages 791--802
\crossref{https://doi.org/10.1134/S0005117920050021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000531703500002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85084266055}
Linking options:
  • https://www.mathnet.ru/eng/at15482
  • https://www.mathnet.ru/eng/at/y2020/i5/p26
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:129
    Full-text PDF :21
    References:16
    First page:5
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024