Abstract
We consider a servicing model for a stationary processor that services a finite collection of objects arriving in packets. A packet is considered to be serviced if all objects in this packet have finished servicing. For each packet, we know an individual penalty function which is monotone increasing from zero with the time a packet spends in the servicing system. We pose and study optimization problems with one and two criteria for evaluating the quality of servicing strategies. With the scheme shown in the paper, we construct a general solving algorithm based on the principle of dynamic programming and show examples of its implementation.
Similar content being viewed by others
References
Spravochnik po seriinym transportnym sudam (Handbook of Commercial Transport Ships), Moscow: Transport, 1975, vol. 4.
Spravochnik po seriinym rechnym sudam (Handbook of Commercial River Ships), Moscow: Transport, 1981, vol. 7.
Kozyrev, V.K., Gruzovedenie (Cargo Handling), Moscow: Transport, 1991.
Bessonov, E.A., Entsiklopediya gidromekhanizirovannykh rabot. Slovar’–spravochnik (Encyclopedia of Hydromechanized Works. Handbook), Moscow: 1989.ru, 2005.
Umang, N., From Container Terminals to Bulk Ports: Models and Algorithms for Integrated Planning and Robust Scheduling, PhD Thesis, école Polytechnique Fédérale de Lausanne, 2014.
Kogan, D.I. and Fedosenko, Yu.S., Optimal Servicing Strategy Design Problems for Stationary Objects in a One-Dimensional Working Zone of a Processor Scheduling Problems On a Single Machine, Autom. Remote Control, 2010, vol. 71, no. 10, pp. 2058–2069.
Kogan, D.I., Fedosenko, Yu.S., and Dunichkina, N.A., Bicriteriial Servicing Problems for Stationary Objects a One-Dimensional Working Zone of a Processor, Autom. Remote Control, 2012, vol. 73, no. 10, pp. 1667–1679.
Kogan, D.I., Kuimova, A.S., and Fedosenko, Yu.S., The Problems of Servicing of the Binary Object Flow in System with Refillable Storage Component, Autom. Remote Control, 2014, vol. 75, no. 7, pp. 1257–1266.
Kogan, D.I. and Sigal, I.Kh., Accounting for the Time Characteristics of a Class of Scheduling Problems for Moving Processor, Autom. Remote Control, 2015, vol. 76, no. 12, pp. 2190–2200.
Kogan, D.I., Pushkin, A.M., Dunichkina, N.A., and Fedosenko, Yu.S., Stationary Object Servicing Dispatching Problems in a One-Dimensional ProcessorWorking Zone, Autom. Remote Control, 2016, vol. 77, no. 4, pp. 604–616.
Severny Zavoz (Delivery of Goods to Northern Territories), http://ru.wikipedia.org/wiki/Severnyi zavoz (accessed on 19.03.2016).
Kogan, D.I. and Fedosenko, Yu.S., The Discretization Problem: Analysis of Computational Complexity, and Polynomially Solvable Subclasses, Discret. Math. Appl., 1996, vol. 6, no. 5, pp. 435–447.
Bellman, R.E. and Dreyfus, S.E., Applied Dynamic Programming, Princeton: Princeton Univ. Press, 1962. Translated under the title Prikladnye zadachi dinamicheskogo programmirovaniya, Moscow: Nauka, 1965.
Kogan, D.I. and Fedosenko, Yu.S., A General Scheme for Implementing Dynamic Programming Algorithms in Synthesis Problems for Strategies of Single-Processor Servicing of a Flow of Objects, Sb. Nauchn. Tr. Mezhd. Nauchn.-Tekhn. Konf. “Informatika i tekhnologii. Innovatsionnye tekhnologii v promyshlennosti i informatike” (MNTK IVT-2016) (Proc. Intl. Sci.-Tech. Conf. “Computer Science and Technologies. Innovative Technologies in Industry and Computer Science” (ISTC IVT-2016)), Moscow: MIREA, 2016.
Kogan, D.I., Trukhina, M.A., Fedosenko, Yu.S., et al., Single-Processor Servicing of a Flow of Packets of Objects: Models and Synthesis of Optimal Strategies, Vestnik MGTU MIREA, 2015, vol. II, no. 3, pp. 108–117.
Pinedo, M.L., Scheduling. Theory, Algorithms, and Systems, New York: Springer, 2008.
Kogan, D.I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya (Dynamic Programming and Discrete Multicriterial Optimization), Nizhny Novgorod: NNGU im. N.I. Lobachevskogo, 2005.
Podinovskii, V.V. and Nogin, V.D., Pareto-optimal’nye resheniya mnogokriterial’nykh zadach (Pareto Optimal Solutions of Multicriterial Problems), Moscow: Fizmatlit, 2007.
Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translation under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Tanaev, V.S., Gordon, V.S., and Shafranskii, Ya.M., Teoriya raspisanii. Odnostadiinye sistemy (Scheduling Theory. Single-Stage Systems), Moscow: Fizmatlit, 1984.
Trukhina, M.A., Fedosenko, Yu.S., and Sheyanov, A.V., Control over the Servicing of a Multiflow of Objects with a Mobile Processor, Sb. “Diskretnye modeli v teorii upravlyayuchshikh sistem,” (Proc. IX Intl. Conf. “Discrete Models in the Theory of Controlling Systems,”) Moscow: Mosk. Gos. Univ., 2015, pp. 242–244.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.I. Kogan, M.A. Trukhina, Yu.S. Fedosenko, A.V. Sheyanov, 2016, published in Avtomatika i Telemekhanika, 2016, No. 11, pp. 142–157.
This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Kogan, D.I., Trukhina, M.A., Fedosenko, Y.S. et al. Models and optimization problems for single-processor servicing of packets of objects. Autom Remote Control 77, 1994–2005 (2016). https://doi.org/10.1134/S0005117916110096
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117916110096