JPH0744610A - Load calculating method in production control system - Google Patents

Abstract

PURPOSE:To speed up a calculation by generating a sum-set processing possible area, calculating the processing capacity of the area and evading a combination explosion. CONSTITUTION:By an input file generation program 501, five input files of order information 502, the spare time information 503 of resource every process, information 504 on processing possible combination relation and processing capacity every process, process information 505 on all the processes to be objects and time information 506 are generated. If necessary, the consolidation of order's and a lot division are performed as initial setting processings 510, next, whether excessive load is generated or not is checked when a processing is performed by a single order 511, and next, a load calculation where the competition between orders is taken into consideration is performed 512. A user can semi- automatically perform the adjustment of excessive load through the interaction with a system by delaying the date of delivery by selecting an order from a displayed range, setting a holiday work and an overtime work, etc., and performing a manual allocation.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a load calculation method in a production management system.

[0002]

2. Description of the Related Art A production management system in the manufacturing industry generally comprises order management, material arrangement, progress management, inventory management, production planning, etc., as shown in FIG.
The production plan is roughly divided into large schedule plan, medium schedule plan and small schedule plan.

The load calculation in the large-scale schedule is shown in FIG.
As shown in (b), it is performed by the production management department for a period of a few months to one year, and the purpose is to roughly balance the processing capacity of resources such as machinery and equipment and the load of receiving orders. Therefore, the load is generally adjusted by a method such as pile-up or landslide. The large-medium schedule load calculation is performed in consideration of both the estimated production amount and the actual received order amount in consideration of factors such as seasonal fluctuations, in which case a delivery date reply is given to a new received order. A small schedule plan is made at each production site (factory) based on this large and medium schedule plan.

The following are related to this type of technology.

(1) "Production control" Mitsuru Kuroda, Tsutomu Tabe, Takao Enagawa, Jinichiro Nakane; Asakura Shoten; 1989; P2
1-P34 (2) "Basics of production control" Hayashi Taro Muramatsu; Kunigen Shobo; published in 1979; P281-P285

[0006]

As shown in FIG. 2, in most production sites, resources such as mechanical equipment, workers, jigs and tools are neither completely general purpose nor completely single function, and the degree of freedom is halfway. There is, so to speak, semi-generic. This semi-universality or half-way substitutability exists not only in the relationship between orders and resources, but also in the combination between resources such as machines and jigs, and which combination of resources determines which order is processed. Only then will the processing capacity be fixed. In other words, it is impossible to statically grasp the processing capacity in advance.

However, it is not possible to investigate all allocation cases. In FIG. 2, the horizontal axis indicates the date, the vertical axis indicates each machine number, and each rectangle means a region (processable region) in which an individual order can be processed. For example, order C can be processed by three machines from No. 2 to No. 4, with a delivery date of 11 days and a possible start date of 4 days.

Although it can be processed by No. 2 to No. 4,
The processing power of each machine may be different,
Even if we consider only Unit 2, there are many combinations of workers and jigs required, and processing capacity may differ depending on that. The delivery date is the latest end date of this process, each process has such an end date, and workers and jigs also have such an end date. In this way, the processable areas of several orders overlap, and it becomes difficult to judge at a glance whether or not all the orders can be processed.

However, at the head office / production management department that makes the large and medium-sized schedule, the processing capacity of the production site is as shown in FIG.
In Factory A, product X has a maximum monthly production of 10,000, product Y has a maximum monthly production of 50,000, and B has a rough understanding of what. This value is accurate if the production resources are completely general purpose and have the same processing power, or if they are completely monofunctional. The vertical axis in FIG. 3 represents the processing capacity, but the processing capacity corresponding to the region in which the order A can be processed is represented by the volume of the rectangular parallelepiped shown by the diagonal lines and is determined before the allocation. The overlap of the processable areas is only in the dimension of the date, and since it is only necessary to check whether or not the number of workers and jigs is complete, there is a big gap in grasping the processing capacity performed by the head office management department. Absent. However, in understanding such processing capacity,
In the case of the semi-general resource as described above, the height in the vertical axis direction is uncertain, and thus accuracy is lacking. In this way, since the load calculation in the conventional large schedule planning is rough, fluctuation exceeding the load leveling capacity at the production site is imposed, and an accurate initial response to a new order may not be given, If you think that you may be working overtime on leave, you may have a situation in which you spend only a few free days and make only inventories.

[0010]

[Means for Solving the Problems] Means for solving the above problems will be described. (1) The two-dimensional area of the resource axis and time axis formed by the group of resources that can process the work and the period from the start date to the delivery date is defined as the "processable area", and there are multiple overlapping "parts". Prepare an algorithm that holds the total area of "processable area" as "union processable area".

(2) Prepare an algorithm for obtaining the processing capacity of these areas so that the required maximum capacity is always exhibited.

(3) An algorithm for forming a "unset processable region" in order from the partially overlapping "processable region" and calculating whether or not the region is overloaded is prepared.

(4) If the "unset processable area" superimposed in (3) has less residual processing capacity than either or both of the two "processable areas" of its constituent elements, Prepare an algorithm to delete the "processable area" of many components.

(5) An algorithm for deleting the "unset processable area" generated in the past by using the "processable area" deleted in (3) as a constituent element is prepared.

(6) An algorithm capable of designating the order of superimposing in (3) (the amount of remaining processing capacity, the number of processable areas included, etc.) is prepared.

(7) When the load factor of the union processable region overlapped in (3) is very small, only the "unset processable region" is left, and the two "processable regions" of its constituent elements are left. Prepare the algorithm to be deleted.

(8) In (3), the shapes of the two "processable areas" are held as a compressed bit pattern.

(9) An algorithm for displaying these "union processable areas" as a "load factor contour map" on the two-dimensional resource axis and time axis is prepared. It is displayed by being painted in a color corresponding to the corresponding load factor, so that information corresponding to when the height of the load factor is viewed from directly above can be obtained.

(10) In the lot allocating method, the "processable areas" that partially overlap each other are overlapped to obtain the maximum "unset processable period", which is used as the outer frame of the stuffing puzzle, and all lots are placed in this. When attempting to allocate, prepare two steps.

In this method, in the first stage, the number of lots that can be allocated is small, with the highest priority being given to avoiding the allocation where there is a high load factor.
Allocation is performed in order from the "resource period" (may be scattered here and there on an island), and the allocation direction (either left-justified or right-justified) in one "resource period" is generally "resource" on that resource. If the number of lots that can be allocated during the period is regarded as high, the direction is to increase the gradient so that the smallest possible free time is not left.

If there is no place to allocate in the first stage, or if all can be allocated but there is a lot of vacant space as a whole, the second stage is simply to move the lot at that time to the best possible resource. Allocate resources in ascending order of the number of lots that can be allocated and the processing capacity of continuous free time.

[0022]

[Action]

(1) In the volume method, each work of input data is the above means (1)
Is generated in each "processable period" and whether or not it is overloaded is calculated.

(2) After that, the "union processable area" is successively generated by the above means (1), and it is calculated whether or not there is an excessive load. At that time, the processing capacity of the area is calculated by the means (2), the combination explosion is avoided by the means (3) to (7), and the calculation is speeded up by the means (8).

(3) In the lot allocation system, the above means (1
The load is calculated by 0).

[0025]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

4 to 6 are views showing the outline of the processing of this embodiment. This system (500) uses the input file generation program (501) to order information (502), resource free time information for each process (503), processable combination relationship and processing capacity information (504) for each process. , Five input files of process information (505) of all target processes and time information (506) are generated.

First, if necessary, an order merger (with the same process, the same resource, and the same delivery date) or lot division is performed as an initial setting process (510). Then, when the order is processed alone, no excessive load occurs. Check (511),
Next, load calculation is performed considering the competition between orders (51
2). If there is a set that is overloaded due to competition in a certain process, a screen as shown in Fig. 17 is displayed for each set, and the user selects an order from the displayed range to postpone the delivery date, Overload adjustments can be made semi-automatically through dialogue with the system by setting leave, overtime, etc., or by manual assignment (506). In some cases, if there is a resource period in which the load factor is too low, it is possible to perform a simulation in which the resource is stopped for a certain period.

After the overload is eliminated, the result is a file related to processing capacity such as order delivery date change (507) and resource overtime leave (508) and load factor information file (509) for each day.
Is output and can be used for delivery date reply, or handed over to the on-site small schedule planning.

FIG. 10 shows the data structure of the process information (505) file. The process names appearing in the two-dimensional matrix in Fig. 10 are a list of all process names of all target products (orders). In the case of "*" mark (63), the vertical process (61) to the horizontal process It indicates that there is a product whose processing proceeds to step (62). A "-" sign indicates that there is no such product. In other words, it does not mean that all products or orders pass through all these processes, but shows the result of superimposing process passing information of individual products. When there are two products that pass through the process shown in (71) of FIG. 11, they are expressed as shown in table (72).

When there are repeated steps A and B (81) as shown in FIG. 12, the same step is registered with different names as shown in table (82). If there are no repeated steps in the same product, but there are products that have A->B-> C and products that have C->B-> A depending on the product, they are expressed in the same manner as in FIG. Even if different products go through the same process, but it is difficult to express them in one arrow diagram because the order is reversed or the merge and branch patterns are different (91), as shown in table (92) of FIG. Express. However, if the process that includes these iterations is the target, in the resource file described later,
It is necessary to specify which resource is the same as the resource of which process.

FIG. 14 shows the data structure of the order information (502) file. The order information (502) file contains the order code (101), processing start date (102), delivery date, passing process (1
03), delivery date (104) for each process, priority (105), etc., priority is express goods, important goods, ordinary goods, planned production
Indicates the importance of the order such as (stock item). The passing process (104) corresponds to the order of appearance in the process information file.

FIG. 15 is a diagram showing the data structure of the resource free time information (503) file. In the figure, the process name (111) for each process, the resource type (112), the usage priority (114) for each resource (113), and the ratio of available time for each unit period (115) such as each day (116) shows. A usable time ratio (116) of 0.0-1.0 indicates that the user can work in all time zones of the day (unit period).

FIG. 16 is a diagram showing the data structure of the processing capacity information (504) file. This file is the data for each process of the combination relation between the order and the resources necessary for the processing and the processing capacity in that case, for example, o5: [m01]: [h00 h01]: [t01 t02]: 200 Is a machine of m01 and a worker of h00 or h01 and t01 or
It shows that with the tool of t02, the order of o5 can be produced at the rate of 200 pieces / direct.

The time information (506) lists the names of calculation target periods including the peripheral periods. List up more holidays. In this example, the unit is "day", but the name can be anything as long as it is unique.

The output files are listed below.

(1) Processable period file: The earliest and latest possible start time and end time are output for each order.

(2) Lot allocation result file (3) Load factor information (509) file: Daily load factor information of the main resource.

(4) Delivery date change information (507) file: As a result of adjusting the load factor, if there is an order for which delivery date has been postponed, that information is output.

(5) Holiday attendance information (508) file: When the holiday attendance is set as a result of the adjustment of the load factor, such information is output.

(6) Overtime information file: When overtime is set as a result of adjusting the load factor, the information is output.

The flow of processing will be described below with reference to FIG. 5 in relation to the display screen.

(1) In case of capacity method The capacity method is targeted when the lot size is smaller than the period or the division is easy.

(A) Start from UNIX-shell.

Enter% lc.

(B) When the initial screen appears, use the "Run" mouse in the top left menu to pick with the mouse (hereafter simply abbreviated as "pick") (c) Single order load plan (510) Ignore one order and another. If there is an excessive load after processing, the order information diagram (the earliest start date and latest completion date for each process of the order is displayed, and the process that is late for delivery is displayed in red) appears. In, the following load adjustment is possible.

(I) Acceptance of delayed delivery (513) Pick "Accept delivery delay" on the menu. A pair of orders that require postponement of delivery date and feasible delivery date is displayed.
If "K" or "NG" is selected, if "OK", the due date of those orders is reset to the feasible due date and the load calculation is continued, and if "NG", the state returns to (c).

(B) Re-execution after setting leave or overtime again When you select "Leave overtime" from the menu, the message "Please specify the order or resource" appears.

Pick the order name field (with the order name field changed to blue), then set "Leave", "Overtime", or "Overtime Overtime" according to the pop-up menu, and then click "Control" in the menu. --Pick "Retry". As a result, the processing capacity of the resource capable of processing the order is changed and the load calculation is restarted from the beginning. You can specify an order as many times as you want before picking "Restart", and if you want to specify all orders at once, pick the title block at the top.
As a result, the period of the main resource in the earliest processing period of each process is set to leave or overtime, and the process proceeds to the next step. Check the sub-resources, but do not display information about which sub-resource period is set to overtime.

(C) When interrupting the processing, "control--interrupt"
Pick.

(D) Competitive load calculation between orders (512) If an excessively loaded set of orders is found by load calculation considering competition between orders, the result is displayed on the screen (506, FIG. 17). In the message column, the name of the order included in the entire competition set (<> indicates that the order is included in the processable area of the previous order), the total load amount and the apparent load (processing is (Value when all the usable capacity is displayed even if completed) Processing capacity, actual lacking processing capacity and order name that can not be processed, loss amount of processing capacity due to lack of processing capacity of each sub resource type Since it is displayed, the load can be adjusted based on this information. The area in the corresponding load factor contour map blinks with the pick in the order name column of the information diagram, and conversely, the pick of a certain area in the load factor contour map, the order information diagram of the order (plural) including that area The name field inside turns blue. Here, the following load adjustment is possible.

(A) Acceptance of postponement of delivery date (515) Pick "Acceptance of postponement of delivery date" in the menu. A pop-up menu will appear, and you will be asked whether it is "automatic" or "manual". Select it.

In the case of automatic postponement of delivery, either the delivery of one order selected by some criteria is thoroughly postponed until the overload is resolved ("single order"), or competing orders are Use the popup to select whether all items should be postponed evenly ("All orders are uniform"). This system automatically calculates the minimum postponed delivery date and displays the result in a pop-up menu. If the result is OK, picking "OK" changes the delivery date of the order and restarts load calculation from the beginning. If you are not satisfied with the result, select "NG" to return to the state of (4).

If "single order" is selected as the postponement of the deadline for delivery within a single order, a pop-up will appear and ask what criteria to select the deferred order.

"Order order" is selected as the order order postponement.
It is selected from the orders with the latest order date.

"Priority order" is selected as the priority order postponement.
The priority specified in the order information file is used.

Competitive All Orders Uniform Delivery If "All Orders Uniform" is selected as the postponement, the orders are selected one by one from the latest order date and the delivery is postponed by one day (unit period) until the overload is resolved. To do.

In case of postponement of manual delivery
"Select an order" is displayed, so select the order you want to postpone by picking the order name field in the order information diagram (color changes to blue), and at the right end of the new delivery date in the popup menu that appears, click ▲. Pick and set the delivery date, and if it is OK, the delivery date will be changed with the "OK" pick and re-execute from the beginning.

(B) Re-execution due to changes in leave and overtime (51
6) When you select "Overtime Overtime" from the menu, a popup will appear asking if you want to "Automatic" or "Manual". Select it.

For manual settings, select "Manual"
Please specify an order or resource. "The system will only display the minimum range of overload, but it is up to the user to decide which resource period should be powered up. Therefore, depending on the circumstances, the user will try and minimize the minimum power-up in the most convenient way. If the power-up is the most effective, the function that does so automatically can be realized. However, it is not always possible to obtain a result that is in line with the actual situation.

As an order designation, select an order (there is a column for the order name that has changed to blue), then set "Leave" or "Overtime" according to the pop-up menu, and then select "Re-execute" from the menu. . As a result, the processing capacity of the resource in the processable area of the order is changed, and the load calculation is restarted from the beginning. Orders can be specified consecutively before picking "Control--Restart", or when specifying all orders at once, pick the top title block. It is also possible to specify the resource period immediately before picking "Control--Rerun".

As the resource period designation, pick the main resource column on the left side of the load factor contour diagram, then specify the period in the order of start date pick and end date pick in the upper period column,
Then, select "leave" or "overtime" according to the pop-up menu. You can repeat it any number of times, and if you select "Rerun" in the menu after finishing, it will be executed from the beginning. You may specify the order just before picking "Control--Rerun". If you want to specify all the main resources at once, pick the title column at the upper left. The + symbol is displayed during the period when overtime is designated, and the background color of the holiday changes to gray during the period when leave is designated.

(C) When interrupting the processing, "control--interrupt"
Pick.

(E) Display of the final result (518) Whenever an order set competing and causing a delivery deadline is encountered, (d) is repeated and the adjustment of excess load is completed, and the load of each process The rate status is displayed. You can select the next process to be displayed by selecting "Next process" in the menu. In the case of an order whose delivery date has been postponed, its column is displayed in red in view of the first requested delivery date.

(2) In case of lot allocation method This is a method when the lot size is larger than the period and the division is difficult, but the capacity method without load factor adjustment is calculated and the lot allocation method continues. Move. The difference between the operation and display with the capacity method is: * Order information chart when the overload is calculated by order single load calculation (the earliest start date and latest completion date of each process of each lot are displayed and (Displayed in red), * The display screen in the case of excessive load in the calculation of competitive load between orders is the Gantt chart, * The picking of "CL conversion" (517) causes the Gantt chart to use the capacity method (however, (The processing period is calculated without dividing into lots, so it will be longer than the original capacity method.) Instead of displaying the load factor contour map of the relevant process calculated in advance and returning to the original by re-picking, 3 points Is.

The procedure is the same as the capacity method up to the calculation of the individual load of the order, but when there is a lot that cannot be allocated during the calculation of the competing load and it is displayed on the display screen, (a) leave it as it is (delay the delivery date). (Tolerate) if you want to allocate
If "Continue" is selected and (b) Power-up is required due to special circumstances, first switch to the load factor information screen with "CL conversion" and then confirm the blinking processable area corresponding to the unallocatable lot. Then power up a resource period somewhere in the area. For example, if the order is rushed by a special express item, etc., it may be possible to specify overtime as soon as possible within the available area, but generally there are certain points that are likely to become a neck (biased).
Since there is a strong tendency, if you try to power up only at places with high load factors, you may end up working overtime with the same resources.

The details of the processing of this system will be described below.

(1) Capacity Method First, assuming that all orders are processed independently, the earliest and latest processing periods of each process are calculated for each order. When obtaining the earliest treatment period, calculation is performed from the process of all branches and leaves at the entrance toward the final assembly process, and in the case of the latest treatment period, calculation is performed in the opposite direction. The period from the earliest possible start date of resources that can process an order to the latest end time is the "processable area".

Next, the calculation considering the competition is performed.
If there are three orders such as A, B, and C and they overlap as in (11), it can be considered whether the load does not exceed the processing capacity for all such overlapping subsets. It must be done, but if all such combinations were checked, a combination explosion would occur immediately.

Therefore, (a) if the new superimposition has a smaller surplus capacity (the processing capacity remaining after processing all the orders that are loads in that area), the original superposition is deleted. In other words, if there is less processing capacity (A> A or B) A in the check of AorB in which order A and order B are overlapped, the order area A is deleted. Because if A or B is left and other order areas are stacked on top of this, a situation with a stricter load factor than that for only A will always appear.
B serves as A (14).

(B) When the load factor is very small, only a new overlapping area is held. This is to superimpose order B and order C, and when all of B, C, and BorC have extremely low load factors, only BorC is left and B and C are also used (13).

(C) The order areas deleted as in (a) constitute one part thereof, and the already checked overlapping areas are also deleted. This is to ensure that (a) is traced back and thorough (12).

(D) For each order, list other orders included in the area in advance and apply the above (a) to 3 to determine the number of order areas at the start time. Suppress as much as possible.

(E) From (a) to (d) by devising the order of superposition
To be more effective. There are various suitable orders depending on the application, but the order area with a small margin capacity is brought in order or the order area with a large included order area is brought in order.

(F) The rectangle is held as a compressed bit pattern to make the inclusion relation check efficient.

These methods solve the problems of memory and time due to combinatorial explosion, and the calculation is completed in near real time.

A more detailed algorithm performs the following processing for each group of all independent main resource groups. While listing the inclusive processable areas of each processable area, if there is a processable area that includes itself and has a remaining power, that is, a marginal capacity less than that of itself, deletes itself. Then, the processable areas are sorted in the order of low remaining power (or high inclusion). Then, as long as a new union processable area is generated, the following processing is performed.

The processable areas included in the processable areas are not required for all independently processable areas of the resource group, and the following processing is performed for all previously registered union processable areas. I do. First, check the inclusion and overlap relationship between the processable area and the union processable area, and if both processable areas truly overlap, create a union and register it as a new unset processable area. Process. In other words, when the load factor exceeds the threshold value, go to the result display and excess load adjustment screen,
Adjust overload.

Then, if the remaining power of the newly created union processable area is smaller than that of the current processable area, the current processable area and the current union processable area are deleted, and a space between the current processable area and the current processable area is deleted. The created union processable area (excluding the union processable area just created) is also deleted, and the next processable area is reached.

When the registered processable area and the current processable area are of the same type, the current processable area is added to the registered union processable area, and thereafter both processable areas truly overlap each other. The same process as in the case of

If the registered processable area includes the current processable area, the current processable area is added to the registered union processable area, and then both processable areas truly overlap each other. The same process as in the case of

Finally, when the current processable area includes the registered union processable area (should not exist), the registered unset processable area is loaded immediately after the current processable area is registered. Prepare to add to the member processable area.

When the processing of the current processable area and all the already registered union processable areas is completed, the current processable area is deleted when there is an overlapping registered unset processable area. If not, the current processable area is registered as a union processable area, and if there is a unset processable area included in the current processable area, those are also included.

If there is no union processable area that overlaps, it is registered as a possibility of an independent processable area.

When all processable areas are completed, if a possible independent processing area is registered, it is set as a new processable area again (union processable area is set as much as possible). Make and check the load).

When all independent main resource groups are completed, the influence of the inter-process common resource is propagated.

Further, by sequentially overlapping the order areas in this way, it is possible to limit the set of orders that are competing and cause an overload. For example, in the case of delaying the delivery date in order of order and eliminating the overload. In addition, it is possible to clarify from which range of order sets the deferred orders should be selected. This is because if you do everything from the beginning, you may not know where the cause of the overload occurs, and you may change the deadline for misplaced orders.

As for how to obtain the processing capacity of the overlapping area, as shown in FIG. 8, the unnecessary processing is performed so that the maximum processing capacity of the area is always exhibited.
In order to prevent (make inventory) from being done from the front to the back of the area, determine what processing to use for each day while considering all resource types (hatched areas have been calculated) .

As a detailed algorithm, the processing capacity of a single processable area is obtained as follows. Do the following from the start date to the end date of the processable area. If you are not prepared to work on holidays, skip the orders on holidays and sort the pairs of primary and secondary resources and orders (loads) that can be executed on that day in descending order of actual power.

Then, as long as there is an unprocessed load, it may not be necessary to take a full day, so check the operating time required for that day, and it is worth the pair to execute. Consider also the sub-resources that can actually be exerted on this day. If there is some power, the combination will be treated on that day. If all the orders are cleared, all the power will be allocated though it is surplus. If there are still unprocessed orders, add to the power of the processable area and record.

When all the loads that can be processed on that day have been exhausted, but there are still unused main resources,
As long as the main resource that is not used remains, if the main resource is available, the power that also takes into account the sub-resources that can actually be exerted on this day is examined and the combination is used as the processing for that day.

The power of the union processable area is obtained as follows. The load of the union processable area is collected, and the first and last days of the union processable area are obtained. In order to postpone a load that has a lot of dedicated processable resource period, set the number of dedicated processing places for each load, check the overlap of the processable regions in the source region of resources and time, and check the dedicated region for each load. Check the possession of. From the first day to the last day of the union processable area, calculation is performed in the same manner as the processing capacity of the single processable area described above.

(2) Allocation (lot) method As shown in FIG. 9, "processable areas" that partially overlap each other (31)
When all lots are overlaid and the maximum "union processable area" is found and this is used as the outer frame of the puzzle and all lots are tried to be allocated in this, two steps of steps are prepared and load calculation is performed. It is a method.

In this system, in the first stage, the number of lots that can be allocated is small, with the highest priority being given to the case where there is no place to allocate, assuming a high load factor.
Allocation is performed in order from the "resource period" (may be scattered here and there on an island), and the allocation direction (either left-justified or right-justified) in one "resource period" is generally "resource" on that resource. If the number of lots that can be allocated during the period is regarded as high, the direction is to increase the gradient so that the smallest possible free time is not left.

If there is no place to allocate in the first stage, or if all of them can be allocated but there is a lot of vacant space as a whole, the second stage is one of the resources that can simply process the lot at the time by forward packing. , The resources are allocated in ascending order of the number of lots that can be allocated and the processing capacity of continuous free time.

The detailed algorithm performs the following processing for resource group groups in all main resource types. First, the maximum set of union processable regions including the maximum overlap is found. Then, all the lots in the resource group are collected, and the lot sets are sorted by (a) ordering order, (b) few available resources, and the like.

All-sum set processable area Uniformity degree of the maximum set area All resource periods are listed, and there is little overlap (a period where they do not overlap with other processable areas) or 1
Score points based on the amount of free time in this series.

While the unallocated lots remain, safety-first allocation (deciding from resource periods with little use so as to prevent allocation failures) is performed as the first step.

That is, all uniform redundancy resource periods capable of processing this lot (without considering power) are collected, and all uniform redundancy resource periods capable of processing this lot are overlapped.
Sorts in ascending order of the free time of one continuous line with a small (period that does not overlap with other processable areas).

For all these main resources (in the order of less overlap and more free space), the sub-resources that can be combined with the main resource that can process this lot are collected, and for all combination resources, the lot is uniformly overlapped with the main and sub-resources. Try to allocate to a resource period and find out when it will end.

If the processing can be performed within the uniform duplication resource period and within the processing period of the lot, proceed to the next step. If a place that can be allocated is found, allocate it as such, set the earliest start time of the lot in the subsequent process (must be allocated after this), and go to the next lot.

If it cannot be allocated within any of the uniform duplication resource period ranges, or if there is a lot of space in the first stage or there is no allocation place, all main units that can process this lot as the second stage. The resources are collected, and all the main resources that can process this lot are evaluated and sorted by the long free time of one continuous line with a small overlap (a period in which the other processable area does not overlap).

For all of these main resources (in the order of less overlap and more vacant space), the sub-resources that can be combined with the main resource that can process this lot are collected, and for all combination resources, the lot is temporarily set as its main and sub resources. Attempt to allocate by the delivery date and ask for the end date and time.

If it is the fastest way up to now, it is recorded, if there is no allocation place, it is displayed, if it is not completed by the process delivery date, it is added to the late delivery lot, allocation is done by the earliest method, and the post process Set the earliest start time (must be assigned after this) of the lot.

When all lots have been allocated, it is checked if there is an empty space when compressing by justification. If there is a large amount of space, the allocation is returned to the original state and the process is executed again from the start.

[0105]

As described above, according to the present invention, it is possible to calculate the large-medium-day schedule load in consideration of the semi-universality of each resource.

[Brief description of drawings]

FIG. 1 is a diagram showing an outline of a production management system.

FIG. 2 is a diagram illustrating a relationship between orders and resources.

FIG. 3 is a diagram illustrating a method of estimating a processing capacity of a production site.

FIG. 4 is a diagram for explaining an outline of processing (input information portion) of the embodiment.

FIG. 5 is a diagram illustrating an outline of processing (internal processing and screen display) according to the embodiment.

FIG. 6 is a diagram illustrating an outline of processing of an embodiment (a portion of output information).

FIG. 7 is a diagram illustrating a load calculation method in consideration of competition in the capacity method.

FIG. 8 is a diagram illustrating setting of processing capacity in the capacity method.

FIG. 9 is a diagram illustrating a method of load calculation in consideration of contention in the allocation method.

FIG. 10 is a diagram showing a data structure of a process information file.

FIG. 11 is a diagram showing a relationship among products, processes, and process information.

FIG. 12 is a diagram exemplifying process information when there are repeated processes.

FIG. 13 is a diagram exemplifying process information in the case of a complicated process.

FIG. 14 is a diagram showing a data structure of an order information file.

FIG. 15 is a diagram showing a data structure of a resource free time information file.

FIG. 16 is a diagram showing a data structure of a processing capacity information file.

FIG. 17 is a diagram illustrating a load factor display screen.

[Explanation of symbols]

 506 Load adjustment 511 Order individual load calculation 512 Inter-order competitive load calculation

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Jun Kawasaki 2-4-1, Ichibancho, Aoba-ku, Sendai-shi, Miyagi Hitachi Tohoku Software Co., Ltd.

Claims (2)

[Claims] 1. A method for determining whether or not a plurality of jobs performed by using a plurality of resources in a plurality of resource types through a plurality of processes are completed by their respective delivery dates by comparing load amount and processing capacity. In the calculation of load, (1) 2 of the resource axis and the time axis, which are formed by the resource group that can process the work and the period from the startable date to the delivery date
Prepare an algorithm that holds a dimensional area as a "processable area" and a total area of a plurality of partially overlapping "processable areas" as a "union processable area", (2)
Prepare an algorithm that finds the processing capacity of these areas so that the required maximum capacity is always exerted, and (3) form the "union processable area" in order from the partially overlapping "processable areas". Prepare an algorithm to calculate whether a region is overloaded, and the "union processable region" that was superposed in (4) and (3) is more than one or both of the two "processable regions" of its constituent elements. If the remaining processing capacity is small, prepare an algorithm that deletes the "processable area" of the component with a large remaining processing capacity, and the "processable area" deleted in (5) and (3) becomes a component. Prepare an algorithm to delete the generated "union processable area", and specify the order of overlapping in (6) and (3) (such as the amount of remaining processing capacity and the number of included processable areas). Prepare an algorithm, and repeat the procedure in (7) and (3). If the combined union processable area has a very low load factor,
Prepare an algorithm that leaves only the union processable region and deletes the two "processable regions" of its constituent elements.
(8) By holding the two "processable area" shapes as compressed bit patterns in (3), it is possible to limit the minimum order and resource period ranges that are overloaded due to competition. It is easy to adjust the overload, and to check all cases rather than actually drawing conclusions from a small number of simulations that allocate each job on the time axis of each resource based on some strategy. A load calculation method in a production management system that is an approximation method and that is performed in a short time. 2. Whether or not a plurality of jobs performed by using a plurality of resources in a plurality of resource types through a plurality of processes are completed by their respective delivery dates without actually permitting lot division is performed on individual resources. "Available areas" that partially overlap in the load calculation calculated by the allocation method
If you try to assign the maximum "union processable period" by stacking all of them and use this as the outer frame of the puzzle, and allocate all lots to this, you have to prepare two-step steps Production control Load calculation method in the system.