Download presentation
Presentation is loading. Please wait.
1
Basic Project Scheduling
IEOR 4405
2
Project Scheduling Jobs subject to precedence constraints
Job on arc format (most common) 2 5 6 1 4 7 2 3 IEOR 4405
3
Overview No resource Constraints Project Scheduling Resource
Critical Path Method (CPM) Program Evaluation and Review Technique (PERT) No resource Constraints Project Scheduling Resource Constraints Heuristic Resource Leveling Integer Programming Formulations IEOR 4405
4
Planning a Concert IEOR 4405
5
Job on Arc Network Not allowed: no two jobs can have the same starting and ending node! Need to introduce a dummy job. B A D C B A D C IEOR 4405
6
Changing a Tire IEOR 4405
7
Job on Arc Network A E B D C Is this correct? IEOR 4405
8
Job on Arc Network A B E C D IEOR 4405
9
Job on Node Network No need for a dummy node Less used traditionally
Recently more popular A B E C D IEOR 4405
10
Critical Path Method (CPM)
Think of unlimited machines in parallel … and n jobs with precedence constraints Processing times pj as before Objective to minimize makespan IEOR 4405
11
Critical Path Method Forward procedure: Backward procedure
Starting at time zero, calculate the earliest each job can be started The completion time of the last job is the makespan Backward procedure Starting at time equal to the makespan, calculate the latest each job can be started so that this makespan is realized IEOR 4405
12
Forward Procedure Step 1:
Set at time t = 0 for all jobs j with no predecessors, Sj’=0 and set Cj’ = pj. Step 2: Compute for each job j Cj’ = Sj’ + pj. Step 3: The optimal makespan is STOP IEOR 4405
13
Backward Procedure Step 1:
Set at time t = Cmax for all jobs j with no successors, Cj’’= Cmax and set Sj’’ = Cmax - pj. Step 2: Compute for each job j Sj’’ = Cj’’ - pj. Step 3: Verify that STOP IEOR 4405
14
Comments The forward procedure gives the earliest possible starting time for each job The backwards procedures gives the latest possible starting time for each job If these are equal the job is a critical job. If these are different the job is a slack job, and the difference is the float. A critical path is a chain of jobs starting at time 0 and ending at Cmax. IEOR 4405
15
Example 2 4 7 10 1 6 9 12 14 3 11 13 5 8 IEOR 4405
16
Forward Procedure 5+6=11 11+12=23 23+10=33 2 4 7 33+9=42 5 14+12=26
26+10=36 43+8=51 1 51+5=56 6 9 12 14 3 11 13 5+9=14 43+7=50 36+7=43 5 8 14+7=21 26+6=32 IEOR 4405
17
Backwards Procedure 24-12=12 34-10=24 43-9=34 2 4 7 51-8=43 14-9=5
36-10=26 43-7=36 56-5=51 1 56 6 9 12 14 3 11 13 26-12=14 56-5=51 51-8=43 5 8 35-10=26 43-7=36 IEOR 4405
18
Critical Path 2 4 7 10 1 6 9 12 14 3 11 13 5 8 IEOR 4405
19
Variable Processing Times
IEOR 4405
20
Time/Cost Trade-Offs Assumed the processing times were fixed
More money shorter processing time Start with linear costs Processing time Marginal cost IEOR 4405
21
Linear Costs Resources (money) Processing time IEOR 4405
22
Solution Methods Objective: minimum cost of project
Time/Cost Trade-Off Heuristic Good schedules Works also for non-linear costs Linear programming formulation Optimal schedules Non-linear version not easily solved IEOR 4405
23
Sources, Sinks, and Cuts Cut set Sink node Source (dummy) node
Minimal cut set IEOR 4405
24
Time/Cost Trade-Off Heuristic
Step 1: Set all processing times at their maximum Determine all critical paths with these processing times Construct the graph Gcp of critical paths Continue to Step 2 IEOR 4405
25
Time/Cost Trade-Off Heuristic
Step 2: Determine all minimum cut sets in Gcp Consider those sets where all processing times are larger than their minimum If no such set STOP; otherwise continue to Step 3 IEOR 4405
26
Time/Cost Trade-Off Heuristic
Step 3: For each minimum cut set: Compute the cost of reducing all processing times by one time unit. Take the minimum cut set with the lowest cost If this is less than the overhead per time unit go on to Step 4; otherwise STOP IEOR 4405
27
Time/Cost Trade-Off Heuristic
Step 4: Reduce all processing times in the minimum cut set by one time units Determine the new set of critical paths Revise graph Gcp and go back to Step 2 IEOR 4405
28
Example IEOR 4405
29
Maximum Processing Times
2 4 7 10 1 6 9 12 14 3 11 13 5 8 IEOR 4405
30
Maximum Processing Times
2 4 7 10 1 6 9 12 14 3 11 13 5 8 IEOR 4405
31
Critical Path Subgraph (Gcp)
1 6 9 12 14 3 11 C11=2 C3=4 Cut sets: {1},{3},{6},{9}, {11},{12},{14}. Minimum cut set with lowest cost IEOR 4405
32
Critical Path Subgraph (Gcp)
1 6 9 12 14 3 11 13 C11=2 C3=4 C13=4 Cut sets: {1},{3},{6},{9}, {11},{12,13},{14}. Minimum cut set with lowest cost IEOR 4405
33
Critical Path Subgraph (Gcp)
1 6 9 12 14 3 11 13 C11=2 C3=4 C13=4 Processing time at minimum Reduce processing time next on job 6 IEOR 4405
34
Critical Path Subgraph (Gcp)
C2=2 C4=3 C7=4 2 4 7 C10=5 C1=7 10 C12=2 C6=3 C9=4 C14=8 1 6 9 12 14 3 11 13 C11=2 C3=4 C13=4 This set cannot be decreased, Choose 2 and 6 instead IEOR 4405
35
Linear Programming Formulation
Objective is weighted avg. of makespan and cost Here total cost is linear Want to minimize IEOR 4405
36
Linear Program Minimize subject to IEOR 4405
37
PERT IEOR 4405
38
Program Evaluation and Review Technique (PERT)
Assumed processing times deterministic Processing time of j random with mean mj and variance sj2. Want to determine the expected makespan Assume we have pja = most optimistic processing time pjm = most likely processing time (mode) pjb = most pessimistic processing time IEOR 4405
39
Expected Makespan Estimate expected processing time
Apply CPM with expected processing times Let Jcp be a critical path Estimate expected makespan IEOR 4405
40
Distribution of Makespan
Estimate the variance of processing times and the variance of the makespan Assume it is normally distributed IEOR 4405
41
Discussion Potential problems with PERT:
Always underestimates project duration other paths may delay the project Non-critical paths ignored critical path probability critical activity probability Activities are not always independent same raw material, weather conditions, etc. Estimates by be inaccurate IEOR 4405
42
Discussion No resource constraints: Critical Path Method (CPM)
Simple deterministic Time/cost trade-offs Linear cost (heuristic or exact) Non-linear cost (heuristic) Accounting for randomness (PERT) IEOR 4405
43
Adding Resource Constraints
IEOR 4405
44
Resource Constraints Renewable resources Very hard problem No LP
Can develop an IP Let job n+1 be dummy job (sink) and IEOR 4405
45
Makespan Let H bound the makespan, e.g. Completion time of job j is
and the makespan IEOR 4405
46
IP Formulation Minimize Subject to If j prec k Each resource
Used at each time t For each job IEOR 4405
47
In Practice The IP cannot be solved
(Almost) always resource constraints Heuristic: Resource constraint Precedence constraint Example: pouring foundation and sidewalk both require same cement mixer delaying foundation delays building precedence constraint: pour foundation first not a logical constraint IEOR 4405
48
Optimality of Heuristic
Say n jobs need the same resource Could otherwise all be done simultaneously Add (artificial) precedence constraints Have n! possibilities Will we select the optimal sequence? IEOR 4405
49
Decision Support Resource leveling Solve with no resource constraints
Plot the resource use as a function of time If infeasible suggest precedence constraints Longest job Minimum slack User adds constraints Start over IEOR 4405
50
Example: One Resource 2 6 9 6 3 6 11 Resource Profile Capacity Time
Uses resource 6 9 6 3 6 11 Resource Profile Capacity Time IEOR 4405
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.