Multi-period assignment optimization using dynamic priority updating
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jan 23, 2018
Issued Date -
N/A
app pub date -
Dec 19, 2016
filing date -
Dec 19, 2016
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Software techniques are described for optimizing resource assignments among assignees of those resources, by using dynamic priority updating over a plurality of rounds of resource assignment. In particular, in example implementations, a greedy algorithm is used to optimize the resource assignments over multiple rounds based on ranked selections within each selection set of each assignee, including dynamically updating the priority of the assignees at each round, based on assignment results from one or more preceding assignment rounds.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully