The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...

The precedence effect (PE) allows us to locate sound sources correctly in rooms despite the presence of interfering reflections. It was shown to function at high frequencies with highly modulated stimuli even when lead and lag had simultaneous onsets, i.e. with information restricted to the ongoing sound part [1]. These studies were done in the free-field where interaural time (ITDs) and level ...

We present an approximate computation of the best-case response times of periodic hard real-time tasks with fixed priorities in a single processor environmen. In particular we are interested in the problem of local precedence relations. After exposinf some difficulties to take into account precedence relations, we give a simple way to solve this problem.