Scheduling Problem

• Given:

  • a group of tasks {T1, …, Tn}
  • each with a duration {d1, …, dn}
  • a single processor without interrupts

• Select an order for the tasks that minimizes average completion time

T1

1

T2

1.5

T3

0.5

T4

0.3

T5

2

T6

1.4

Average time to completion:

Previous slide

Next slide

Back to first slide

View graphic version