Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA15-19877S" target="_blank" >GA15-19877S: Automatické modelování znalostí a plánů pro autonomní roboty</a><br>

Návaznosti

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

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-3-319-27946-6

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

22

Strana od-do

185-206

Název nakladatele

Springer International Publishing

Místo vydání

Switzerland

Místo konání akce

Lisbon, Portugal

Datum konání akce

10. 1. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—