| 摘要 |
A method identifies a candidate schedule from a universe of schedules, wherein each of the universe of schedules allocates a first set of tasks to a first workforce for a first set of time periods. Based on first data representing the first set of time periods and second data representing a set of hard constraints, a set of P schedules selected from the universe of schedules is generated which includes an infeasible schedule. A set of P replicas is generated from each of the set of P schedules wherein one is generated from the infeasible schedule and each of the set of P replicas comprises schedule encoding data. A quantum annealing optimization process is applied to recursively optimize the set of P replicas that uses a cost function configured to output a cost for any replica generated from the universe of schedules and a candidate replica is identified. |
