Detail publikace

Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation

NOVOTNÝ, J. BRANDA, M. OLSTAD, A.

Originální název

Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Fixed interval scheduling; Uncertainty; Stochastic programming; Robust coloring problem; Archimedean copula; Tabu search

Autoři

NOVOTNÝ, J.; BRANDA, M.; OLSTAD, A.

Vydáno

1. 3. 2016

Nakladatel

PERGAMON-ELSEVIER SCIENCE LTD

Místo

OXFORD

ISSN

0360-8352

Periodikum

COMPUTERS & INDUSTRIAL ENGINEERING

Ročník

93

Číslo

March

Stát

Spojené království Velké Británie a Severního Irska

Strany od

45

Strany do

54

Strany počet

10

URL

https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S036083521500501X

BibTex

@article{BUT171078,
  author="Jan {Novotný} and Martin {Branda} and Asmund {Olstad}",
  title="Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation",
  journal="COMPUTERS & INDUSTRIAL ENGINEERING",
  year="2016",
  volume="93",
  number="March",
  pages="45--54",
  doi="10.1016/j.cie.2015.12.021",
  issn="0360-8352",
  url="https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S036083521500501X"
}