Skip to main content
Log in

Stationary object servicing dispatching problems in a one-dimensional processor working zone

  • System Analysis and Operations Research
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider a system where servicing of a collection of stationary objects distributed inside a one-dimensional zone is done by a moving processor. One-time servicing of each object must be performed during two runs of the processor, direct and reverse. Servicing of any object cannot begin before a predefined time moment; each object is also associated with an individual penalty which is a monotone increasing function of the moment when servicing ends. For the resulting optimization problems, we propose algorithms based on dynamic programming, give examples of their implementation, show results of numerical experiments; we study the computational complexity of these algorithms and the problems themselves.

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. Kogan, D.I., Fedosenko, Yu.S., and Shlyugaev, A.Yu., The Single-Stage Servicing Problem for Mining Complexes in a Large-Scale Aquatic Region, Proc. V Moscow Int. Conf. on Operations Research (ORM2007), Moscow: MAKS Press, 2007, pp. 60–62.

    Google Scholar 

  2. Kogan, D.I., Fedosenko, Yu.S., and Dunichkina, N.A., Bicriterial Servicing Problems for Stationary Objects in a One-Dimensional Working Zone of a Processor, Autom. Remote Control, 2012, vol. 73, no. 10, pp. 1667–1679.

    Article  MathSciNet  MATH  Google Scholar 

  3. Podinovskii, V.V. and Nogin, V.D., Pareto-optimal’nye resheniya mnogokriterial’nykh zadach (Pareto Optimal Solutions of Multicriterial Problems), Moscow: Fizmatlit, 2007.

    Google Scholar 

  4. Villareal, B. and Karwan, M., Multicriterial Dynamic Programming with an Application to the Integer Case, J. Optim. Theory Appl., 1982, vol. 38, no. 1, pp. 43–69.

    Article  MathSciNet  Google Scholar 

  5. Kogan, D.I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya (Dynamic Programming and Discrete Multicriterial Optimization), N. Novgorod: Nizhegorod. Univ., 2005.

    Google Scholar 

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

  7. Kogan, D.I. and Fedosenko, Yu.S., Optimal Servicing Strategy Design Problems for Stationary Objects in a One-dimensional Working Zone of a Processor, Autom. Remote Control, 2010, vol. 71, no. 10, pp. 2058–2069.

    Article  MathSciNet  MATH  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.M. Pushkin, N.A. Dunichkina, Yu.S. Fedosenko, 2016, published in Avtomatika i Telemekhanika, 2016, No. 4, pp. 67–83.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kogan, D.I., Pushkin, A.M., Dunichkina, N.A. et al. Stationary object servicing dispatching problems in a one-dimensional processor working zone. Autom Remote Control 77, 604–616 (2016). https://doi.org/10.1134/S0005117916040068

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation