Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10377489" target="_blank" >RIV/00216208:11320/18:10377489 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.cor.2018.05.025" target="_blank" >https://doi.org/10.1016/j.cor.2018.05.025</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cor.2018.05.025" target="_blank" >10.1016/j.cor.2018.05.025</a>
Alternative languages
Result language
angličtina
Original language name
Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
Original language description
We deal with fixed interval scheduling (FIS) problems on parallel identical machines where the job starting times are given but the finishing times are subject to uncertainty. In the operational problem, we construct a schedule with the highest worst-case probability that it remains feasible, whereas in the tactical problem we are looking for the minimum number of machines to process all jobs given a minimum level for the worst-case probability that the schedule is feasible. Our ambiguity set contains joint delay distributions with a given copula dependence, where a proportion of marginal distributions is stressed and the rest are left unchanged. We derive a trackable reformulation and propose an efficient decomposition algorithm for the operational problem. The algorithm for the tactical FIS is based on solving a sequence of the operational problems. The algorithms are compared on simulated FIS instances in the numerical part.
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
10102 - Applied mathematics
Result continuities
Project
<a href="/en/project/GBP402%2F12%2FG097" target="_blank" >GBP402/12/G097: DYME-Dynamic Models in Economics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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 and Operations Research
ISSN
0305-0548
e-ISSN
—
Volume of the periodical
98
Issue of the periodical within the volume
October 2018
Country of publishing house
GB - UNITED KINGDOM
Number of pages
9
Pages from-to
231-239
UT code for WoS article
000440526800017
EID of the result in the Scopus database
2-s2.0-85048708257