Skip to main content
Log in

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

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Severnyi zavoz, Wikipedia, http://ru.wikipedia.org/wiki/Severnyi_zavoz (accessed on 31.05.2013).

  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. 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. 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.

    MATH  Google Scholar 

  5. Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literatura, 1960.

    MATH  Google Scholar 

  6. Pinedo, M.L., Scheduling: Theory, Algorithms, and Systems, New York: Springer, 2008.

    Google Scholar 

  7. Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.

    Google Scholar 

  8. Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Nauka, 2007.

    Google Scholar 

  9. Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1975.

    Google Scholar 

  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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. I. Kogan.

Additional information

Original Russian Text © D.I. Kogan, A.S. Kuimova, Yu.S. Fedosenko, 2014, published in Avtomatika i Telemekhanika, 2014, No. 7, pp. 122–135.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kogan, D.I., Kuimova, A.S. & Fedosenko, Y.S. The problems of servicing of the binary object flow in system with refillable storage component. Autom Remote Control 75, 1257–1266 (2014). https://doi.org/10.1134/S0005117914070078

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914070078

Keywords

Navigation