Benders Decomposition in SMT for Rescheduling of Hierarchical Workflows

Result code in 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>

Result on the web

<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

—

Result language

angličtina

Original language name

Benders Decomposition in SMT for Rescheduling of Hierarchical Workflows

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

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

Project

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

Continuities

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

Publication year

2017

Confidentiality

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

Article name in the collection

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

ISBN

—

ISSN

2305-249X

e-ISSN

neuvedeno

Number of pages

16

Pages from-to

295-310

Publisher name

Neuveden

Place of publication

Neuveden

Event location

Kuala Lumpur, Malaysia

Event date

Dec 5, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—