Oliver Braun

Parallel Processor Scheduling with Limited Number of Preemptions

In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is to minimize the makespan, i.e., the completion time of the last job that finishes. We show that the ratio of the optimal i-preemptive schedule length

Stability of Johnson's schedule with respect to limited machine availability

{C_{max}^{ip^*}}

Single-processor scheduling with time restrictions

versus the optimal preemptive schedule length

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions

{C_{max}^{p^*}}

On the single-processor scheduling problem with time restrictions

is bounded from above by

Optimality of Jackson's permutations with respect to limited machine availability

{C_{max}^{ip^*}} \le {( 2 - 2 / (m/(i+1) + 1) )} {C_{max}^{p^*}}

A Reference Model for Personal Financial Planning

. Furthermore, we show that the ratio of the length

Vergleichende Untersuchung von Tools zur privaten Finanzplanung

{C_{max}^{LPT}}

How to Model Business Processes with GPN

of a nonpreemptive schedule following the {\it longest processing time (LPT)} rule versus the optimal preemptive schedule length

Process Language GPN

{C_{max}^{p^*}}