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”

Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319183" target="_blank" >RIV/00216208:11320/15:10319183 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-27947-3_10" target="_blank" >http://dx.doi.org/10.1007/978-3-319-27947-3_10</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-27947-3_10" target="_blank" >10.1007/978-3-319-27947-3_10</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

  • Original language description

    One of the problems of real-life production scheduling is dynamics of manufacturing environments with new production demands coming and breaking machines during the schedule execution. Simple rescheduling from scratch in response to unexpected events mayrequire excessive computation time. Moreover, the recovered schedule may deviate prohibitively from the ongoing schedule. This paper studies two methods how to modify a schedule in response to a machine breakdown: right-shift of affected activities andsimple temporal network recovery. The importance is put on the speed of the rescheduling procedures as well as on the minimum deviation from the original schedule. In addition, this paper models the problem as a Mixed Integer Program and compares the proposed algorithms to the model using the mosek optimizer. The scheduling model is motivated by the FlowOpt project, which is based on Temporal Networks with Alternatives and supports simple temporal constraints between the activities.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA15-19877S" target="_blank" >GA15-19877S: Automated Knowledge and Plan Modeling for Autonomous Robots</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • 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

    Agents and Artificial Intelligence 7th International Conference, ICAART 2015,Revised Selected Papers

  • ISBN

    978-3-319-27946-6

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    22

  • Pages from-to

    185-206

  • Publisher name

    Springer International Publishing

  • Place of publication

    Switzerland

  • Event location

    Lisbon, Portugal

  • Event date

    Jan 10, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article