JP2002297222A - Production management method and production management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a production management method and system capable of making an accurate production schedule in a short time, and predicting the term of delivery of a product suitable for reality. SOLUTION: At the time of preparing a production schedule by making each facility correspond to each process in a situation that a plurality of facilities and a plurality of orders are provided, and that at least one process is included in each order, time is advanced to a point of time when the process which is being processed by any facility ends, and a prescribed process is assigned to the facility whose processing ends by referring to a priority α to be calculated by referring to a priority accessory to the order, the term of delivery, the calculation execution date, and the total time of the unprocessed process, and discrete processing is performed to the process next to the process whose processing ends by selecting a prescribed facility by referring to the total time of the processing waiting processes of each facility from among the facility capable of processing the next process. Thus, the calculating time can be sharply shortened, and a production schedule whose satisfaction level is high can be prepared in response to all the orders.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a production management method and a production management system, and more particularly to a production management method and a production management system suitable for use in predicting a product delivery date in a high-mix low-volume production factory.

[0002]

2. Description of the Related Art When a plurality of products are produced using production equipment of a factory, the quantity and delivery date for each product type to be produced,
Various methods have been proposed for calculating a production schedule that minimizes the total cost based on a mathematical calculation method, on condition that equipment to be used, procurement of materials, distribution of personnel, and the like. In planning the above production schedule, in a factory that produces a large number of small varieties, the optimal solution can generally be obtained by sequentially allocating orders to vacant facilities, and the calculation is also processed by a simple algorithm. Calculation can be performed in a short time.

However, in a factory that performs high-mix low-volume production, there is a great difference in the delivery date of each order, the number of processing steps, the processing time, and the like. It is necessary to calculate in consideration of the delivery date and man-hours, the equipment to be used, the operation status of the equipment, and the like. Therefore, conventionally, when processing a large number of orders using a large number of equipment, all combinations are sequentially calculated using the equipment and the order as elements, and a method of selecting an optimal solution among them and a predetermined constant (See Japanese Patent Application Laid-Open No. 1-109060 and Japanese Patent Application Laid-Open No.
185351, JP-A-5-108649,
JP-A-5-108661, etc.).

[0004]

However, in the above-described conventional production management method, a solution can be obtained based on each algorithm, but a calculation is performed for all combinations of equipment and orders, or a predetermined value is determined. There is a problem that it takes time to perform a calculation to obtain a required solution because the map is developed at each time interval and the calculation is performed.

Further, according to the above calculation method, when it is necessary to re-create the production schedule, for example, when a new order is generated, when the delivery date of the order is changed, or when equipment is broken down, The calculations had to be recalculated from the beginning, and it was not possible to quickly respond to the ever-changing conditions at the production site.

Further, in the method of calculating all combinations and the method of developing a map, the calculation is often performed uniformly, and there is a gap between the optimal solution in calculation and the production plan considered by the site staff. There is also a problem that a great deal of system change is required to improve the calculation method to fill the gap.

[0007] The above-mentioned problem is particularly noticeable in a production mode in which a large number of various orders are present and a lot of sudden orders are provided, and a production management method and a production management system capable of providing a quick and appropriate production schedule are realized. Is desired.

The present invention has been made in view of the above problems, and a main object of the present invention is to provide a production management method capable of planning an accurate production schedule in a short time and predicting the actual delivery date of a product. And a production management system.

[0009]

In order to achieve the above object, the production management method of the present invention can process a plurality of orders requiring processing in one or more steps in a plurality of facilities. In the production management method of sequentially allocating to a plurality of facilities and creating a production schedule, for each of the plurality of facilities, a scheduled time at which predetermined processing is completed is calculated, and the calculation is performed until the earliest arrival time among the scheduled times. Advancing the above time, at that time, allocating a predetermined process to the facility for which the process has been completed with reference to a priority calculated in advance, and a process next to the process for which the process has been completed And sequentially executing a step of selecting predetermined equipment with reference to the processing time of the waiting step from among the equipment capable of processing the next step, and associating the plurality of orders with the equipment. Is performed.

The production management method of the present invention creates a production schedule by sequentially allocating a plurality of orders requiring processing in one or more processes to equipment capable of performing the processing among a plurality of equipment. In the production management method, a predetermined transition period is set in advance between a plurality of processes in the order, and for each of the plurality of facilities, a scheduled time at which a predetermined process ends or a scheduled time at which the transition period ends is calculated. Then, the calculation time is advanced to the earliest arrival time among the scheduled times, and at that time, a predetermined process is distributed to the equipment for which the processing has been completed with reference to a priority calculated in advance. Steps and, for the next step after the step in which the processing has been completed or the transition period has been completed, refer to the processing time of the step in the waiting state from among the equipment capable of performing the processing in the next step. Sequentially performing the step of selecting a predetermined facility, and performs correlation between the plurality of orders and the facilities.

[0011] In the present invention, the priority is at least a priority associated with the order, a delivery date specified in the order, a date and time when the calculation is performed, and a total time of the unprocessed steps of the order. The priority associated with the order may be A, the delivery date specified in the order may be T1, the date and time when the calculation is performed is T2, and a total for processing the unprocessed steps of the order. When the time is T3, the priority is preferably defined as A ÷ (T1−T2) × T3.

Further, in the present invention, the priorities of all the orders may be recalculated during the distribution process.

Further, in the present invention, the data of the production schedule created by the above method is converted into a plurality of files by encryption processing and division processing using a predetermined encryption method, and the converted plurality of files are converted. Alternatively, the data may be transmitted to a server connected via the Internet network, and the server may perform aggregating processing and decrypting processing of the plurality of files, and convert the plurality of files into a format that can be browsed by a browser.

Further, the production management system of the present invention creates a production schedule by sequentially allocating a plurality of orders requiring processing in one or more processes to facilities capable of performing the processing among a plurality of facilities. In the production management system, for each of the plurality of facilities, a means for calculating a scheduled time at which a predetermined process is completed, and a calculation time is advanced to the earliest time arriving from the scheduled time. Means for allocating a predetermined process to the equipment for which the processing has been completed, with reference to a priority calculated in advance;
At least means for selecting predetermined equipment with reference to the processing time of a waiting step from among equipment capable of performing the processing of the next step with respect to the next step of the step after the completion of the processing. Is the thing.

Further, the production management system of the present invention creates a production schedule by sequentially allocating a plurality of orders that require processing in one or more processes to equipment capable of performing the processing among a plurality of equipment. In the production management system, means for setting a predetermined transition period between a plurality of steps of the order, means for calculating a scheduled time at which a predetermined process ends or a predetermined transition period ends, and A calculation time is advanced to the earliest arrival time, and at that time, means for distributing a predetermined process to the facility for which the processing has been completed with reference to a previously calculated priority, and Means for selecting a predetermined equipment from the equipment that can perform the processing of the next step with reference to the processing time of the waiting step from the equipment that can perform the processing of the next step for the next step after the transition period has ended Those having Kutomo.

[0016] In the present invention, the production management system includes an arithmetic processing unit for executing at least the priority calculation and the distribution process, terminals installed in respective departments involved in product manufacturing, A host computer for managing and storing information, each of which is mutually connected via an in-house network, wherein order information input from the terminal and progress information relating to the order are stored in the host computer, and the host computer Is transmitted to the arithmetic processing unit at predetermined intervals to create a production schedule, and the production schedule is output to each of the terminals via the in-house network. it can.

In the present invention, the production management system is further installed in a proxy server connected via the in-house network, a web server connected via the Internet, and a company outside the company. And a terminal, wherein the data of the production schedule is converted into a plurality of files by an encryption process and a division process using a predetermined encryption method in the proxy server, and the plurality of converted files are transmitted through the Internet network. Is transmitted to the web server via the web server, the plurality of files are converted and converted into a format that can be browsed by a browser after the aggregation process and the decryption process are performed on the web server. The production schedule may be referred to.

Thus, the present invention defines a priority with reference to the priority associated with the order, the due date and the unprocessed time,
A process in which the process is advanced to a point in time at which processing is completed earliest among a plurality of facilities, and at that time, a process of assigning a predetermined process to the completed facility by referring to the priority, and a process in which the process is completed For the next process, the process of selecting the specified equipment by referring to the total processing time of the waiting process from among the equipment that can process the next process is repeated, thereby realizing a realistic production in a short time. A schedule can be created, and by considering a transition period between processes of each order, a more realistic production schedule can be created even when each equipment is scattered. it can.

[0019]

BEST MODE FOR CARRYING OUT THE INVENTION In a preferred embodiment of the production management method according to the present invention, there are provided a plurality of facilities (for example, facilities A to E) and a plurality of orders (for example, order X and order Y). Then, in a situation where one or more processes (for example, processes X1, X2, processes Y1, Y2) are included for each order, when creating a production schedule by associating each facility with each process, Advance the time until the end of the process being processed in any of the facilities, at which point the priority of the order, the delivery date, the date and time when the calculation is performed, and the unprocessed Priority calculated with reference to the total time (for example, priority α
= Priority associated with order ÷ (delivery date-date and time of execution of calculation) x total time of unprocessed process) By performing discrete processing of selecting predetermined equipment with reference to the total time of the processing waiting process of each equipment from among the equipment capable of performing the processing, the calculation time is significantly reduced, and Thus, a production schedule with a high degree of satisfaction can be created for all orders.

[0020]

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram showing an embodiment of the present invention;

[Embodiment 1] First, an algorithm in a production management method according to a first embodiment of the present invention will be described with reference to FIGS. FIG. 1 is a chart for explaining a sorting method using the algorithm of the present embodiment, and FIG. 2 is a flowchart showing the algorithm of the present embodiment.

First, a procedure for allocating equipment to a plurality of orders will be described with reference to FIG. In the following description, the order is assumed to be of two types, X and Y, and the order X is a process X1,
It is assumed that the order Y includes two steps of a step X2, and the order Y includes two steps of a step Y1 and a step Y2. Step X1
Is processed in either equipment A or B, step X2 is processed in either equipment C or D, and step Y1 is equipment A to C
, The process Y2 is performed by the equipment D. In the initial stage (t = 0), X1 of order X
It is assumed that the process is in facility B, and the process Y1 of order Y is in the queue of facility A waiting for processing. In addition, equipments A to D are operating, equipments A, B, and D have orders other than orders X and Y in a queue waiting to be processed, and equipment C has no other orders scheduled. I do. In the following description, the calculation time is skipped from time t0 at which the calculation is performed (t1 to t8), and what kind of processing is performed at each time point is shown.

That is, the algorithm of the present embodiment does not calculate at regular time intervals as in the conventional example, but the scheduled time (t1 to t) at which the processing of the facilities A to D ends.
It is characterized in that the distribution process is executed only in 8). Specifically, in the example of FIG. 1, the time point t1 at which the processing of the facility B ends is the earliest, so the calculation time is advanced to t1.

Then, at t1, it is checked whether or not there is a process in the queue of the facility B waiting for processing. Here, as previously defined, the queue for processing the facility B includes the process X1 of the order X and other processes (not shown). Therefore, the order is sorted to the facility B. As a condition for the determination, a priority calculated in advance at each time point is used as a reference. The priority can be, for example, the priority (eg, important product, important customer request, etc.) associated with the order, the delivery date, or the like as an index alone. In order to perform the above, the priority associated with the order ÷ (delivery date−the date and time of execution of the calculation) × the total processing time in the unprocessed process is used as the priority α.

By adopting such a priority α, not only the priority accompanying the order but also the product whose delivery time is imminent or the product whose processing time is long can be preferentially processed. As a whole, customer satisfaction can be increased as a whole. In this example, assuming that the priority of the order X is the highest, the process X1 of the order X is assigned at the time (t1) when the processing of the facility B ends as shown in the figure.

Thereafter, the calculation time is skipped until the next processing is completed. In this example, the time point (t2) at which the processing of the facility A ends is the earliest, so the calculation time is advanced to t2. At this stage, since the calculated period until the delivery date changes, the priority α of all the orders is recalculated, and similarly, the process in the queue of the facility A waiting for processing is checked. Here, as previously defined, the process Y1 of the order Y and other processes (not shown) are in the processing waiting queue, but if the priority of the process Y1 is the highest, the process Y1 is allocated to the facility A. become.

When the distribution process at t2 is completed, at the time (t3) when the process X1 of the facility B ends, the priorities of all the orders are recalculated, and then the distribution process is performed. Here, in the step X2 which is the next step of the step X1, any of the equipment C and the equipment D can be used, but since the equipment C and the equipment D are both being processed in other steps, the processing in the step X2 is immediately performed. Can't start. Therefore, the equipment is placed in the queue waiting to be processed by any one of the facilities. At that time, which equipment is to be allocated is determined by taking into account the number of processes waiting to be processed by each facility and the total processing time, etc. It is preferable to determine it. In this example, since the facility D has a process waiting process as defined in advance, the process X2 is put in the process C queue of the device C.

Thereafter, the calculation time is advanced until the next processing (t4) is completed in any of the facilities, and the priority α of all the orders is recalculated. Here, at time t4, facility C
And the processing of the equipment D is completed. However, since only the processing X2 is in the processing waiting queue in the equipment C, the processing X2 is sorted, and the processing of another order (not shown) is processed in the equipment D as defined in advance. Since it is in the waiting queue, the process is distributed.

Next, the calculation time is advanced until a time (t5) at which one of the facilities ends the next processing, and the priority α of all the orders is recalculated. Then, at step t5, the process Y2
Since the facility D capable of performing the process Y2 is in the process of another process, the process Y2 is put in a queue waiting for the process of the facility D. Then, at the time when the processing of the other process in the facility D is completed at t6, the facility Y performs the process Y2.
Is started, and equipment allocation processing is executed for each step of order X and order Y.

The above series of steps will be described with reference to a flowchart shown in FIG. That is, step S1
In step 01, the calculation time is advanced until the processing ends in all the facilities for the first time, and in step S102,
The priority α at that time is calculated from the priority attached to the order, the delivery date, the date and time when the calculation is executed, and the total time of the unprocessed process. Then, in step S103, orders waiting to be processed are allocated to the equipment whose processing has been completed, based on the priority α, and the next process of the order whose processing has been completed in one step is placed in the processing waiting queue of the equipment. And step S
At 104, it is determined whether or not the processing of all the orders has been completed, and if there are any remaining orders, the process returns to step S101, and the calculation is performed in the same procedure until the distribution of all the steps is completed.

As described above, the priority α is defined with reference to the priority associated with the product, the delivery date, the date and time at which the calculation is executed, and the unprocessed time, and the time at which the processing ends at the earliest among a plurality of facilities. Advance the calculation time up to that point, and at that point, sort the process with reference to the priority α for the equipment that has completed processing,
An operation of placing the next process of an order after the process of one process is completed in a queue of a predetermined facility for processing, and then advancing the calculation time until the next processing end time to recalculate the priority α of the order. , A realistic production plan can be drafted in a short time.

That is, in this embodiment, since the processing is performed discretely only at the time when the processing of each facility is completed, a method of calculating an optimum solution by calculating all combinations or a method of calculating an optimum solution at every predetermined time interval The calculation time can be remarkably shortened as compared with the method of calculating by expanding the map. In addition, in order to make a sorting decision based on the priority α taking into account the delivery date and unprocessed time as well as the priority attached to the order,
A more realistic schedule can be created.

In this embodiment, the case where two orders and four facilities are used has been described for ease of explanation. However, the present invention is not limited to the above embodiment, and the number of Obviously, the number of steps in each order, the equipment used in each step, the number of equipment, and the like can be arbitrarily set. In addition, as the priority α, it is possible to define not only the priority, delivery date and unprocessed time associated with the product, but also other factors, such as the number of steps required for processing each order. , Can be appropriately defined according to the production mode.

[Second Embodiment] Next, an algorithm in a production management method according to a second embodiment of the present invention will be described with reference to FIGS. FIG. 3 is a chart for explaining a sorting method using the algorithm of the present embodiment, and FIG. 4 is a flowchart showing the algorithm of the present embodiment. The second embodiment is characterized in that a transition period is taken into consideration when moving to the next step, and the configuration of other parts is the same as that of the first embodiment.

First, a procedure for distributing equipment to a plurality of orders will be described with reference to FIG. In the following description, as in the first embodiment described above, the order is of two types, X and Y, the order X is composed of two steps, step X1 and step X2, and the order Y is the step Y1 and step Y2. It is assumed that there are two steps. Further, the process X1 is processed in any of the facilities A and B, the process X2 is processed in any of the facilities C and D, and the process Y1 is performed in any of the facilities A to C and the process Y2.
Is to be processed in equipment D. In addition, for each process, the transition time (x1, x2,
y1) is set, and a virtual facility P for processing the transition time for convenience is provided. In the initial stage (t = 0)
It is assumed that the X1 process of the order X is in the facility B and the Y1 process of the order Y is in the queue of the facility A for processing.
Assume that orders other than orders X and Y are queued for processing in equipments A, B, and D, and no other order is scheduled for equipment C.

In the same manner as in the first embodiment, the time when the process ends for all the facilities is calculated first. FIG.
In the example, the time point t1 at which the processing of the facility B ends is the earliest, so the calculation time is advanced to t1. And
At time t1, the priority α is set in the same manner as in the above-described embodiment.
Is calculated, it is checked whether or not there is a process in a queue of the facility B waiting for processing. In this example, as previously defined, the process X1 of the order X and other processes (not shown) are in the queue waiting for the processing of the equipment B, and if the priority of the processing X1 is the highest, the processing of the equipment B ends. Time (t
In step 1), the process X1 of the order X is allocated to the equipment B.

Thereafter, the calculation time is skipped until the next processing is completed. In this example, since the time (t2) at which the processing of the facility A ends is the earliest, the time is advanced to t2. Then, after recalculating the priority α of all the orders, the process in the queue of the equipment A waiting for processing is checked. Here, as previously defined, the process Y1 of the order Y and other processes are in a queue waiting to be processed.
If the priority of the order Y is the highest,
1 is sorted.

When the processing at t2 is completed, the calculation time is skipped until the next processing is completed, and the priority α of all orders is recalculated. In this example, at time t3, facility C
And the processing of D is completed. However, since there is no process in the queue waiting for processing in the facility C, the process is put into a waiting state, and the process of another order is placed in the queue waiting for processing in the facility D as defined in advance. Since it is included, the processing of that step is started.

Next, at the time (t4) when the process X1 of the facility B is completed, the process X2, which is the next process of the order X, is allocated. In this embodiment, a more realistic production schedule is created. First, the transition time between processes is taken into account. That is, each facility is not necessarily installed at a place close to each other, and may be installed at a remote site or a building. Therefore, a time x1 required for shifting from the process X1 to the process X2 is set, and the process X1 is set.
Is completed, the next process X2 is not immediately started during the transition period of x1, and the process X2 is placed in a queue waiting for processing of either the facility C or the facility D. It is preferable that the determination be made in consideration of the number of processes waiting to be processed by each facility and the total processing time. In this example, since the equipment D has a process waiting to be processed, the process X
2 is placed in a queue of the facility C waiting for processing. And
At the time t5 when the transition period x1 ends, the process of the process X2 is started in the facility C.

Similarly, the process skips until the time when the processing is next finished in any of the facilities or the time when the transition period ends (t6), and recalculates the priority α of all the orders. At t6, similarly, during the transition period y1, the next process Y2 is not immediately processed, and the process Y2 is put in the processing D queue of the equipment D. Then, at the time t7, the processing of the other process in the facility D ends, but in the process Y2, since the transition period y1 has not ended, the process of the process Y2 does not start here, and t8 after the end of the transition period. , The process of the process Y2 is started, and the process of allocating the equipment to each process of the order X and the order Y is executed.

The above series of steps will be described with reference to a flowchart shown in FIG. That is, step S2
In 01, the time axis is advanced to a point in time when the processing is first completed in all the equipments or a point in time when the transition period between processes is completed,
In step S202, the priority α at that time is calculated from the priority associated with the order, the delivery date, the date and time when the calculation is performed, and the total time of the unprocessed process. The orders waiting to be processed are sorted on the basis of the priority α, and the next step of the order for which the processing of one step has been completed or the transition period has been completed is placed in the processing waiting queue of the equipment. Then, in step S204,
It is determined whether or not the processing of all the orders has been completed. If there are any remaining orders, the process returns to step S201, and the calculation is performed by the same procedure until the distribution of all the steps is completed.

As described above, according to the algorithm in the production management method of this embodiment, in addition to the effects of the above-described first embodiment, by taking into account the transition period between the steps of each order, Even if it is better to provide a certain storage period before moving on to the next process, etc.
A realistic production schedule can be formulated in a short time.

Third Embodiment Next, a production management system using a production management algorithm according to a third embodiment of the present invention will be described with reference to FIGS. FIG.
FIG. 6 is a diagram illustrating an outline of the entire production management system according to the present embodiment, and FIG. 6 is a diagram illustrating a configuration in a delivery date prediction system that executes an algorithm according to the present embodiment.

As shown in FIG. 5, the production management system 1 according to the present embodiment has terminals 6 of respective departments such as a production management department, a manufacturing department, and a design department via a network such as an in-house LAN 7.
Are connected to each other, and progress information of the manufacturing department, the design department, and the like are collected at the terminal 6 of the production management department, and are managed and stored by the host computer 5. Then, the progress information file is periodically downloaded from the host computer 5 to the database 4, and the information is sent to the delivery date prediction machine 3 that executes the production management algorithm shown in the first and second embodiments. In addition, the delivery date forecasting system 2 collects progress information on progress information related to drafting of the design department that is difficult to manage by the host computer 5.

As shown in FIG. 6, the delivery date prediction system 2 comprises, for example, a progress data management system 8, a delivery date calculation system 9, and an EUC environment maintenance 10, and the progress data management system 8 The system includes a manufacturing progress data management subsystem 8a for managing, a design progress data management subsystem 8b for managing the progress of drafting work, and a drawing classification subsystem 8c for specifying a machining route. Basic data subsystem 9a that prepares basic data such as processing route and processing time
And a feedback subsystem 9b for extracting basic data from actual results, and a simulation subsystem 9c for calculating a delivery date. In the EUC environment maintenance 10, an environment using the progress data stored in the progress data management system 8 is improved.

The operation of the production management system 1 having the above configuration will be described below. First, when an order is received from a customer,
The order is sent to the production management department, and after predetermined items related to the order are registered, a production instruction is issued. At this time, if the order is a new product, it is necessary to create a drawing, so a command is passed to the design department, and the created drawing is returned to the production management department. This series of drawing creation work is managed by the design progress data management subsystem 8b. Then, the production management section assigns a drawing number to the new drawing, and classifies the drawing using the drawing classification subsystem 8c.

Next, a manufacturing instruction is issued to the manufacturing department based on the drawings classified by the drawing classification subsystem 8c. In the manufacturing department receiving the instruction, the terminal 6 is used to input predetermined items. Here, the basic data of the order can be performed using, for example, a barcode, and it is convenient for the user if the process name, the name of the equipment used, the command number, and the like are automatically input. In addition, the processing start time, end time, processing quantity, and the like in each process are directly input by a worker in the manufacturing department.

The delivery date is calculated in the delivery date calculation system 9 based on the input data. Specifically, the basic data includes product classification information from the drawing classification subsystem 8c, actual data for each drawing number from the feedback subsystem 9b, in-process command data from the progress data subsystems 8a and 8b, accounted command data, and the like. After being collected by the subsystem 9a and inputting and correcting various information through the interface screen, the information is sent to the simulation subsystem 9c.

The data to be input to the basic data subsystem 9a include, for example, data defining processes and equipment, factory calendar data, equipment calendar data, processing time data, processing route data, and the like. Here, as for the processing time and the processing route, for those manufactured once, since those data are stored in the host computer 5 corresponding to the drawing numbers, the data can be used, and First, a machining route, a used facility, and a machining time are given according to the classification number assigned by the drawing classification subsystem 8c. It should be noted that the processing route and the processing time need to be constantly updated to reflect the performance information because the information defined in advance may become obsolete.

Then, the delivery date is calculated in the simulation subsystem 9c based on the above data. The specific method is as described in the first and second embodiments, but the basic data subsystem 9
With reference to the information (equipment processing capacity, operation status, etc.) regarding the equipment stored in a, the information regarding the order (delivery date, required process, etc.) and the priority α, the processing end time of each equipment for all orders, At the end of the transition period, the equipment and the order are discretely associated with each other. For example, if the number of in-process commands is 3
000, 60 equipments, 5 average steps for each order
According to the production management system 1 of the present embodiment, when the delivery date is calculated for a period of 3 to 6 months, the calculation can be performed in about 30 seconds.

Thereafter, the simulation result is transmitted to each terminal 6.
The output is performed in a Gantt chart format or the like, and the product is manufactured based on the output result. If there is a difference between the simulation result and the actual result, the data input method, the simulation method, and the basic data are corrected, and the system is updated.

As described above, according to the production management system 1 of the present embodiment, after the progress information of each department is collected by the production management department, it is managed and stored in the host computer 5. The progress information is obtained from the host computer 5 at a frequency of, and the delivery date is predicted in a short time by discretely allocating each equipment to each order by referring to the equipment information and the priority α etc. which are input in advance. Can be output. Therefore, the process management department can accurately grasp the progress of each department, and the manufacturing department can perform production under a schedule that quickly responds to changes in the production status.

[Fourth Embodiment] Next, a production management system using a production management algorithm according to a fourth embodiment of the present invention will be described with reference to FIGS. FIG.
FIG. 8 is a diagram illustrating an outline of the entire production management system according to the present embodiment, and FIG. 8 is a diagram schematically illustrating a processing flow in the production management system. This embodiment is similar to the third embodiment.
This describes a system that allows the production plan calculated by the system of the third embodiment to be viewed while maintaining security at an outsourcing factory.

As shown in FIG. 7, the production management system 1 according to the present embodiment includes terminals 6 of respective departments such as a production management department, a manufacturing department, and a design department via a network such as an in-house LAN 7.
And the proxy server 12 are connected to each other. Also, the proxy server 12 via the Internet network 18
And a web server 14 and a terminal 15 of an outsourcing factory are connected.

First, a user on the ordering side drafts a production schedule according to the procedure shown in the third embodiment. Then, the production management data is transmitted to the proxy server 12 connected via the in-house LAN 7 (FIG. 8). Next, the proxy server 12 connects to the Internet 18 via the router 13 and transmits the production plan data to the web server 14 (FIG. 8). At this time, the client program receives the success or failure of the transmission from the web server 14, and resends the transmission if the transmission fails. Also, proxy server 1
2 sends a decryption request to the web server 14 after the data transmission is completed.

When data is transmitted, the data is not transmitted as it is in order to secure the confidentiality of the data, but rather is transmitted using a predetermined encryption technology (for example, Advanced Encryptio).
n Serpen ranked second in Standard Development Effort
The method is characterized in that the data is encrypted using t), and the data is further divided into files of a predetermined size and transmitted. Also, at the time of data transmission, it is preferable to attach management information such as the number of divided files and the file ID in addition to the file to be attached.

On the other hand, when the web server 14 receives the encrypted and divided files, it refers to the management information such as the number of divided files and the file ID to consolidate and decrypt the files and restore the original production management data. After that, the data is converted into an HTML format that can be browsed by a browser.

The web browser of the terminal 15 of the outsourcing factory accesses the URL specified in advance using SSL or the like, and logs in using the user name and password registered in advance, so that the web browser of the terminal 15 on the outsourcing side. Browse production management data created by the ordering user with a browser,
Alternatively, it can be downloaded (FIG. 8).

As described above, according to the production management system 1 of the present embodiment, the production management data created by the ordering user is encrypted and divided by the proxy server 12 and then transmitted to the web server 14. Then, the data is aggregated and decrypted on the web server 14, converted into a format that can be browsed by the browser, and the user of the outsourcing factory registered in advance as the ordering user browses and downloads the production management data via the Internet network. Thereby, the user of the outsourcing factory can also acquire the production schedule while maintaining confidentiality, and smooth production can be realized even when the production of the product includes the processing in the outsourcing factory.

In the above configuration, on the ordering user side, the function of automatically transmitting the production plan data, the function of confirming the history of the transmitted data, and the inability of anyone other than the transmission destination user to refer to the transmission data are prohibited. It is preferable to have a function and a function to confirm that the receiving user has received the transmission data.When the data is transmitted from the ordering side, the outsourcing factory side user is notified by e-mail to the person in charge of the transmission. It is preferable to have a function of confirming the transmission history of transmission data, a function of notifying that transmission data has been referenced, and the like.

[0061]

As described above, according to the production management method and the production management system of the present invention, the following effects can be obtained.

The first effect of the present invention is that the priority α is defined with reference to the priority, delivery date, and unprocessed time associated with the product, and until the point at which the processing ends at the earliest among a plurality of facilities. Advance the calculation time, recalculate the priority α at that time, sort the order with reference to the recalculated priority α for the equipment for which processing has been completed, or complete one processing By performing the discrete processing of repeating the operation of placing the next process of the order in the processing waiting queue of the predetermined equipment, a realistic production schedule can be drafted in a short time.

The second effect of the present invention is that, in addition to the above-described configuration, by considering the transition period between the steps of each order, even when each facility is scattered, etc. This means that a production schedule can be formulated that is in line with it.

A third effect of the present invention is that the progress information of each department is managed and stored in the host computer, and in the delivery date prediction system, the progress information is obtained from the host computer at a predetermined frequency and input in advance. Equipment information and priority α
By discretely performing the sorting process for each equipment and each order with reference to the etc., it is possible to output a delivery forecast in a short time, and the process management department can accurately grasp the progress of each department. This makes it possible for the manufacturing department to carry out production on a schedule that quickly responds to changes in the production situation.

A fourth effect of the present invention is that the production management data created by the ordering user is encrypted and divided by the proxy server, and then transmitted to the web server.
Aggregated and decrypted on the eb server, converted to a format that can be browsed by the browser, and concealed by users of the outsourcing factory registered in advance as the ordering user who browse and download the production schedule via the Internet network. That is, the user of the outsourcing factory can also acquire the production schedule while maintaining the property, and smooth production can be realized even when the production of the product includes the processing in the outsourcing factory.

[Brief description of the drawings]

FIG. 1 is a chart for explaining a production management algorithm according to a first embodiment of the present invention.

FIG. 2 is a flowchart illustrating a calculation procedure of a production management algorithm according to the first embodiment of the present invention.

FIG. 3 is a chart for explaining a production management algorithm according to a second embodiment of the present invention.

FIG. 4 is a flowchart illustrating a calculation procedure of a production management algorithm according to a second embodiment of the present invention.

FIG. 5 is a diagram illustrating an outline of an entire production management system according to a third embodiment of the present invention.

FIG. 6 is a diagram showing a configuration in a delivery date prediction system that executes an algorithm of a production management system according to a third embodiment of the present invention.

FIG. 7 is a diagram illustrating an outline of an entire production management system according to a fourth embodiment of the present invention.

FIG. 8 is a diagram schematically illustrating a processing flow in a production management system according to a fourth embodiment of the present invention.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Production management system 2 Delivery time forecasting system 3 Delivery time forecasting machine 4 Database 5 Host computer 6 Terminal 7 In-house LAN 8 Progress data management system 8a Manufacturing progress data management subsystem 8b Design progress data management subsystem 8c Drawing classification subsystem 9 Delivery time calculation System 9a Basic data subsystem 9b Feedback subsystem 9c Simulation subsystem 10 EUC environment maintenance 11 Printer 12 Proxy server 12 13 Router 14 Web server 15 Outsourced factory terminal 16 Dial-up 17 Printer 18 Internet network

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Yasushi Ishiyama 1-3-25 Koishikawa, Bunkyo-ku, Tokyo Daikoku Building Mitsubishi Materials Corporation System Business Center (72) Inventor Hiroshi Murakami 1-3 Koishikawa, Bunkyo-ku, Tokyo -25 Daikoku Building Mitsubishi Materials Corporation System Business Center (72) Inventor Masahiro Kuga 1-5-1 Otemachi 1-chome, Chiyoda-ku, Tokyo F-term (reference) 3C100 AA01 AA23 BB03 BB14

Claims (13)

[Claims] 1. A production management method for creating a production schedule by sequentially allocating a plurality of orders requiring processing in one or more processes to equipment capable of performing the processing among a plurality of equipment. For each of the facilities, calculate the scheduled time at which the predetermined process is to be completed, advance the calculation time to the earliest time at which the scheduled time is reached, and at that time, for the facility at which the process has been completed. A step of allocating a predetermined process with reference to a priority calculated in advance, and, for a process next to the process in which the process has been completed, waiting in a facility capable of processing the next process. A step of sequentially selecting predetermined equipment with reference to a processing time of a process, and associating the plurality of orders with the equipment. 2. A production management method for creating a production schedule by sequentially allocating a plurality of orders requiring processing in one or more processes to equipment capable of performing the processing among a plurality of equipment, wherein: A predetermined transition period is set in advance between a plurality of processes, and for each of the plurality of facilities, a scheduled time at which predetermined processing ends or a scheduled time at which the transition period ends is calculated,
Advancing the calculated time to the earliest arrival time among the scheduled times, and at that time, allocating a predetermined process to the equipment for which the processing has been completed with reference to a previously calculated priority; And, for the next step of the step where the processing is completed or the transition period is completed, predetermined equipment is referred to from among the equipment capable of performing the processing of the next step with reference to the processing time of the step in the waiting state. A step of sequentially executing the selecting step and associating the plurality of orders with the equipment. 3. The priority is determined by referring to at least a priority associated with the order, a delivery date specified in the order, a date and time when a calculation is performed, and a total time of unprocessed steps of the order. The production management method according to claim 1, wherein the production management method is determined. 4. A case where the priority associated with the order is A, the delivery date specified in the order is T1, the date and time when the calculation is performed is T2, and the total time for processing the unprocessed steps of the order is T3. 4. The production management method according to claim 3, wherein the priority is defined by A ÷ (T1−T2) × T3. 5. The method according to claim 3, wherein the priority of all the orders is recalculated during the distribution process.
Or the production management method according to 4. 6. The production schedule data created by the method according to claim 1 is converted into a plurality of files by encryption processing and division processing using a predetermined encryption method. Transmitting the plurality of files to a server connected via the Internet network, and performing an aggregation process and a decryption process on the plurality of files in the server to convert the plurality of files into a format that can be browsed by a browser. Production control method. 7. A production management system for sequentially allocating a plurality of orders requiring processing in one or more processes to equipment capable of performing the processing among a plurality of equipment and creating a production schedule, wherein: Means for calculating a scheduled time at which a predetermined process is to be completed for each of the facilities; and a calculation time advance to the earliest time at which the scheduled process is completed, and at the time, the facility at which the process is completed. Means for allocating a predetermined process with reference to a priority calculated in advance, and waiting for a process next to the process in which the process has been completed from equipment capable of processing the next process. Means for selecting predetermined equipment with reference to the processing time of the step (a). 8. A production management system for sequentially allocating a plurality of orders requiring processing in one or more processes to a facility capable of performing the processing among a plurality of facilities and creating a production schedule, wherein: Means for setting a predetermined transition period between a plurality of processes; means for calculating a scheduled time at which a predetermined process ends or a predetermined transition period ends; Means for allocating a predetermined process to the facility for which the process has been completed at the time by referring to a priority calculated in advance, and the process in which the process has been completed or the transition period has been completed. Means for selecting predetermined equipment with reference to the processing time of the waiting step from among the equipment capable of processing the next step for the next step. Management system. 9. The method according to claim 1, wherein the priority refers to at least a priority associated with the order, a delivery date determined by the order, a date and time when a calculation is performed, and a total time of unprocessed steps of the order. The production management system according to claim 7, wherein the production management system is determined. 10. The priority associated with the order is A, the delivery date specified in the order is T1, the date and time when the calculation is performed is T2,
10. The production management system according to claim 9, wherein when the total time for processing the unprocessed steps of the order is T3, the priority is defined by A ÷ (T1−T2) × T3. . 11. The production management system according to claim 9, wherein the priority of all the orders is recalculated during the distribution process. 12. The production management system manages at least an arithmetic processing unit for executing the priority calculation and the distribution process, terminals installed in respective departments involved in product manufacturing, and information on the terminals. , And a host computer for storing the information, each of which is connected to each other via an in-house network, wherein the order information input from the terminal and the progress information regarding the order are stored in the host computer, and stored in the host computer. 8. The method according to claim 7, wherein the information is transmitted to the arithmetic processing unit at predetermined intervals to create a production schedule, and the production schedule is output to each of the terminals via the in-house network. 12. The production management method according to any one of claims 11 to 11. 13. The production management system further includes a proxy server connected through the in-house network, a web server connected through the Internet, and a terminal installed in an outside company. The data of the production schedule is converted into a plurality of files by the proxy server in an encryption process and a division process using a predetermined encryption method, and the converted files are transferred to the web server via an Internet network.
b, the files are aggregated and decrypted by the web server, and then converted into a format that can be browsed by a browser. 13. The production management system according to claim 12, which is referred to.