JPH0453773B2 - - Google Patents

Description

[Detailed Description of the Invention] (1) Technical Field of the Invention The present invention relates to a sequential controller in a product processing system, and particularly to a sequential controller that anticipates future scheduling while processing a large number of products of various types. The present invention relates to a product processing control method that allows for continuous input of products at all times.

(2) Background of the technology In a system that processes a wide variety of products by feeding them into many devices, a system that automatically schedules which products should be fed into which device and when should Recently, there has been an increase in the number of processing devices, and a major problem is how to control the sequence control to optimally schedule the devices.

Scheduling is often predetermined to be optimal when a product can be processed by one device at a time and then wait before entering another device. There are already ways to do this. However, if each product must be processed in one piece of equipment and then immediately fed into the next piece of equipment, the feeding from one piece of equipment to the next piece of equipment must be scheduled so that there is no waiting. Must be.

For example, the system shown in FIG. 1 processes a wide variety of products A, B, and C using several devices (for example, device 1 is for cleaning, device 2 is for etching, device 3 is for washing, and device 4 is for washing.
This is a product processing system that processes products continuously (drying), and as shown in the figure, product A is
Product B is continuously processed in devices 1, 3, and 4, and product C is continuously processed in devices 2 and 4. In this way, the equipment used, processing order, and processing time differ depending on the product, so in such a system, product processing control using optimal scheduling that processes each product in succession without waiting is required. Emphasis has been placed on developing methods.

In such a system, it is necessary to take into account the preparation period for each device to come out of the busy state and become ready to introduce a new product.Also, depending on the product, some devices may not be used, so It is necessary to consider when and which device to introduce it to so that there is no waiting time. In such a system, assuming that new products are being introduced rapidly, it is difficult to predict scheduling for all products when they are introduced, and it is difficult to predict scheduling for all products when new products are introduced. There is a need to. That is, it is necessary to dynamically determine the schedule while each product is being processed by the system.

(3) Prior Art and Problems Conventionally, sequential control in such product processing systems has been created by predicting scheduling before all products are input into the system. However, in systems that predict scheduling in this way, optimal scheduling can only be achieved in small-scale systems, and if applied directly to large-scale systems, a waiting state may occur during processing. This method has the disadvantage that it may have a negative impact on the quality of the product and may also reduce the operating efficiency of the entire line.

(4) Purpose of the Invention In order to eliminate the above-mentioned conventional drawbacks, the present invention unifies the processing cycle of each processing device as an integral multiple of the unit time, and reduces the processing time of the devices through which the product input to the product processing system passes. and a product processing control method that performs input control at the time of product input using a processing method in which the preparation time of the equipment is set in units of the processing cycle and a schedule is created at the time of inputting a new product into the system. .

(5) Structure of the Invention The feature of the present invention is that in a product processing control method that controls a plurality of products to be processed through a plurality of processing devices via the same route or different routes, The time and preparation time are uniformly defined as unit cycle time, distribution information of each of the products to each processing device at each time is set in a register as parameter information, and each of the products is configured to handle the plurality of processing devices. Status information indicating in what cycle each processing device through which each of the products should go through when input to the product processing register including the products processes the product is set in the register, and the parameter information and the status information are set in the register. From this, it is determined whether a waiting state occurs because a certain processing device is in use for processing a product that has already been put in, and if the waiting state occurs, the product is stopped being put in, and the waiting state is stopped. This is achieved by providing a product processing control method characterized by controlling the input time to be delayed until the condition disappears.

(6) Embodiment of the Invention Next, an embodiment of the product processing control method of the present invention will be described with reference to the drawings.

The product processing control method of the present invention unifies the processing cycle in each device as an integral multiple of the unit cycle time, and also determines which device each product input to the product processing system passes through and takes the preparation time of the device to process the process. By managing each cycle with a microcomputer, we can control the input of products into the processing system. By doing so, we can ensure that products flow continuously between devices without waiting in the middle of processing. It is for scheduling. First, the scheduling method will be briefly explained.

Figure 2 shows the device 1,
2, 3, and 4, the product processing control method of the present invention shows a method of scheduling so that there is no waiting even if a certain device has a preparation period.

First, what is marked with a cross is defined as the processing cycle of the device. and the product at time t ₁
A ₁ is inputted into device 1, and then sequentially inputted from device 2 to device 3 and device 4. Product A ₂ is
It is input into the system at time t ₂ and then successively input into devices 2, 3, and 4. Product A ₃ is charged into device 1 at time t ₃ and then sequentially into devices 2, 3, and 4. Furthermore, if product A ₄ is introduced at time t ₄ , then device 2,
3, and are fed into the device 4 at time _t5 , but assuming that the device 4 can only process three products in succession and that a preparation period is required after that, A ₁ and A ₂ have already been processed. , A ₃ , the device 4 cannot take in the new product A ₄ at time t ₅ , and if this continues, the product A ₄
will have to wait until time t ₆ when the device 4 exits the ready state and enters the ready state.

Therefore, under the condition that variety A must be processed continuously, product A ₄ at time t ₄
Therefore, at time t ₄ , the above wait is predicted and the time is set so that there is no wait.
At t ₄ ′, input into device 1, then device 2,
_The device 3 predicts that at time t ₆ the device 4 will have already been released from the preparation state and will be in the ready state.
Allow A ₄ to be input into device 4.

Such scheduling is possible using conventional scheduling methods when the scale of the system is small, but as the number of different types and the number of devices increases, it becomes difficult to use conventional methods. However, with the product processing control method of the present invention, optimal scheduling management can be performed, as will be described later.

In the embodiment of the second scheduling method shown in FIG. This is the case.

At time _t1 , product A, _A1, is put into device 1, and then successively into devices 2, 3, and 4. Similarly, product A, A ₂ , is put into device 1 at time t ₂ , and then devices 2, 3, 4
will be continuously introduced. And then, the time
When B ₁ , which is product B, is put into device 1 at t ₃ , product B does not take the path that passes through device 1, then device 2, but passes through device 2, passes through device 3, and then goes through device 4. Assume that it follows. At this time, if product B ₁ is put into device 1 at time t ₃ , after the processing is finished, device 3 will
Since the process _A2 is being executed, the product B1 is in a busy state and cannot be used, so the product _B1 is forced to wait until time _t4 '.

However, under the condition that such a wait should not occur, product B (B ₁₎ must also be processed continuously, so at time t ₃ , the above waiting is predicted and B ₁ is not inputted into the device 1. and time
At t ₃ ′, product B ₁ is charged into device 1 . time
At t ₄ ', device 3 has already finished processing product A ₂ ;
Since it is in the ready state, product B ₁
After that, the product can be put into the device 4.

In conventional scheduling methods, all products are predicted before they are introduced, so
It is extremely difficult to predict this, especially when the processing time for each product is different, and moreover, it is very difficult to predict when the system is large-scale. However, in the product processing control method of the present invention, as will be described later, scheduling is performed dynamically during the product processing process, making it possible to eliminate waiting states.

The product processing control method of the present invention has the following new features in order to perform waiting-free scheduling while products are being processed.

In order to integrate the predictions of the above two items, the processing time and preparation time of the device are defined as multiples of a certain unit cycle time. In each device, which process uses which cycle and how many cycles, or how many cycles it takes for preparation are set as parameters in the register of the microprocessor. When input to the product processing system, the status of each device indicating the cycle from the current time to use is created and set in the register of the microprocessor. When a new product is to be introduced into the product processing system, it is assumed that the new product has already been introduced, the above status is created, and the above parameters and the above status are used to determine future discrepancies (when the product is in front of the equipment). The system determines whether or not the new product will be delayed (long wait times), and then decides whether or not to introduce the new product.

Next, FIG. 4 shows a microcomputer system that implements the product processing control method of the present invention having such features.

In FIG. 4, the control module 10
The system actually controls when and what types of products are introduced into each device of the product processing system, and information on the types of products to be introduced into each device is given to the decision-making module 20, which determines the boundaries, and the schedule is After Yuling's decision is made, the entire process system is controlled based on the decision information.

The decision making module 20 has attribute (distribution) information as a parameter 201, such as which process uses which cycle and how many cycles to use, or how many cycles are required for preparation in each device in the product processing system. When a new product is input into the product processing system using the current status 202 of each device, which indicates the number of cycles in which it will be used from the current time, it is assumed that the new product has already been input into the product processing system at that time. calculate and create a current status assuming that the current status is the same, and determine from the parameters and the current status whether or not the product is kept waiting in front of the device, that is, whether a conflict will occur in the future;
A decision is made as to whether or not the product can be introduced at that time.
Furthermore, a future status 203 is created that indicates when the product will be introduced into each device.

Next, the scheduling method of the decision making module 20 of the microcomputer system is applied to a product processing system including devices 1, 2, 3, and 4 in the order of products A, A, and B as shown in FIG. Taking the case of input as an example, an example of the parameter information and status information is shown in FIG.

Below, each parameter and each status will be expressed in 6 bits for ease of explanation. It is assumed that each of the devices 1, 2, 3, and 4 currently has one status.

When a certain product is to be introduced into the product processing system at a certain time, the microcomputer system creates future parameters for each device by ORing the parameters of each product and the current status of each device. At this time, the decision as to whether or not it is okay to input a certain product into the product processing system at a certain time is made by performing an AND of each bit between the current status of each device at the time of input and the parameters of the product to be input. , and checks whether the result is 0 or 1.

1, if the product is introduced at that point, product competition will occur and the product cannot be introduced into the product processing system. In this case, the decision-making module 20 determines that there will be a conflict in the future where the product is left waiting in front of the device, that is, a conflict will occur, that is, the product cannot be introduced at that time, and based on that judgment, the product will not be introduced. Furthermore, if the result of the AND operation is 0, it is determined that there is no conflict, and as a result of the OR operation, a future status is created that indicates when the product will be introduced to each device. .

In FIG. 5, since no products are input into the product processing system before time t ₁ , the current status of each device immediately before time t ₁ is device 1, 2,
It is (000000) for all of 3 and 4.

On the other hand, at time t ₁ , only product A ₁ is being input into the product processing system, so product A ₁
The parameters for device 1 are (100000),
For device 2, it is (010000), for device 3, it is (001000), and for device 4, it is (000100). This means that, in order, device 1 is used at time t ₁ to process product A ₁ , device 2 is used at time t ₂ after one cycle time has elapsed, and again at time t ₃ after one cycle time has elapsed. This means that device 3 is used and then device 4 is used at time t ₄ after one cycle time has elapsed.

In this case, naturally, no conflict will occur even if product A ₁ is introduced at time t ₁ , so the current status of the device and the parameters of product A ₁ are ORed to create the future status of the device. That is, at time t ₁ ,
From the left of the diagram (100000), (010000), (001000),
(000100). This indicates that device 1 is used at time t ₁ , device 2 is used at time t ₂ , device 3 is used at time t ₃ , and device 4 is used at time t ₄ .

Next, when one cycle time has passed and the process moves to time _t2 , the current status of each device becomes the future status at time _t1 shifted one bit to the left. That is, immediately before time _t2 , the current status of each device is (000000),
(100000), (010000), (001000).

On the other hand, at time t ₂ , product A ₂ is about to be introduced into the product processing system, so the parameters of product A ₂ are (10000), (010000),
(001000), (000100). This is the product in order
To process A ₂ , device 1 is used at time t ₂ , device 2 is used at time t ₂ after one cycle time has elapsed, and device 3 is used at time t ₄ after one cycle time has elapsed. , further indicates that the device 4 is used at time t ₅ after one cycle time has elapsed.

Then, at time _t2 , each bit of the current status of each device and the parameter of product _A2 is ANDed to check whether it is okay to input product _A2 into the product processing system. At this time, since there is no bit that becomes 1 as a result of the AND operation, it is determined that no conflict will occur. In this case, product A ₂ is introduced at time t ₂ . and,
OR the current status of each device and the parameters of product A ₂ to create the future status of the device. That is, at time t ₂ , from the left in the figure,
(100000), (110000), (011000), (001100). This means that device 1 is used at time t ₂ and device 2
is used at time t ₂ and time t ₃ , and device 3 is used at time t 3 and time t ₃ .
It is used at time t ₄ to indicate that device 4 is used at time t ₄ and time t ₅ .

Next, when one cycle time has elapsed and we move to time _t3 , the current status of each device immediately before time _t3 becomes the future status at time _t2 shifted one bit to the left, as described above. From the left of the diagram: (000000), (100000), (110000), (011000)
becomes.

On the other hand, at time t ₃ , product B ₁ is to be introduced, but since it is assumed that product B ₁ is not introduced into device 2, the parameters of product B ₁ are (100000), (000000), (010000),
(001000). This in turn means that at time t ₃ equipment 1 is used for processing product B ₁ ;
It is shown that the device 3 is used at time t ₄ after one cycle time has elapsed, and that the device 3 is used at time t ₅ after one cycle time has elapsed.

Then, at time _t3 , each bit of the current status of each device and the parameter of product _B1 is ANDed to check whether it is okay to input product _B1 into the product processing system. At this time, the decision-making module 20 determines that since there is a bit that becomes 1 in devices 3 and 4 as a result of the AND operation, a competition will occur and a product conflict will occur.
Based on this determination, product _B1 is not introduced at time _t3 .

Next, when one cycle time has elapsed and we move to time _t4 , in this case, the current status just before time _t4 is the current status at time _t3 shifted one bit to the left, starting from the left in the diagram. ,
(000000), (000000), (100000), (110000). On the other hand, when trying to introduce product B ₁ at time t ₄ , the parameters of product B ₁ are (100000), (000000), (010000), (001000) from the left in the figure.
becomes. This, in turn, for the processing of product B ₁ ,
This indicates that device 1 is used at time t ₄ , device 3 is used at time t ₅ after one cycle time has elapsed, and device 4 is used at time t ₆ after one cycle time has elapsed. There is.

Then, at time _t4 , each bit of the current status of each device and the parameter of product _B1 is ANDed as a check to see if it is okay to input product _B1 into the product processing system. In this case, since there are no bits that result in 1 as a result of the AND operation, it is determined that no conflict occurs. In this case, product _B1 is introduced at time _t4 . and,
A future status is created by ORing the current status of each device and the parameters of device _B1 . That is, at time t ₄ , from the left in the figure,
(100000), (000000), (110000), (111000). This means that device 1 is used at time t ₄ and device 2
is no longer used, device 3 is used at time t ₄ and time t ₅ , and device 4 is used at time t ₄ , time t ₅ , and time t ₆ .

Next, when one cycle time has elapsed and the time moves to time _t5 , in this case, the current status of each device immediately before time _t5 becomes the future status at time _t4 shifted one bit to the left. From left to right: (000000), (000000), (100000), (110000)
becomes.

Since the product is not input to the product processing system at time t ₅ , no product parameters are created.
Also, no check is made to see if there will be a conflict, and the future parameters will have the same form as the current parameters. That is, from the left of the figure, (00000),
(000000), (100000), (110000). This means that device 1 and device 2 are no longer used, and device 3 is t ₅
indicates that device 4 is used at time t ₅ and time t ₆ .

Next, when one cycle time has elapsed and the time moves to time t ₆ , the current status of each device immediately before time t ₆ becomes the future status at time t ₅ shifted by 1 bit to the left, so that In order from
(000000), (000000), (000000), (100000).

At time t ₆ , no product is input to the product processing system, so no product parameters are created, no check is made to see if there is a conflict, and the future parameters have the same form as the current parameters. That is, from the left of the figure, (000000),
(000000), (000000), (100000). this is,
Device 1, device 2, and device 3 will no longer be used, and device 4 will be used at time _t6 .

Next, when one cycle time has passed and it moves to time t ₇ , the current status and future status of the device are all (000000), and at time t ₇ , the product processing system has completed processing the product, and from now on Indicates that the device is not used.

As described above, in this example, each product is sequentially fed into each device and processed without waiting.

Figure 5 shows that all of the devices 1, 2, 3, and 4 can each process products for 5 consecutive cycles, that is, the number of uses is limited to 5 times, and each device is ready after reaching the limited number of uses. Two cycle hours were required. However, if there is a device in the product processing system whose number of uses is limited to a lower number than others, a preparation period is required to restart processing, which may result in the device not being able to be used.

FIG. 6 shows an example of parameter information and status information when it is impossible to introduce a product because a preparation period is required after processing. In the following description, parts of each parameter and each status that were not explained in the example shown in FIG. 5 will be mainly explained in detail, and other redundant explanations will be omitted. In this example, it is assumed that the device 4 can be used only twice.

In Fig. 6, just before time _t3 , the current status of each device is (000000),
(100000), (110000), (011000).

On the other hand, when product A ₃ is introduced at time t ₃ , the parameters of product A ₃ are as follows from the left in the diagram:
(100000), (010000), (001000), (000100). In order to check whether a product conflict will occur, as mentioned above, there is no bit that becomes 1 when the current status is ANDed with each bit of the parameter of product _A3 , so it is determined that there is no conflict. be done. Then, in the same way as the creation of the future parameters described above, each bit of the current parameter and the parameter of product A ₃ is ORed to create an OR parameter of product A ₃ which is a temporary parameter. Then,
From the left of the figure: (100000), (110000),
(111000), (011100).

Among the above OR parameters, focusing on device 4 indicates that device 4 is used at time t ₄ , time t ₅ , and time t ₆ . However, in this case, it is assumed that the device 4 can only be used twice consecutively, so after being used at time t ₄ and time t ₅ , it has to enter a two-cycle preparation period, and therefore, t ₃
The decision making module 20 determines that product A ₃ cannot be introduced at that time. Based on this judgment, t ₃
Product _A3 is not added at the time.

Next, when one cycle time has elapsed and we move to time _t4 , the current status of each device immediately before time _t4 becomes the current status at time _t3 shifted one bit to the left, starting from the left in the diagram. , (000000),
(000000), (100000), (110000).

On the other hand, when trying to introduce product A ₃ at time t ₄ , the parameters of product A ₃ are (100000), (010000), (001000), (000100) from the left in the figure.
becomes. To check if there are any product conflicts, check the current status and product A ₃ as described above.
AND each bit with the parameter of
Since there is no bit such that , it is determined that no conflict will occur. Then, in the same way as the creation of the future parameters described above, each bit of the current parameter and the parameter of product A ₃ is ORed to create an OR parameter of product A ₃ which is a temporary parameter. Then, from the left of the figure, (100000), (010000),
(101000), (110100). Of the above OR parameters, focusing on device 4, time t ₄ ,
t indicates that device 4 is used at time ₅ .
However, in this case, it is assumed that device 4 can be used only twice consecutively, so at time t ₄ and time t ₅
The decision making module 20 determines that the product A 3 cannot be introduced at time t ₄ because the product A ₃ must enter a two-cycle preparation period after it has been used. Based on this judgment, product A ₃ will not be introduced at time t _4. Next, when one cycle time has passed and we move to time t ₅ , the current status of each device immediately before time t ₅ will be the current status at time t ₄ . It is shifted one bit to the left, and in order from the left of the diagram, (000000),
(000000), (000000), (100000).

On the other hand, when trying to introduce product A ₃ at time t ₅ , the parameters of product A ₃ are (100000), (010000), (001000), (000100) from the left in the figure.
becomes. In order to check whether there is a product conflict, as mentioned above, it is determined that there is no conflict since there is no bit that becomes 1 even when the bits are ANDed between the current status and the parameter of product _A3 . Then, in the same way as creating the future parameters described above, OR each bit between the current parameters and the parameters of product _A3 , and then
Create an or parameter for _A3 . Then, from the left of the figure, (100000), (010000), (001000),
(100100).

Of the above OR parameters, focusing on device 4 shows that device 4 is used at time t ₅ and time t ₈ . In this case, since two cycle time is prepared as a preparation period, the decision making module 20 determines that product A ₃ can be introduced at time t ₅ . Based on this judgment, product A ₃ is introduced at time t ₅ . The OR parameter temporarily created above is used as the future status.

Although the following explanation will be omitted, in this example as well, each product is continuously fed into each device and processed so that there is no waiting.

Next, FIG. 7 shows an example of parameter information and status information when a product cannot be inputted because a certain device requires several cycles to process a certain product. In the following explanation, each parameter and each status will be explained as shown in Fig. 5 and 6.
In the example shown in the figure, parts that are not explained will be mainly explained, and other redundant explanations will be omitted. In this example, it is assumed that the apparatus 2 requires two cycle times to process one product.

In FIG. 7, just before time t ₂ , the current status of each device is (000000),
(100000), (010000), (001000).

On the other hand, when product C ₁ is introduced at time t ₂ , the parameters of product C ₁ are (100000), (011000), (000100), (000010) from the left in the figure.
becomes. This, in turn, for the treatment of product C ₁ , t ₂
At time, device 1 is used, device 2 is used at time t ₃ after one cycle time has elapsed, device 2 is used at time t ₄ after one cycle time has elapsed, and device 3 is used at time t ₅ after one cycle time has elapsed. used and further 1
It is shown that device 4 is used at time t ₆ after the cycle time has elapsed.

In the above, since device 2 requires two consecutive cycle times from time t ₃ to time t ₄ to process product C ₁ , time t ₃ and time t ₄ are indicated in the parameters of product C ₁ regarding device 2. The bits are continuously 1.

Thus, if a piece of equipment requires several consecutive cycles to process a certain product,
This can be done by continuously setting bits indicating the relevant time to 1 in the parameters of the product related to the device.

Then, as a check whether it is okay to input product C ₁ into the product processing system at time t ₂ ,
Each bit of the current status of each device and the parameter of product _C1 is ANDed. As a result of the AND operation, there is no bit that becomes 1, so it is determined that no conflict will occur. In this case, product C ₁ at time t ₂
investment will be made.

Then, each bit of the current status of each device and the parameter of product _C1 is ORed to create the future status of the device. That is, at time t ₂ , (100000), (111000),
(010100), (001010). This means that device 1
used at time t ₂ and device 2 is used at time t ₂ and time t ₃ and time t ₄
is used at time, indicating that device 3 is used at time t ₃ and time t ₅ and device 4 is used at time t ₄ and time t ₆ .

Next, when one cycle time has elapsed and we move to time _t3 , the current status of each device immediately before time _t3 becomes the future status at time _t2 shifted one bit to the left, as described above. From the left of the diagram: (000000), (110000), (101000), (010100)
It is becoming.

On the other hand, when product A ₂ is introduced at time t ₃ , the parameters of product A ₂ are (100000), (010000), (001000), (000100) from the left in the figure.
becomes. To check for product conflicts, the current status and product
When each bit is ANDed with the parameter of _A2 , there is a bit that becomes 1 for devices 2, 3, and 4. Therefore, the decision making module 20 determines that product A ₂ cannot be introduced at time t ₃ .
Based on this judgment, product A ₂ is not introduced at time t ₃ .

Next, when one cycle time has elapsed and it moves to time _t4 , the current status of each device immediately before time _t4 becomes the current status at time _t2 shifted to the left by 1 bit, and from the left, ( 000000),
(100000), (010000), (101000).

On the other hand, when product A ₂ is introduced at time t ₄ , the parameters of product A ₂ are (100000), (010000), (001000), (000100) from the left in the figure.
becomes. To check for product conflicts, the current status and product
When each bit is ANDed with the parameter of _A2 , there is no bit that becomes 1. Therefore, it is determined that there will be no conflict, so at time t ₄ the product
A ₂ is thrown in. Then, as described above, the future parameters are created by ORing the current status and the parameters of product _A2 .

Although the following explanation will be omitted, in this example as well, each product is continuously fed into each device and processed so that there is no waiting.

(7) Effects of the Invention The present invention unifies the processing cycle in each processing device as an integral multiple of the unit cycle time, and reduces the processing time and preparation of the devices through which the product input to the product processing system passes. By managing time in units of processing cycles, we can control the time of input into the product processing system, and thereby perform processing in the product processing system using simple sequence control so that products do not have to wait in front of the equipment. In addition, the overall operating rate can be improved, and efficient product input control is possible.

[Brief explanation of the drawing]

FIG. 1 is a diagram of a system in which a wide variety of products are processed in parallel by several devices, and FIG. 2 is a diagram showing scheduling of an embodiment of the product processing control method of the present invention.
FIG. 3 is a block diagram showing scheduling in another embodiment of the present invention, FIG. 4 is a diagram showing an embodiment of a microcomputer system for realizing the product processing control method of the present invention, and FIG. 6 is a diagram showing an example of parameter information and status information in the scheduling method as shown in the third aspect of the present invention, and FIG. FIG. 7 is a diagram showing an example of parameter information and status information when a product cannot be inputted because a certain device requires several cycles for processing. DESCRIPTION OF SYMBOLS 10...Control module, 20...Decision making module, 201...Parameter, 202...Current status, 203...Future status.

Claims (1)

[Scope of Claims] 1. In a product processing control method for controlling a plurality of products to be processed through a plurality of processing devices on the same route or different routes, the processing time and preparation time of each processing device is defined as a unit cycle time. distribution information of each of the products to each processing device at each time is set in a register as parameter information, and each of the products is input into a product processing system including the plurality of processing devices. In some cases, status information indicating in which cycle each processing device through which each of the products should process the product is set in the register, and based on the parameter information and the status information, the products that have already been introduced are Determine whether or not a waiting state occurs because a certain processing device is in use for processing, and if the waiting state occurs, stop supplying this product, and delay the introduction time until the waiting state disappears. A product processing control method characterized by controlling as follows. 2. Claim 1, wherein the processing time and the preparation time in each of the processing devices are defined as an integral multiple of a unit cycle time.
Product processing control method described in Section.