Skip to main content
Log in

Accounting for the time characteristics of a class of scheduling problems for moving processor

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

Abstract

Consideration was given to scheduling service of the stationary objects distributed over a one-dimensional zone by a processor moving within this zone. Servicing is performed in the course of two processor passes, direct, from the initial to the final point of the zone, and reverse. Schedules are designed with account for the early start of service prescribed to the objects and/or the deadlines of service completion. For the problems accounting for the early timing of service start, studied were the questions of finding the criterion-optimal time schedules. For the problems with prescribed deadlines, existence of schedules meeting such deadlines was investigated.

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

  2. Dunichkina, N.A., Kogan, D.I., Pushkin, A.M., and Fedosenko, Yu.S., On a Model of Processor-servicing of Stationary Objects Moving in a One-dimensional Working Zone, in Proc. XII All-Russian Conf. Control Probl., Moscow: IPU RAN, 2014, pp. 5044–5052.

    Google Scholar 

  3. Bellman, R. and Dreifus, S., Applied Dynamic Programming, Princeton: Princeton Univ. Press, 1962. Translated under the title Prikladnye problemy dinamicheskogo programmirovaniya, Moscow: Nauka, 1965.

    MATH  Google Scholar 

  4. Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie: modeli i vychislitel’nye algoritmy (Introduction to Applied Discrete Programming: Models and Computational Algorithms), Moscow: Fizmatlit, 2007, 2nd. ed.

    Google Scholar 

  5. Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    Google Scholar 

  6. Villareal, B. and Karwan, M., Multicriteria 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 

  7. Kogan, D.I., Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya (Dynamic Programming and Discrete Multicriterial Optimization), Nizhny Novgorod: NNGU, 2005.

    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, I.Kh. Sigal, 2015, published in Avtomatika i Telemekhanika, 2015, No. 12, pp. 121–134.

This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kogan, D.I., Sigal, I.K. Accounting for the time characteristics of a class of scheduling problems for moving processor. Autom Remote Control 76, 2190–2200 (2015). https://doi.org/10.1134/S0005117915120085

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation