Skip to content
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

Refactor Optimize #37

Open
amarvin opened this issue Oct 30, 2019 · 1 comment
Open

Refactor Optimize #37

amarvin opened this issue Oct 30, 2019 · 1 comment

Comments

@amarvin
Copy link
Owner

amarvin commented Oct 30, 2019

Optimize finds optimal add/drop pairs sequentially, which is highly interpretable but suboptimal. It'd be better to allow all add/drops to find the optimal roster, then post-process to determine a priority list of add/drop pairs.

  1. Optimize roster allowing any number of adds and drops
  2. If more drops than adds, re-optimize to find who to drop first
  3. For Max(adds, remaining drops), re-optimize to find a priority for add/drop pairs

Perhaps allowing waiver wire claims for adds should be an optional input to Optimize, to isolate that capability.

@amarvin
Copy link
Owner Author

amarvin commented Nov 21, 2021

For step 2, drop based on VOR (#36).

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

No branches or pull requests

1 participant