1. Chapter 3: Planning and Scheduling

2. Planning and Scheduling - Topics Resolving Conflict via Coloring Bin Packing Scheduling Tasks Critical-Path Schedules Independent Tasks 2

3. 3 Resolving Conflict Resolving Conflict Goals of Three Scheduling Problems Optimization issues – Try to maximize profit, minimize cost. Example: Scheduling machine time for earliest completion time

4. 4 Resolving Conflict Resolving Conflict Goals of Three Scheduling Problems Equity – Try to make things fair for all participants. Example: Schedule baseball games (same number home and away games)

5. 5 Resolving Conflict Resolving Conflict Goals of Three Scheduling Problems Conflict Resolution – Try to prevent conflicts from happening. Example: Scheduling college final examinations for end of term

6. The goal of a map coloring problem is to color a map so that regions sharing a common border have different colors. (Regions that meet only in a point may share a common color.)

7. What is the least amount of colors needed?

8. What is the least amount of colors needed? 3

9. Resolving Conflict via Coloring Chromatic Number Chromatic Number The chromatic number is the minimum number of colors necessary to color a map so that regions sharing a common border have different colors

10. Resolving Conflict via Coloring Chromatic Number Chromatic Number For example, the chromatic number for the map above is 3 since it takes at least 3 colors to color the map so that regions sharing a common border have different colors. Why can't it be done with 2 colors?

11. Resolving Conflict via Coloring A map coloring problem can be solved by first converting the map into a graph where each region is a vertex and an edge connects two vertices if and only if the corresponding regions share a border.

12. Resolving Conflict via Coloring Once a map is converted into a graph, a process called vertex coloring can be used to decide how the map should be colored.

13. Resolving Conflict via Coloring For example, using the original graph above, we convert each country to a vertex. (We'll use open circles instead of filled dots to make it easier to color them later.)

14. Resolving Conflict via Coloring

15.  Now we add the edges. Two countries are connected by an edge if and only if they have a common border (but not if they just meet at a point). This gives:

16. Resolving Conflict via Coloring

17. To "color" a graph, we follow the following vertex coloring rules: Vertex coloring rules Vertices connected by an edge must be different colors. Use the fewest possible number of colors.

18. Resolving Conflict via Coloring Continuing the example, one way of doing the vertex coloring (that happens to correspond to the colors used in the second map above) is:

19. Resolving Conflict via Coloring This same idea can be used to solve other problems. Example: those in which people or things must be grouped or organized based on conflicts among the people or things. those in which people or things must be grouped or organized based on conflicts among the people or things.

20. Resolving Conflict via Coloring In such a situation, the people (or things) are represented by vertices and conflicts between two people (or things) are represented by a connecting edge. In such a situation, the people (or things) are represented by vertices and conflicts between two people (or things) are represented by a connecting edge.

21. 21 Resolving Conflict via Coloring Example: Scheduling Exams Using Vertex Coloring There are eight (8) finals to schedule with only two (2) air- conditioned rooms. (8 courses: French-F, Math-M, History-H, Philosophy-P, English-E, Italian-I, Spanish-S, Chemistry-C).

22. 22 Resolving Conflict via Coloring Example: Scheduling Exams Using Vertex Coloring In the graph, courses are represented by vertices and two course are joined by an edge for every student enrolled in both courses.

23. Resolving Conflict via Coloring The graph represents conflict info about the courses.

24. Resolving Conflict via Coloring 8 colors represent 8 time slots — not optimal. It means 8 rooms are needed.

25. 25 Resolving Conflict via Coloring 4 colors — 4 time slots but need 3 rooms for time slot 2.

26. 26 Resolving Conflict via Coloring d) 4 colors with 4 time slots each color appears twice so only need 2 air condition rooms.

27. 27 Resolving Conflict via Coloring The chromatic number is 4 as in d (we scheduled 8 exams in 4 time slots without a conflict).

28. 28 Bin Packing The problem of finding the minimum number of bins (containers) into which the weight (object) can be packed. Once again, there is no fast or optimal algorithm, so we will look at several methods and compare them.

29. 29 Bin Packing Six Methods Next Fit (NF) Next Fit Decreasing (NFD) First Fit (FF) First Fit Decreasing (FFD) Worse Fit (WF)Worse Fit Decreasing (WFD)

30. 30 Bin Packing Next Fit (NF) – A new bin is opened if the weight to be packed next will not fit in the bin that is currently being filled; the current bin is then closed. First Fit (FF) – The next weight to be packed is placed in the lowest- numbered bin already opened into which it will fit. If it does not fit in any open bins, a new bin is opened.

31. 31 Bin Packing Worse Fit (WF) – The next weight to be packed is placed into the open bin with the largest amount of room remaining. If it does not fit in any bins, open a new bin. Decreasing-Time (NFD, FFD, WFD) – list the weights in order of decreasing size before the bin-packing method. Does NOT guarantee optimal solution.

32. 32 Bin Packing Next Fit (NF) Advantages – Does not require knowledge of all the weights in advance; only need to know the remaining space in the bin. Disadvantages – The bin packed early on may have had room for small items that come later in the list. Best method for assembly-line packing.

33. 33 Bin Packing First Fit (FF) Advantages – Does not require knowledge of all the weights in advance. Disadvantages – Large number of bins will cause issues, large amount of computer storage Best method for small amount of items to be packed.

34. Scheduling Tasks Examples: Around-the-clock scheduling of doctors and nurses, scheduling equipment (X-rays, MRI scans) for maximum efficiency Organizing all sub-contractors (electric, plumbing, etc) to get a house built. 34

35. Scheduling Tasks Examples: Schedule all different crews that are necessary to prepare a plane for next flight Creating a High School Yearbook 35

36. Scheduling Tasks Accurate planning and scheduling is required of both people and machines. 36 Processors  A person, machine, robot, operating room, or runway (for airplanes) whose time must be scheduled.

37. Scheduling Tasks Accurate planning and scheduling is required of both people and machines. 37 Machine-Scheduling Problem  The problem of deciding how the tasks should be scheduled so the entire job is completed as early as possible.

38. Assumptions When a processor starts a task, it will be completed without interruption. Any processor can work on any of the tasks. No processor stays idle voluntarily. Scheduling Tasks 38

39. Assumptions Order-requirement digraph is used to show the task order and has the task times highlighted within each vertex. Priority lists arrange the tasks in order, independent of the order requirements. Used to “break ties” if more than one task is ready. Scheduling Tasks 39

40. Goals to Consider Minimize the completion time of the job. Minimize the total time the processors are idle. Find the minimum number of processors necessary to finish the job by a specified time. Scheduling Tasks 40

41. 41 When is the schedule optimal? Optimal Time = Total time of all tasks/# processors. Completion Time: length of longest processor Idle Time is the amount of total time the processors are not used.

42. 42 When is the schedule optimal? If the schedule completion time = the length of critical path, then the schedule is optimal (earliest completion time).

43. Order-Requirement Digraph A directed graph (digraph) that shows which tasks precede other tasks among the collection of tasks making up a job.

44. Independent Tasks Tasks that are independent of each other if they can be performed in any order (no edges in the order-requirement digraph). Label the tasks by their task times rather than their task number.

45. Independent Tasks The list-processing algorithm can be used to schedule the tasks onto machines using the given list but may not be efficient. Geometrically, we can think of independent tasks as rectangles of height 1.

46. Independent Tasks Diagram of a task schedule on 2 processors

47. 47 List Processing Algorithm Also called “First come, First serve” Algorithm 1. 1. Put finger on available processor (whenever there is a tie, lowest numbered processor). 2. 2. Schedule 1 st task from the priority list on the available processor. Cross it off the list.

48. 48 List Processing Algorithm 3. Put finger on processor that is behind. Schedule next task from the priority list onto the processor. Remove this task from priority list. 4. Repeat 1-3 until all tasks are scheduled. 5. Create idle time to “even-up” processors.

49. Decreasing-Time List Algorithm 1) Arrange tasks in decreasing order by time. This becomes the priority list, 2) Apply the List Processing Algorithm.

50. Decreasing-Time List Algorithm Example: Apply decreasing-time list algorithm on independent tasks 10, 9, 7, 7, 5, 4 (already in order) This result is an optimal schedule!

51. Dependent Tasks Complications arise with jobs consisting of several tasks that cannot be done in an arbitrary order.

52. Dependent Tasks Example: Treating the job of building a house as a scheduling problem, what must occur first? Order these tasks: working on the roof, putting up the walls, laying the foundation Laying foundation, putting up the walls, working on roof

53. 53 Order-Requirement Digraph For the next example, tasks are labeled as T1–T8. The length of time for each task is indicated in a colored circle.

54. 54 Order-Requirement Digraph At the beginning (time = 0), tasks T1, T7, T8 are ready to be scheduled on machines.

55. 55 Scheduling Tasks Processors  For this example, tasks will be scheduled on two machines according to the order-requirement digraph and priority list.

56. 56 Scheduling Tasks Priority List  A list that ranks the tasks in some criterion of importance. Used to “break ties” if more than one task is ready.

57. 57 Scheduling Tasks Priority List  Ready task – A task is ready if its predecessors have been completed by that time as given by the order- requirement digraph.  For the problem, the priority list is T1, T2, T3, T4, T5, T6, T7, T8.

58. 58 Scheduling Tasks on Machines

59. Critical Path Critical Path is BE = 25 + 27 = 52 min. The longest path in an order-requirement digraph. The length is measured in terms of summing the task times of the tasks making up the path.

60. 60 Critical Path Schedules A systematic method of choosing/creating a priority list, that yields optimal, or nearly optimal, schedules.

61. 61 Critical Path Scheduling Algorithm (to create a Priority List) 1. 1. Evaluate paths and find critical (longest) path in the order- requirement digraph. If a tie, choose path with the lowest-number task. 2. 2. Remove first task occurring in that path and put it first in the priority list. (Remove the task found in step 1 and the edges attached to it from the current order-requirement digraph).

62. 62 Critical Path Scheduling Algorithm (to create a Priority List) 3. With this task removed, evaluate new completion time for this path. (reduce path by length of task). 4. If there is more than one path from which to choose, assign the lowest numbered task to the priority list.

63. 63 Critical Path Scheduling Algorithm (to create a Priority List) 5. Repeat 1-4 until all tasks have been placed on the priority list. 6. Apply list processing algorithm, along with order-requirement digraph, to schedule all tasks on the given number of processors.

64. 64 Example of Critical-Path Scheduling Algorithm For this order-requirement digraph, there are two critical paths of length 64: T1, T2, T3 and T1, T4, T3. Place T1 on the list L.

65. 65 Example of Critical-Path Scheduling Algorithm With T1 “gone,” there is a new critical path of length 60: T5, T6, T4, T3. Place T5 next on the list L.

66. 66 Example of Critical-Path Scheduling Algorithm With T1 and T5 “gone,” the next longest path would be 56: T6, T4, T3. Place T6 next on the list L. (Continue the algorithm until list is complete.)

67. 67 Critical Path Schedules The new priority list would be: T1, T5, T6, T2, T3, T3, T8, T9, T7, T10. Using the list-processing algorithm with the new priority list, the following schedule is obtained:

68. 68 Example of Critical-Path Scheduling Algorithm For this order-requirement digraph, the critical path of length 27: T1, T2, T3, T4. Place T1 on the list.