All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Switched max-plus linear-dual inequalities: Application in scheduling of multi-product processing networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00564906" target="_blank" >RIV/67985840:_____/22:00564906 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ifacol.2022.10.343" target="_blank" >http://dx.doi.org/10.1016/j.ifacol.2022.10.343</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ifacol.2022.10.343" target="_blank" >10.1016/j.ifacol.2022.10.343</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Switched max-plus linear-dual inequalities: Application in scheduling of multi-product processing networks

  • Original language description

    P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by max-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamical inequalities in the max-plus algebra and its dual, the min-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operations, each corresponding to an LDI, according to an infinite sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the schedule is fixed and periodic. We show that SLDIs can model single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose an algorithm to compute minimum and maximum cycle times for these processes that improves the time complexity of other existing approaches.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20205 - Automation and control systems

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    IFAC-PapersOnLine. Volume 55, Issue 28 - Proceedings of 16th IFAC Workshop on Discrete Event Systems WODES 2022

  • ISBN

  • ISSN

    2405-8963

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    196-203

  • Publisher name

    Elsevier

  • Place of publication

    Amsterdam

  • Event location

    Prague

  • Event date

    Sep 7, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000877003700028