Solution robust project scheduling is a growing research field aiming at constructing proactive schedules to cope with multiple disruptions during project execution. When stochastic activity durations are considered, including time buffers between activities is a proven method to improve the stability of a baseline schedule. This paper introduces multiple algorithms to include time buffers in a...

In this paper we investigate the problem of how to schedule n independent jobs on an m m torus based network. We develop a model to to quantify the effect of contention for communication links on the dilation of job execution time when multiple jobs share communication links; we then design an efficient algorithm to schedule a set of n independent jobs with different torus size requirements on ...

In this paper we investigate the problem of how to schedule n independent jobs on an m m torus based network. We develop a model to to quantify the effect of contention for communication links on the dilation of job execution time when multiple jobs share communication links; we then design an efficient algorithm to schedule a set of n independent jobs with different torus size requirements on ...

Kautz, in the above paper' has presented a method of correcting single errors in SIB3 codes that does not displace the count by more than two counts in the counting sequence, assuming the two most significant bits are correct. This paper presents a correction method that does not require the two most significant bits to be correct and does not displace the count by more than one in the counting...

We consider a recently introduced class of network construction problems where edges transportation need to be constructed by server (construction crew). The has constant speed which is much lower than its travel speed, so relocation times are negligible with respect times. It required find schedule that minimizes non-decreasing function the when various connections interest become operational....

What happens if the Xi ’s take values in a (real) Banach space (B, ‖ · ‖)? In such cases, in particular when the square of the norm ‖ · ‖ is not given by an inner product, we are aiming at inequalities of the following type: Let X1, X2, . . . , Xn be independent random vectors with values in (B, ‖ · ‖) with EXi = 0 and E‖Xi‖2 < ∞. With Sn := ∑n i=1 Xi we want to show that E‖Sn‖ ≤ K n ∑ i=1 E‖Xi...