Intro to BPC Logic Filter for Microsoft Project · BPC Logic Filter is a lightweight tool that...

Intro to BPC Logic Filter for Microsoft ProjectEnhanced Schedule Logic Tracing

By Thomas Boyle, PE, PSP, PMP

BPC Logic Filter for Microsoft Project –Abstract and Introduction

• Complex sequencing logic can be difficult to extract and display in Microsoft Project, especially when deadlines or variable calendars complicate Project’s Slack (Float) calculations. So we wrote our own Add-In to make Project sing like a rock star. BPC Logic Filter is a lightweight tool that shows only logically-connected tasks and includes advanced features to focus on Driving Relationships, Project Longest Path, Multiple Float Paths, Driving Path Drag, and other key parameters.

• Presented by Thomas Boyle, PE, PMP, PSP, principal consultant of a firm which he founded in 2004 after 19 years in engineering and construction management. Based in Charlotte, NC, USA, he provides outcome-driven consulting and management-support services to clients worldwide.

Agenda - Outline

• Background / Motivation• Program Development• User Interface• Limitations / Calculation Notes• Some Real-World Examples• Questions

BPC Logic Filter for Microsoft Project

- Background / Motivation• History

• MSP (DOS version) – 1984• MSP (Windows version) – 1990• Then

• Focus on IT/Software Development• Multiple Smaller Projects – Competing for manpower• Low cost – limited functionality• Not taken seriously in other sectors

• Now (MSP 2013)• General-Purpose Project focus• All project sizes, client/server, master/sub-projects• Appears generally compliant with requirements for PDM/CPM• Improved functionality• Extremely large user base• Widely used in government and business, growing use in Construction.• Logic Output remains difficult (manual, click-intensive)


- Background / Motivation

• History (to MSP2010)



• History (to MSP2010)• MSP Logic Input/Output



Predecessors / Successors fields (R/W)




Dependency (Predecessors) Object Form (R/W)




Dependency (Predecessors / Successors) Object Forms (R/W)




Logic Links (R/W)




Task Inspector (RO)




Free Slack Field (RO)• History (to MSP2010)

• MSP Logic Input/Output



Total Slack Field (RO)• History (to MSP2010)

• MSP Logic Input/Output




• Input = Multiple Options• Output = ??

• Task Inspector• Local Driving Predecessor• Unreliable for non-FS drivers

• Free Slack• Distance from nearest local successor • No ID of driven successors

• Total Slack• Basis of “Critical” Flag• CPM Forward/Backward Pass + mods. (Sparse docs.)• Loses significance w/ variable calendars and mult. Deadlines



• NeedsFor Complex Industrial / Construction Projects:• Communication of the schedule plan:

• Sequential logical relationships• Cascading consequences of delay/acceleration• Key milestones – ID and tracking

• Perform What-If Analyses• Evaluate Schedule Disruptions• Total Slack is not enough


- Background / MotivationNeeds – Why Total Slack is not enough• Simplest Case (1980):

• TS ~ “The amount of (working) time a task may slip without delaying the project.”• TS = Late Finish – Early Finish; TS = Late Start – Early Start• TS=0 Critical Path; TS=1 Near-Critical Path; etc.

• Complex Project (2015)• Working Time – i.e. Calendar – variations TS changes along a single logical path.

i.e. Critical Path ≠ (TS=0)• NLT Constraints and Deadlines affect Late dates ~ sometimes TS<0.

i.e. Critical Path ≠ (TS=0)• (Multiple) NLT Constraints and Deadlines TS~ “The amount of time a task may

slip without delaying ????? (a constrained task somewhere, or the project finish.)”i.e. Critical Path = ????

• All Projects• TS ~ Task A “project finish”.• TS says nothing re. Task A Task B


- Background / Motivation• NeedsFor a given task:• Which tasks are its predecessors? (The whole

chain, not just the immediate dependencies.)• Which tasks are its successors?• Which predecessors are driving – i.e. effectively

limiting the early start of – the task? • Which successor tasks are being driven by the

task?• If a predecessor is NOT driving, how much may it

slip before it becomes driving.• If a successor is NOT being driven, how much

may the given task slip before it has an impact on the successor?


- Background / Motivation• NeedsFor the Project as a whole:• What is the real “Critical Path” and how

is this related to Project’s “Critical” task flag? (Is it related at all?)

• What is the Longest Path – i.e. that group of logically connected activities that drive the overall project completion date?

• What is the Critical/Longest Path for a project whose key milestone(s) don’t coincide with the end of the project schedule?

• Identify and differentiate parallel critical paths and near critical paths?

• Available Tools• Non-MSP Scheduling

Tools (P6, Asta PP, Spider, Safran, Deltek, Acumen Fuse, etc.)

• MSP 2013 – Task Path





• MSP 2013 – Task Path• PathsPro

(http://www.projectprocorp.com/)



http://www.projectprocorp.com/





• Driving Path Widget (http://www.projectwidgets.com/)




http://www.projectwidgets.com/





• Driving Path Widget (http://www.projectwidgets.com/)

• BPC Logic Filter (http://www.boyleprojectconsulting.com )




http://www.projectwidgets.com/

http://www.boyleprojectconsulting.com/

Thomas

Stamp


- Program Development

• Initiation• Client: “My people can’t see why they need to finish

these tasks so soon. Isn’t there a report or something to show what other tasks (in other departments) are depending on them?”

• VBA – “Macros”• Rod Gill’s book – VBA Programming – For Microsoft

Project ’98 through 2010 with an Introduction to VSTO



• Feature Development 2013-2015 (VBA)1. Simple Logic Tracer (Ancestors/Descendants)







Filter: Select Task Links



• Feature Development 2013-2015 (VBA)1. Simple Logic Tracer (Ancestors/Descendants)2. Counters/Limits/Controls






Only within 1 logical step of selected task.




Filter: Select Task Links(<1stp)



• Feature Development 2013-2015 (VBA)1. Simple Logic Tracer (Ancestors/Descendants)2. Counters/Limits/Controls3. Driving-Only (Relative Float=0) Relationship Float

Rel. Float



• Feature Development 2013-2015 (VBA)1. Simple Logic Tracer (Ancestors/Descendants)2. Counters/Limits/Controls3. Driving-Only (Relative Float=0)
















Filter:Select Task Links: Drvrs+0dFF



• Feature Development 2013-2015 (VBA)4. Path Relative Float







Task9 Driving PathRelFlt=0





Task9 PathRelFlt=5





Task9 PathRelFlt=5

Task9 PathRelFlt=7





Task9 PathRelFlt=5

Task9 PathRelFlt=7

Task9 PathRelFlt=12






• Feature Development 2013-2015 (VBA)5. Longest Path Filter

• Automatically Find Last Task(s)• Driving Predecessors

6. Local Network Filter• Dedicated Button• Limited steps from Selected Task



• Feature Development 2013-2015 (VBA)7. Target Task (Bounded Network)















Task9 PathRelFlt=7





Task9 PathRelFlt=7






• Feature Development 2013-2015 (VBA)8. Cross-Project Links







Project 2a




Project 2a

Project 3a




Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub




Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub




Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub




Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub




Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub

• Feature Development 2013-2015 (VBA)9. Driving Path Drag

• DRAG = Devaux’s Removed Activity Gauge• Total Project Acceleration to be achieved by removing a particular

schedule component:• ~Task Remaining Duration (e.g. resource limitations)• ~Early Constraints• ~Predecessor Lags• ~Leveling Delays, Suspend/Resume of In-progress tasks

• In Logic Analysis, • Only the Driving Path (e.g. Critical Path) has Drag.• Drag <= Task Remaining Duration• Drag is limited by parallel paths• i.e. Drag <= Path Relative Float of Parallel paths


Program Development



• Feature Development 2013-2015 (VBA)1. Simple Logic Tracer (Ancestors/Descendants)2. Counters/Limits/Controls3. Driving-Only (Relative Float=0)4. Path Relative Float5. Longest Path Filter6. Local Network Filter7. Target Task (Bounded Network)8. Cross-Project Links9. Driving Path Drag



• Sharing the Tools• Client Needs• Macros + MS Security <> Easy sharing/deployment• VBA VB.Net VSTO (Office Add-In)• First Beta May 2015


- User Interface

• Installation• Receive link to .vsto file on deployment server(by email)• Execute link using MS Internet Explorer

• If MSIE is default browser, then just click the link• Else, copy link and paste into URL of MSIE

• MSIE automatically downloads and installs the Add-In in user’s account using “ClickOnce”

• Subject to User Access Control permissions• (Uninstall using Control Panel if desired)• New menu group added to MS Project Ribbon


- User Interface

• Trial Operation• Limited Period (7-21d)• Full Analysis Functions Available• Selectable Edition

• No Data Persistence


- User Interface

• Basic Operation• Select Task (or Tasks)


- User Interface

• Basic Operation• Select Task (or Tasks)• Select Application Button


- User Interface

• Basic Operation• Select Task (or Tasks)• Select Application Button• Click thru initial messages.


- User Interface



- User Interface



- User Interface



- User Interface



- User Interface



- User Interface

• Basic Operation• Confirm Parameters


- User Interface

• Basic Operation• View Results

Filter=“Select Task Links: Drvrs+100dFF”Group=“BPC Relative Float - All Links”


- User Interface

• Basic Operation• Restore Previous (Non-BPC) View if desired


- User Interface

• User Applications• (General) Task Logic Tracer• Longest Path Filter• Local Network Filter

BPC Logic Filter for Microsoft Project- User Interface

- User Applications

• Task Logic Tracer• Simple Project

Logic Tracing• Path Relative

Float• Cross-Project

Links• Bounded

Network (Target Task) Analysis

• Drag Analysis• Re-Sorting to

Show Logical Branches

• Rounding-Off Clock-Time Errors


- User Applications

• Task Logic Tracer• Simple Project Logic Tracing


- User Applications


• Display Output Form


- User Applications


• Predecessors Only

• Display Output Form


- User Applications


• Predecessors Only• Hide Completed Tasks• Display Output Form


- User Applications


• Predecessors Only• Hide Completed Tasks• Display Output Form• Filter = “Select Task Preds”


- User Applications

• Task Logic Tracer• Path Relative Float


- User Applications


Relationship Float = “Number of Days away from Driving”


- User Applications



Driving Path: RelFlt=0


- User Applications



Driving Path: RelFlt=0

Multiple Float Paths


- User Applications


• Show Path Rel. Flt.• Re-Sort• Filter Name = “Select

Task Preds: Drvrs+100dFF”


- User Applications

• Task Logic Tracer• Path Relative Float for Intermediate Task


- User Applications




- User Applications


• Selected Task21 (Task9 PathRelFlt=12)



- User Applications


• Selected Task21 (Task9 PathRelFlt=12)• Show Both Directions



- User Applications


• Selected Task21


- User Applications


• Selected Task21• Filter Name = “Select Task Links: Drvrs+100dFF”


- User Applications


• Selected Task21• Filter Name = “Select Task Links: Drvrs+100dFF”

• PathRelFlt (re. Task21) <> PathRelFlt (re. Task9)


- User Applications

• Task Logic Tracer• Cross-Project Links


- User Applications



- User Applications


Project 2a


- User Applications


Project 2a

Project 3a


- User Applications


Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub


- User Applications


Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub


- User Applications


Project 2a

Project 3a

Project 4aSub

Project 4a

Project 4aSubSub


- User Applications



- User Applications

• Task Logic Tracer• Cross-Project Links• Multi-Project (Master-Subproject) allows consolidated

view and calculationFS FS

FS

FS FS

FS

FS

FS

FS

FS

SS

FS FS FS FS

FS

FS FS FS

FS

FS

FS FS FS FSFS

FS

FS FS FS FS FS FS

FS FS FS FS FS

FS

T a s k 2 1

E S : 3 0 - 0 4 - 1 5 I D : 4

D u r : 3 d a y s F S : 7 d a y s

T a s k 3

E S : 3 0 - 0 4 - 1 5 I D : 5

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4

E S : 1 4 - 0 5 - 1 5 I D : 6

D u r : 1 0 d a y s F S : 0 d a y s

S t a r t : 0 1 - 0 1 - 8 4 I D : 1 8

P r o j e c t : F : \ T h o m a s \ M y D o c u m e n t s \ B P C \ R e f e r e n c

S t a r t : 0 1 - 0 1 - 8 4 I D : 1 9

F in is h : 0 1 - 0 1 - 8 4 D u r : 2 1 0 d a y s

T a s k 1 1

E S : 2 8 - 0 5 - 1 5 I D : 2

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 2

E S : 1 1 - 0 6 - 1 5 I D : 3

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 3

E S : 2 5 - 0 6 - 1 5 I D : 4

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 4

E S : 0 9 - 0 7 - 1 5 I D : 5

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 5

E S : 2 3 - 0 7 - 1 5 I D : 6

D u r : 1 0 d a y s F S : 0 d a y s

M a n u a l T e s t T a s k

E F : 3 0 - 0 5 - 1 5 T S : 0 d a y s

T a s k 1 6

E S : 0 6 - 0 8 - 1 5 I D : 8

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 7

E S : 2 0 - 0 8 - 1 5 I D : 9

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 8

E S : 0 3 - 0 9 - 1 5 I D : 1 0

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 1 9

E S : 1 7 - 0 9 - 1 5 I D : 1 1

D u r : 1 0 d a y s F S : 1 3 d a y s

T a s k 4 1

E S : 2 0 - 1 0 - 1 5 I D : 3

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4 2

E S : 0 3 - 1 1 - 1 5 I D : 4

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4 3

E S : 1 7 - 1 1 - 1 5 I D : 5

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4 4

E S : 0 1 - 1 2 - 1 5 I D : 6

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4 5

T a s k 4 7 1

E S : 2 4 - 0 3 - 1 5 I D : 1

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 2

E S : 2 1 - 0 4 - 1 5 I D : 3

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 3

E S : 1 9 - 0 5 - 1 5 I D : 4

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 4

E S : 1 6 - 0 6 - 1 5 I D : 5

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 5

E S : 1 4 - 0 7 - 1 5 I D : 6

D u r : 2 0 d a y s F S : 1 0 d a y s

T a s k 4 7 6

E S : 2 5 - 0 8 - 1 5 I D : 8

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 7

E S : 2 2 - 0 9 - 1 5 I D : 9

D u r : 2 0 d a y s F S : 0 d a y s

T a s k 4 7 1 1

E F : 1 1 - 0 5 - 1 5 T S : 0 d a y s

T a s k 4 7 1 2

E F : 0 1 - 0 6 - 1 5 T S : 0 d a y s

T a s k 4 7 1 3

E F : 2 2 - 0 6 - 1 5 T S : 0 d a y s

T a s k 4 7 1 4

E F : 1 3 - 0 7 - 1 5 T S : 0 d a y s

T a s k 4 7 1 5

E F : 0 3 - 0 8 - 1 5 T S : 0 d a y s

T a s k 4 7 1 6

E F : 2 4 - 0 8 - 1 5 T S : 0 d a y s

T a s k 0

E S : 0 1 - 0 4 - 1 5 I D : 1

D u r : 1 d a y F S : 0 d a y s

S t a r t : 0 1 - 0 1 - 8 4 I D : 1 0

F in is h : 0 1 - 0 1 - 8 4 D u r : 1 5 0 d a y s

S t a r t : 0 1 - 0 1 - 8 4 I D : 0

C o m p : 0 %

T a s k 1

E S : 0 2 - 0 4 - 1 5 I D : 2

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2

E S : 1 6 - 0 4 - 1 5 I D : 3

D u r : 1 0 d a y s F S : 0 d a y s

S t a r t : 0 1 - 0 1 - 8 4 I D : 1 1

P r o j e c t : F : \ T h o m a s \ M y D o c u m e n t s \ B P C \ R e f e r e n c

FS+ 5 0 %

FS

FS

FS

FS

FS

FS

FS

FS

FS FS FS FS FS FS FS FS FS

FS FS FS FS FS FS FS FS FS

FS FS

FS

T a s k 5

E F : 2 2 - 0 1 - 1 6 T S : 0 d a y s

D u r : 9 d a y s F S : 0 d a y s

T a s k 6

E F : 1 2 - 0 2 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 6 1

E F : 1 7 - 0 2 - 1 6 T S : 7 d a y s

T a s k 7

E F : 2 6 - 0 2 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 8

E F : 1 1 - 0 3 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 9

E F : 1 4 - 0 3 - 1 6 T S : 8 9 d a y s

T a s k 2 0

E F : 2 5 - 0 3 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 1

E F : 0 8 - 0 4 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 2

E F : 2 2 - 0 4 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 5

E F : 0 3 - 0 6 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 6

E F : 1 7 - 0 6 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 7

E F : 0 1 - 0 7 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 8

E F : 1 5 - 0 7 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 9

E F : 2 9 - 0 7 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 0

E F : 0 5 - 0 2 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 1

E F : 1 9 - 0 2 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 2

E F : 0 4 - 0 3 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 3

E F : 1 8 - 0 3 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 4

E F : 0 1 - 0 4 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 5

E F : 1 5 - 0 4 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 6

E F : 2 9 - 0 4 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 7

E F : 1 3 - 0 5 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 8

E F : 2 7 - 0 5 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 3 9

E F : 1 0 - 0 6 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 3 4 . 5 d a y s

T a s k 4 0

E F : 2 8 - 0 3 - 1 6 T S : 0 d a y s

T a s k 4 4

T a s k 4 5

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 4 6

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 4

E F : 2 0 - 0 5 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s

T a s k 2 3

E F : 0 6 - 0 5 - 1 6 T S : 0 d a y s

D u r : 1 0 d a y s F S : 0 d a y s


- User Applications

• Task Logic Tracer• Cross-Project Links• Multi-Project (Master-Subproject) allows consolidated

view and calculation

Note: Task9 no longer Critical Path


- User Applications



- User Applications


What About Task9?


- User Applications


What About Task9?

Task21: 20d away from driving Task9


- User Applications


What About Task21?

Drives Nothing.

7d from driving <<this path



<<And This one.

<<Driven by these.


- User Applications

• Task Logic Tracer• Bounded Network (Target Task) Analysis


- User Applications




- User Applications



- User Applications


Task35: 20d from being driven by Task21

Task2: Driving Task21


- User Applications

• Task Logic Tracer


- User Applications



- User Applications

• Task Logic Tracer• Bounded Network (Target Task) Analysis• Selected: Task35


- User Applications

• Task Logic Tracer• Bounded Network (Target Task) Analysis• Selected: Task35• Target: Task2


- User Applications



- User Applications


Task2: 13d (not 20d) from Driving Task35

• Task Logic Tracer• Drag Analysis

• DRAG = Devaux’s Removed Activity Gauge• Total Project Acceleration to be achieved by removing a

particular schedule component:• ~Task Remaining Duration (e.g. resource limitations)• ~Early Constraints• ~Predecessor Lags• ~Leveling Delays, Suspend/Resume of In-progress tasks



- User Applications


• DRAG = Devaux’s Removed Activity Gauge• Total Project Acceleration to be achieved by removing a

particular schedule component:• ~Task Remaining Duration (e.g. resource limitations)• ~Early Constraints• ~Predecessor Lags• ~Leveling Delays, Suspend/Resume of In-progress tasks



- User Applications


• BPC Logic Filter Displays Duration Drag Only. Drag from other components is logged for referral.


- User Applications

Thomas

Stamp


- User Applications

• Task Logic Tracer• Re-Sorting to Show Logical Branches

Analysis Parameters Displayed Results

Re-S

ort t

o Sh

ow

Logi

cal B

ranc

hes Relationships

to Check

Chec

k Dr

ivin

g/

Driv

en O

nly

View Applied Group-By Applied Sort Criteria (within groups if

applicable)

Pred

s

Succ

s

Both

No Change No Change No Change

No Change No Change No Change

No Change Name: BPC Relative Float - All LinksGroup By: Relationship Type

No Change

BPC_MultipleFloatPaths Name: BPC Relative FloatGroup By: Relative FloatThen By: Driving Path Drag (descending, if applicable)

Task check order -descending

BPC_MultipleFloatPaths Name: BPC Relative FloatGroup By: Relative FloatThen By: Driving Path Drag (descending, if applicable)

Task check order -ascending

BPC_MultipleFloatPaths Name: BPC Relative Float - All LinksGroup By: Relationship TypeThen By: Relative FloatThen By: Driving Path Drag (descending, if applicable)

Task check order -ascending


- User Applications

• Task Logic Tracer• Rounding-Off Clock-Time Errors

Default catches errors from sloppy updating:

What about Hourly Projects?


- User Applications

• Task Logic Tracer• Rounding-Off Clock-Time Errors


- User Applications

• Task Logic Tracer• Rounding-Off Clock-Time Errors Hourly Project Example


- User Applications



- User Applications


Default: Relative Float<1/2 d ignored. All tasks are shown driving.


- User Applications



- User Applications


Uncheck Rounding:


- User Applications


Uncheck Rounding:

Hour-scale relative float is correctly caught.


- User Applications

• Longest Path Filter• Last-Task Selector• Driving-Path Task Logic Tracer


- User Applications

• Longest Path Filter• Last-Task Selector

• (Ignores User’s Initial Task Selection)• Finds and selects the task (or tasks) that has

• The latest finish date of all tasks in the project that meet the following conditions:

• At least one predecessor• No successors (except external tasks)

• Driving-Path Task Logic Tracer – Limited Options


- User Applications

• Longest Path Filter• Driving-Path Task Logic Tracer – Limited Options


- User Applications

• Longest Path Filter• Default Result

Filter=“Project Longest Path”View=Group=Sort=[No Change]


- User Applications

• Local Network Filter• Limited Options• Change default steps in settings


- User Applications

• Local Network Filter• Default Re-sorted Output

View=[No Change]Filter=“Local Logic at Selected Task”Group=“BPC Relative Float - All Links”


- User Interface

• User Settings• General Settings• Analysis Preferences• About/Upgrade


- User Interface

• User Settings


- User Interface

• User Settings• General Settings


- User Interface



- User Interface



- User Interface

• User Settings• Analysis Preferences


- User Interface

• User Settings• About/Upgrade


- User Interface• Data Output and Retention

• Output• Print to pdf (preferred)• Print to Printer• Recommended Data to Include in All Legend/Hdr/Ftr

• Project Title• Project Filename• Status Date/Time• Print Date/Time• View Name applied• Group-By Name applied• Filter Name applied

• Image Copy/Paste (No Legend/Hdr/Ftr) • Table/Bar Chart (Task Menu|Copy|Copy Picture Paste)• Output Form (<Alt>PrntScrn Paste)


- User Interface

• Data Output and Retention• Retention

• Filters/Groups/Views created by BPC Logic Filter are saved with the project file.

• Logs:• Run Log of each analysis is prepared and included in a

consolidated daily log stored in the default folder. e.g. user\My Documents\BPCLogicFilter\BPC_Logic_Filter-DayLogYYYYMMDD.txt

• Run Log of each analysis is included on the output form if selected.

• Drag Log will be created for each analysis and stored in the default folder if selected. Drag comments may also be added to task notes if selected.


- User Interface• Data Output and Retention

• Retention• Data:

• Program identifies and uses up to eight custom fields for generating the required filters and views.

• Fields unavailable run is aborted.• Default: After generating the filter/group/view, program clears and releases all

the underlying data fields• Filter/group/view can only be regenerated by BPC Logic Filter.• Saving and re-opening the file immediately after running BPC Logic Filter

may cause a null-filter – i.e. all tasks are hidden. Need to Clear Filters.• User may manually tag/flag any/all tasks included in the filter and

manually re-create the view• “Mark the filtered tasks” selected (registered Std Edition required):

task.marked field is used to save underlying basis of filter. Other parts of the view are not saved.

• “Permanently save the data…” selected (registered Pro Edition required): Eight fields needed to prepare all views are permanently retained in the file. Same fields are re-used for every run – so any user edits will be overwritten.


- Limitations/ Calculation Notes

• Dates• Summary Tasks• Inactive Tasks• Manually-Scheduled Tasks• Resource Leveling



• Dates• BPC Logic Filter does not change the dates.

• Running BPC Logic Filter after editing and before re-calculating the schedule will yield incorrect results.

• Program mimics parts of forward and backward pass to compute path relative float, consistent w/ MSP behavior for task calendars, leads, lags.

• Exception: use of task calendars for path relative float vs. total slack.



• Summary Tasks• Program accounts for sequential logic through summary

tasks.• Program ignores all parent/child inheritance logic.

Schedules with the following characteristics may yield incorrect results:

• Constraints on summary tasks• Manually Scheduled summary tasks• Actual-start entries on summary tasks• Predecessors or successors on summary tasks.

• Exception: if all generations of subtasks (including sub-summaries) below the summary have no logic at all, then results may be correct. This condition seems rare in practice.



• Inactive Tasks• MSP 2010

• Program ignores all inactive tasks.• Consistent with MSP 2010 behavior – inactive tasks are

removed from logic.• MSP 2013

• Program ignores all inactive tasks.• NOT-consistent with MSP 2013 behavior – inactive tasks are

substituted with FS relationships (between all predecessors and all successors of the task) at run-time.

• Future program upgrade is planned to address this condition.



• Manual-Scheduling• Program ignores “Task Mode”• Program assumes all tasks are automatically scheduled• Logical conflicts due to manually scheduled tasks are

ignored – presumed unreal.



• Resource Leveling• Program allows resource leveling• Leveling delays are noted/logged and deducted from

relative float• Resource-constrained driving path is NOT tracked• Therefore all leveling should be cleared before running

BPC Logic Filter.

BPC Logic Filter for Microsoft Project- TenSix Example-Critical/Near Critical Paths

BPC Logic Filter for Microsoft Project- TenSix Example-Critical/Near Critical Paths Std Project Calendar is

4d (M-Th)

BPC Logic Filter for Microsoft Project- TenSix Example-Critical/Near Critical PathsAlternate Calendar

on Start MilestonesStd Project Calendar is 4d (M-Th)

BPC Logic Filter for Microsoft Project- TenSix Example-Critical/Near Critical PathsAlternate Calendar

on Start Milestones

Possible External Constraint on Fence

Std Project Calendar is 4d (M-Th)


4d (M-Th)

Traditional Approach – Use TS to Identify Critical/Near-Critical Paths


4d (M-Th)

Start Milestones Excluded from CP



4d (M-Th)

Start Milestones Excluded from CP

Fence is NCP (4d) based on

TS alone



4d (M-Th)

Using Logic Filter to Identify Critical/Near-Critical Paths


4d (M-Th)


Start Milestones are on Driving Path to Project

Completion


4d (M-Th)



Completion

Fence is 24d (not 4d) from Driving Path to Project Completion


4d (M-Th)



Completion

Fence is 24d (not 4d) from Driving Path to Project Completion

Grading is 12d (not 4d) from Driving Path to Project Completion

BPC Logic Filter for Microsoft Project- Real World Example – Container Terminal- Critical/Near Critical Paths







Deadlines: Key Milestones <>

Project End



Project End

Std Project Calendar is 5d (M-F).



Project End

Alternate Calendar on Construction




Project End


Traditional Approach – “Critical” Filter (TS<=0)



Project End


Traditional Approach – “Critical” Filter (TS<=0)

Critical Path??



Project End


Critical Path??

Traditional – “Critical” Filter + Group by TS



Project End



Critical Path??



Project End



Critical Path??

Near-Critical Paths??

BPC Logic Filter for Microsoft Project- Real World Example – Container Terminal- Critical/Near Critical Paths Std Project Calendar is

5d (M-F).


5d (M-F).


5d (M-F).

Longest Path Filter = Driving Path to Project Completion


5d (M-F).


TS= -4 >>Constraint on other path


5d (M-F).


TS= -4 >>Constraint on other path

No Slack Jumps at Calendar Changes => Mixed-Calendar

links are on weekdays.









Task Logic Tracer -> Driving Path & Near Driving Paths to Project End




Critical Path has “Drag”




Critical Path has “Drag”

Near Critical ~ No “Drag”


Task Logic Tracer -> Drag on Driving Path to Project End



“Drag” is limited by first Near Critical Path (17d)



“Drag” is limited by first Near Critical Path (17d)

Task Durations not on CP: “Drag” = 0


5d (M-F).


5d (M-F).

Constrained Milestone


5d (M-F).



5d (M-F).



5d (M-F).

Task Logic Tracer -> Driving Path & Near Driving Paths to Key Milestone



5d (M-F).

Task Logic Tracer -> Driving Path & Near Driving Paths to Key Milestone


What about Drag?


Task Logic Tracer Driving Path Drag ~ Potential Acceleration



“Drag” Limited by Parallel Logic Path (2d)




Driven Finish + Driving Start: “Negative Drag”



What About Crane Deliveries?


Driven Finish + Driving Start: “Negative Drag”

BPC Logic Filter for Microsoft Project- Real World Example – Container Terminal- Bounded Analysis – Major Equipment


Target: Crane Fabrication Task


All Logical Connections Between STS Crane Fabrication and Terminal First Commercial Lift.


All Logical Connections Between STS Crane Fabrication and Terminal First Commercial Lift.

Conclusion: Crane Erection/Testing & Transport may be delayed 53 days without delaying milestone.

BPC Logic Filter for Microsoft Project- Real World Example – Industrial EPC (4 Plants)- Check for Missing Logic in Defined Scope

12

3 4



Manually Flag tasks for inclusion in Scope of Key

Milestone (FTP1/Section1).







Check and Tag ALL Predecessors of Key

Milestone, not just driving.






Need Data Persistence

on.







on.







on.

Highlight Missing Logic


Conclusion

• Questions?

“I didn’t write BPC Logic Filter to overcome all the shortcomings of MSP; rather I wrote it to extract and present the logic-related information that is already there but which MSP does not show. In this case - as in most - it tells a more complete story than Total Slack alone.”

Date post:	12-Mar-2020
Category:	Documents
Upload:	others
View:	11 times
Download:	1 times