JP2005346131A - Process management system, process management method, process management program and recording medium with the program recorded thereon - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a process management system having high responsiveness to change, a process management method and a process management program and a recording medium with the program recorded thereon. <P>SOLUTION: The process management system comprises an end time detection means detecting the work end time of each device; a priority determination means determining the priority of processing of each lot; and an arithmetic processing means calculating a work start time in each device based on the work end time and the priority. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a process management system, a process management method, a process management program, and a recording medium that records the process management system for managing each process of a product manufactured through a plurality of processes.

  As one of the ideas of the optimization problem, there is a salesman circulation problem that seeks the shortest route for visiting each point. In the salesman patrol problem, a method of searching all routes and obtaining the shortest route is generally used.

  For example, as shown in FIG. 1, when each of lot A, lot B, and lot C is passed through apparatus X, apparatus Y, and apparatus Z, this method calculates all combinations of orders, and the optimum among them A simple answer is required.

  Specifically, the order of passing through the device X is three from the first to the third for each of the lot A, the lot B, and the lot C. Similarly, the order of passing through the devices Y and Z is the lot A, the lot. There are three types, B to C, from the first to the third. Therefore, for device X, device Y and device Z, there are 27 possible events. In this method, the optimum order is determined from these.

Generally, an event that can occur for each device is the number of devices raised to the power of a lot. Accordingly, if, lots are five, device ¹⁰⁵ that is, when there 10, will get occur events 100,000 ways, it is necessary to determine the best order from the. If there are more lots and devices, the number of events that can occur is further increased, and the processing requires enormous calculation time.

  On the other hand, there are Artemis and Asprova as systems for optimizing the processes used conventionally. In these systems, the capacity of each device and the load on each process for each product are quantified, and the entire schedule is optimized based on constraints such as delivery date.

  In addition, there is a system that calculates the estimated passage time after each process is completed based on the standard time.

  For example, a virtual number based on product flow data, processing condition data, transport destination data, initial priority data, production plan data, line operation plan data, and similar data on products in progress. There is a production scheduling system that includes a host computer that performs a progress simulation over months and creates a long-term production plan when a desired result is obtained (see, for example, Patent Document 1).

For example, based on the work results before a certain point in time, the schedule after that point can be easily corrected, and the worker can grasp whether the process for each product is digested according to the schedule. There is a process management system that can do this (for example, see Patent Document 2).
JP-A-6-176030 JP 2003-30309 A

  However, the background art described above has the following problems.

  Even when work for only some products (lots) is delayed, the schedule is calculated for the entire system, and thus there is a problem that it takes time to calculate.

  Further, since the schedule is calculated at a predetermined timing, there is a problem that the change cannot be flexibly handled.

  Moreover, since the capability and load of the apparatus are determined by a calculation formula determined in advance for each system, there is a problem that the application range is limited and the degree of freedom is low.

  In addition, there is a problem that the delivery date cannot be determined in a process away from the completed process due to poor accuracy.

  Therefore, in view of such circumstances, an object of the present invention is to provide a process management system, a process management method, a process management program, and a recording medium in which the process management system has a quick response to changes.

  In order to solve the above-described problems, a process management system according to the present invention is a process management system for managing each process of a product manufactured through a plurality of processes, and detects an end time of work of an apparatus. The apparatus includes a detection unit, a priority determination unit that determines the priority of processing of each product, and an arithmetic processing unit that calculates a work start time in each device based on the work end time and the priority.

  In this way, it is possible to respond quickly to changes in the schedule.

  Further, the arithmetic processing means may obtain a work time for each device, and calculate a work start time in each device based on the work time.

  Furthermore, when the work start time limiter is set for at least one device, the arithmetic processing means may calculate the work start time in each device based on the limiter.

  The process management method according to the present invention is a process management method for managing each process of a product manufactured through a plurality of processes, the step of detecting the work end time of the apparatus, and the processing of each product And determining the work start time in each device based on the work end time and the priority order.

  Furthermore, a step of obtaining a work time for each device and calculating a work start time in each device based on the work time may be provided.

  Furthermore, when a work start time limiter is set for at least one device, a step of calculating the work start time in each device may be included based on the limiter.

  A process management program according to the present invention causes a computer to execute a process management method.

  A computer-readable recording medium according to the present invention stores a process management program.

  According to the embodiment of the present invention, it is possible to realize a process management system, a process management method, a process management program, and a recording medium recording the same, which have quick response to changes.

Next, embodiments of the present invention will be described with reference to the drawings.
In all the drawings for explaining the embodiments, the same reference numerals are used for those having the same function, and repeated explanation is omitted.

  First, a process management system according to an embodiment of the present invention will be described with reference to FIG.

  The process management system according to the present embodiment includes, for example, an apparatus 110, an apparatus 120, and an apparatus 130 disposed in a factory 100, and a process management apparatus 200 that is online-connected to each of the apparatuses 110, 120, and 130. In the factory 100, lots, for example, lot A140 and lot C160 are processed by the devices 110, 120, and 130.

  The process management apparatus 200 is configured by, for example, a host computer 200 and includes a database (DB) 300. In addition, the process management apparatus 200 constructs a virtual system and generates apparatus objects 210, 220, and 230 that are linked online with the apparatuses 110, 120, and 130. Further, the process management apparatus 200 generates a lot object A240 corresponding to the lot A140 and a lot object C260 corresponding to the lot C160.

  Next, the apparatus 110 arranged in the factory 100 will be described. The devices 120 and 130 may have different processing contents for the lot, but since they have the same configuration as the device 110, the description thereof is omitted.

  The apparatus 110 includes a control unit 112, a communication unit 111 connected to the control unit 112, a storage unit 113, a start time detection unit 114, and an end time detection unit 115.

  The start time detection unit 114 detects a lot processing start time. For example, it is constituted by a sensor, and when a lot is inserted, the time when the lot passes the sensor is detected, and the time is set as the processing start time of the lot. In addition, for example, when processing is started by reading a barcode attached to a lot by a barcode reader provided in the apparatus 110, the read time is detected and the processing time of the lot is detected. The start time may be set. Alternatively, the time when the processing start button of the apparatus is pressed may be detected, and that time may be used as the processing start time for the lot.

  The storage unit 113 stores device names, process names, data related to processing contents, programs for causing the device 110 to function as the communication unit 111, the start time detection unit 114, and the end time detection unit 115, and the like.

  Here, this program is stored in a computer-readable recording medium such as a CD-ROM, and is stored in a magnetic disk or the like via a CD-ROM drive provided in the apparatus 110 and then loaded into a memory. Executed. The recording medium for recording the program may be a recording medium other than the CD-ROM.

  The end time detection unit 115 detects the processing end time of the lot. For example, it is constituted by a sensor, and at the end of the lot processing, the time when the lot is passed is detected, and the time is set as the processing end time of the lot. In addition, for example, when the process is completed by reading the barcode attached to the lot by the barcode reader provided in the apparatus 110, the read time is detected and the processing of the lot is completed. You may make it be time.

  The communication unit 111 performs communication processing with the process management apparatus 200.

  The control unit 112 includes a CPU (Central Processing Unit), a memory, a cache memory, and the like, and controls the entire apparatus 110. For example, the CPU performs control by reading and executing a program stored in the storage unit 113.

  In each device 110, 120, and 130, when an event of lot processing start and processing end occurs, the device in which the event has occurred notifies the corresponding device object via the network. The notified device object notifies the corresponding lot object, and the received lot object notifies the DB 300 of the notified data, for example, current process, device, processing start time, processing end time, event history, etc. Write.

  Next, the process management apparatus 200 will be described with reference to FIG.

  The process management apparatus 200 includes a control unit 260, a communication unit 270 connected to the control unit 260, an arithmetic processing unit 280, a priority order determination unit 285, a storage unit 290, and a DB 300.

  The communication unit 270 performs communication processing between the devices 110, 120, and 130.

  The arithmetic processing unit 280 collects information such as a lot name, a device name, a processing start time, and a processing end time processed in each device 110, 120, and 130, and schedules the time and processing to arrive at each device for each lot. An operation for obtaining a start time, a processing time in the apparatus, and the like is performed.

  The priority order determination unit 285 determines the priority order of processing of each lot.

  The storage unit 290 stores a program for causing the device 200 to function as the communication unit 270, the arithmetic processing unit 280, and the priority order determination unit 285.

  Here, this program is stored in a computer-readable recording medium, such as a CD-ROM, and stored in a magnetic disk or the like via a CD-ROM drive provided in the process management apparatus 200, and then loaded into a memory. To be executed. The recording medium for recording the program may be a recording medium other than the CD-ROM.

  The DB 300 includes a lot data holding table 300-1, a history data holding table 300-2, and a specification data holding table 300-3, which will be described later, and stores the current process, device, event history, and the like for each lot.

  The control unit 260 includes a CPU (Central Processing Unit), a memory, a cache memory, and the like, and controls the entire process management apparatus 200. For example, the CPU performs control by reading and executing a program stored in the storage unit 290.

  Next, the operation of the arithmetic processing unit 280 of the process management apparatus 200 will be described with reference to FIG.

  The arithmetic processing unit 280 includes a calculation unit 282, device objects 210, 220 and 230 connected to the calculation unit 282, and a lot object 240 connected to the calculation unit 282 and connectable to the respective device objects 210, 220 and 230. , 250, a delivery object 284 connected to each of the device objects 210, 220, and 230, and a lot controller 286-1, a history controller 286-2, and a specification controller 286-3 connected to each of the lot objects 240 and 250. Generate.

  The lot controller 286-1 is connected to the lot data holding table 300-1, the history controller 286-2 is connected to the history data holding table 300-2, and the specification controller 286-3 is connected to the specification data holding table 300-3. Connected.

  The device objects 210, 220, and 230 are linked online with the devices 110, 120, and 130 via the communication port 202 provided in the process management device 200. The device objects 210, 220, and 230 correspond to the devices 110, 120, and 130. When an event of lot processing start and processing end occurs in each device 110, 120, and 130, information on the event is displayed. collect.

  Lot objects 240 and 250 correspond to lot A140 and lot B150. The lot object in which the event occurs acquires event information from the device object. Each of the lot objects 240 and 250 accesses the lot data holding table 300-1 via the lot controller 286-1, and accesses the history data holding table 300-2 via the history controller 286-2. The specification data holding table 300-3 is accessed via 286-3.

  The delivery object sends the lot object to the device object on which processing is performed. That is, the lot object and the device object are connected.

  The calculation unit 282 displays information such as the lot name, the device name, the processing start time, and the processing end time processed in each device 110, 120, and 130, the device objects 210, 220, and 230, and the lot objects 240 and 250. For each lot, operations such as work time in each device, scheduled time to arrive at each device, and processing start time are performed.

  The lot controller 286-1, the history controller 286-2, and the specification controller 286-3 write data and data to the lot data holding table 300-1, the history data holding table 300-2, and the specification data holding table 300-3. Take out.

  The lot data holding table 300-1 stores information on the number of substrates, the size of the substrate, the current process, and the current apparatus for each lot. In addition, the history data holding table 300-2 stores information about a device that has been passed so far, a processing start time and a processing end time in the device, for each lot. The specification data holding table 300-3 records the processing contents in each process and each device.

  As an example, processing in the arithmetic processing unit 280 when the lot A 140 is processed in the apparatus 110 and then transferred to the apparatus 120 will be described.

  In this case, while the lot A 140 is processed in the device 110, the lot object 240 is in the device object 210 even on the virtual system. That is, the device object 210 and the lot object 240 are connected.

  Each device object 210, 220, and 230 recognizes the lot object that is held, and the lot object recognizes the device object to which it belongs.

  When the processing of the lot A 140 is completed in the device 110, the end time is notified to the device object 210 on the system via the communication port 202. The notified device object 210 inputs the processing end time of the lot A 140 to the calculation unit 282.

  The calculation unit 282 requests the lot objects 240 and 250 for data regarding the number of substrates and the size of the substrate. The lot objects 240 and 250 retrieve data from the database 300 via the controllers, and calculate the calculation unit. Input to 282. For example, each of the lot objects 240 and 250 accesses the lot data holding table 300-1 via the lot controller 286-1, and stores the number of substrates, the size of the substrate, the current process, the current Information regarding the device is extracted and input to the calculation unit 282. Further, the calculation unit 282 requests a calculation formula for calculating the processing time to the device objects 210 to 230, and each device object 210 to 230 sends the calculation formula stored in the storage unit 290 to the calculation unit 282. input.

  Next, the calculation unit 282 determines whether to change the priority order.

  For example, the priority of processing is increased for a lot whose delivery date is close or a lot that requires rapid processing. Priorities may be determined based on, for example, factory operating conditions, personnel deployment status, etc. other than the delivery date. That is, the priority order of each lot can be changed according to the process, schedule, and the like. By doing so, the priority is reviewed every time processing in a certain process is completed, so that it is possible to respond quickly to changes in the schedule.

  For example, a case where lots A and B are processed by the same process will be described. As shown in FIG. 5, until the lots A and B arrive at the apparatus X, the priority order of the lot A is set to “high”, the delivery date is set to “allow”, and the priority order of the lot B is “low”. "Delivery date is set to" Close ". When lot A and lot B are both in the “waiting” state in apparatus X, the delivery date of lot B is “close”, so the priority of lot B is raised from lot A or the priority of lot A is lowered from lot B It is set so that the lot B is put into the apparatus X first.

  Next, the calculation unit 282 performs calculation by a forward loop based on the data of all lot objects and the data of device objects on the system.

  This forward loop will be specifically described.

  First, work time is determined. In this embodiment, the calculation method of the working time in each apparatus differs depending on the lot configuration state such as the size and number of substrates, the load on each apparatus, and the setup. For this reason, the calculation is performed by changing the calculation method for each device based on these parameters. The calculation method can be changed according to each process, apparatus, lot, and the like. By doing so, compared to the conventional process management system in which the calculation method is determined for each system, the work time and the like can be calculated for each device, so that the capability of the device and the freedom of parameter setting for the load can be increased. .

  This will be described with reference to FIG. In lot A, the size of the substrate is small and the number of mounted substrates is 8, and in lot B, the size of the substrate is large and the number of mounted substrates is 4.

  For example, in the apparatus X, the size of the substrate × the number of sheets / the load of the apparatus is adopted as the calculation method, and the work time of the lot A is calculated as 45 minutes and the work time of the lot B is calculated as 1 hour 15 minutes. In addition, the apparatus Y adopts the size of the substrate + the number of sheets × the load of the apparatus as a calculation method, and the work time of the lot A is calculated as 2 hours and the work time of the lot B is calculated as 1 hour 30 minutes. In the apparatus Z, the number of sheets × the load of the apparatus + the setup time is adopted as a calculation method, and the work time of lot A is calculated as 1 hour 30 minutes, and the work time of lot B is calculated as 2 hours 2 minutes.

  Next, the expected arrival time is calculated based on the obtained work time.

  In actual factory sites, lots do not flow as expected. For this reason, recalculation is performed each time a lot is paid out from the apparatus. By doing so, it is possible to respond quickly to changes. In addition, if there is a change in the schedule, the calculation can be recalculated, and the change can be made more flexible than the conventional process management system in which the schedule is calculated at a predetermined timing. Yes. Further, even when the work time in a certain process is different from the prediction, it is possible to flexibly cope with the subsequent processes.

  For example, a case where lot A is processed in the order of apparatus X, apparatus Y, and apparatus Z will be described.

  In the initial schedule, as shown in FIG. 7, the expected arrival time and working time are 7:00 and 1 hour for apparatus X, 8:00 and 1.5 hours for apparatus Y, and 9:30 for apparatus Z. And 2 hours. Here, the time when the lot is put into the apparatus and the work is completed is set as the expected arrival time for the next apparatus.

  However, although the working time in the apparatus X was calculated as 1 hour, it actually took 3 hours and was paid out from the apparatus X at 10:00. In this case, recalculation is performed, the work end time of the device X is 10:00, the expected arrival time to the device Y is 10:00, the expected arrival time to the device Z is 11:30, the devices Y and Z The expected arrival time is corrected. Here, the recalculation is performed based on the work time and priority.

  Further, when the predicted arrival time is calculated, the predicted arrival time may diverge or become much earlier than the current time for those with a low priority. For this reason, when a limiter is provided and the expected arrival time is calculated beyond a certain time, recalculation is performed from the last step by a back loop described later. Even when recalculation is performed by the back loop, if a predetermined time is exceeded, recalculation is performed again by the forward loop. Optimization is performed by always repeating recalculation by the forward loop and the back loop. By doing this, the forward loop calculated from the first process and the back loop calculated from the last process can be alternately performed, and recalculation can be performed constantly to maintain a stable point. It can respond flexibly. Further, by providing the limiter, for example, when the calculation formula is changed, it is possible to prevent divergence even when the preceding and succeeding processes influence each other and do not converge.

  For example, a case where lot A, lot B, lot C, and lot D are processed in the order of apparatus 1, apparatus 2, apparatus 3, and apparatus 4 will be described as an example.

  The work time in each device of each lot is shown in FIG. The processing time in apparatus 1, apparatus 2, apparatus 3 and apparatus 4 is 2 hours, 2 hours, 1 hour and 1 hour for lot A, and 1 hour, 2 hours, 1 hour and 1 hour for lot B. For lot C, 1 hour, 1 hour, 1 hour and 1 hour, and for lot D 2 hours, 2 hours, 2 hours and 2 hours.

  Based on these work times, the expected arrival time is calculated. When the processing is performed in the order of lot A, lot B, lot C, and lot D, as shown in FIG. 9, the expected arrival time to the apparatus 1, the apparatus 2, the apparatus 3, the apparatus 4, and the warehouse is the lot A Is about 7:00, 9:00, 11:00, 12:00 and 13:00, and for lot B is 7:00, 10:00, 13:00, 14:00 and 15:00, The lot C is 7:00, 12:00, 13:00, 15:00 and 16:00, and the lot D is 7:00, 14:00, 16:00, 18:00 and 20:00 is there.

  Here, when the lot D needs to arrive at the warehouse by 19:00, it is necessary to finish the processing in the apparatus 4 at 19:00. In this case, since the work time in the apparatus 4 is 2 hours, it is necessary to start the work in the apparatus 4 by 17:00. That is, the limit of the work start time in the apparatus 4 is 17:00.

  Therefore, the expected arrival time of the apparatus 4 is set to 17:00, and calculation is performed from the end by a back loop. As a result, as shown in FIG. 10, with respect to lot D, the expected arrival times for device 1, device 2, device 3, device 4 and the warehouse are 7:00, 13:00, 15:00, 17:00 and It is changed to 19:00. Here, in order to make the lot D arrive at the apparatus 2 at 13:00, it is necessary to finish the work of the apparatus 1 by 13:00. For this purpose, the work time in the apparatus 1 is 2 hours. Therefore, it can be seen that it is necessary to input by 11:00. However, at 11 o'clock, the lot C is scheduled to be loaded into the apparatus 1. For this reason, at least one of lot A, lot B, and lot C is corrected by performing recalculation by the forward loop.

  As a result, as shown in FIG. 11, the expected arrival time and work start time for apparatus 1, apparatus 2, apparatus 3, and apparatus 4 and the estimated arrival time for the warehouse are 7:00 and 9:00 for lot A. 11:00 and 11:00, 13:00 and 13:00, 14:00 and 14:00, and 15:00, and for lot B, 7:00 and 8:00, 9:00 and 9:00, 11:00 and 11:00, 12:00 and 12:00, and 13:00, and 7:00 and 7:00, 8:00 and 8:00, 9:00 and 9:00 and 10 for lot C 0:00 and 10:00, and 11:00, and lot D is 7:00 and 11:00, 13:00 and 13:00, 15:00 and 15:00, 17:00 The preliminary 17:00 and 19:00. In this way, the forward loop and the back loop are repeated.

  When the calculation is completed, the calculation unit 282 inputs the result to each device object 210 to 230, and each device object 210 to 230 transmits the result to the devices 110, 120, and 130 via the port 202. The devices 110, 120, and 130 perform processing according to the received schedule. Each device 110, 120 and 130 displays the expected arrival time of the lot on a display device (not shown). In this way, since specific dates and times are passed to the devices 110, 120, and 130, it is possible to understand the information by simply looking at the expected arrival time of each lot.

  When the lot A 140 is conveyed to the apparatus 120, the lot object 240 moves to the apparatus object 220. That is, as shown in FIG. 12, the connection between the lot object 240 and the device object 210 is released and the device object 220 is connected.

  In this case, when the lot object 240 recognizes that the processing has been completed in the device object 210, the data of the next process, that is, the specification of the device 120 is transferred from the specification data holding table 300-3 via the specification controller 286-3. Take out.

  Next, the device object 210 sends the lot object 240 to the device object 220 through the delivery object 284. At this time, the device object 240 and the lot object 220 are connected. Even in this case, the lot object 240 recognizes that it is connected to the device object 220, and the device object 220 recognizes that it is connected to the lot object 240.

  Next, the operation of the process management apparatus 200 will be described with reference to FIG.

  The apparatuses 110, 120, and 130 transmit the process end time to the process management apparatus 200 when the process of the predetermined process ends. When signals are received from the devices 110, 120, and 130 (step S 1302), the device objects 210 to 230 in the virtual system of the process management device 200 input the received information to the calculation unit 282.

  Next, the calculation unit 282 collects data necessary for calculation from the lot objects 240 and 250 and the device objects 210, 220, and 230 (step S1304).

  Next, the calculation unit 282 determines whether or not it is necessary to change the priority of treatment (step S1306).

  When it is necessary to change the priority (step S1306: YES), the priority of the lot whose priority needs to be changed is changed (step S1308).

  Next, it is determined whether or not there is a difference in priority (step S1310). If there is a difference in the priority order (step S1310: YES), it is set so that the work is performed from the lot with the higher priority order. Here, for a lot with high priority, the result is fixed without being affected by both the forward loop and the back loop. In other words, the lot with the highest priority is passed through the device first in any device, and the lot with the second highest priority is passed after the lot with the highest priority passes. It is set so as to pass through (th step S1312).

  If there is no difference in the priority order (step S1310: NO), the calculation is set to start from a lot randomly selected by the system (step S1314).

  Next, calculation is started (step S1316). That is, the calculation by the forward loop is performed.

  Next, it is determined whether or not there is a lot that exceeds the limiter operating time (step S1318).

  If there is a lot that exceeds the limiter operating time (step S1318: YES), an expected arrival time is forcibly set so as not to exceed the working time of the lot that exceeds the limiter operating time (step S1320). Here, with respect to a lot having a high priority, even if a lot having a lower priority than the own lot exceeds the limiter operating time, the result once calculated is not changed.

  If there is no lot exceeding the limiter operating time (step S1318: NO), the result is notified to the device object (step S1322).

  Next, a back loop calculation is performed (S1324).

  Next, it is examined whether there are lots overlapping at the same time (step S1326). In other words, if there are not multiple lots that pass through a single device at the same time, work on multiple lots has not been started on a single device at the same time, or another lot is Check if the device is ready to start work.

  If there are overlapping lots at the same time (step S1326: YES), processing for shifting the time of the overlapping lots, for example, the expected arrival time and the work start time is performed (step S1330). In this case, the time of the lot having the same priority or the lower lot is shifted from the own lot.

  On the other hand, if there is no lot overlapping at the same time (step S1326: NO), the result is notified to the device object (step S1328).

  Next, it returns to step S1316 and the calculation by a forward loop is performed. In this case, the calculation by the forward loop is performed based on the calculation result by the back loop performed in step S1324. In addition, when the time overlaps in the calculation by the back loop and the time is shifted, the adjustment is performed to match the time. Also, if the time does not overlap, check whether there is a blank time, for example, the time when the lot has arrived and the work is not started despite the fact that there is no lot being worked on in the equipment, and adjust in the same way To do. When the calculation by the forward loop is completed, it is checked whether there is a lot whose adjusted time exceeds the limiter operating time (step S1318), and the calculation by the back loop is performed.

  In the present embodiment, the case where the expected arrival time is notified to all the devices through which the lot passes after the completion of a certain process has been described. However, even when a new lot is inserted, the lot passes thereafter. All devices are notified of the expected arrival time.

  In the above-described embodiments, the process management system including three apparatuses has been described. However, even when three or more apparatuses are provided, the process management system can be realized by configuring similarly.

  Although the present invention has been described with reference to the preferred embodiments, the present invention is not limited to the specific embodiments described above, and various modifications and changes can be made within the scope described in the claims.

  The present invention can be applied to a process management system that optimizes each process.

It is explanatory drawing for demonstrating an optimization problem. It is a block diagram for demonstrating the process management system concerning a present Example. It is a block diagram for demonstrating the process management apparatus concerning a present Example. It is a block diagram for demonstrating the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is explanatory drawing for demonstrating operation | movement of the process management apparatus concerning a present Example. It is a block diagram for demonstrating the process management apparatus concerning a present Example. It is a flowchart for demonstrating operation | movement of the process management apparatus concerning a present Example.

Explanation of symbols

100 Factory 110, 120, 130 Device 200 Process management device 240, 250 Lot object

Claims (8)

A process management system for managing each process of a product manufactured through a plurality of processes,
End time detecting means for detecting the work end time of the device;
A priority determining means for determining the processing priority of each product;
A process management system comprising: arithmetic processing means for calculating a work start time in each device based on the work end time and the priority order. In the process management system according to claim 1,
The process processing system characterized in that the arithmetic processing means obtains a work time for each device and calculates a work start time in each device based on the work time. In the process management system according to claim 1 or 2,
The process management system characterized in that the arithmetic processing means calculates a work start time in each device based on the limiter when a work start time limiter is set for at least one device. A process management method for managing each process of a product manufactured through a plurality of processes,
Detecting a work end time of the device;
Determining the processing priority of each product;
And a step of calculating a work start time in each device based on the work end time and the priority order. In the process management method according to claim 4,
A process management method comprising: calculating a work time for each device and calculating a work start time in each device based on the work time. In the process management method according to claim 4 or 5,
A process management method comprising: calculating a work start time in each device based on the limiter when a work start time limiter is set for at least one device.   A process management program for causing a computer to execute the process management method according to claim 4. A computer-readable recording medium storing the process management program according to claim 7.

Images