IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i16p5905-5924.html
   My bibliography  Save this article

Optimal planning and scheduling of information processes during interaction among mobile objects

Author

Listed:
  • Sokolov Boris
  • Ushakov Vitaly
  • Zakharov Valerii

Abstract

The purpose of the research was to improve the quality of information process control in the interaction of mobile object grouping. This proposal is based on developing and implementing new combined models with algorithms for optimal planning and scheduling of information processes during interaction among mobile objects. The proposed approach would guarantee the required level of aircraft maintenance at the airport. The novel aspect of the proposed solution is that it divides the spatially distributed task of selecting a plan and a schedule for information processes in mobile objects into two subtasks, describing the spatial and temporal features of the original task. The spatial component of the original problem is described as a static model. Using this model, the optimal distribution of information operations over the resources of mobile objects is carried out without binding these operations to time. The time component is described as a dynamic model, within which the information operations are tied to time and the corresponding resources. Examples of construction and research of synthesized plans and schedules are given.Abbreviations: DM, Dynamic model; FIFO, First-In First-Out; Gr, Grouping; HSC, Hardware and software complex; ITS, Intelligent Transport System; IP, Information Processes; MO, Mobile object; PC, Programmed control; SM, Static model; SMS, Special mathematic support; LDM, Logical-dynamic models

Suggested Citation

  • Sokolov Boris & Ushakov Vitaly & Zakharov Valerii, 2024. "Optimal planning and scheduling of information processes during interaction among mobile objects," International Journal of Production Research, Taylor & Francis Journals, vol. 62(16), pages 5905-5924, August.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:16:p:5905-5924
    DOI: 10.1080/00207543.2024.2302388
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2302388
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2302388?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:62:y:2024:i:16:p:5905-5924. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.