Encoding of a schedule into a binary structure
First Claim
1. A method for encoding first schedule data into a data structure for use in a quantum annealing optimization process, the method comprising:
- determining, by a process optimization computing device, a schedule indicator value for each of a plurality of schedule data entries based on whether each of a first set of recorded tasks has been allocated to one or more of a plurality of identifier data names in one or more of a first set of time periods in accordance with the first schedule data to generate schedule portion data;
determining, by the process optimization computing device, a hard constraint indicator value for each of a plurality of hard constraint data entries based on whether at least one of a plurality of hard constraints has been violated by the allocation of the first set of recorded tasks to one or more of the plurality of identifier data names in one or more of the first set of time periods in accordance with the first schedule data to generate hard constraint portion data; and
generating, by the process optimization computing device, the data structure for use in a quantum annealing optimization process based on the determined schedule portion data and the determined hard constraint portion data, thereby encoding the first schedule data into a data structure for use in a quantum annealing optimization process.
4 Assignments
0 Petitions
Accused Products
Abstract
A method determines a schedule indicator value for each of a plurality of schedule data entries based on whether each of a set of recorded tasks has been allocated to one or more identifier data names in one or more of a set of time periods in accordance with the first schedule data to generate schedule portion data. A hard constraint indicator value is determined for each of a plurality of hard constraint data entries based on whether at least one hard constraint has been violated by the allocation of the set of recorded tasks to one or more of the identifier data names in one or more of the time periods in accordance with the schedule data to generate hard constraint portion data. The data structure is generated based on the determined schedule portion and hard constraint portion data encoding the schedule data into a data structure.
-
Citations
30 Claims
-
1. A method for encoding first schedule data into a data structure for use in a quantum annealing optimization process, the method comprising:
-
determining, by a process optimization computing device, a schedule indicator value for each of a plurality of schedule data entries based on whether each of a first set of recorded tasks has been allocated to one or more of a plurality of identifier data names in one or more of a first set of time periods in accordance with the first schedule data to generate schedule portion data; determining, by the process optimization computing device, a hard constraint indicator value for each of a plurality of hard constraint data entries based on whether at least one of a plurality of hard constraints has been violated by the allocation of the first set of recorded tasks to one or more of the plurality of identifier data names in one or more of the first set of time periods in accordance with the first schedule data to generate hard constraint portion data; and generating, by the process optimization computing device, the data structure for use in a quantum annealing optimization process based on the determined schedule portion data and the determined hard constraint portion data, thereby encoding the first schedule data into a data structure for use in a quantum annealing optimization process. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer readable medium having stored thereon instructions for encoding first schedule data into a data structure for use in a quantum annealing optimization process comprising machine executable code which when executed by a processor, causes the processor to perform steps to and that comprise:
-
determine a schedule indicator value for each of a plurality of schedule data entries based on whether each of a first set of recorded tasks has been allocated to one or more of a plurality of identifier data names in one or more of a first set of time periods in accordance with the first schedule data to generate schedule portion data; determine a hard constraint indicator value for each of a plurality of hard constraint data entries based on whether at least one of a plurality of hard constraints has been violated by the allocation of the first set of recorded tasks to one or more of the plurality of identifier data names in one or more of the first set of time periods in accordance with the first schedule data to generate hard constraint portion data; and generate the data structure for use in a quantum annealing optimization process based on the determined schedule portion data and the determined hard constraint portion data, thereby encoding the first schedule data into a data structure for use in a quantum annealing optimization process. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A process optimization computing device, comprising:
-
one or more processors; a memory coupled to the one or more processors which are configured to be capable of executing programmed instructions stored in the memory to and that comprise; determine a schedule indicator value for each of a plurality of schedule data entries based on whether each of a first set of recorded tasks has been allocated to one or more of a plurality of identifier data names in one or more of a first set of time periods in accordance with the first schedule data to generate schedule portion data; determine a hard constraint indicator value for each of a plurality of hard constraint data entries based on whether at least one of a plurality of hard constraints has been violated by the allocation of the first set of recorded tasks to one or more of the plurality of identifier data names in one or more of the first set of time periods in accordance with the first schedule data to generate hard constraint portion data; and generate the data structure for use in a quantum annealing optimization process based on the determined schedule portion data and the determined hard constraint portion data, thereby encoding the first schedule data into a data structure for use in a quantum annealing optimization process. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification