JP4718403B2 - Processing sequence plan creation device, processing sequence plan creation method and program - Google Patents

Description

  The present invention relates to a processing order plan creation device, a processing order plan creation method, and a program, and more particularly to a processing order plan creation device and a processing order for planning a processing order of products of a plurality of products for a plurality of products. The present invention relates to a planning method and a program.

  In production lines for metal processing molds such as steel, aluminum, and copper, there are constraints that cannot be processed continuously between specific varieties with many facilities in terms of quality assurance. For example, there are restrictions that cannot be continuously processed in the casting process due to the components of the front and rear varieties, and in the rolling process due to the front and rear plate widths and thicknesses. When determining the processing order in such a process, in order to plan the processing order of all products of the planning target, an operator who is familiar with the constraints often determines the processing order manually. However, there is a problem that it takes a lot of time to plan and only a specific operator can take charge.

Therefore, various methods have been proposed for determining the processing order of products of a plurality of products on the same production line using a computer without depending on an operator (see, for example, Patent Document 1). In the production plan creation method disclosed in Patent Document 1, the processing order is planned according to the following procedure.
1. A product to be preferentially processed is selected from among products to be processed.
2. The processing order of the products to be preferentially processed is determined.
3. If there is a constraint violation in the determined processing order, a product that does not need to be preferentially processed is added between the products in violation.

  According to this method, as shown in FIG. 12, even if there is no connection in the processing order (in FIG. 12, connection between product type E and product C is not possible), a product that does not need to be processed preferentially. (In FIG. 12, the types G and F) are inserted into the non-connectable portion, so that the non-connectable state can be eliminated. Therefore, even when there is a combination that cannot be operated in continuous processing between varieties, an executable processing order can be planned.

JP 2002-312020 A

  However, in the production plan creation method of Patent Document 1 described above, since the types (types G and F) that do not need to be preferentially processed are added to the part that cannot be connected between the types, the connection is disabled. If it is difficult to distinguish between the types that should be processed preferentially and the types that do not need to be processed preferentially, or if all types that do not need to be processed preferentially have already been processed In the case of disappearance), there is a problem that it becomes impossible to process all kinds of products.

  The present invention has been made to solve the above-described problems, and even when there are combinations that cannot be operated in connection between varieties as operation restrictions, products of all varieties can be processed. It is an object of the present invention to provide a processing sequence plan creation apparatus, a processing sequence plan creation method, and a program for creating a possible processing plan.

Means for Solving the Problems and Effects of the Invention

  In order to achieve the above object, a processing order plan creating apparatus of the present invention is a processing order plan creating apparatus for planning a processing order of products of a plurality of varieties for a plurality of varieties of products. An inter-product type connection constraint storage means for storing an inter-product type connection constraint table in which connectability information indicating whether or not there is an operationally operable relationship between them is stored, and an inter-product type connection constraint table Referring to each of a plurality of varieties, with reference to a pre-variety registration means for registering a pre-variety that can be processed before a predetermined varieties due to operation restrictions, and a connection restriction table between varieties, a plurality of For each of the varieties, the subsequent varieties registration means for registering subsequent varieties that can be processed after the predetermined varieties, and the pre-varieties registered by the pre-variety registration means, Remaining And a pre-variety remaining amount registering means for updating the remaining amount every time the processing order of a predetermined variety is determined, and the N (N: integer greater than or equal to 2) number of types to be processed. Then, from among the subsequent varieties registered by the subsequent varieties registration means, a variety that can be processed after the (N-1) th predetermined varieties can be selected as a candidate due to operation restrictions, and the candidate is selected from the candidates. And a succeeding product type determining unit for preferentially determining a candidate whose total remaining number of processing times of the preceding product type is 0 by the preceding product remaining amount registering unit as a succeeding product type.

  In the processing sequence plan creating apparatus according to the present invention, as described above, by referring to the subsequent varieties registered by the subsequent varieties registration means, candidates for processing the subsequent varieties for the N-1th processed varieties as Nth can do. Then, by referring to the remaining number of processing times of the preceding varieties registered by the preceding cultivar remaining amount registering means, the remaining amount of the preceding varieties (the number of processing times of the preceding varieties for the candidate varieties) is included in the candidate varieties. When there is a variety whose total amount is 0), the variety can be preferentially processed to the Nth. As a result, since there is no remaining product that can be processed before the predetermined product, it is possible to prevent a situation in which it is impossible to connect to the predetermined product. For this reason, it is possible to prevent a situation in which it is impossible to connect to a predetermined product by preferentially determining the product with the remaining number of pre-product from 0 among the subsequent products in each product determination step. be able to. As a result, if the processing sequence plan creation apparatus of the present invention is used, even if there is a combination that cannot be operated in connection between varieties as an operation constraint, a processing plan that can process products of all varieties. Can be planned.

  In the processing order plan creation apparatus, in the inter-product connection restriction table, connection priority information between each product is registered in addition to the connectability information, and the succeeding product determining means selects the product to be processed Nth. In the case of determination, from among the subsequent varieties registered by the subsequent varieties registration means, a variety that can be processed after the predetermined variety processed in the (N-1) th operation is selected as a candidate, and the candidate is selected. If there is no subsequent product with a total remaining number of processing times of the previous product of 0, the subsequent product is prioritized from the candidates based on the connection priority information registered in the inter-product connection restriction table. To decide. In this way, when there is no cultivar having a remaining pre-variety of 0 in the subsequent varieties, the cultivar is determined based on the connection priority, and the cultivar having the remaining pre-variety is 0 among the subsequent varieties. If there is a configuration, the processing order is planned based on the connection priority while preventing a situation where connection to a predetermined type is impossible, if the configuration is determined with priority. be able to.

  In this case, the processing sequence plan creation apparatus indexes the connection priority information in the inter-product connection constraint storage means based on the setup time required for changing the product type to be processed, and registers it in the inter-product connection constraint table. Time indexing means may be provided. By configuring in this way, it is possible to preferentially determine a product with a short setup time and prevent a setup from being lost to a predetermined product, and to create a plan with less setup time loss. .

  The processing order plan creation method of the present invention is a processing order plan creation method for planning the processing order of products of a plurality of varieties for a plurality of varieties of products. The inter-product connection constraint storage step for storing the inter-product connection constraint table in which the connectability information indicating whether or not there is an operationally operable relationship is stored. For each of a plurality of varieties, with reference to the pre-variety registration step for registering a pre-variety that can be processed before the predetermined varieties for operation restrictions and the inter-variety connection restriction table. Subsequent variety registration step for registering subsequent varieties that can be processed after the variety due to operational restrictions, and for the previous variety registered in the previous variety registration step, the remaining number of processing times of the preceding variety is determined. When the processing order of a predetermined product type is determined, the pre-product type remaining amount registration step for updating the remaining amount and the product type to be processed Nth (N: integer of 2 or more) are determined. From among the subsequent varieties registered in the subsequent varieties registration step, the subsequent varieties that can be processed after the predetermined varieties processed in (N-1) th are selected as candidates, and the candidates are selected from the candidates. A succeeding product type determining step for preferentially determining a candidate whose total remaining number of processing times of the preceding product type is 0 in the preceding product remaining amount registering step as a succeeding product type.

  In the processing order plan creation method according to the present invention, as described above, by referring to the succeeding variety registered in the succeeding variety registering step, the candidate for processing the succeeding variety for the N-1th processed variety as the Nth candidate is processed. It can be. Then, by referring to the remaining number of times of processing of the preceding varieties registered in the preceding varieties remaining amount registration step, the remaining amount of the preceding varieties (processing of the preceding varieties for the candidate varieties is included in the candidate varieties. In the case where there is a variety whose total number of remaining times is 0, the variety can be preferentially processed to the Nth. As a result, since there is no remaining product that can be processed before the predetermined product, it is possible to prevent a situation in which it is impossible to connect to the predetermined product. For this reason, it is possible to prevent a situation in which it is impossible to connect to a predetermined product by preferentially determining the product with the remaining number of pre-product from 0 among the subsequent products in each product determination step. be able to. As a result, if the processing order plan creation method of the present invention is used, even if there is a combination that makes operation impossible in connection between varieties, a processing plan that can process products of all varieties. Can be planned.

  Further, the program of the present invention is a program for causing a computer to plan the processing order of products of a plurality of varieties for a plurality of varieties of products. With reference to the inter-product connection constraint storage step for storing the inter-product connection constraint table in which the connectability information indicating whether or not there is a possible relationship is registered, for each of a plurality of product types, Referring to the pre-variety registration step for registering a pre-variety that can be processed before a predetermined variety due to operational restrictions and the inter-product connection restriction table, each of a plurality of varieties is processed after the predetermined variety In the subsequent product registration step for registering subsequent product types that can be operated due to operational restrictions, and for the previous product registered in the previous product registration step, the remaining number of processing times for the previous product is registered. In addition, every time the processing order of a predetermined product is determined, the pre-product remaining amount registration step for updating the remaining amount, and the case of determining the product to be processed in the Nth (N: integer greater than or equal to 2) order, From among the subsequent varieties registered in the varieties registration step, select the subsequent varieties that can be processed after the predetermined varieties processed in the (N-1) th as operational candidates, and from among the candidates, The computer is caused to execute a subsequent product determination step for preferentially determining a candidate for which the total remaining number of processing times for the previous product is 0 in the previous product remaining amount registration step.

  In the program according to the present invention, as described above, by referring to the succeeding variety registered in the succeeding variety registering step, the succeeding variety corresponding to the N-1th processed variety can be set as a candidate for the Nth processing. it can. Then, by referring to the remaining number of times of processing of the preceding varieties registered in the preceding varieties remaining amount registration step, the remaining amount of the preceding varieties (processing of the preceding varieties for the candidate varieties is included in the candidate varieties. In the case where there is a variety whose total number of remaining times is 0, the variety can be preferentially processed to the Nth. As a result, since there is no remaining product that can be processed before the predetermined product, it is possible to prevent a situation in which it is impossible to connect to the predetermined product. For this reason, it is possible to prevent a situation in which it is impossible to connect to a predetermined product by preferentially determining the product with the remaining number of pre-product from 0 among the subsequent products in each product determination step. be able to. As a result, if the program of the present invention is used, a processing plan capable of processing products of all varieties even when there is a combination that cannot be operated in connection between the varieties as an operation constraint. Can do.

  The program according to the present invention is a program that allows a computer to function as the processing order plan creation apparatus as described above, and has the same effects as the processing order plan creation apparatus as described above. The program according to the present invention can be recorded and distributed on a removable recording medium such as a CD-ROM, FD, or MO, or a fixed recording medium such as a hard disk, or can be distributed via wired or wireless telecommunication means. It can be distributed via a communication network.

  DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiments embodying the present invention will be described below with reference to the drawings.

  FIG. 1 is a block diagram showing a configuration of a processing order plan creation apparatus according to an embodiment of the present invention. FIG. 2 is a diagram showing connection availability information and setup time stored in the inter-product connection restriction table. FIG. 3 is a diagram showing the subsequent product type and the setup time stored in the subsequent product type registration unit. FIG. 4 is a diagram showing the front varieties stored in the front varieties registration unit and the front varieties remaining amount registration unit and their planned remaining amounts. First, with reference to FIGS. 1-4, the structure of the processing order plan creation apparatus 1 by this embodiment is demonstrated.

  The processing sequence plan creation apparatus 1 according to the present embodiment is capable of processing one type of processing apparatus capable of processing five types of products A, B, C, D, and E having different materials and plate thicknesses. It is an apparatus for planning the order of supplying products of five varieties A to E. Since there is a combination of varieties that cannot be processed continuously due to operational restrictions due to differences in materials, plate thicknesses, etc., in the above processing devices, using the processing sequence plan creation device 1 according to the present embodiment, Develop an executable processing sequence. Further, when processing products of types A to E, the processing device needs to be set in accordance with the types A to E. When changing the type of product to be processed, it is necessary to change the settings of the processing device. Setup time is required. As shown in FIG. 1, the processing sequence plan creation apparatus 1 includes a planning target data storage unit 11, an inter-product connection constraint table 12 (inter-product connection constraint storage unit), an initial state setting unit 13, and a pre-product type registration. Unit 14 (previous product registration unit), subsequent product registration unit 15 (subsequent product registration unit), pre-product type remaining amount registration unit 16 (pre-product type remaining amount registration unit), and subsequent product type determination unit 17 (following) Product type determining means), planned intermediate state storage section 18, and setup time indexing section 20 (setup time indexing means).

  Here, the processing order plan creation apparatus 1 shown in FIG. 1 is configured by, for example, a general-purpose computer (process computer or the like). Such a computer stores hardware such as a CPU, ROM, RAM, and hard disk. The hard disk includes a program for causing the computer to function as the processing sequence plan creation device 1 (this program is a CD-ROM, Various kinds of software are stored, which can be installed in any computer by recording on a removable recording medium such as FD or MO. And the processing order plan creation apparatus 1 is constructed | assembled by combining these hardware and software.

  The planning target data storage unit 11 is used to record product information (weight, number, length, etc.) of varieties A to E whose processing order is to be created by the processing order plan creation device 1 according to this embodiment. It may be input by the processing sequence plan creator or automatically input by another computer or the like.

  The inter-product type connection constraint table 12 is provided for registering operation constraint conditions between product types, and indicates whether or not there is a relationship that allows continuous processing between each product type because of operation constraints. The connectability information shown is registered. Specifically, as shown in FIG. 2, in the inter-product type connection restriction table, connection availability information “×” indicating a relationship that cannot be continuously processed between product types due to operation restrictions is registered. Yes. It should be noted that there is a relationship that can be continuously processed due to operation restrictions between the types corresponding to the portions other than the connection possibility information “×”. That is, referring to the inter-product type connection restriction table 12 of this embodiment, it is understood that after processing the product type A, it is impossible to process the product type B and the product type E. It can be seen that it can be processed.

  In addition, in the inter-product type connection restriction table 12 of the present embodiment, in addition to the above-described connectability information “×”, the setup time between each product type is registered as an index. The indexed setup time stored in the inter-product connection restriction table 12 is supplied from a setup time indexing unit 20 described later.

  The initial state setting unit 13 is provided for setting the number of times of processing products of types A to E (hereinafter, the number of times of planned processing). Specifically, in the present embodiment, the number of planned processes for products of varieties A to E is all “1”. Therefore, the initial state setting unit 13 causes the planned number of processes for varieties A to E to be “1”. Is set in the pre-variety remaining amount registration unit 16 to be described later.

  The pre-variety registration unit 14 refers to the above-described inter-product connection restriction table 12 and registers pre-product varieties that can be processed before a predetermined product for the products A to E due to operation restrictions. . Therefore, as shown in FIG. 4, the varieties B to D that can be processed before the varieties A are registered in the pre-variety registration unit 14 as pre-varieties. In addition, for cultivar B, varieties C and D are registered as the predecessor varieties, varieties A, B, D, and E are registered as the predecessor varieties. And E are registered, and for the varieties E, varieties B and C are registered as pre-varieties.

  The subsequent product type registration unit 15 refers to the above-mentioned inter-product type connection restriction table 12 and registers the following product types that can be processed after a predetermined product type in terms of operation restrictions. Accordingly, as shown in FIG. 3, types C and D that can be processed continuously after type A are registered in the subsequent type registering unit 15 as subsequent types as shown in FIG. Also, for cultivar B, varieties A and C to E are registered as succeeding varieties, varieties A, B, D, and E are registered as succeeding varieties for varieties C, and varieties A to C are registered as succeeding varieties for varieties D. Registered, and for product type E, product types A, C and D are registered. Further, the setup time between each type is registered in the subsequent type registration unit 15 together with the subsequent type.

  The pre-variety remaining amount registering unit 16 is provided for registering the remaining amount (plan remaining amount) of the number of times the pre-variety can be processed before the predetermined variety because of operational restrictions. In the present embodiment, since the number of times of planned processing for the products of varieties A to E is set to one each, as shown in FIG. 1 ”prefix varieties A to E are registered. In addition, not only the individual planned remaining amount of the preceding varieties A to E but also the total of the remaining remaining amount of the preceding varieties corresponding to the predetermined varieties are registered in the preceding variety remaining amount registering unit 16. Yes. For example, in the example of FIG. 4, the individual planned remaining amount of the front varieties corresponding to the varieties A (in FIG. 4, the front varieties B: 1, the front varieties C: 1, the front varieties D: 1, the front varieties A total of varieties E: 1 (hereinafter referred to as a pre-variety remaining amount) (total: 4 in FIG. 4) is registered.

  The pre-variant remaining amount registering unit 16 has a function of updating the registered remaining pre-variety planned remaining amount and the pre-variety remaining amount each time the processing order is determined by a subsequent product determining unit 17 described later. Have. For example, when processing of the product type A is determined by the subsequent product type determination unit 17, the planned remaining amount of the front product type A registered in the front product type remaining amount registration unit 16 is reduced by 1, and the product type A Decrease the remaining amount of the cultivar by 1 as the cultivar.

  Here, in the present embodiment, the subsequent product type determination unit 17 is provided to sequentially determine the product type to be processed by the processing apparatus. When determining the N (N: integer greater than or equal to 2) th type of product to be processed, the subsequent product type determining unit 17 first refers to the subsequent product type registering unit 15 and determines the (N-1) th processed type. Subsequent varieties, which can be processed after the varieties, can be selected as candidates. Subsequently, the succeeding product type determining unit 17 refers to the preceding product type registering unit 14 and the preceding product type remaining amount registering unit 16, and the succeeding product type in which the preceding product remaining amount of the succeeding product type selected as a candidate becomes zero. Is prioritized. In the case where there is no subsequent variety in which the remaining amount of the pre-variety is 0 among the candidate subsequent varieties, the subsequent variety determination unit 17 is indexed by the subsequent variety registration unit 15 shown in FIG. With reference to the setup time, it is determined that the subsequent product of the combination with the minimum setup time is the product to be processed Nth.

  The planned intermediate state storage unit 18 has a function of storing the product determined by the subsequent product determining unit 17 in association with the process number N.

  The setup time indexing unit 20 has a function of indexing the setup time required in accordance with the change of the product type to be processed and storing it in the above-mentioned product type connection restriction table 12. The indexed setup time indicates the connection priority between each product type. The smaller the value, the shorter the time required to change the setting of the processing device, and the larger the value, the time required to change the setting of the processing device. Indicates that it is long.

  Next, a procedure for planning a processing order by the processing order plan creating apparatus 1 according to the present embodiment will be described with reference to FIGS. FIG. 5 to FIG. 8 are diagrams showing the prefix varieties stored in the prefix varieties registration unit and the prefix varieties remaining amount registration unit and their planned remaining amounts. FIG. 9 is a flowchart showing a procedure for planning the processing order. FIG. 10 is a diagram showing the varieties determined by the subsequent varieties determining unit and the varieties that are candidates as the subsequent varieties of the varieties.

(Initial setting)
First, in the inter-product type connection restriction table 12, connection enable / disable information indicating whether or not there is an operational relationship between the product types A to E is registered. Then, referring to the inter-variety connection restriction table 12, for the varieties A to E, the pre-varieties that can be processed before the varieties A to E are registered in the pre-variety registration unit 14 due to operation restrictions. Subsequent varieties that can be processed after the varieties A to E are registered in the subsequent varieties registration unit 15 because of operational restrictions. Further, the number of planned processes for each of the varieties A to E (in the present embodiment, all of the varieties A to E are registered once) is registered in the pre-variety remaining amount registration unit 16 (step S1). This initial state is shown in FIG. Then, process number N = 1 is set (step S2).

(N = Extraction of candidate for the first processing type)
Then, with reference to the subsequent product type registration unit 15, product type candidates that can be processed after the most recently processed product type due to operation restrictions are extracted. In the present embodiment, it is assumed that the processing of the product type A (see FIG. 10) has been completed most recently. Therefore, since the varieties that can be processed after the processing of the varieties A are varieties C and D, as shown in FIGS. 3 and 10, the cultivar No. 1 with the process number N = 1 is the varieties C and D. (Step S3).

(Check the remaining amount of pre-variety (N = 1))
It is determined whether or not there is a variety candidate whose process type N is the first variety candidate (variety C and D) and the remaining amount of the previous kind of the variety candidate is 0 (step S4). As shown in FIG. 4, the pre-variant remaining amount of the variety C that is a variety candidate is 4, and the pre-variant remaining amount of the variety D that is a variety candidate is 4. Neither is zero.

(Determination of product type (N = 1))
In the case where none of the preceding product remaining amounts of the products C and D which are product candidates are 0 (step S4: No), in the present embodiment, the succeeding product determination unit 17 minimizes the indexed setup time. A product type is determined (step S5). Therefore, the succeeding product type determining unit 17 refers to the succeeding product type registering unit 15 shown in FIG. 3 and changes the setup time “5” required for changing from the product type A to the succeeding product type C, and from the product type A to the succeeding product type D. The setup time “0” required for the change is compared, and the product type D is determined as the product type to be processed first N = 1 and stored in the planned intermediate state storage unit 18. Thereby, the process number N = 1 and the product type D are stored in association with each other.

(Update of the remaining plan and remaining product (N = 1))
Since the product type D has been determined, the front product type remaining amount registration unit 16 updates the planned remaining amount corresponding to the front product type D registered in the front product type registration unit 14 by one. Further, as shown in FIG. 5, since the product D has completed one planned processing, a flag indicating the completion is stored in the pre-product type registration unit 14 and the pre-product type remaining amount registration unit 16. . In the example of FIG. 5, the corresponding part is a hatched area. Then, by reducing the planned remaining amount of the product D, the preceding product remaining amount registering unit 16 updates the remaining product of each of the products A, B, and C by 1 (step S6). Thereafter, it is determined whether or not N (N = 1 at this time) stored in the planned intermediate state storage unit 18 matches the planned number (5 in the present embodiment) (step S7). . At this time, since N stored in the planned intermediate state storage unit 18 does not match the planned target number (step S7: No), 1 is added to N stored in the planned intermediate state storage unit 18, and the process number N = 2 is set.

(N = Extraction of candidate for the second processing type)
Then, with reference to the subsequent product type registration unit 15, product type candidates that can be processed after the most recently processed product type due to operation restrictions are extracted. In the present embodiment, the processing of the product type D (see FIG. 10) has been completed most recently. Therefore, since the varieties that can be processed after the processing of the varieties D are varieties A, B, and C, as shown in FIGS. B and C (step S3).

(Check the remaining amount of pre-variety (N = 2))
It is determined whether or not there is a variety candidate whose process type N = 2nd variety candidate (variety A, B, and C) has a pre-variety remaining amount of the variety candidate is 0 (step S4). As shown in FIG. 5, the pre-variety remaining amount of the breed A that is the breed candidate is 3, the remaining amount of the pre-variety of the breed B that is the breed candidate is 1, and the front of the breed C that is the breed candidate. The remaining variety is 3. None of the pre-variety remaining amount is zero.

(Determination of product type (N = 2))
Since none of the varieties A, B, and C, which are candidate varieties, are in front of the remaining varieties (step S4: No), in this embodiment, the succeeding varieties determining unit 17 minimizes the indexed setup time. Is determined (step S5). Therefore, the succeeding product type determining unit 17 refers to the succeeding product type registering unit 15 shown in FIG. 3 and changes the setup time “10” required for changing from the product type D to the succeeding product type A, and from the product type D to the succeeding product type B. The setup time “15” required for the change is compared with the setup time “5” required for the change from the product D to the subsequent product C, and the product C is determined as the product to be processed N = 2nd. The plan intermediate state storage unit 18 stores the result. Thereby, the process number N = 2 and the product type C are stored in association with each other.

(Updating the remaining plan and remaining product (N = 2))
Since the product type C has been determined, the pre-product type remaining amount registration unit 16 updates the planned remaining amount corresponding to the pre-product type C registered in the pre-product type registration unit 14 by one. Further, as shown in FIG. 6, since the product C has completed one planned processing, a flag indicating the completion is stored in the pre-product type registration unit 14 and the pre-product type remaining amount registration unit 16. . In the example of FIG. 6, the corresponding part is a hatched area. Then, by reducing the planned remaining amount of the product C, the front product remaining amount registering unit 16 updates the front product remaining amount of the products A, B, D, and E by 1 (step S6). . Thereafter, it is determined whether or not N (N = 2 at this time) stored in the planned intermediate state storage unit 18 matches the number of objects to be planned (5 in this embodiment) (step S7). . At this time, since N stored in the planned intermediate state storage unit 18 does not match the planned target number (step S7: No), 1 is added to N stored in the planned intermediate state storage unit 18, and the process number N = 3 is set.

(N = Extract candidate for the third type to be processed)
Then, with reference to the subsequent product type registration unit 15, product type candidates that can be processed after the most recently processed product type due to operation restrictions are extracted. In the present embodiment, the processing of the product type C (see FIG. 10) has been completed most recently. Therefore, the varieties that can be processed after the processing of the cultivar C are varieties A, B, D, and E as shown in FIGS. 3 and 10, but the cultivar D has already been determined (variety D Therefore, the process number N = third product type candidate is product types A, B, and E (step S3).

(Check the remaining amount of pre-variety (N = 3))
It is determined whether or not there is a breed candidate for which the remaining number of the previous breed of the breed candidate is 0 in the process number N = third breed candidate (variety A, B and E) (step S4). As shown in FIG. 6, the pre-variant remaining amount of the breed A that is the breed candidate is 2, the remaining amount of the pre-variety of the breed B that is the breed candidate is 0, and the front of the breed E that is the breed candidate. The remaining variety is 1.

(Determination of product type (N = 3))
Here, in this embodiment, since the pre-type remaining amount of the product type B that is a product type candidate is 0 (step S4: Yes), the product type B is determined as the product type to be processed N = 3rd (step). S <b> 9), which is stored in the planned intermediate state storage unit 18. Thereby, the process number N = 3 and the product type B are stored in association with each other.

(Updating the remaining plan and remaining product (N = 3))
Since the product type B has been determined, the pre-product type remaining amount registration unit 16 updates the plan remaining amount corresponding to the pre-product type B registered in the pre-product type registration unit 14 by one. Further, as shown in FIG. 7, since the product B has completed one planned processing, a flag indicating completion is stored in the pre-product type registration unit 14 and the pre-product type remaining amount registration unit 16. . In the example of FIG. 7, the corresponding part is a shaded area. Then, by reducing the planned remaining amount of the product B, the preceding product remaining amount registering unit 16 updates the remaining product of each of the products A, C, D, and E by 1 (step S6). . Thereafter, it is determined whether or not N (N = 3 at this time) stored in the mid-planning state storage unit 18 matches the number of planning targets (5 in the present embodiment) (step S7). . At this time, since N stored in the planned intermediate state storage unit 18 does not match the planned target number (step S7: No), 1 is added to N stored in the planned intermediate state storage unit 18, and the process number N = 4 is set.

(N = extract the candidate for the 4th type to be processed)
Then, with reference to the subsequent product type registration unit 15, product type candidates that can be processed after the most recently processed product type due to operation restrictions are extracted. In the present embodiment, the processing of the product type B (see FIG. 10) has been completed most recently. Therefore, the varieties that can be processed after the processing of the varieties B are varieties A, C, D, and E as shown in FIGS. 3 and 10, but the varieties C and D have already been determined ( Since the planned remaining amounts of the varieties C and D are 0), the cultivar No. 4 with the process number N = 4 is the varieties A and E (step S3).

(Check the remaining amount of pre-variety (N = 4))
It is determined whether or not there is a breed candidate for which the preceding breed remaining amount of the breed candidate is 0 in the process number N = fourth breed candidate (kinds A and E) (step S4). As shown in FIG. 7, the remaining amount of the previous type of the type A that is the type candidate is 1 and the remaining amount of the previous type of the type E that is the candidate of the type E is 0.

(Determination of product type (N = 4))
Here, in the present embodiment, since the pre-variety remaining amount of the product type E, which is the product type candidate, is 0 (step S4: Yes), the product type E is determined as the product to be processed N = 4th (step). S <b> 9), which is stored in the planned intermediate state storage unit 18. Thereby, the process number N = 4 and the product type E are stored in association with each other.

(Updating the remaining plan and remaining product (N = 4))
Since the product type E is determined, the front product type remaining amount registering unit 16 updates the planned remaining amount corresponding to the front product type E registered in the front product type registering unit 14 by one. Further, as shown in FIG. 8, since the product type E has completed one planned processing, a flag indicating the completion is stored in the front product type registration unit 14 and the front product type remaining amount registration unit 16. . In the example of FIG. 8, the corresponding part is a hatched area. Then, by reducing the planned remaining amount of the product type E, the front product type remaining amount registering unit 16 updates the front product type remaining amount of the product types A, C, and D by 1 respectively (step S6). Thereafter, it is determined whether or not N (N = 4 at this time) stored in the planned intermediate state storage unit 18 matches the number of objects to be planned (5 in the present embodiment) (step S7). . At this time, since N stored in the planned intermediate state storage unit 18 does not match the planned target number (step S7: No), 1 is added to N stored in the planned intermediate state storage unit 18, and the process number N = 5 is set.

(N = 5th candidate for processing type is extracted)
Then, with reference to the subsequent product type registration unit 15, product type candidates that can be processed after the most recently processed product type due to operation restrictions are extracted. In the present embodiment, the processing of the product type E (see FIG. 10) has been completed most recently. Therefore, the varieties that can be processed after the processing of the varieties E are varieties A, C, and D as shown in FIGS. 3 and 10, but the varieties C and D have already been determined (variety C And the planned remaining amount of D is 0), the candidate for the processing number N = 5 is only the product A, and the product A is determined as the product to be processed N = 5, and the planned state Save in the storage unit 18. As a result, the process number N = 5 and the product type A are stored in association with each other.

  Thereafter, it is determined whether or not N (N = 5 at this time) stored in the mid-planning state storage unit 18 matches the number of planning targets (5 in the present embodiment) (step S7). . At this time, since N stored in the mid-planning state storage unit 18 matches the number of planning targets (step S7: Yes), the process ends. In this way, the processing order is registered in the planned intermediate state storage unit 18 in the order of D, C, B, E, and A, and an executable processing order is drafted.

  In the present embodiment, as described above, by referring to the succeeding product type registration unit 15, the succeeding product type for the product processed in the (N-1) th product can be set as a candidate for processing in the Nth product. Then, by referring to the prefix varieties registration unit 14 and the prefix varieties remaining amount registration unit 16, when there is a varieties having a prefix varieties remaining zero among the candidate varieties, the corresponding varieties are designated as Nth. It can be a variety to be processed. As a result, since there is no remaining product that can be processed before the predetermined product, it is possible to prevent a situation in which it is impossible to connect to the predetermined product. For this reason, it is possible to prevent a situation in which connection to a predetermined product type is impossible by determining the product type with the remaining pre-product type 0 from the subsequent product types in each product type determination step. . As a result, if the processing sequence plan creation apparatus 1 of the present embodiment is used, it is possible to process products of all varieties even when there are combinations in which connection between varieties is operationally impossible as operation restrictions. A processing plan can be drawn up.

  If priority is given to the set-up time without determining the type with the remaining amount of the previous type 0, as shown in FIG. 11, the products of type B and type E cannot be processed. We will make a plan.

  Further, in the present embodiment, by using the setup time indexed by the setup time indexing unit, it is possible to prevent a product having a short setup time while preventing a situation where connection to a predetermined product is impossible. It is possible to make a decision with priority and to make a plan with little loss of setup time.

  The embodiment disclosed this time should be considered as illustrative in all points and not restrictive. The scope of the present invention is shown not by the above description of the embodiments but by the scope of claims for patent, and further includes all modifications within the meaning and scope equivalent to the scope of claims for patent.

  For example, the embodiment includes the inter-product connection restriction table 12, the pre-product type registration unit 14, the subsequent product type registration unit 15, the pre-product type remaining amount registration unit 16, the subsequent product type determination unit 17, and the setup time indexing unit 20. However, the present invention is not limited to this, and may be a program that causes a computer to function as each of the above-described units.

  Further, in the above-described embodiment, an example is shown in which, when there is no product whose remaining remaining product is 0, the subsequent product is determined based on the indexed setup time. However, the present invention is not limited to this, and the setup is not limited thereto. Using an index other than time (for example, delivery date), when there is no product whose remaining remaining product is 0, the subsequent product may be determined.

It is a block diagram which shows the structure of the processing order plan preparation apparatus by one Embodiment of this invention. It is the figure which showed the connection permission information memorize | stored in the connection restriction | limiting table between types, and the setup time. It is the figure which showed the following kind and setup time memorize | stored in a following kind registration part. It is the figure which showed the prefix varieties memorize | stored in the prefix varieties registration part and the prefix varieties residual quantity registration part, and its plan residual amount. It is the figure which showed the prefix varieties memorize | stored in the prefix varieties registration part and the prefix varieties residual quantity registration part, and its plan residual amount. It is the figure which showed the prefix varieties memorize | stored in the prefix varieties registration part and the prefix varieties residual quantity registration part, and its plan residual amount. It is the figure which showed the prefix varieties memorize | stored in the prefix varieties registration part and the prefix varieties residual quantity registration part, and its plan residual amount. It is the figure which showed the prefix varieties memorize | stored in the prefix varieties registration part and the prefix varieties residual quantity registration part, and its plan residual amount. It is the flowchart which showed the procedure which plans a processing order. It is the figure which showed the kind determined as the succeeding kind of the kind determined by the succeeding kind determination part, and the kind. It is the figure which showed the processing plan at the time of giving priority to setup time. It is the figure which showed the cancellation method of the connection impossibility by the production plan preparation method disclosed by patent document 1. FIG.

Explanation of symbols

1 Processing order plan creation device 12 Inter-product connection constraint table (inter-product connection constraint storage means)
14 Pre-variety registration section (pre-variety registration means)
15 Subsequent product registration section (subsequent product registration means)
16 Pre-variety remaining amount registration section (pre-variety remaining amount registration means)
17 Subsequent product type determination unit (subsequent product type determining means)
20 Setup time indexing part (Setup time indexing means)

Claims (5)

A processing order plan creation device for planning a processing order of products of a plurality of types for a plurality of types of products,
Inter-product connection constraint storage means for storing an inter-product connection constraint table in which connectability information indicating whether or not there is an operationally operable relationship between the products is stored;
With reference to the inter-variety connection restriction table, for each of the plurality of varieties, a pre-variety registration means for registering a pre-variety that can be processed in advance of a predetermined varieties due to operation restrictions;
With reference to the inter-product connection restriction table, for each of the plurality of product types, subsequent product registration means for registering subsequent product types that can be processed after a predetermined product in terms of operation constraints;
For the prefix varieties registered by the prefix varieties registration means, the remaining number of processing times of the prefix varieties is registered and the remaining amount is updated each time the processing order of a predetermined variety is determined. A variety remaining amount registration means;
When determining the N (N: integer greater than or equal to 2) number of products to be processed, the (N-1) -th processed product after the predetermined product from among the subsequent products registered by the subsequent product registration means. A variety that can be processed due to operational restrictions is selected as a candidate, and from among the candidates, a candidate whose total remaining number of processing times of the preceding variety is 0 by the preceding variety remaining amount registration unit And a subsequent product type determination means for preferentially determining the product as a subsequent product type. In the inter-product type connection restriction table, in addition to the connectability information, connection priority information between each product type is registered,
When determining the Nth type of product to be processed, the subsequent product type determining unit performs processing after the (N-1) th predetermined product type from among the subsequent product types registered by the subsequent product type registering unit. Is selected as a candidate in terms of operation restrictions, and if there is no subsequent varieties for which the total remaining number of processing times of the preceding varieties is 0 for that candidate, it is registered in the inter-variety connection restriction table. 2. The processing sequence plan creation device according to claim 1, wherein a succeeding product type is preferentially determined from the candidates based on the connection priority information.   The inter-product connection constraint storage means includes setup time indexing means for indexing the connection priority information based on a setup time required for changing the product type to be processed and registering it in the inter-product connection constraint table. The processing order plan creation device according to claim 2, wherein: A processing order plan creation method for planning the processing order of products of a plurality of types for a plurality of types of products,
Inter-product connection constraint storage step for storing an inter-product connection constraint table in which connectability information indicating whether or not there is an operationally operable relationship between the products is stored;
Referencing the inter-product connection restriction table, for each of the plurality of product types, a pre-product type registration step of registering a pre-product type that can be processed before a predetermined product type due to operation restrictions;
Referencing the inter-product connection restriction table, for each of the plurality of product types, a subsequent product type registration step of registering a subsequent product type that can be processed after a predetermined product type due to operation restrictions;
For the prefix varieties registered in the prefix varieties registration step, the remaining number of times of processing of the prefix varieties is registered, and the remaining amount is updated each time the processing order of a predetermined variety is determined. The remaining product type registration step,
When determining the N (N: integer greater than or equal to 2) -th product type, the processing is performed after the (N-1) -th processed product type among the subsequent product types registered in the subsequent product type registration step. The succeeding varieties that can be operated due to operational restrictions are selected as candidates, and the total remaining number of processing times of the preceding varieties becomes 0 in the preceding varieties remaining amount registration step from among the candidates. And a subsequent product type determination step for preferentially determining candidates as subsequent product types. A program for causing a computer to plan a processing order of products of a plurality of types for a plurality of types of products,
Inter-product connection constraint storage step for storing an inter-product connection constraint table in which connectability information indicating whether or not there is an operationally operable relationship between the products is stored;
Referencing the inter-product connection restriction table, for each of the plurality of product types, a pre-product type registration step of registering a pre-product type that can be processed before a predetermined product type due to operation restrictions;
Referencing the inter-product connection restriction table, for each of the plurality of product types, a subsequent product type registration step of registering a subsequent product type that can be processed after a predetermined product type due to operation restrictions;
For the prefix varieties registered in the prefix varieties registration step, the remaining number of times of processing of the prefix varieties is registered, and the remaining amount is updated each time the processing order of a predetermined variety is determined. The remaining product type registration step,
When determining the N (N: integer greater than or equal to 2) -th product type, the (N-1) -th processed product after the predetermined product type registered in the subsequent product type registration step. The succeeding varieties that can be processed due to operational restrictions are selected as candidates, and the total remaining number of processing times of the preceding varieties becomes 0 in the preceding varieties remaining amount registration step from among the candidates. A program for causing a computer to execute a subsequent product type determining step for preferentially determining the candidate as a subsequent product type.

Images