Planning program, planning method, and information processing device

Abstract

The planning program causes a computer to execute: a first step in which a plurality of objects are arranged in a processing subject of a plurality of processes by means of a forward arrangement, which is planned to be arranged with a prescribed time as a starting point, in accordance with a prescribed order of the plurality of objects; a second step in which the plurality of objects are arranged in the processing main body of the plurality of processes by means of a reverse arrangement planned to be arranged in the reverse direction of the time axis with a prescribed time as a starting point, on the basis of the processing completion order of the objects to be subjected to the final processing in the arrangement obtained in the first step; a third step for matching the processing start time of each object by forward filling in each processing in the arrangement obtained in the second step; and a fourth step of filling the arrangement obtained in the third step forward to a predetermined time.

Description

Technical Field

[0001] The present application relates to a planning program, a planning method, and an information processing device. Background Art

[0002] A technique for optimizing the schedule in a plan for processing a plurality of objects in each process is disclosed (for example, refer to Patent Documents 1 to 4).

[0003] Patent Document 1: Japanese Patent Application Laid-Open No. 07-021264

[0004] Patent Document 2: U.S. Patent Publication No. 2005 / 0149219

[0005] Patent Document 3: U.S. Patent Publication No. 2006 / 0026052

[0006] Patent Document 4: Japanese Patent Application Publication No. 2013-152648

[0007] However, it is difficult to make both the processing completion time and the operation rate satisfy predetermined conditions. Summary of the invention

[0008] In one aspect, an object of the present invention is to provide a planning program, a planning method, and an information processing device that can make both a processing completion time and an operating rate satisfy predetermined conditions.

[0009] In one embodiment, a planning program is a planning program for arranging the plurality of objects to the processing bodies of the plurality of processes under the condition that a plurality of processes are sequentially performed on a plurality of objects, a processing time of each of the plurality of processes is respectively specified for the plurality of objects, a number of processing subjects for any one of the plurality of objects is respectively specified for the plurality of processes, and the processing subjects do not perform processing on other objects while the processing subjects are processing any one of the objects, and the planning program causes a computer to execute: a first step of arranging the plurality of objects to the processing bodies of the plurality of processes by forward arrangement in which the arrangement is planned starting from a specified time according to a specified order of the plurality of objects; a second step of arranging the plurality of objects to the processing bodies of the plurality of processes by reverse arrangement in which the arrangement is planned starting from a specified time and in a direction opposite to the time axis according to a processing completion order of each object finally processed in the arrangement obtained by the first step; a third step of making the processing start time of each object consistent by forward filling in each process in the arrangement obtained by the second step; and a fourth step of filling forward the arrangement obtained by the third step to a specified time.

[0010] Both the processing completion time and the operating rate can satisfy the prescribed conditions. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] Figure 1 (a) is a diagram illustrating an example of a work line. Figure 1 (b) is a diagram illustrating master data.

[0012] Figure 2 This is a diagram illustrating a flow when forward configuration is applied to the priority method.

[0013] Figure 3 (a) and Figure 3 (b) is a diagram for explaining a configuration example when forward configuration is applied to the priority method.

[0014] Figure 4 This is a diagram illustrating a flow when forward configuration is applied to the FIFO method.

[0015] Figure 5 (a) and Figure 5 (b) is a diagram illustrating a forward configuration of the FIFO method.

[0016] Figure 6 (a) is a diagram illustrating a reverse configuration of a priority method. Figure 6 (b) is a diagram illustrating a reverse configuration of the FIFO method.

[0017] Figure 7 (a) is a diagram illustrating how to optimize the priority of each product under strict compliance with the delivery deadline when forward allocation is applied to the priority method. Figure 7 (b) is a diagram illustrating how the priority of each product is optimized while strictly complying with the delivery deadline when the reverse configuration is applied to the priority method.

[0018] Figure 8 (a) is a diagram illustrating how to optimize the order of inputting each product under strict compliance with the delivery deadline when applying the forward configuration to the FIFO method. Figure 8 (b) is a diagram illustrating how the order of inputting each product is optimized while strictly complying with the delivery deadline when the reverse configuration is applied to the FIFO method.

[0019] Fig. 9 (a) is a diagram showing an example of the device operation rate. Fig. 9 (b) is a diagram illustrating the device operation rate in each mode.

[0020] Fig.10 This is a diagram illustrating a case where each product is arranged in each process so as to optimize the device operating rate.

[0021] Fig.11(a) is a functional block diagram showing the overall structure of the information processing device of Example 1, Fig.11 (b) is a block diagram illustrating the hardware configuration of each unit of the information processing device.

[0022] Fig.12 (a) is a diagram illustrating process 01. Fig.12 (b) is a diagram illustrating a situation where configuration is performed according to process 02.

[0023] Fig.13 (a) and Fig.13 (b) is a diagram illustrating process 03.

[0024] Fig.14 (a) is a diagram illustrating process 03. Fig.14 (b) is a diagram illustrating process 04.

[0025] Fig.15 This is a diagram illustrating an optimized processing flow executed by the information processing device.

[0026] Fig.16 This is a flowchart illustrating the details of the process of step S3.

[0027] Fig.17 is a detailed flowchart illustrating process 01.

[0028] Fig.18 is a detailed flowchart illustrating process 02.

[0029] Fig.19 It is a detailed flowchart of the example process 03.

[0030] Fig. 20 is a detailed flowchart illustrating process 04.

[0031] Fig.21 It is a graph showing the simulation results.

[0032] Fig. 22 (a) is a diagram showing the result of the optimization process when the number of devices in process 1 is 2, the number of devices in process 2 is 2, and the number of devices in process 3 is 1. Fig. 22 (b) is a diagram showing the result of the optimization process when the number of devices in step 1 is 2, the number of devices in step 2 is 2, and the number of devices in step 3 is 2.

[0033] Fig.23 This is a block diagram illustrating a case where a result of the output unit is output to an operating device. DETAILED DESCRIPTION

[0034] First, the outline of a processing line that sequentially performs a plurality of processes on a plurality of objects is described. As an example, a processing line that performs processing on each product in each process is described. In the processing line, a plurality of processes are sequentially performed on each product. Figure 1 (a) is a diagram illustrating an example of a work line. Figure 1 In the example of (a), three steps of step 1, step 2, and step 3 are performed in sequence.

[0035] In each process, the number of processing bodies that perform operations on each variety is specified. As processing bodies for performing process 1, there are three devices, namely, devices 1-1 to 1-3. As processing bodies for performing process 2, there are two devices, namely, devices 2-1 to 2-2. As processing bodies for performing process 3, there is one device, namely, device 3-1. In this way, in each process, the number of devices used to perform the process is different. In addition, there are processes in which the number of devices is less than the number of varieties. While a device is performing operations on a variety, the device does not perform operations on other varieties.

[0036] Figure 1 (b) is a diagram illustrating master data. The master data includes all the products that are operated on the production line, and includes the operation time (production interval time) required for each product to be operated through each process. Figure 1 In the example (b), the master data includes item 1 to item 3.

[0037] like Figure 1 As shown in (b), for variety 1, the production interval time of process 1 is set to 70 minutes, the production interval time of process 2 is set to 110 minutes, and the production interval time of process 3 is set to 70 minutes. For variety 2, the production interval time of process 1 is set to 60 minutes, the production interval time of process 2 is set to 30 minutes, and the production interval time of process 3 is set to 60 minutes. For variety 3, the production interval time of process 1 is set to 50 minutes, the production interval time of process 2 is set to 50 minutes, and the production interval time of process 3 is set to 50 minutes. In this way, there are cases where the production interval time of each process is different for each variety. In addition, it is assumed that in each process, no matter which device performs the operation, the production interval time does not change. For example, for variety 1, the production interval time in device 1-1 and the production interval time in device 1-2 are both the same, 70 minutes.

[0038] In addition, if Figure 1 As shown in (b) of the example, the delivery date is specified for each product. Figure 1 In the example (b), 400 minutes is specified as the delivery time for each of items 1 to 3. The delivery time refers to the time that must be observed when the work in the final process is completed.

[0039] If there are enough devices in each process, there will be no waiting time for each product to be processed. However, in actual sites, there may not be enough devices. Figure 1 In the example of (a), there is only one device for implementing step 3. Therefore, it is easy to generate waiting time for the operation. In this case, a method for optimizing the plan (scheduling) for allocating each product to each device is desired.

[0040] There are two main types of scheduling configuration rules. The first is the priority method, and the second is the First-in First-out method. The First-in First-out method is sometimes called the FIFO method. The priority method is a method of configuring each product to each device in each process based on the priority set for each product. The First-in First-out method is a method of configuring each product to the first process in a specified order, and then configuring it to the next process in the order of the earliest processing completion in each process.

[0041] Next, as the starting point of scheduling, two methods can be listed. The first is forward configuration, and the second is reverse configuration. Forward configuration is a method of making a plan at the starting point of input to the production line. Reverse configuration is a method of making a plan in the opposite direction of the time axis at the starting point of the delivery period.

[0042] Figure 2 FIG. 2 is a diagram illustrating a flow in which forward configuration is applied to a priority method. Figure 2 As illustrated, first, set the priority of the product (step S101). Next, set the variable n representing the order of the process to n=1 (step S102). Next, configure the job of the nth process by forward filling according to the priority (step S103). Next, determine whether the nth process is the final process (step S104). If it is determined to be "no" in step S104, add 1 to the variable n (step S105). Thereafter, execute again from step S103. If it is determined to be "yes" in step S104, end the process.

[0043] Figure 3 (a) and Figure 3 (b) is a diagram for explaining a configuration example in which a forward configuration is applied to a priority method. Figure 3 As shown in (a) of , each product is arranged according to the priority. For example, suppose the priority is set in the order of product 1, product 2, and product 3. In this case, at 0 minutes, which is the starting point of the input to the production line, product 1 is arranged in any device of process 1 (in Figure 3Next, immediately after the production interval of product 1 in process 1, product 1 is placed in any device in process 2 (in the example of (a)). Figure 3 In the example of (a), it is device 2-1). Next, after the production interval of product 1 in process 2, product 1 is immediately placed in device 3-1 of the process. In this way, product 1 is placed in the devices of each process. No waiting time is generated for product 1.

[0044] Next, at 0 minutes, product 2 is placed in any of the devices that are not in operation in process 1 (at Figure 3 Next, immediately after the production interval of product 2 in process 1, product 2 is placed in the device that is not in operation in process 2 (in the example of (a)). Figure 3 Next, immediately after the production interval of product 2 in process 2, product 2 is placed in the device that is not in operation in process 3 (in the example of (a)). Figure 3 In the example of (a), it is device 3-1). In this way, item 2 is allocated to the device of each process. No waiting time is generated for item 2.

[0045] Next, at 0 minutes, product 3 is placed in any one of the devices that are not in operation in step 1 (at Figure 3 In the example of (a), it is device 1-3). Next, immediately after the production interval of product 3 in process 1, product 3 is placed in the device that is not in operation in process 2. However, in Figure 3 In the example (a), since any device is in operation, it is not possible to place product 3 until the operation is completed. If the operation of product 2 in device 2-2 is completed, the operation of device 2-2 is completed, so product 3 is placed in device 2-2 at the moment when the operation of product 2 is completed. Next, after the production interval of product 3 in process 2, product 3 is immediately placed in the device that is not in operation in process 3. However, in Figure 3 In the example (a), since the device 3-1 is in operation, the item 3 cannot be arranged until the operation is completed. When the operation of the item 1 is completed in the device 3-1, the operation of the device 3-1 is completed, so the item 3 is arranged in the device 3-1 when the operation of the item 1 is completed.

[0046] Thus, in the priority method, the high-priority products are allocated to all processes in a manner that satisfies the restrictions according to the order of priority, and then the allocation of the second-highest-priority products is determined. However, in the priority method, there is a case where at least one product has a long waiting time.

[0047] Figure 4FIG. 2 is a diagram illustrating a flow in which a forward configuration is applied to the FIFO method. Figure 4 As illustrated, first, set the order of input of each variety (step S201). Next, determine the configuration order of the operations of the first process (step S202). Next, set the variable n representing the order of the processes to n=1 (step S203). Next, configure the operations of the nth process by forward filling according to the determined input order (step S204). Next, determine whether the nth process is the final process (step S205). If it is determined as "no" in step S205, obtain the order of completion of the operations of the nth process (step S206). Next, determine the configuration order of the operations of the (n+1)th process (step S207). Next, add 1 to the variable n (step S208). Thereafter, execute again from step S204. If it is determined as "yes" in step S205, end the process.

[0048] Figure 5 (a) and Figure 5 (b) is a diagram illustrating forward arrangement of the FIFO method. In the FIFO method, at each time, the types are arranged in order from the type that can be arranged earlier.

[0049] First, determine the order in which each item is put in. For example, the order in which the items are put in is item 1, item 2, and item 3. Figure 5 As shown in (a), at 0 minutes, which is the starting point of the input to the production line, each product is allocated to the devices 1-1 to 1-3 of process 1. If the number of devices is less than the number of products, the products are allocated starting from the earlier ones according to the input order. Next, since the production interval of product 3 in process 1 is the shortest, product 3 is immediately allocated to any device in process 2 (at Figure 5 In the example of (b), it is device 2-1). In process 1, the production interval of product 2 is the second shortest, so immediately after the production interval of product 2 in process 1, product 2 is allocated to the non-operating device of process 2 (in Figure 5 In the example of (b), it is device 2-2). Since the operation of product 1 is completed in process 1, product 1 is immediately allocated to any non-operating device in process 2 after the production interval of product 1 in process 1. However, in Figure 5 In the example (b), any device in process 2 is in operation, so it is not possible to place product 1 until the operation is completed. If the operation of product 2 is completed in device 2-2, the operation of device 2-2 is completed, so product 1 is placed in device 2-2 when the operation of product 2 is completed. Figure 5In the example (b), the operation of product 2 in process 2 is completed first, so after the production interval of product 2 in process 2, product 2 is immediately allocated to the non-operating device in process 3 (in Figure 5 In the example of (b), it is device 3-1). In process 2, the operation of product 3 is completed after product 2, so after the production interval of product 3 in process 2, product 3 is immediately placed in the device that is not running in process 3. However, in Figure 5 In the example (b), the operation of product 2 is not completed, so product 3 cannot be allocated until the operation is completed. Product 3 is allocated to device 3-1 when the operation of product 2 is completed in device 3-1. The operation of product 1 is completed last in process 2. After the production interval of product 1 in process 2, product 1 is immediately allocated to the device that is not operating in process 3. However, in Figure 5 In the example of (b), the work of item 3 is not completed, so item 1 cannot be arranged until the operation is completed. When the work of item 3 is completed in device 3-1, item 1 is arranged in device 3-1.

[0050] Thus, in the FIFO method, at each time, the product that has completed the work earlier in each process is arranged in the next process. However, in the FIFO method, there is a situation where at least one product has a long waiting time.

[0051] Figure 6 (a) is a diagram illustrating a reverse configuration of the priority method. In the reverse configuration, the products are configured in the opposite direction of the time axis, starting from the delivery date. Figure 6 As shown in (a) of , each product is reversely arranged according to the priority. For example, suppose the priority is set in the order of product 1, product 2, and product 3. In this case, product 3 is arranged in device 3-1 so that the time after 400 minutes of the delivery period becomes the time when the work of product 3 is completed. Next, product 3 is arranged in any device of process 2 (in Figure 6 In the example of (a), it is device 2-1). Next, the time after the production interval of the product 3 in process 2 is traced back to the time when the work of the product 3 is completed, and the product 1 is configured to the device 1-1 of process 1. In this way, the product 3 is configured to the device of each process. No waiting time is generated for the product 3.

[0052] Next, Item 2 is placed in any device that is not in operation in process 3 so that the time when the work of Item 2 is completed is 400 minutes after the delivery date. However, since the work of Item 3 is being performed in device 3-1, Item 2 cannot be placed in device 3-1. Item 2 is placed in device 3-1 so that the time after the production interval of Item 3 in process 3 is traced back to the time when the work of Item 2 is completed. Next, Item 2 is placed in a device that is not in operation in process 2 (in Figure 6 Next, the product 2 is placed in the device that is not in operation in process 1 (in the example of (a)), so that the time after the production interval of product 2 in process 2 is traced back to the time when the operation of product 2 is completed. Figure 6 In the example of (a), it is device 1-2). In this way, item 2 is allocated to the device of each process. No waiting time is generated for item 2.

[0053] Next, in such a way that 400 minutes from the delivery date becomes the time when the work of variety 1 is completed, variety 1 is arranged in any device that is not in operation in process 1. However, since the work of variety 3 is being performed in device 3-1, variety 1 cannot be arranged in device 3-1. Since the work of variety 2 is next performed in device 3-1, variety 1 is arranged in device 3-1 at the time after the total time of the production interval time of variety 3 and the production interval time of variety 2 is traced back from 400 minutes from the delivery date. Next, in such a way that the time after the production interval time of variety 1 is traced back becomes the time when the work of variety 1 is completed, variety 1 is arranged in the device that is not in operation in process 2 (at Figure 6 Next, item 1 is placed in a non-operating device in process 1 (in the example of (a)) so that the time when the production interval of item 1 is traced back becomes the time when the operation of item 1 is completed. Figure 6 In the example of (a), it is device 1-1).

[0054] Thus, in the priority method, each product is allocated to all processes in a manner that satisfies the constraints according to the order of priority, and then the allocation of the next product is determined. However, in the priority method, there is a case where at least one product has a long waiting time.

[0055] Figure 6 (b) is a diagram illustrating the reverse configuration of the FIFO method. In the reverse configuration, the products are arranged in the opposite direction of the time axis, starting from the delivery date. Figure 6As shown in (b), each product is arranged in reverse order according to the prescribed input order. Specifically, each product is arranged in process 3. If the number of devices is less than the number of products, the products are arranged starting from the later ones according to the input order. Figure 6 In the example (b), item 3 is arranged in device 3-1 so that the time of 400 minutes of the delivery period becomes the time of completion of the work of item 3. Next, item 2 is arranged in device 3-1 so that the time after the production interval time of item 3 in process 3 is traced back becomes the time of completion of the work of item 2. Next, item 1 is arranged in device 3-1 so that the time after the production interval time of item 2 in process 3 is traced back becomes the time of completion of the work of item 1.

[0056] Next, the product 3 is placed in any device of process 2 (in the process 2) so that the time after the production interval of the product 3 in process 3 is traced back to the time when the work of the product 3 is completed. Figure 6 Next, the product 2 is configured to any device in process 2 (in the example of (b)) so that the time after the production interval of product 2 in process 3 is traced back to the time when the operation of product 2 is completed. Figure 6 Next, the product 1 is configured to any device in process 2 (in the example of (b)) so that the time after the production interval of product 1 in process 3 is traced back to the time when the operation of product 1 is completed. Figure 6 In the example of (b), it is device 2-1).

[0057] Next, the product 3 is placed in any device of process 1 (in the process 2) so that the time after the production interval of the product 3 in process 2 is the time of completion of the work of the product 3. Figure 6 Next, the product 2 is configured to any device in process 1 (in the example of (b)) so that the time after the production interval of product 2 in process 2 is traced back to the time when the operation of product 2 is completed. Figure 6 Next, the product 1 is placed in any device of process 1 (in the example of (b)) so that the time after the production interval of product 1 in process 2 is traced back to the time when the operation of product 1 is completed. Figure 6 In the example of (b), it is device 1-1).

[0058] Thus, in the FIFO method, at each time, the product that has completed the work earlier in each process is arranged in the next process. However, in the FIFO method, there is a situation where at least one product has a long waiting time.

[0059] Therefore, consider optimizing the schedule. For example, Figure 7 (a) is a diagram illustrating how to optimize the priority of each product under strict delivery constraints when forward allocation is applied to the priority method. Figure 7 In the example (a), relative to Figure 3 (a) and Figure 3 (b) configuration, change the priority. Figure 7 (b) is a diagram illustrating how to optimize the priority of each product while strictly complying with the delivery deadline when the reverse configuration is applied to the priority method. Figure 7 In the example (b), relative to Figure 6 In these cases, there is a concern that at least one of the products will have a longer waiting time.

[0060] Figure 8 (a) is a diagram illustrating how to optimize the order of each product under strict delivery constraints when applying forward configuration to the FIFO method. Figure 8 In the example (a), relative to Figure 5 (a) and Figure 5 (b) configuration, change the order of input of each variety. Figure 8 (b) is a diagram illustrating how to optimize the order of each product under strict delivery constraints when the reverse configuration is applied to the FIFO method. Figure 8 In the example (b), relative to Figure 6 In these cases, there is a concern that at least one of the varieties will have a longer waiting time.

[0061] Therefore, it is considered to focus on the device operating rate and optimize the device operating rate. Fig. 9 (a) is a diagram illustrating the device operation rate. In each process, (the time width from the start time of the first product to the completion time of the last product) × number of devices = total operation time. Next, in each process, the time when each product is configured in each device is set as the actual operation time. The operation ratio of each process can be expressed as actual operation time / total operation time × 100 (%). For example, in Fig. 9 In the example (a), the area of ​​the region surrounded by the dotted line of process 1 is the total operation time of process 1. The total time of arranging each product in the region surrounded by the dotted line of process 1 is the actual operation time of process 1. Fig. 9 In the example of (a), the operation ratio of process 1 is 85.7%, the operation ratio of process 2 is 63.3%, and the operation ratio of process 3 is 100%. The average value of the operation ratios of the respective processes is defined as the device operation rate.

[0062] Fig. 9 (b) is a diagram illustrating the device operation rate in each mode. Fig. 9 As shown in (b), for Figure 3 (a) and Figure 3 The result of (b) shows that the device operation rate is 83%. Figure 5 (a) and Figure 5 The result of (b) shows that the device operation rate is 83%. Figure 6 The result of (a) shows that the device operation rate is 76%. Figure 6 As for the result of (b), the device operation rate is 76%.

[0063] Therefore, it is considered to arrange each type of product in each process to optimize the equipment operation rate. Fig.10 This is a diagram illustrating how to configure each product in each process to optimize the equipment operation rate. Fig.10 In the example, Fig. 9 Compared with (a), the operating ratio of process 2 is improved. As a result, the device operating rate is improved. However, in the four methods in which the priority method and the FIFO method are combined with the forward configuration and the reverse configuration, it is also difficult to optimize the device operating rate. For example, in the forward configuration, since each variety is loaded from the front, it is difficult to consider the replacement of operations in the middle of the process and the intentional delay of the operation. In the reverse configuration, since each variety is loaded from the back, there is a concern that the operating rate will decrease as the process moves forward. Based on the above, it is expected that both the job completion time and the device operating rate can be optimized at the same time by combining the advantages of both the forward configuration and the reverse configuration. The job completion time refers to the time from the start time of the operation of the first variety to the completion time of the operation of the last variety.

[0064] In the following embodiments, a planning program, a planning method, and an information processing device that can simultaneously optimize both the work completion time and the device operating rate are described.

[0065] Example 1

[0066] Fig.11 (a) is a functional block diagram showing the overall structure of the information processing device 100 involved in Example 1. The information processing device 100 is a server for optimization processing, etc. Fig.11 As illustrated in (a) of FIG. 1 , the information processing device 100 includes a storage unit 10 , a calculation condition setting unit 20 , an input order generating unit 30 , a calculation unit 40 , a determination unit 50 , an output unit 60 , and the like.

[0067] Fig.11 (b) is a block diagram illustrating the hardware configuration of each part of the information processing device 100. Fig.11 As illustrated in (b) of FIG. 1 , the information processing device 100 includes a CPU 101 , a RAM 102 , a storage device 103 , an input device 104 , a display device 105 , and the like.

[0068] CPU (Central Processing Unit) 101 is a central processing unit. CPU 101 includes one or more cores. RAM (Random Access Memory) 102 is a volatile memory that temporarily stores programs executed by CPU 101, data processed by CPU 101, etc. Storage device 103 is a non-volatile storage device. As storage device 103, for example, ROM (Read Only Memory), a solid state drive (SSD) such as a flash memory, a hard disk driven by a hard disk drive, etc. can be used. Storage device 103 stores a planning program. Input device 104 is an input device such as a mouse and a keyboard. Alternatively, input device 104 is an interface for an external storage device such as a USB memory. Display device 105 is a device that displays the processing results of information processing device 100, such as a display. The various parts of information processing device 100 are realized by CPU 101 executing the planning program. In addition, hardware such as dedicated circuits can also be used as various parts of information processing device 100.

[0069] The storage unit 10 stores the layout model of the production line. As an example, the storage unit 10 stores Figure 1 The storage unit 10 stores the master data. As an example, the storage unit 10 stores Figure 1 The main data is shown in (b).

[0070] Next, the principle of the arrangement of each type of product to each process in this embodiment is described. In this embodiment, four processes, process 01 to process 04, are performed in sequence. Fig.12 (a) is a diagram illustrating process 01. Fig.12 As shown in (a) of FIG. 1 , in process 01, the forward configuration is applied to the FIFO method. In this case, Figure 5 The results are described in (b) of FIG. 1. The work completion time in this case was 270 minutes, and the device operation rate was 85%.

[0071] Next, process 02 is implemented. In process 02, the order of reverse configuration is determined according to the order of completion of each product in the final process in the configuration obtained by process 01. Specifically, since the operations are completed in the order of product 2 → 3 → 1 in the forward configuration of process 01, the order of reverse configuration is made to be product 1 → 3 → 2. For each product, if there are multiple devices that can be configured, the device with the shorter operating time before configuration is configured. Fig.12 (b) is a diagram illustrating a configuration according to process 02. Fig.12 In the example (b), the work completion time is 270 minutes and the device operating rate is 76%.

[0072] Next, process 03 is implemented. In process 03, the reverse configuration of process 02 is replaced with the forward configuration. In this case, the start time of each process is made consistent as much as possible. Fig.13 In the example of (a), in process 1, the operation start time of varieties 1 to 3 can be made consistent by forward filling. In process 2, the operation deviation time of varieties 1 and 2 can be made consistent by forward filling. In this case, Fig.13 As shown in (b) of the example, the operation start time of each process is filled forward in a manner that does not break the front and back constraints. For example, for the positions where the operation start points are consistent, they are linked and fixed so that they do not shift forward or backward. Next, as Fig.14 As shown in (a) of Fig.13 The reverse configuration of (b) was replaced by the forward configuration plan. As a result, the work completion time was 280 minutes and the device operation rate was 91%.

[0073] Next, process 04 is implemented. In process 04, for the configuration obtained by process 03, the jobs that can be filled forward are filled forward independently as much as possible. For example, Fig.14 As shown in (b), the linked operations are disconnected and the amount that can be filled is filled forward. As a result, the operation completion time is 270 minutes and the device operation rate is 88.3%.

[0074] Both the work completion time and the device operation rate can be optimized simultaneously through these processes 01 to 04. In addition, processes 01 and 02 can be either FIFO or priority.

[0075] Next, an example of a specific operation of each unit of the information processing device 100 will be described. Fig.15 1 is a diagram illustrating the optimized processing flow performed by the information processing apparatus 100. Fig.15As illustrated, the calculation condition setting unit 20 sets the calculation conditions of the genetic algorithm (GA) (step S1). The calculation conditions include, for example, the number of iterations of step S4 described later.

[0076] Next, the betting order generation unit 30 generates an initial betting order for each item (step S2). For example, the betting order generation unit 30 may generate the initial betting order based on information input by the user using the input device 104, or may generate the initial betting order randomly.

[0077] Next, the calculation unit 40 executes scheduling based on the initial input order (step S3). The details of step S3 will be described later.

[0078] Next, the determination unit 50 determines whether the optimization is completed (step S4 ). For example, the determination unit 50 determines that the optimization is completed when the number of iterations included in the calculation condition set in step S1 is reached.

[0079] If the judgment of step S4 is "No", the input sequence generation unit 30 generates the next input sequence using a genetic algorithm or the like (step S5). In this case, the input sequence generation unit 30 generates the input sequence so that the device operation rate and the work completion time meet the prescribed conditions. Thereafter, the operation is executed again from step S3. When step S3 is executed for the second time or later, the scheduling is executed according to the input sequence generated in step S5.

[0080] When it is determined as "yes" in step S4, the output unit 60 outputs the best input sequence from the "job completion time and device operation rate" (1) to (4) of each input sequence (step S6). The output input sequence is displayed on the display device 105, etc. For example, the best input sequence of "job completion time and device operation rate" (4) can be output. For example, the best input sequence of "job completion time" (4) can be output, the best input sequence of "device operation rate" (4) can be output, or the best input sequence of the weighted average of "job completion time" (4) and "device operation rate" (4) can be output. "Job completion time and device operation rate" (1) to (4) will be described later.

[0081] Fig.16 is a detailed flowchart illustrating the processing of step S3. Fig.16 As shown in the example, the calculation unit 40 performs the calculation according to Fig.12 In the process 01 described in (a) of FIG. 1 , forward configuration is performed (step S11 ).

[0082] Next, the calculation unit 40 calculates the “work completion time and device operation rate” (1) after the arrangement of the process 01 (step S12).

[0083] Next, the calculation unit 40 calculates Fig.12 In the process 02 described in (b) of FIG. 1 , reverse configuration is performed (step S13 ).

[0084] Next, the calculation unit 40 calculates the “work completion time and device operation rate” (2) after the arrangement of the process 02 (step S14 ).

[0085] Next, the calculation unit 40 aligns the operation start time for each process and replaces it with the forward arrangement according to the procedure 03 described in (a) of FIG. 13 (step S15 ).

[0086] Next, the calculation unit 40 calculates the “work completion time and device operation rate” (3) after the arrangement of the process 03 (step S16).

[0087] Next, the calculation unit 40 calculates Fig.13 In the process 04 described in (b), the jobs that can be filled forward are filled forward independently as much as possible (step S17).

[0088] Next, the calculation unit 40 calculates the "work completion time and device operation rate" (4) after the arrangement of the process 04 (step S18). After the above processing, the execution of the flowchart ends.

[0089] Fig.17 is a detailed flow chart illustrating process 01. Fig.17 As illustrated, the calculation unit 40 sets the order of input of each item (step S21 ).

[0090] Next, the calculation unit 40 determines the arrangement order of the tasks in the first process (process 1) (step S22).

[0091] Next, the calculation unit 40 sets n indicating the order of the process to n=1 (step S23 ).

[0092] Next, the calculation unit 40 arranges the work of the n-th process by forward filling according to the determined arrangement order (step S24).

[0093] Next, the calculation unit 40 determines whether the nth process is the final process (step S25). Figure 1 In the example of (a), step 3 is the final step.

[0094] When it is determined as "NO" in step S25, the calculation unit 40 acquires the order of completion of the work of each type in the n-th process (step S26).

[0095] Next, the calculation unit 40 determines the arrangement order of the tasks in the (n+1)th process (step S27 ).

[0096] Next, the calculation unit 40 sets n to n+1 and increases n by 1 (step S28 ). Thereafter, the process starts again from step S24 .

[0097] When it is determined as “YES” in step S25 , the execution of the flowchart ends.

[0098] Fig.18 02 is a detailed flowchart illustrating process 02. Fig.18 As illustrated, the calculation unit 40 acquires the order of completion of work for each item in the final step of process 01 (step S31 ).

[0099] Next, the calculation unit 40 determines the arrangement order of the tasks in the final process (step S32 ).

[0100] Next, the calculation unit 40 sets the total number of steps s and the variable m. The calculation unit 40 sets the variable m to 0 (step S33).

[0101] Next, the calculation unit 40 arranges the work of the (s-m)th step by forward filling according to the determined arrangement order (step S34 ).

[0102] Next, the calculation unit 40 determines whether the (s-m)th step is the final step (step S35 ).

[0103] When it is determined as “NO” in step S35 , the calculation unit 40 acquires the completion order of the work in the (s−m)th process (step S36 ).

[0104] Next, the calculation unit 40 determines the arrangement order of the tasks in the (s-m-1)th step (step S37 ).

[0105] Next, the calculation unit 40 substitutes m+1 into m and increases the variable m by 1 (step S38 ). Thereafter, the process is executed again from step S34 .

[0106] When it is determined as “YES” in step S35 , the execution of the flowchart ends.

[0107] Fig.19 This is a flowchart illustrating the details of process 03. The calculation unit 40 acquires the operation arrangement of all steps of process 02 (step S41).

[0108] Next, the calculation unit 40 sets a variable n indicating the order of the process. The calculation unit 40 sets n=1 (step S42).

[0109] Next, the calculation unit 40 acquires the earliest operation start time among all the operations in the n-th process (step S43 ).

[0110] Next, the calculation unit 40 arranges the n-th process of the job by forward filling, starting from the earliest job start time (step S44).

[0111] Next, the calculation unit 40 arranges the work of the n-th process by forward filling, starting from the start time of the plan preparation period (step S45).

[0112] Next, the calculation unit 40 determines whether the n-th process is the final process (step S46 ).

[0113] If it is determined as "No" in step S46, the calculation unit 40 substitutes n+1 for n to increase n by 1 (step S47). Thereafter, the process is executed again from step S43.

[0114] When it is determined as “YES” in step S46 , the execution of the flowchart ends.

[0115] Fig. 20 FIG. 4 is a detailed flow chart illustrating process 04. Fig. 20 As illustrated, the calculation unit 40 acquires the work arrangement of all steps of the process 03 (step S52 ).

[0116] Next, the calculation unit 40 sets a variable n indicating the order of the process. The calculation unit 40 sets the variable n to 2 (step S52).

[0117] Next, the calculation unit 40 arranges the operation of the n-th process by forward filling in consideration of the previous process (step S53 ).

[0118] Next, the calculation unit 40 determines whether the n-th process is the final process (step S54 ).

[0119] If it is determined as "No" in step S54, the calculation unit 40 substitutes n+1 into the variable n to increase the variable n by 1 (step S55). Thereafter, the process is executed again from step S53.

[0120] When it is determined as “YES” in step S54 , the execution of the flowchart ends.

[0121] Next, using the optimization process involved in this embodiment, Figure 1 The layout of (a) and Figure 1 The master data of (b) was simulated. Fig.21 is a graph showing the simulation results. Fig.21 As shown in FIG. 1 , the solution surrounded by the dotted line is the best solution group after the optimization process involved in this embodiment is optimized. Fig.21 As shown, it can be seen that both the device operating rate and the work completion time can be optimized at the same time.

[0122] In addition, Fig.21 In the example, the solution obtained by the FIFO method and the solution obtained by the priority method are also shown. Fig.21 As can be seen from the results, a solution with a higher device operation rate can be obtained, which cannot be found either by the FIFO method or the priority method.

[0123] Fig. 22 (a) is a diagram showing the result of the optimization process when the number of devices in process 1 is 2, the number of devices in process 2 is 2, and the number of devices in process 3 is 1. Fig. 22 As shown in (a), it can be seen that the result of optimization using the optimization processing involved in this embodiment is better than that of the FIFO method and the priority method.

[0124] Fig. 22 (b) is a diagram showing the result of the optimization process when the number of devices in process 1 is 2, the number of devices in process 2 is 2, and the number of devices in process 3 is 2. Fig. 22 As shown in (b), it can be seen that the result of optimization using the optimization processing involved in this embodiment is better than that of the FIFO method and the priority method.

[0125] According to this embodiment, by repeatedly performing reverse configuration and forward configuration based on the configuration established by forward configuration while satisfying constraints in both directions, it is possible to suppress deviation in one direction and optimize both the job completion time and the device operation rate. In the initial forward configuration, the device operation rate can be further improved by adopting the FIFO method.

[0126] In each of the above examples, multiple varieties are an example of multiple objects. The device of each process is an example of a processing subject of each process. Therefore, the processing subject is not limited to a machine but may also be a person. Process 01 is an example of a first process that arranges multiple objects to the processing subjects of multiple processes according to the prescribed order of multiple objects through a forward configuration that is planned to be configured with a prescribed time as the starting point. Process 02 is an example of a second process that arranges multiple objects to the processing subjects of multiple processes through a reverse configuration that is planned to be configured in the opposite direction of the time axis with a prescribed time as the starting point according to the processing completion order of each object finally processed in the configuration obtained by the first process. Process 03 is an example of a third process that makes the processing start time of each object consistent by forward filling in each process in the configuration obtained by the second process. Process 04 is an example of a fourth process that forward fills the configuration obtained by the third process to the prescribed time.

[0127] In addition, although the results output by the output unit 60 are output to the display device 105 in the above examples, they may be output to the operating device 200 . Fig.23 The motion device 200 is a conveyor belt or the like used to transport each product to each process in the production line. Fig.23 As illustrated, the result output by the output unit 60 is output to the action device 200. The action device 200 performs an action so as to realize the optimal solution received from the output unit 60. The action device 200 includes a CPU, a RAM, a storage device, etc. For example, a control program for controlling the action of the action device 200 is stored in the storage device, and the optimal solution received from the output unit 60 is stored in the RAM. The CPU controls the action of the action device 200 based on the control program and the optimal solution.

[0128] As mentioned above, although the embodiment of the present invention is described in detail, the present invention is not limited to the specific embodiment, and various modifications and changes can be made within the scope of the gist of the present invention described in the claims.

[0129] Description of Reference Numerals

[0130] 10 storage unit, 20 calculation condition setting unit, 30 input order generating unit, 40 calculation unit, 50 determination unit, 60 output unit, 100 information processing device, 105 display device.

Claims

1. A planning procedure, A planning program for allocating the plurality of objects to the processing subjects of the plurality of processes under the condition that a plurality of processes are sequentially performed on the plurality of objects, the processing time of each of the plurality of processes is respectively specified for the plurality of objects, the number of processing subjects for any one of the plurality of objects is respectively specified for the plurality of processes, and the processing subject does not perform processing on other objects during the period when the processing subject processes any one of the objects, wherein the program is characterized in that: Causes the computer to execute: A first step is to arrange the plurality of objects in the processing bodies of the plurality of processes according to a predetermined order of the plurality of objects by forward arrangement of the plurality of objects with a predetermined time as a starting point; A second step of arranging the plurality of objects to the processing bodies of the plurality of processes by reverse arrangement in which the arrangement is planned in the opposite direction of the time axis starting from a predetermined time, according to the order of completion of the processing of the objects finally processed in the arrangement obtained in the first step; A third step of aligning the processing start time of each object by forward filling in each processing in the configuration obtained by the second step; as well as The fourth step is to fill the configuration obtained in the third step forward to a predetermined time.

2. The planning procedure according to claim 1, characterized in that In the first step, the plurality of objects are arranged in a first process according to a predetermined order, and then arranged in the order of the earliest completion of the process in each process to the next process.

3. The planning program according to claim 1, characterized in that In the first step, the plurality of objects are arranged in the processing bodies of the plurality of processes according to priorities specified for the plurality of objects.

4. The planning program according to any one of claims 1 to 3, characterized in that: The above computer is made to perform the following processing: performing a repetitive process of repeatedly performing the first step to the fourth step after changing the order of feeding the plurality of objects into the plurality of processes, and searching the feeding order in the repetitive process so that the operation rate and the process completion time satisfy the prescribed conditions, In each process, (the time width from the start time of the process of the object to be processed first to the completion time of the process of the object to be processed last) × the number of subjects = the total operation time, the time for arranging each object in each subject in each process is set as the actual operation time, and the operation ratio of each process is set as actual operation time / total operation time × 100 (%), and the above operation rate is defined as the average value of the operation ratio of each process, The processing completion time is defined as the time from the start time of processing of the first object to the completion time of processing of the last object.

5. The planning program according to claim 4, characterized in that The computer is made to execute the following processing: From the results obtained through the repeated steps, the best result in terms of the operation rate and the processing completion time is selected and outputted.

6. The planning program according to claim 4, characterized in that When searching for the above input sequence, a genetic algorithm is used.

7. A planning method, A planning method for allocating the plurality of objects to the processing subjects of the plurality of processes under the condition that a plurality of processes are sequentially performed on the plurality of objects, the processing time of each of the plurality of processes is respectively specified for the plurality of objects, the number of processing subjects for any one of the plurality of objects is respectively specified for the plurality of processes, and the processing subject does not perform processing on other objects during the period when the processing subject processes any one of the objects, and the method is characterized in that: implement: A first step is to arrange the plurality of objects in the processing bodies of the plurality of processes according to a predetermined order of the plurality of objects by forward arrangement of the plurality of objects with a predetermined time as a starting point; A second step of arranging the plurality of objects to the processing bodies of the plurality of processes by reverse arrangement in which the arrangement is planned in the opposite direction of the time axis starting from a predetermined time, according to the order of completion of the processing of the objects finally processed in the arrangement obtained in the first step; A third step of aligning the processing start time of each object by forward filling in each processing in the configuration obtained by the second step; as well as The fourth step is to fill the configuration obtained in the third step forward to a predetermined time.

8. The planning method according to claim 7, characterized in that: In the first step, the plurality of objects are arranged in a first process according to a predetermined order, and then arranged in the order of the earliest completion of the process in each process to the next process.

9. The planning method according to claim 7, characterized in that: In the first step, the plurality of objects are arranged in the processing bodies of the plurality of processes according to priorities specified for the plurality of objects.

10. The planning method according to any one of claims 7 to 9, characterized in that: The computer executes the following processing: executing a repetitive process of repeatedly performing the first step to the fourth step after changing the order of feeding the plurality of objects into the plurality of processes, and searching the feeding order in the repetitive process so that the operation rate and the process completion time meet the prescribed conditions, In each process, (the time width from the start time of the process of the object to be processed first to the completion time of the process of the object to be processed last) × the number of subjects = the total operation time, the time for arranging each object in each subject in each process is set as the actual operation time, and the operation ratio of each process is set as actual operation time / total operation time × 100 (%), and the above operation rate is defined as the average value of the operation ratio of each process, The processing completion time is defined as the time from the start time of processing of the first object to the completion time of processing of the last object.

11. The planning method according to claim 10, characterized in that: The computer executes a process of selecting and outputting the best result of the operation rate and the processing completion time from among the results obtained through the repeated steps.

12. The planning method according to claim 10, characterized in that: When searching for the above input sequence, a genetic algorithm is used.

13. An information processing device, An information processing device is an information processing device that performs a plan of arranging the plurality of objects to the processing subjects of the plurality of processes under the condition that a plurality of processes are performed on a plurality of objects in sequence, a processing time of each of the plurality of processes is specified for each of the plurality of objects, a number of processing subjects for any one of the plurality of objects is specified for each of the plurality of processes, and the processing subjects do not perform processing on other objects during the period when the processing subjects are processing any one of the objects, characterized in that: A calculation unit is provided, the calculation unit executing: a first step of arranging the plurality of objects to the processing bodies of the plurality of processes according to a predetermined order of the plurality of objects by forward arrangement of the arrangement planned with a predetermined time as a starting point; A second step is to arrange the plurality of objects to the processing bodies of the plurality of processings by a reverse configuration that is planned in the opposite direction of the time axis starting from a specified time, according to the processing completion order of each object finally processed in the configuration obtained by the first step; a third step is to make the processing start time of each object consistent by forward filling in each processing in the configuration obtained by the second step; and a fourth step is to forward fill in the configuration obtained by the third step to a specified time.

14. The information processing device according to claim 13, characterized in that: The computing unit arranges the plurality of objects in a first process in a predetermined order in the first step, and then arranges the objects in a next process in the order of the earliest completion of the process in each process.

15. The information processing device according to claim 13, characterized in that: In the first step, the calculation unit arranges the plurality of objects in the processing bodies of the plurality of processes according to priorities defined for the plurality of objects.

16. The information processing device according to any one of claims 13 to 15, characterized in that: The computing unit executes the following processing: executing a repetitive process of repeatedly performing the first to fourth processes after changing the order of feeding the plurality of objects into the plurality of processes, and searching the feeding order in the repetitive process so that the operation rate and the process completion time satisfy a predetermined condition, In each process, (the time width from the start time of the process of the object to be processed first to the completion time of the process of the object to be processed last) × the number of subjects = the total operation time, the time for arranging each object in each subject in each process is set as the actual operation time, and the operation ratio of each process is set as actual operation time / total operation time × 100 (%), and the above operation rate is defined as the average value of the operation ratio of each process, The processing completion time is defined as the time from the start time of processing of the first object to the completion time of processing of the last object.

17. The information processing device according to claim 16, characterized in that: have: The output unit selects and outputs the best result of the operation rate and the processing completion time from among the results obtained through the repeated steps.

18. The information processing device according to claim 16, characterized in that: The calculation unit uses a genetic algorithm when searching for the input sequence.

Images