Download presentation

Presentation is loading. Please wait.

Published byJanie Leadingham Modified over 2 years ago

1
**Excursions in Modern Mathematics Sixth Edition**

Peter Tannenbaum

2
**Chapter 8 The Mathematics of Scheduling**

Directed Graphs and Critical Paths

3
**The Mathematics of Scheduling**

8.1 The Basic Elements of Scheduling

4
**The Mathematics of Scheduling**

The Basic Elements of Scheduling The Processors. - Every job requires workers. - Processors describe “Workers” - P1, P2, P3, …PN to denote the processors themselves.

5
**The Mathematics of Scheduling**

The Basic Elements of Scheduling The Tasks. - Individual pieces of work - We will use capital letters A, B, C…, to represent the tasks.

6
**The Mathematics of Scheduling**

The Basic Elements of Scheduling The Tasks (continued). At a particular moment in time a task can be in one of four possible states: Completed In execution Ready Ineligible

7
**The Mathematics of Scheduling**

The Basic Elements of Scheduling The processing times. - The notation X(5) tells us that the task called X has a processing time of 5 units (be it minutes, hours, days, or any other unit of time).

8
**The Mathematics of Scheduling**

The Basic Elements of Scheduling The Precedence of Relations. - Formal restrictions on the order in which tasks must be executed.

9
**The Mathematics of Scheduling**

A precedence relation can be conveniently abbreviated by writing XY or described graphically in (a).

10
**The Mathematics of Scheduling**

When a pair of tasks X and Y have no precedence requirements between them, we say that the tasks are independent. Graphically, we can tell if there are no arrow connecting them (b).

11
**The Mathematics of Scheduling**

Two final comments about precedence relations are in order. First, precedence relations are transitive: If XY and YZ , then it must be true that XZ as shown in (c).

12
**The Mathematics of Scheduling**

The second observation is that we cannot have a set of precedence relations that form a cycle as shown in (d). Clearly, this is logically impossible!

13
**The Mathematics of Scheduling Repairing a Wreck**

Imagine you just wrecked your car. The garage is operated by two processors, P1 and P2. The repairs can be broken into four different tasks: exterior body work (4 hours) engine repairs (5 hours) painting and exterior finish work (7 hours) repair transmission (3 hours). The only precedence relation A C .

14
**The Mathematics of Scheduling Repairing a Wreck**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 P1 P2

15
**The Mathematics of Scheduling Repairing a Wreck**

(A) exterior body work (4 hours), (B) engine repairs (5 hours), (C) painting and exterior finish work (7 hours), and (D) repair transmission (3 hours). The only precedence relation A C .

16
**The Mathematics of Scheduling Repairing a Wreck**

The schedule shown in (a) is very inefficient. All the short tasks are assigned one processor (P1) and all the long tasks to the other processor (P2).

17
**The Mathematics of Scheduling Repairing a Wreck**

Under this schedule, the project finishing time (the duration of the project from the start of the first task to the completion of the last task) is 12 hours. We will use Fin to denote the finishing time, so we can write Fin = 12 hours.

18
**The Mathematics of Scheduling Repairing a Wreck**

It looks better in schedule (b), but it violates the precedence relation A C (we cannot start task C until task A is completed).

19
**The Mathematics of Scheduling Repairing a Wreck**

On the other hand, if we force P2 to be idle for one hour, waiting for the green light to start task C, we get a perfectly good schedule as shown in (c). Fin = 11 hours.

20
**The Mathematics of Scheduling Repairing a Wreck**

Can we do better? No! The precedence relation A(4) C(7) implies that the 11 hours is a minimum barrier that we cannot break. Thus, the schedule in (c) is an optimal schedule and Fin = 11 hours is the optimal finishing time.

21
**The Mathematics of Scheduling Repairing a Wreck**

From now on we will use Opt instead of Fin when we are referring to the optimal finishing time. Schedule (d) shows a different optimal schedule with finishing time Opt = 11 hours.

22
**The Mathematics of Scheduling**

8.2 Directed Graphs (DiGraphs)

23
**The Mathematics of Scheduling**

A directed graph or digraph for short, is a graph in which the edges have a direction associated with them, typically indicated by an arrowhead. Digraphs are particularly useful when we want to describe asymmetric relationships (X related to Y does not imply that Y must be related to X).

24
**The Mathematics of Scheduling**

The classic example of an asymmetric relationship is romantic love: Just because X is in love with Y, there is no guarantee that Y reciprocates that love. Given two individuals X and Y and some asymmetric relationship (say love), we have four possible scenarios:

25
**The Mathematics of Scheduling**

Neither loves the other (a), X loves Y but Y does not love X (b), Y loves X but X does not love Y (c), and they love each other (d).

26
**The Mathematics of Scheduling**

In a digraph, instead of talking about edges we talk about arcs. Every arc is defined by its starting and ending vertex. Thus, if we write XY, we are describing the arc in (b) as opposed to YX as shown in (c). A list of all the arcs is called the arc-set of a digraph A = {XY, YX}

27
**The Mathematics of Scheduling**

Additional Terminology If XY is an arc in the digraph, we say that vertex X is incident to vertex Y, or equivalently, that Y is incident from X. The arc YZ is said to by adjacent to the arc XY if the starting point of YZ is the ending point of XY.

28
**The Mathematics of Scheduling**

Additional Terminology Indegree and Outdegree. Outdegree of X is: the number of arcs that have X as their starting point (outgoing arcs). Indegree of X is: the number of arcs that have X as their ending point (incoming arcs).

29
**Indegree and Outdegree**

30
B C D E A E B C D A

32
**The Mathematics of Scheduling**

8.3 Scheduling with Priority Lists

33
**The Mathematics of Scheduling**

A priority list is a list of all the tasks prioritized in the order we prefer to execute them. If task X comes before task Y in the priority list, then X gets priority over Y. This means that when it comes to a choice between the two, X is executed ahead of Y. However, if X is not yet ready for execution, we skip over it and move on to the first ready task after X in the priority list.

34
**The Mathematics of Scheduling**

8.4 The Decreasing-Time Algorithm

35
**The Mathematics of Scheduling**

One first attempt to find a good priority list is to do the longer jobs first and leave the shorter jobs for last. A priority list where the tasks are listed in decreasing order of processing times is called a decreasing-time priority list, and the process of creating a schedule using a decreasing-time priority list is called decreasing-time algorithm.

36
**The Mathematics of Scheduling**

To use the decreasing-time algorithm we first prioritize the 15 tasks in a decreasing-time priority list: AD(8), AP(7), IW(7), AW(6), FW(6), AF(5), IF(5), ID(5), IP(4), HU(4), PL(4), PU(3), PD(3), EU(2), IC (1)

37
**The Mathematics of Scheduling**

Using the decreasing-time algorithm with N = 2 processors, we get the schedule shown above with project finishing time Fin = 42 hours.

38
**The Mathematics of Scheduling**

8.5 Critical Paths

39
**The Mathematics of Scheduling**

Critical Paths and Critical Times For a given vertex X of a project digraph, the critical path for X is the path from X to END with longest processing time. (The processing time of a path is defined to be the sum of the processing times of all the vertices in the path.) When we add the processing times of all the tasks along the critical path for a vertex X, we get the critical time for X. (By definition, the critical time of END is 0.)

40
**The Mathematics of Scheduling**

Critical Paths and Critical Times The path with longest processing time from START to END is called the critical path for the project, and the total processing time for this critical path is called the critical time for the project.

41
**The Mathematics of Scheduling**

The Backflow Algorithm Step 1. Find the critical time for every vertex of the project digraph. This is done by starting at END and working backward toward START according to the following rule: critical time for X = processing time of X plus largest critical time among the vertices incident from X.

42
**The Mathematics of Scheduling**

The Backflow Algorithm Step 2. Once we have the critical time for every vertex in the project digraph, critical paths are found by just following the path along largest critical times. In other words, the critical path for any vertex X (and that includes START) is obtained by starting at X and moving to the adjacent vertex with largest critical time, and from there to the adjacent vertex with largest critical time, and so on.

43
**The Mathematics of Scheduling**

8.6 The Critical- Path Algorithm

44
**The Mathematics of Scheduling**

The concept of critical paths can be used to create very good schedules. The idea is to use critical times rather than processing times to prioritize the tasks. The priority list we obtain when we write the tasks in decreasing order of critical times (with ties broken randomly) is called the critical-time priority list, and the process of creating a schedule using the critical-time priority list is called the critical-path algorithm.

45
**The Mathematics of Scheduling**

Critical-Path Algorithm Step 1 (Find critical times). Using the backflow algorithm, find the critical time for every task in the project. The critical times for each task are shown in red.

46
**The Mathematics of Scheduling**

Critical-Path Algorithm Step 2 (Create priority list). Using the critical times obtained in Step 1, create the critical-time priority list. The critical-time priority list for the project is AP[34], AF[32], AW[28], IF[27], IW[22], AD[18], IP[15], PL[11], HU[11], ID[10], IC[7], FW[6], PU[5], PD[3], EU[2].

47
**The Mathematics of Scheduling**

Critical-Path Algorithm Step 3 (Create schedule). Using the critical-time priority list obtained in Step 2, create the schedule. The timeline for the resulting schedule is given above. The project finishing time is Fin = 36 hours. This is a very good schedule, but it is not an optimal schedule.

48
**The Mathematics of Scheduling**

Critical-Path Algorithm Step 3 (Continued). Using the critical-time priority list obtained in Step 2, create the schedule. The above figure shows the timeline for an optimal schedule with finishing time Opt = 35 hours. -Won’t always show the optimal.

49
**The Mathematics of Scheduling**

8.7 Scheduling with Independent Tasks

50
**The Mathematics of Scheduling**

In this section, we will briefly discuss what happens to scheduling problems in the special case when there are no precedence relations to worry about. This situation arises whenever we are scheduling tasks that are all independent. There are no efficient optimal algorithms known for scheduling, even when the tasks are all independent.

51
**The Mathematics of Scheduling**

In this case, we just assign the tasks to the processors as they become free in exactly the order given by the priority list. Second, without precedence relations, the critical-path time of a task equals its processing time. This means that the critical-time list and decreasing-time list are exactly the same list, and, therefore, the decreasing-time algorithm and the critical-path algorithm become one and the same.

52
**The Mathematics of Scheduling**

The Relative Error If we know the optimal finishing time Opt, we can measure how “close” a particular schedule is being optimal using the concept of relative error. For a project with finishing time Fin, the relative error (denoted by ) is given by

53
**The Mathematics of Scheduling Conclusion**

Precedence Relations Project Digraph Priority List Models Independent Tasks

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google