Brake Hughes Bellermann LLP
Multi-period assignment optimization using dynamic priority updating
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.
SAP SE
H H
H04W H04W
inventional inventional
Wen-Syan Yu Mengjiao
Li Cheng Wang