Maximization of schedule reliability under uncertain job processing times
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10281216" target="_blank" >RIV/00216208:11320/14:10281216 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Maximization of schedule reliability under uncertain job processing times
Original language description
Interval scheduling problem aims at assigning jobs to machines where the job starting and finishing times are known. If random delays influence the job processing times, the objective can be to find a schedule which remains feasible with the highest possible probability. In this paper, we propose the formulations based on stochastic integer programming and robust coloring problems. The second one leads to a large scale binary-linear programming problem.We report first numerical results based on simulated instances.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP13-03749P" target="_blank" >GP13-03749P: Efficiency tests for investment opportunities</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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
Article name in the collection
Proceeding of 4th Scientific Colloquium
ISBN
978-80-7080-890-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
80-87
Publisher name
Institute of Chemical Technology
Place of publication
Prague
Event location
Prague
Event date
Jun 24, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—