Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F16%3APU140549" target="_blank" >RIV/00216305:26210/16:PU140549 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/16:10323558
Result on the web
<a href="https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S036083521500501X" target="_blank" >https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S036083521500501X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cie.2015.12.021" target="_blank" >10.1016/j.cie.2015.12.021</a>
Alternative languages
Result language
angličtina
Original language name
Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation
Original language description
We propose several formulations of the fixed interval scheduling problem under uncertainty, where the risk is represented by random delays in processing times. We employ various stochastic programming and robust coloring problems to deal with the uncertainty. Our main goal is to introduce equivalent deterministic reformulations of the stochastic programming problems. We show that the minimization of the expected number of overlaps is equivalent to the deterministic robust coloring problem under particular choice of the penalties. Moreover, we extend the robust coloring problem to obtain equivalence with the stochastic programming problem with the schedule reliability objective under multivariate distribution of delays represented by an Archimedean copula. We show that small simulated instances of this problem can be solved to optimality by available software tools and we propose a tabu search algorithm suitable for larger instances.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
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
Name of the periodical
COMPUTERS & INDUSTRIAL ENGINEERING
ISSN
0360-8352
e-ISSN
1879-0550
Volume of the periodical
93
Issue of the periodical within the volume
March
Country of publishing house
GB - UNITED KINGDOM
Number of pages
10
Pages from-to
45-54
UT code for WoS article
000371844900005
EID of the result in the Scopus database
2-s2.0-84953897685