In this paper we continue our investigation of stochastic (and hence dynamic) variants of classical scheduling problems. Such problems can be modeled as duration probabilistic automata (DPA), a well-structured class of acyclic timed automata where temporal uncertainty is interpreted as a bounded uniform distribution of task durations [18]. In [12] we have developed a framework for computing the...

We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermediate relays are capable of XOR network coding. Transmission scheduling is done by tailoring the backpressure algorithm to the problem at hand. Two main alternatives for network operation are either to have queues at th...

OF THE THESIS Utility-Aware Scheduling of Stochastic Real-Time Systems by Terry Tidwell Doctor of Philosophy in Computer Science Washington University in St. Louis, 2011 Research Advisor: Christopher Gill Time utility functions offer a reasonably general way to describe the complex timing constraints of real-time and cyber-physical systems. However, utility-aware scheduling policy design is an ...

Stochastic Petri Nets and their generalizations are powerful formalisms for the specification of stochastic processes. In their original definition they do not provide any specification for the token extraction order applied by a transition to its input places, however this aspect may be relevant if timed transitions are interpreted as servers and tokens as customers, so that the extraction ord...

In this paper, impacts of various uncertainties such as random outages of generating units and transmission lines, forecasting errors of load demand and wind power, in the presence of Demand response (DR) programs on power generation scheduling are studied. The problem is modelled in the form of a two-stage stochastic unit commitment (UC) which by solving it, the optimal solutions of UC as well...

background one of most important operations research problems is nurse scheduling problem (nsp) that tries to find an optimal way to assign nurses to shifts with a set of hard constraints. most of the researches are dealing with this problem in deterministic environment with constant parameters. while in the real world applications of nsp, the stochastic nature of some parameters like number of...