JP2020042687A - Processing order creation device and processing order creation method - Google Patents

Abstract

To provide a processing order creation device capable of solving a large-scale processing order determination problem in a continuous processing line, and a processing order creation method.SOLUTION: A processing order creation device 1 is configured to create a processing order of multiple processing target materials in a continuous processing line and comprises: a connection matrix creation section 131 which digitizes indexes relating to connection limitations and total stock of the processing target materials and creates a connection matrix indicating a connection relationship between the processing target materials; a formulation section 132 which utilizes elements of the connection matrix and performs formulation as a mathematical programming problem for determining a processing order of the processing targets by connecting nodes corresponding to the processing target materials over a total coupling network; an Ising model conversion section 133 for converting the formulated mathematical programming problem into an Ising model available for a quantum computer; and a solution derivation section 134 for obtaining a solution by means of the quantum computer with the Ising model defined as a computation model.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a processing sequence creation device and a processing sequence creation method in a continuous processing line such as the steel industry.

  In general, the problem of creating the processing order of products in a continuous processing line such as the steel industry can be formulated as a combinatorial optimization problem.However, such a combinatorial optimization problem requires an explosion of the optimal solution when the number of elements to be determined increases. It is known that derivation is difficult, and various approximate approaches such as MIP (Mixed Integer Programming), GA (Genetic Algorithm), SA (Simulated Annealing), and PSO (Particle Swarm Optimization) have been proposed. . Also, when such a combination optimization problem is applied to a real-world problem such as a problem of determining a processing order of a plurality of materials to be processed, various contrivances have been made because of similar difficulties.

  For example, in Patent Literature 1, for the processing order determination problem, it is possible to obtain a product matrix for multiplying the number of connections by a basic matrix composed of matrix elements indicating whether direct connection from a preceding product to a following product is possible. A method of determining a processing order that satisfies an order constraint based on an operation is disclosed. Further, Patent Document 2 discloses an approach for drafting a processing sequence plan in a short time and fully automatically by devising a search method for creating a production plan of a production line in which a plurality of products are put into the same line and processing is performed. Proposed. In Patent Document 3, when creating a production plan, the search is divided into subproblems to speed up the search, and by devising the visualization, the production plan is drafted at a high speed as a whole, including human judgment. A way to do that has been proposed.

JP-A-2002-312020 JP-A-5-28162 JP 2009-9311 A

  In recent years, with the development of computer technology, the calculation speed of the combination optimization problem has been improved. However, the methods proposed in Patent Documents 1 to 3 cannot solve the above-mentioned problem of combination explosion, and thus it has been difficult to obtain an optimal solution of a large-scale processing order determination problem in a realistic time.

  The present invention has been made in view of the above problems, and has as its object to provide a processing order creation device and a processing order creation method that can solve a large-scale processing order determination problem in a continuous processing line. .

  In order to solve the above-described problems and achieve the object, a processing order creation device according to the present invention is a processing order creation device that creates a processing order of a plurality of processing target materials in a continuous processing line, A connection matrix creation unit that quantifies an index related to the connection constraint between the target materials and the stock amount, and creates a connection matrix indicating a connection relationship between the processing target materials, using an element of the connection matrix, A formalizing unit that formulates a mathematical programming problem that determines the processing order of the material to be processed by connecting corresponding nodes to each other by a fully connected network, and a quantum computer can use the formulated mathematical programming problem An Ising model conversion unit for converting into an Ising model, and a solution deriving unit for obtaining a solution by the quantum computer using the Ising model as a calculation model , Characterized in that it comprises a.

  Further, in the processing order creation device according to the present invention, in the above invention, the mathematical programming problem is that a traveling salesman problem that passes through each node corresponding to each material to be processed only once on the network and goes around all the nodes. It is characterized by being formulated as

  Further, in the processing order creation device according to the present invention, in the above invention, the solution deriving unit transmits the parameter of the Ising model to the quantum computer arranged on a cloud, and the quantum computer A quantum computer calling unit for searching for an optimal solution is provided.

  Further, in the processing order creation device according to the present invention, in the above invention, the connection matrix creation unit sets a small distance value when a forward change is made for a certain index with respect to the connection constraint, and sets a small distance value in a reverse direction. When changing, a larger distance value is set than when changing in the forward direction.

  Further, in the processing order creation device according to the present invention, in the above invention, the connection matrix creation unit is configured to perform the reverse direction change when two connection target materials cannot be continuously processed with respect to the connection constraint. It is characterized in that a distance value significantly larger than that is set.

  Further, in the processing order creation device according to the present invention, in the above invention, the connection matrix creation unit may be configured such that, with respect to the index regarding the stock amount, when a difference between the processing request dates of the processing target materials is equal to or less than a predetermined threshold value. Sets a small distance value, and sets a larger distance value when the difference between the requested processing dates of the processing target materials exceeds a predetermined threshold value than when the difference is equal to or less than the threshold value.

  In order to solve the above-described problems and achieve the object, a processing order creating method according to the present invention is a processing order creating method for creating a processing order of a plurality of processing target materials in a continuous processing line, The connection constraint between the target materials and the index regarding the stock amount are quantified, a connection matrix creation step of creating a connection matrix indicating the connection relationship between the processing target materials, and using the elements of the connection matrix, the processing target material is used. Formulating a mathematical programming problem to determine the processing order of the material to be processed by connecting corresponding nodes to each other by a fully-connected network, and a quantum computer can use the formulated mathematical programming problem An Ising model conversion step of converting into an Ising model, and using the Ising model as a calculation model by the quantum computer. Characterized in that it comprises a solution deriving step to obtain a solution, a.

  According to the present invention, it is possible to solve a large-scale processing order determination problem in a continuous processing line by formulating a processing order of a material to be processed as a mathematical programming problem and converting it into an Ising model usable by a quantum computer. Therefore, the production efficiency in the continuous processing line can be improved.

FIG. 1 is a functional block diagram of a processing order creation device according to an embodiment of the present invention. FIG. 2 is a diagram illustrating an example of a method of creating a processing order of coils to be continuously processed in a continuous annealing line. FIG. 3 is a flowchart of the processing order creation method according to the embodiment of the present invention. FIG. 4 is a diagram illustrating an example of the connection matrix created in the connection matrix creation step of the processing order creation method according to the embodiment of the present invention.

  Hereinafter, a processing order creation device and a processing order creation method according to an embodiment of the present invention will be described with reference to the drawings. Note that the present invention is not limited to the embodiments described below.

  In recent years, commercial use of quantum computers has started, and an environment has been set up in which quantum computers can be used relatively easily by cloud services via networks. The present invention solves a large-scale processing order planning problem by using a quantum computer by a cloud service via a network, for example.

[Processing order creation device]
The configuration of the processing order creation device 1 according to the embodiment of the present invention will be described with reference to FIG. FIG. 1 is a configuration diagram of the entire system including the processing order creation device 1. The system comprises a business computer 40 as a high-order computer, a processing order creation device 1 composed of a personal computer as a low-order computer, and a quantum computer 50 connected to the processing order creation device 1 via an external network N. Is done.

  The processing sequence creation device 1 is a device for creating a processing sequence (for example, a charging sequence, a manufacturing sequence) of a material to be processed in a continuous processing line. The processing order creation device 1 includes an input / output control unit 11, a storage unit 12, and a calculation unit 13.

  The input / output control unit 11 is specifically an input / output interface, and is connected to the input device 20, the display device 30, and the business computer 40. The input / output control unit 11 stores the order data input from the business computer 40 in the storage unit 12. In addition, the input / output control unit 11 outputs the optimal solution in the processing order received by the solution display unit 134b from the quantum computer 50 and input from the solution display unit 134b to the display device 30, as described later. .

  The storage unit 12 is specifically configured by a hard disk or the like, and includes an order storage unit 121 and a connection restriction storage unit 122. The order storage unit 121 stores order data including a delivery date, a processing schedule (for example, a manufacturing schedule) in each process, a desired processing date (for example, a desired manufacturing date), and the like. The connection restriction storage unit 122 stores predetermined connection restrictions between processing target materials.

  The operation unit 13 includes a connection matrix creation unit 131, a formulation unit 132, an Ising model conversion unit 133, and a solution derivation unit 134. The solution deriving unit 134 is connected to the quantum computer 50 via the network N.

  The connection matrix creation unit 131 performs a connection matrix step of quantifying an index regarding the connection constraint and the stock amount between the materials to be processed and creating a connection matrix indicating the connection relationship between the materials to be processed. An example of specific processing contents of the connection matrix creation step will be described later.

  The formulation unit 132 uses the elements of the connection matrix to connect nodes corresponding to the material to be processed by a fully-connected network, thereby formulating a mathematical programming problem that determines the processing order of the material to be processed. Perform the steps. Specifically, the formulation unit 132 connects the processing target materials by a fully-connected network, passes each node corresponding to each processing target material only once on the network, and goes around all the nodes. Formulate as a traveling salesman problem.

  The Ising model conversion unit 133 performs an Ising model conversion step of converting the mathematical programming problem (the traveling salesman problem) formulated by the formulation unit 132 into an Ising model that can be used by the quantum computer 50. An example of specific processing contents of the Ising model conversion step will be described later.

  The solution deriving unit 134 performs a solution deriving step of obtaining a solution by the quantum computer 50 using the Ising model converted by the Ising model converting unit 133 as a calculation model. The solution deriving unit 134 specifically includes a quantum computer calling unit 134a and a solution displaying unit 134b.

  The quantum computer calling unit 134a calls an API (Application Programming Interface) of the quantum computer 50 connected via the network N, and sets parameters of the Ising model created by the Ising model conversion unit 133 (formula (8) described later). Is transmitted to the quantum computer 50. In response, the quantum computer 50 performs a search step of searching for an optimal solution in the processing order.

  The solution display unit 134b receives the optimal solution in the processing order from the quantum computer 50, and performs a display step of displaying the optimal solution in the processing order on the display device 30.

  The quantum computer 50 is a quantum computer of a quantum annealing system, and is arranged on a cloud. As the quantum computer 50, for example, a computer that is publicly available and can be used by calling an API via the network N can be used. As described later, the quantum computer 50 searches for the optimal solution in the processing order by finding the minimum value of the Hamiltonian of the Ising model (see the following equation (8)) corresponding to the optimization problem.

  In the present embodiment, an example in which the quantum computer 50 is arranged on the cloud is described, but the location where the quantum computer 50 is arranged is not limited to the cloud. For example, the quantum computer 50 may be arranged in the company, and the present invention may be implemented using the quantum computer 50 owned by the company. Alternatively, the quantum computer 50 may be located in another company, and the present invention may be implemented using the quantum computer 50 owned by another company.

[Processing order creation method]
A processing order creation method according to an embodiment of the present invention will be described with reference to FIGS. In the following description, an example in which the present invention is applied to a continuous annealing line (CAL) will be described. In the continuous annealing line, the coils to be processed are connected to each other by welding to perform continuous processing, thereby performing a completely continuous operation. Since the coils continuously processed in the continuous annealing line are based on various orders, the types of coils are also various.

  FIG. 2 shows an example of a method for creating a processing order of coils to be continuously processed in a continuous annealing line. In a continuous annealing line, it is fundamental to connect and process coils from a coil having a wide sheet width to a coil having a narrow sheet width while gradually reducing the sheet width. This is because, when a large number of coils having the same width are processed, an edge mark is formed on a rolling roll, and thereafter, when a wide coil is processed, the edge mark is transferred and a quality defect occurs.

  Therefore, when a new coil processing order is created subsequent to a coil for which a processing order (connection order) has already been created, first, as shown in FIG. To form a wide-up part that connects while gradually increasing the width of the board, and then to form a narrow-down part that connects while gradually narrowing the width from a coil with a wide width to a coil with a narrow width, Connect the coils.

  As described above, in the continuous annealing line, the sheet width is repeatedly increased (narrow → wide) → narrow down (wide → narrow) → wide up, and complete continuous operation is performed while connecting the coils. At that time, the wide-up section is required to be operated at a relatively low speed, and therefore it is necessary to configure the wide-up section with as few as possible. In addition, the narrow-down portion needs to be connected while basically narrowing down the plate width and keeping the thickness change amount and the temperature change within the limits of a preset constraint.

  Here, a group from wide-up to narrow-down as shown in FIG. 2 is called a “cycle”. The number of treatments per day in the continuous annealing process is about 100, which corresponds to approximately one cycle. Therefore, when a processing plan for a plurality of days is made, a solution in which a plurality of cycles are connected is obtained.

  If the connection restrictions between the coils cannot be satisfied, the operation is performed by inserting a so-called dummy coil between the coils, but the productivity is reduced. Therefore, it is desirable that the dummy coil is not used as much as possible. Therefore, in the processing order creation method according to the present embodiment, the solution of the inventory Min and the efficiency Max is derived while considering the material to be processed up to several days ahead. That is, in the processing order creation method according to the present embodiment, the problem of the processing order of the processing target material is reduced to the traveling salesman problem by the formulation described later, and the optimal solution is obtained by utilizing the quantum computer 50 on the cloud. Is derived.

  As shown in FIG. 3, the processing order creation method according to the present embodiment performs a reading step, a connection matrix creation step, a formulation step, an Ising model conversion step, and a solution search step in this order. In the processing order creation method according to the present embodiment, after the solution search step, a display step of displaying the optimal solution in the processing order received from the quantum computer 50 on the display device 30 may be performed as necessary.

(Reading step)
In the reading step, the calculation unit 13 reads the connection constraint stored in the connection constraint storage unit 122 and the planning target order stored in the order storage unit 121 (steps S1 and S2).

(Connection matrix creation step)
In the connection matrix creation step, the connection matrix creation unit 131 creates a connection matrix indicating the connection relationship between the materials to be processed (step S3). In the connection matrix creation step, specifically, a connection matrix as shown in the following equation (1) is created.

In the above formula (1), A (i, j) is a matrix representing a connection relationship between n pieces of processing target materials, i is a preceding material of certain two treatment target materials, and j is a certain material. The following material of the two treatment target materials is shown. Each component is a distance value between each processing target material, and is determined as follows, for example.
a_ij = f (connection constraint) + g (index related to stock amount)

  Here, the “connection constraint” is determined by a difference between the sheet width and the sheet thickness between the preceding material and the following material. As described above, the change in the plate width between the preceding material and the succeeding material is desirably in the direction in which the width is reduced (hereinafter, referred to as “width narrow direction”), but is increased in width (hereinafter, “width wide”). A change in direction is also possible. Further, the change in the sheet thickness between the preceding material and the succeeding material may be within an allowable range.

  The connection matrix creation unit 131 sets a small distance value when a forward change is made for a certain index with respect to the connection constraint, and when the backward change is made, the distance is larger than when the forward change is made. Set the distance value. For example, the connection matrix creation unit 131 sets a small distance value “1” when the board width between the preceding material and the succeeding material changes in the width narrow direction as in the “narrow down portion” of FIG. Set. On the other hand, when the board width between the preceding material and the succeeding material changes in the width-wide direction, as in the “wide-up portion” in FIG. Set.

  In addition, the connection matrix creation unit 131 sets a distance value that is significantly larger than the case of changing in the opposite direction when two certain materials to be processed cannot be processed continuously with respect to the connection constraint. For example, when the preceding material and the following material cannot be connected, the connection matrix creating unit 131 sets a large distance value of about “1000” in the sense that the connection can be performed via the dummy.

  The “index related to the stock amount” is determined by the difference between the processing target materials and the processing request date. The connection matrix creation unit 131 sets a small distance value with respect to the index regarding the stock amount when the difference between the processing request dates of the processing target materials is equal to or smaller than a predetermined threshold, and sets the difference between the processing request dates between the processing target materials. Is larger than a predetermined threshold, a larger distance value is set than when it is equal to or smaller than the threshold.

  For example, the connection matrix creation unit 131 sets a small distance value “1” when the difference between the processing request dates between the processing target materials is equal to or less than the appropriate stock days (threshold), and sets the processing request between the processing target materials. If the difference between the days exceeds the appropriate stock days (threshold), a distance value of “(days difference−appropriate stock days) × 100” is set. By setting such a distance value, a material to be processed that can be used for a connection portion can be secured while preventing prefabrication.

  An example of the connection matrix creation step will be described with reference to Table 1 and FIG.

  In the following, for the sake of simplicity, as shown in Table 1, 10 to-be-processed materials (No. 1 to No. 10) having different sheet widths and sheet pressures are used, and three to four sheets each day are requested to manufacture. The description will be made assuming a certain case. The size of the material to be processed at the “creation start point” shown in FIG. 2 is 600 mm in width and 1.5 mm in thickness, and the allowable change in the width narrow direction for the ten materials to be processed shown in Table 1 FIG. 4 shows a calculated connection matrix with an amount of 100 mm, a permissible change in the widthwise direction of 200 mm, and a permissible change in plate thickness ± 0.5 mm.

  The connection matrix shown in FIG. 4 focuses on two materials to be processed, arranges the preceding material in the row direction and the succeeding material in the column direction, and uses the connection weight (distance value) as a component. Also, since there is no connection with itself, the distance value of the diagonal component is “0”. For example, the leading material is No. 4, No. of the following material. In the case of 7, since the plate width and the plate thickness do not satisfy the connection restriction and the manufacturing request date (processing request date) is close, the distance value “2001” is set. Further, since the connection weight varies depending on the direction of connection of the material to be processed, for example, the preceding material 1 → trailing material No. 2 and, for example, the preceding material No. 2 → trailing material No. It is different from the distance value in the case of 1, and forms an asymmetric connection matrix as a whole.

(Formulation step)
In the formulation step, nodes corresponding to the material to be processed are connected to each other by a fully-connected network to formulate a traveling salesman problem that determines the processing order of the material to be processed (step S4).

(Ising model conversion step)
In the Ising model conversion step, the traveling salesman problem is converted into an Ising model that can be used by the quantum computer 50 (step S5). In the Ising model conversion step, an Ising model equation (Hamiltonian equation) corresponding to the traveling salesman problem is generated by the following procedure.

First, the processing order of the processing target material is “t”, the preceding material of the two processing target materials is “i”, the following material of the two processing target materials is “j”, and the preceding material i is The variable (QUABO variable) that takes the distance value between the following and the subsequent material j (see FIG. 4) as “d ^ij ”, takes 1 when the t-th preceding material i is processed, and takes 0 when it is not processed (“KUBO variable”). _{When a} variable (QUABO variable) that takes 1 when processing the succeeding material j at the t + 1th time and 0 when not performing processing at the _{t +} 1th time is “xt _{+ 1, j} ”, a plurality of processing target materials Can be represented by the following equation (2).

  Next, a constraint condition in the traveling salesman problem that “only one material to be processed at a time can be processed” can be expressed as in the following equation (3).

  Next, the constraint condition of “processing all the materials to be processed once at a time” in the traveling salesman problem can be expressed by the following equation (4).

The above equation (3) can be modified as the following equation (5). The following equation (5) is obtained by moving 1 on the right side of the above equation (3) to the left side, taking a square so as not to generate a negative term, and satisfying the above equation (3) in all processing orders t. The expression is transformed into In the following equation (5), _HA takes the minimum value of 0 only when the constraint condition is satisfied in all the processing orders t.

The above equation (4) can be modified as the following equation (6). The following equation (6) is obtained by moving 1 on the right side of the above equation (4) to the left side, taking a square so as not to cause a negative term, and satisfying the above equation (4) with all preceding members i. The formula is a modified version. In formula (6), only if it meets a constraint in all preceding material i, H _B takes the minimum value of 0.

Here, the equation of the Ising model that satisfies the above two constraints in the traveling salesman problem can be expressed as the following equation (7). K ₁ and k ₂ in the formula (7) is a coefficient indicating the strength of the constraints (> 1), a very large number, respectively, are set.

  Then, by substituting the above equations (2), (5) and (6) into the above equation (7), the equation of the Ising model corresponding to the traveling salesman problem finally becomes the following equation (8) Can be shown as follows.

(Solution search step)
In the solution search step, the optimal solution in the processing order is searched using the quantum computer 50 (step S6). In the solution search step, the API of the quantum computer 50 is called by the quantum computer calling unit 134a. Then, the parameters of the Ising model shown in the above equation (8) are transmitted to the quantum computer 50. In response, the quantum computer 50 searches for the optimal solution in the processing order by finding the minimum value of the Hamiltonian H ^~ (indicating that there is ~ above H for convenience) in the above equation (8).

  In the solution search step, for example, when the optimal solution in the processing order of the ten materials to be processed (No. 1 to No. 10) shown in Table 1 is searched, the process at the creation start point of the processing order (see FIG. 2) Taking into account the size of the target material (plate width 600 mm, plate thickness 1.5 mm), "No. 8" → "No. 9" → "No. 7" → "No. 6" → "No. 5" → "No. The processing order of “No. 2” → “No. 1” → “No. 10” → “No. 3” → “No. 4” is obtained.

  According to the processing order creation apparatus 1 and the processing order creation method according to the present embodiment described above, the processing order of the processing target material is formulated as a traveling salesman problem, and is converted into an Ising model that can be used by the quantum computer 50. This can solve a large-scale processing order determination problem in a continuous processing line. Therefore, the production efficiency in the continuous processing line can be improved.

  Further, according to the processing order creation apparatus 1 and the processing order creation method according to the present embodiment, the high speed of the quantum computer 50 is utilized, the problem scale is increased, and the optimal solution is obtained, so that the pre-production of the product is minimized. It is possible to reduce the use of dummy coils while suppressing them. Further, according to the processing order creation device 1 and the processing order creation method according to the present embodiment, after obtaining a large number of solutions by using the high speed of the quantum computer 50, it is also possible to select a suitable solution from among them. it can.

  As described above, the processing order creating apparatus and the processing order creating method according to the present invention have been specifically described by the embodiments for carrying out the invention. However, the gist of the present invention is not limited to these descriptions, and claims Must be widely interpreted based on the description of the range. Needless to say, various changes and modifications based on these descriptions are also included in the gist of the present invention.

  For example, in the above-described embodiment, an example in which the present invention is applied to a continuous annealing line (CAL) has been described, but the scope of the present invention is not limited to this. For example, the present invention can be applied to the production of a steel strip production plan in a tandem rolling line (TCM), a hot dip galvanizing line (CGL), an electrogalvanizing line (EGL), and the like. In addition, the present invention is not limited to the above-described steelmaking line, but in a general processing line, a plurality of types of processing targets are selected in consideration of predetermined constraints to be satisfied between the processing targets, and the order of input to the processing line is selected. Can be widely applied to the creation of a production plan for determining

Reference Signs List 1 processing order creation device 11 input / output control unit 12 storage unit 121 order storage unit 122 connection constraint storage unit 13 operation unit 131 connection matrix creation unit 132 formulation unit 133 Ising model conversion unit 134 solution derivation unit 134a quantum computer calling unit 134b solution Display unit 20 input device 30 display device 40 business computer 50 quantum computer N network

Claims (7)

In a continuous processing line, a processing sequence creation device that creates a processing sequence of a plurality of processing target materials,
A connection matrix creating unit that quantifies the index regarding the connection constraint and the stock amount between the processing target materials and creates a connection matrix indicating the connection relationship between the processing target materials,
Utilizing the elements of the connection matrix, a formulation unit that formulates as a mathematical programming problem that determines the processing order of the processing target material by connecting nodes corresponding to the processing target material by a fully connected network,
An Ising model conversion unit that converts the formulated mathematical programming problem into an Ising model that can be used by a quantum computer,
A solution deriving unit that obtains a solution by the quantum computer, using the Ising model as a calculation model,
A processing order creation device, comprising:   2. The mathematical planning problem according to claim 1, wherein the mathematical programming problem is formulated as a traveling salesman problem that passes through each node corresponding to each material to be processed on the network only once and goes around all nodes. 3. Processing order creation device.   The solution deriving unit includes a quantum computer calling unit that transmits the parameters of the Ising model to the quantum computer arranged on a cloud and causes the quantum computer to search for an optimal solution in the processing order. The processing sequence creation device according to claim 1 or 2.   The connection matrix creation unit sets a small distance value when a forward change is made for a certain index with respect to the connection constraint, and when a backward change is made, a smaller distance value is set than when the forward change is made. The processing order creation device according to claim 1, wherein a large distance value is also set.   The connection matrix creation unit sets a distance value that is significantly larger than that in the case of changing in the opposite direction when two connection target materials cannot be processed continuously with respect to the connection constraint. 5. The processing order creation device according to 4.   The connection matrix creation unit sets a small distance value when the difference between the processing request dates of the processing target materials is equal to or less than a predetermined threshold value with respect to the index regarding the stock amount, and sets the processing request between the processing target materials. The processing order creation according to any one of claims 1 to 5, wherein when the day difference exceeds a predetermined threshold, a distance value larger than when the difference is equal to or less than the threshold is set. apparatus. In a continuous processing line, a processing order creation method for creating a processing order of a plurality of processing target materials,
A connection matrix creation step of quantifying the index regarding the connection constraint and the stock amount between the processing target materials and creating a connection matrix indicating a connection relationship between the processing target materials,
Using the elements of the connection matrix, formulating as a mathematical programming problem to determine the processing order of the processing target material by connecting the nodes corresponding to the processing target material by a fully connected network,
Ising model conversion step of converting the formulated mathematical programming problem into an Ising model usable by a quantum computer,
Using the Ising model as a calculation model, a solution deriving step of obtaining a solution by the quantum computer,
A method for creating a processing order, comprising:

Images