Benders Decomposition in SMT for Rescheduling of Hierarchical Workflows

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10372055" target="_blank" >RIV/00216208:11320/17:10372055 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.schedulingconference.org/previous/publications/download/index.php?key=2017-295-310-P&filename=mista.bib" target="_blank" >http://www.schedulingconference.org/previous/publications/download/index.php?key=2017-295-310-P&filename=mista.bib</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Benders Decomposition in SMT for Rescheduling of Hierarchical Workflows

Popis výsledku v původním jazyce

Real-life scheduling has to face many difficulties such as dynamic manufacturing environments with failing resources and urgent orders arriving during the schedule execution. Complete rescheduling, considering only the original objective function, in response to unexpected events occurring on the shop floor may yield schedules that are prohibitively different from the original schedule, which may lead to extra costs due to impacts on other planned activities. Our novel approach in the area of predictive-reactive scheduling is to allow for substitution of jobs which cannot be executed with a set of alternative jobs. Hence, this paper describes the model of hierarchical work-flows suitable for dealing with unforeseen events using the possibility of alternative processes and proposes a new approach, based on the Satisability Modulo Theories (SMT) formalism, to recover an ongoing schedule from a resource failure. The experimental results show that the SMT approach using Benders decomposition is orders of magnitude faster than a Constraint Programming approach.

Název v anglickém jazyce

Benders Decomposition in SMT for Rescheduling of Hierarchical Workflows

Popis výsledku anglicky

Real-life scheduling has to face many difficulties such as dynamic manufacturing environments with failing resources and urgent orders arriving during the schedule execution. Complete rescheduling, considering only the original objective function, in response to unexpected events occurring on the shop floor may yield schedules that are prohibitively different from the original schedule, which may lead to extra costs due to impacts on other planned activities. Our novel approach in the area of predictive-reactive scheduling is to allow for substitution of jobs which cannot be executed with a set of alternative jobs. Hence, this paper describes the model of hierarchical work-flows suitable for dealing with unforeseen events using the possibility of alternative processes and proposes a new approach, based on the Satisability Modulo Theories (SMT) formalism, to recover an ongoing schedule from a resource failure. The experimental results show that the SMT approach using Benders decomposition is orders of magnitude faster than a Constraint Programming approach.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

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

Rok uplatnění

2017

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

Proceedings of the 8th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2017)

ISBN

—

ISSN

2305-249X

e-ISSN

neuvedeno

Počet stran výsledku

16

Strana od-do

295-310

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

Kuala Lumpur, Malaysia

Datum konání akce

5. 12. 2017

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

WRD - Celosvětová akce

Kód UT WoS článku

—