Skip to content

Driving Path Alg Update #337

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ryanbeard82 opened this issue May 17, 2023 · 1 comment
Open

Driving Path Alg Update #337

ryanbeard82 opened this issue May 17, 2023 · 1 comment
Assignees
Labels
enhancement New feature or request

Comments

@ryanbeard82
Copy link
Collaborator

A method to account for different calendars along the driving path(s):

  • For a collection of incomplete predecessors
    • When the lowest dependency float <> 0
      • normalize dependency float to set the lowest value equal to 0
      • this accounts for scenarios where a predecessor task with a 7 day calendar is driving a successor task with a 5 day calendar but the dependency float is > 0 because the network spans a weekend (or other nonworking time)
@ryanbeard82 ryanbeard82 added the enhancement New feature or request label May 17, 2023
@ryanbeard82
Copy link
Collaborator Author

This should be a user configurable option

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant