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.
Similar content being viewed by others
References
Severnyi zavoz, Wikipedia, http://ru.wikipedia.org/wiki/Severnyi_zavoz (accessed on 31.05.2013).
Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-Stage Systems), Moscow: Nauka, 1984.
Tanaev, V.S., Sotskov, Yu.N., and Strusevich, V.A., Teoriya raspisanii. Mnogostadiinye sistemy (Scheduling Theory. Multi-Stage Systems), Moscow: Nauka, 1989.
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.
Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literatura, 1960.
Pinedo, M.L., Scheduling: Theory, Algorithms, and Systems, New York: Springer, 2008.
Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Nauka, 2007.
Tanaev, V.S. and Shkurba, V.V., Vvedenie v teoriyu raspisanii (Introduction to Scheduling Theory), Moscow: Nauka, 1975.
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.
Author information
Authors and Affiliations
Corresponding author
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
About this article
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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117914070078