A Kronecker Algebra Formulation for Markov Activity Networks with Phase-Type Distributions

The application of theoretical scheduling approaches to the real world quite often crashes into the need to cope with uncertain events and incomplete information. Stochastic scheduling approaches exploiting Markov models have been proposed for this class of problems with the limitation to exponential durations. Phase-type approximations provide a tool to overcome this limitation. This paper proposes a general approach for using phase-type distributions to model the execution of a network of activities with generally distributed durations through a Markov chain. An analytical representation of the infinitesimal generator of the Markov chain in terms of Kronecker algebra is proposed, providing a general formulation for this class of problems and supporting more efficient computation methods. This entails the capability to address stochastic scheduling in terms of the estimation of the distribution of common objective functions (i.e., makespan, lateness), enabling the use of risk measures to address robustness.

Representations of constant socle rank for the Kronecker algebra

Inspired by recent work of Carlson, Friedlander and Pevtsova concerning modules for p-elementary abelian groups {E_{r}} of rank r over a field of characteristic {p>0}, we introduce the notions of modules with constant d-radical rank and modules with constant d-socle rank for the generalized Kronecker algebra {\mathcal{K}_{r}=k\Gamma_{r}} with {r\geq 2} arrows and {1\leq d\leq r-1}. We study subcategories given by modules with the equal d-radical property and the equal d-socle property. Utilizing the simplification method due to Ringel, we prove that these subcategories in {\operatorname{mod}\mathcal{K}_{r}} are of wild type. Then we use a natural functor {\operatorname{\mathfrak{F}}\colon{\operatorname{mod}\mathcal{K}_{r}}\to% \operatorname{mod}kE_{r}} to transfer our results to {\operatorname{mod}kE_{r}}.