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”

Robust Scheduling for Manufacturing with Energy Consumption Limits

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F16%3A00304025" target="_blank" >RIV/68407700:21730/16:00304025 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/16:00304025

  • Result on the web

    <a href="http://dx.doi.org/10.1109/ETFA.2016.7733513" target="_blank" >http://dx.doi.org/10.1109/ETFA.2016.7733513</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ETFA.2016.7733513" target="_blank" >10.1109/ETFA.2016.7733513</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Robust Scheduling for Manufacturing with Energy Consumption Limits

  • Original language description

    Our work considers a scheduling problem in which manufacturing companies with large energy demand are obligated to comply with total energy consumption limits in specified time intervals, e.g. 15 minutes. Moreover, the problem is complicated by the fact that in reality the production schedules are not executed exactly as planned due to unexpected disturbances such as machine breakdowns or material unavailability. Therefore, the goal is to find a robust schedule which guarantees that the energy consumption limits are not violated if the start times of operations are arbitrary delayed within a given limit. To circumvent the problem of an exponential number of constraints in the mixed integer linear programming formulation, we propose an exact algorithm based on a decomposition approach. The decomposition approach exploits the fact that the robustness of a given schedule can be checked in a pseudo-polynomial time. We evaluated the proposed algorithm on instances with varying bound of the start times delays

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • 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

    Proceedings of the IEEE International Conference on Emerging Technologies and Factory Automation

  • ISBN

    978-1-5090-1314-2

  • ISSN

    1946-0740

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

  • Publisher name

    IEEE

  • Place of publication

    Piscataway, NJ

  • Event location

    Berlín

  • Event date

    Sep 6, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000389524200021