Advertisement

Automation and Remote Control

, Volume 75, Issue 7, pp 1257–1266 | Cite as

The problems of servicing of the binary object flow in system with refillable storage component

  • D. I. KoganEmail author
  • A. S. Kuimova
  • Yu. S. Fedosenko
Topical Issue

Abstract

We consider a model for single-stage servicing of a finite deterministic stream of objects by a processor with a storage component, a reservoir of bounded capacity. The stream consists of a stream of objects that fill the reservoir and a stream of objects that are filled from the reservoir. With each object, we associate a linear individual penalty function for the time it spends in the servicing system. We study the problem of constructing a schedule that minimizes total penalty over all objects in the stream. Our algorithms are based on dynamic programming, branch and bound techniques, and their joint implementation. We show results of computational experiments.

Keywords

Remote Control Open Vertex Time Moment Joint Implementation Storage Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Severnyi zavoz, Wikipedia, http://ru.wikipedia.org/wiki/Severnyi_zavoz (accessed on 31.05.2013).
  2. 2.
    Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-Stage Systems), Moscow: Nauka, 1984.Google Scholar
  3. 3.
    Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multi-Stage Systems), Moscow: Nauka, 1989.Google Scholar
  4. 4.
    Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.zbMATHGoogle Scholar
  5. 5.
    Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literatura, 1960.zbMATHGoogle Scholar
  6. 6.
    Pinedo, M.L., Scheduling: Theory, Algorithms, and Systems, New York: Springer, 2008.Google Scholar
  7. 7.
    Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.Google Scholar
  8. 8.
    Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Nauka, 2007.Google Scholar
  9. 9.
    Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1975.Google Scholar
  10. 10.
    Kogan, D.I. and Fedosenko, Yu.S., The Dispatching Problem: Analysis of Computational Complexity and Polynomially Solvable Subclasses, Diskret. Mat., 1966, vol. 8, no. 3, pp. 135–147.CrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  • D. I. Kogan
    • 1
    Email author
  • A. S. Kuimova
    • 2
  • Yu. S. Fedosenko
    • 2
  1. 1.Moscow State University of Instrument Engineering and InformaticsMoscowRussia
  2. 2.Volga State Academy of River TransportNizhni NovgorodRussia

Personalised recommendations