This thesis concerns solutions to problems that arise in optimizing fixed interval scheduling under situations of uncertainty such as when there are random delays in job process times. These problems can be solved by using a vertex coloring with random edges and problems can be formulated using integer linear, quadratic and stochastic programming. In this thesis is propo- sed a new integer linear formulation. Under certain conditions there is proved its equivalence with stochastic formulation, where is maximized the schedule reliability. Moreover, we modified the proposed formulation to obtain bet- ter corresponding to real life situations. In a numerical study we compared computational time of individual formulations. It turns out that the propo- sed formulation is able to solve scheduling problems considerably faster than other formulations. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:350833 |
| Date | January 2015 |
| Creators | Hájek, Štěpán |
| Contributors | Branda, Martin, Lavička, Karel |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0014 seconds