JPH07244692A - Method and device for production process scheduling - Google Patents

Abstract

PURPOSE:To obtain a process schedule which enables production in less operator arrangement by using a virtual production master where only frames as many as operators required for the production are defined on the basis of an empirical rule, performing process scheduling, and then performing operator scheduling which allocates the operators to operator frames in the obtained process schedule. CONSTITUTION:The number of operators required at the time of prestep/poststep operation is temporarily set as to a product to be scheduled according to scheduling strategy to generate a virtual process master 120. Then the process scheduling 130 is performed on the basis of sales information (order data), the virtual process master 120, and field information (device data). Then a schedule (where only an operator quantity frame is scheduled as to operators) outputted by a process scheduling system 110 is received and the operator scheduling 165 for operator allocation is performed.

Description

Detailed Description of the Invention

[0001]

[Field of Industrial Application] The present invention receives orders in the manufacturing industry,
It takes a method of creating a process schedule that considers both so-called "things" constraints such as manufacturing equipment and operators of manufacturing equipment, that is, "persons". In particular, each process time of the production master depends on how the operator is assigned. When the (time required for each process) changes, there are restrictions on the "material" aspect such as meeting the delivery date and improving the equipment operating rate, and "human" aspects such as reducing the number of required operators and improving the operator operating rate. The present invention relates to a process scheduling method in the case where it is necessary to consider both the above constraint and

[0002]

2. Description of the Related Art In conventional process scheduling, "production scheduling system based on expert model" (Journal of the Japanese Society for Artificial Intelligence, Vol.5, No.2, p.194-202, (1
990)), relax the constraints so that the problem of "people" does not occur in the first place, or do operators ignore the problem of "people" as if there is a margin. Alternatively, the operator was fixed as an operator of the specific device (the number of personnel required for each process was determined, and "persons" were scheduled when the layout was reviewed). Scheduling can be done by ignoring the problem of "people", compared to the problem of "people" such as the personnel cost of the operator. I think it was because it was expensive.

On the other hand, as a problem of operator scheduling, "US Ascent Technology"
s, Scheduling system for airline companies released ”(Nikkei AI, 1999.5.7, page 8)
Developed a timetable creation expert system such as Ntia "(Nikkei AI, 1990.3.12, pages 8-9)
However, it was treated as a question of who should be assigned to each frame when the frame is decided in advance.

[0004]

In recent years, due to innovations in production technology, it is no longer necessary to have as many operators as before to make the same product, or due to a long-term economic downturn, labor cost reduction is deadly for the organization. It's a problem.

In the above-mentioned prior art, when human problems can be basically ignored, or when the production master can be fixed (manufacturing method and manufacturing time are uniquely determined when a product is determined), scheduling can be performed. However, there is a problem that practical process scheduling cannot be performed when the scheduling of “object” changes depending on the scheduling of “person”. For example, since the contents of orders change every time scheduling is performed, if the operator allocation is reduced only by considering the achievement of the operator operating rate, the process time is extended and other inconveniences such as undelivered delivery are caused. On the other hand, if the setup times overlap, separate operators are required, and thus more operators are required.
The operator operating rate will need to be adjusted and determined while balancing production efficiency.

Also from the aspect of computer system construction, changing the scheduling strategy while adjusting the operator availability in one scheduling increases the search range of the scheduling solution space. The combination will explode, and scheduling will take an enormous amount of time.

According to the present invention, "it is practically difficult to numerically determine a scheduling strategy by designating an operator operating rate in advance, so a plurality of schedules are created / evaluated according to a plurality of scheduling strategies, and the current status is calculated. Based on the idea that it is realistic (practical) to select an appropriate schedule, ”the above problems will be solved, and the operator will be able to meet the constraints of production, such as meeting the delivery date, while at the same time using fewer operators. It is an object of the present invention to construct a production process scheduling system capable of obtaining a process schedule that can be produced by arrangement. However, in order to keep the scheduling result obtained by the above method within the practical range, 1) extract some scheduling strategies by setting a trial period in advance, and 2) select the selected schedule. , It is necessary to provide a flexible and modifiable interface.

[0008]

[Means for Solving the Problems] In order to solve the above problems, (1) production in which only a frame of the number of operators required for production is defined by a rule based on an empirical rule extracted from past process scheduling results. A master (hereinafter referred to as a virtual production master) is set. (2) Two-step process scheduling is performed, in which process scheduling is performed using the virtual production master, and operator scheduling is performed in which an actual operator is assigned to the operator frames in the process schedule obtained thereafter.

(3) The operator scheduling result (that is, which operator performed which work and how many times) was saved. (4) The operator scheduling is performed while referring to the past allocation history of each operator. (5) The operator operating rate is calculated from the operator scheduling result, and the attendance date and working hours of the operator are set.

(6) When the scheduling result does not satisfy the preset evaluation criteria, the process scheduling strategy is changed so that the scheduling is restarted from the creation of the virtual production master. (7) Schedule that creates the process schedule that takes the longest time in advance (satisfies the delivery date and the constraints on production), and then shortens the production master (basically increases the number of operators and shortens the process) To do.

(8) The process scheduling and the operator scheduling are coordinated by using two computers. (9) The process scheduling and the operator scheduling are coordinated by the two tasks of one multi-task compatible computer.

[0012]

The above means has the following functions. (1) Since the virtual production master is set according to rules based on empirical rules extracted from past process scheduling results, "objects" cannot be scheduled unless "people" are originally determined. It works to resolve the contradiction that you must know the scheduling result to make a decision.

(2) Since the operator scheduling for allocating the operators is performed after the process scheduling using the virtual production master, the scheduling problem that should originally consider "object" and "person" at the same time is "object". It acts to replace the partial scheduling problem of separately scheduling "person" and "person" (localization of scheduling).

(3) Since the process scheduling result and the operator scheduling result are saved, they can be called and used whenever necessary. (4) Since the operator scheduling is performed while referring to the past allocation history of each operator, it acts to give a prediction that entraps a person's thoughts at the reference stage. (5) Since the attendance date and the working time of the operator are set after the fixed scheduling result is seen, it works so as to sandwich the judgment / evaluation of the person when setting the attendance date and the working time.

(6) When the scheduling result does not meet the preset evaluation criteria, the process scheduling strategy is changed and the scheduling is restarted from the creation of the virtual production master. Acts to move in the solution space.

(7) Since the process schedule that takes the longest time is created in advance and thereafter the scheduling for shortening the production master is performed, the schedule can be partially changed while the production constraint is satisfied.

(8) Since the process scheduling and the operator scheduling are performed in cooperation with each other by using two computers, the operator scheduling can be started before the process scheduling is completed.

(9) Two multitasking computers
Since the task scheduling and the operator scheduling are coordinated by one task, the scheduling of the corresponding part of each schedule is completed in a shorter time.

[0019]

EXAMPLES Examples of the present invention will be described below.
In the first embodiment, an example of performing scheduling in two stages of process scheduling and operator scheduling via a virtual production master, which is the central idea of the present invention, will be described with reference to FIGS.

In the second embodiment, as shown in FIGS. 1 and 2, as an alternative 1 to the first embodiment, a process schedule that takes the longest time is created in advance, and then a time reduction scheduling is performed while adjusting the operator distribution. An example will be described. In the third embodiment, as an implementation apparatus of the first embodiment, an example in which two computers cooperate with each other to perform process scheduling and operator scheduling will be described with reference to FIG.

In the fourth embodiment, as an alternative to the fourth embodiment, an example in which two tasks of one computer having a multitask function perform the process scheduling and the production master confirmation scheduling in cooperation with each other will be described with reference to FIG. .

(First Embodiment) Before explaining the outline of the first embodiment, a virtual production master used in the first embodiment will be described with reference to FIG. As shown in FIG. 2A, when a virtual production master cannot determine in advance a part (including all) of each process constituting the production master, for example, an ordering order, a manufacturing site Comprehensively judge the situation, etc., and decide the scheduling strategy that is the standard for creating the virtual process master (scheduling strategy, especially operator placement strategy,
A plurality of cases are accumulated as an example, and a strategy can be selected according to the current situation), and the processing content at the time of actual scheduling (adjustment of setup change process duplication, etc.) is determined by the determined scheduling strategy. In FIG.
Since the processing time varies depending on the number of operators assigned by the front setup 210 and the second setup 220 of the process A 215, the operator assignment frame is expressed as (*) 225.

The virtual process master is created by virtually setting the number of operators required for executing the pre-setup 210 / post-setup 220 according to the scheduling strategy for the product to be scheduled. FIG. 2A shows an example in which one person is placed in each of the front setup 210 / the rear setup 220,
FIG. 2B shows an example in which two persons are arranged in each of the front setup 210 and the second setup 220, and FIG. 2C shows an example in which an actual operator is assigned. Basically, the operator staff to be assigned to each process is determined by a rule based on a schedule strategy.

Next, an outline of the first embodiment will be described with reference to FIGS. Basically, in the first embodiment, the process scheduling 130 based on the virtual production master is performed first, and then the operator scheduling 165 is performed. The procedure is as follows.

(1) Process Scheduling (a) Determining (Modifying) Scheduling Strategy The ordering order, the situation of the manufacturing site, etc. are comprehensively determined to determine the scheduling strategy to be a virtual production master creation reference 115. A plurality of scheduling strategies, especially operator allocation strategies, are accumulated as examples, and the strategy is selected (multiple selections are possible) according to the current situation. Depending on the determined scheduling strategy, the processing content (adjustment of setup change duplication) at the time of actual scheduling is determined.

(B) Creation of Virtual Production Master The virtual production master described above is created 120. For the product to be scheduled this time, the number of operators required for performing pre-setup / post-setup is provisionally set according to a scheduling strategy, and a virtual process master is created.
Basically, the operator staff to be assigned to each process is determined by a rule based on a schedule strategy.

(C) Process scheduling Process scheduling is performed based on sales information (order data), virtual process master, and site information (device data) 1
30. The process schedule is 1) a process schedule proposal is created using a planning-type expert system, 2) is evaluated based on preset evaluation conditions, 3) is interactively modified, or the scheduling strategy is changed to be a planned process schedule. It is created by the procedure of recreating with an expert system.

(2) Operator Scheduling Here, the operator scheduling 165 is performed in which the schedule output by the process scheduling system 110 (only the number of people is scheduled for the operator is scheduled) is received.

(A) Expansion of scheduling data The following scheduling data is obtained from the process scheduling result 140 in order to execute operator scheduling. 1) Allocation information of each process: Detailed information of each order data allocated by the process scheduling. 2) Information of each operator: accumulated work records,
Working hours that are a constraint for scheduling.

Further, as data to be retained and maintained independently in the operator scheduling, there is a scheduling strategy, that is, a strategy required for scheduling such as a combination of operators and the number of repetitions of the same work is defined and maintained. .

(B) Development of scheduling data The data received from the process scheduling is expanded 155 into a data format according to the operator scheduling specifications.

(C) Determination of Scheduling Strategy Based on the purpose of the operator, an operator allocation strategy for realizing averaging of work results, maintenance of operator availability, etc. is set 160.

(D) Operator Scheduling Each device is selected as an operator allocation target from allocation data having a short machining time. With respect to the target allocation data, the operators to be allocated to the data are extracted within the range satisfying the constraint condition, and when a plurality of operators are extracted, the allocation operator is determined according to the predefined priority order.

Next, details of the first embodiment will be described with reference to FIGS. (1) Process Scheduling In this embodiment, an example is used in which “resource-oriented”, that is, an example in which an order is basically allocated to an idle time of the apparatus and a schedule is planned by assigning orders The operation of No. 1 will be described.

The process scheduling is performed according to the following procedure. (A) Creation of Scheduling Data 400 Order data is created based on the sales information 300. (B) Scheduling environment setting 405 Setting scheduling strategy 325 that is a prerequisite for scheduling such as operator frame setting strategy 11
5. Also, a virtual production master is created 120 based on the scheduling strategy 325.

(C) Extraction of equipment to be allocated 410 The order data is allocated resource-oriented (equipment priority) according to the scheduling logic. Allocate all production equipment in order according to the following procedure. (D) Selection of order to be allocated 415 Extracts order data that can be processed by the selected production facility.

(E) Determining the order to be allocated 420 From the extracted order data, the allocation job is determined according to a predefined allocation priority order. However, for operators required for job processing, scheduling is performed by setting only the number of people.

(F) Schedule evaluation 425 A scheduling result is generated by creating a graph 305 of the number of operators and an evaluation graph 310 of a schedule plan according to a preset evaluation standard, and outputting a form 315 such as a schedule. Display and schedule comprehensive evaluation 3
50. If the result of the schedule evaluation is good, the virtual production master creation know-how 320 is extracted and saved and used for the next process scheduling.

(G) Schedule modification The schedule is modified 345 interactively by modifying the knowledge base 340 or manually. The interactive correction is, for example, displaying a delivery delay order 800, and interactively correcting 810 by moving the delay amount with the mouse. In addition,
If necessary (for example, when the correction amount is large), the rescheduling 820 is performed while fixing the correction amount in order to obtain the entire consistency after the correction.

(2) Operator Scheduling Here, the actual operator arrangement is scheduled for the operator frame of the process scheduling result 500 obtained as a result of the process scheduling 130.

In the present invention, the operator scheduling 165 is performed by using the knowledge base 525 in which the rule of thumb is ruled.
I do. (A) Acquisition of prerequisite data 600 From the process scheduling result 500, 1) allocation information of each process, 2) accumulating work results, and information of each operator such as a working time zone which is a constraint of scheduling are acquired.

(B) Setting Scheduling Environment 605 An operator allocation strategy 520 such as a combination of operators and the number of repetitions of the same work is set. (C) Process selection 610 For each device, allocation data that is earlier in time is selected as an operator allocation target.

(D) Extraction and selection of operator 615 For the target allocation data, the operator to be allocated to the data is extracted within the range satisfying the constraint condition. When a plurality of operators are extracted, the allocation operator is determined according to the priority order defined in advance.

(E) Evaluation of allocation result 620 According to the evaluation standard defined in advance, the operator utilization rate is graphed 505, the graph of schedule plan evaluation is created 510, and the operator allocation result is output as a form 51.
5 or more, comprehensive evaluation of operator allocation results 53
5.

(F) Modification of allocation result 625 When the allocation result does not satisfy the evaluation standard, the allocation result is interactively modified, or the precondition for scheduling and the knowledge base 525 are modified to perform rescheduling. To do.

The production process scheduling result according to the present invention can be used to perform the following, such as averaging work records of operators. (1) Leveling of operator performance First, for each assignment in the process scheduling 500 result, when assigning an operator, the work type performed by the operator, which work type and how many times were performed , Record everything during scheduling. By storing this work record history for a certain period, it is possible to achieve long-term leveling of work types. Next, the work allocation of the operator is done for each allocation of the order received to the device.
Although it is determined according to the rule, the saved past work history is referred to in the condition part of the rule. Assign the operator with the smallest work record in the referred operator history.

(2) Leveling of working hours of operator As for the working hours of operators, the same as the above-mentioned leveling of operator performance, the working hours of the operator are set in the rules in the knowledge base 525 of the operator scheduling 165. Leveling can be achieved by selecting a small number of operators.

(3) Averaging of operator working time zones Operator scheduling 16 in (1) and (2) above
With just 5, the same operator is assigned regardless of day or night, and it is not possible to average the working hours. In addition, it is necessary to basically determine the working hours in accordance with work regulations.

Therefore, the scheduling period is divided into the number of days according to the working rules, and the working time zone is set as a constraint condition for each period and for each operator, and is allocated in the knowledge base 525 of the operator scheduling 165. By adopting rules, the operator working hours can be averaged.

(4) Method of setting holidays Basically, the daily operator operating rate 700 is calculated after the operator scheduling 165, and the day when the operator operating rate 700 is low is set as the operator holiday. consider. This is done by the following procedure.

(A) A schedule that can be most evaluated by the above-mentioned production process scheduling method is selected, and the operator operating rate 700 is calculated for each day. (B) The scheduler interactively examines the holiday setting 710 for the days when the operator utilization rate 700 is low 710. (C) The holiday setting portion is fixed 720 (operator holiday is set in advance) and rescheduling 730 is performed to make the hand correction portion and the periphery consistent.

Example 2 In Example 2, according to FIG.
As an alternative to the first embodiment, an example will be described in which a process schedule that takes the longest time in advance, that is, a case where the number of operators is minimized is created in advance, and then the time reduction scheduling is performed while adjusting the operator distribution. .

The process schedule is created in the following procedure. (1) Create 120 a production master with the minimum allocation of operators. Set the minimum required number of operator frames in the process frame of each production master. For example, if the process can be performed by one person, the operator frame is set to 1. This allows the most time consuming production master.

(2) Process scheduling 130 is carried out with the production master created in (1). The process scheduling 130 is performed based on the order data. As a result, the most time-consuming process schedule is obtained. (3) Modify the results of (2) by interactively increasing the number of operators in each process. Since each production master of the process schedule obtained in (2) is assigned the minimum required number of operator frames, the actual operator is assigned while expanding the frame. By increasing the number of operators, the time required for each process will be shortened, so there will be no problem of delay in delivery due to correction. (4) Correct the operator frame for all allocations.

(Embodiment 3) In Embodiment 3, as shown in FIGS. 1 and 9, the process scheduling 130 and the operator scheduling 165 are coordinated by two computers, a computer A900 and a computer B905, as an implementation apparatus of the first embodiment. An example will be described.

In the computer A 900, the process scheduling unit 910 performs the process scheduling 130 described in the first embodiment. Process scheduling 13
0, the computer A 900 sets the scheduling data storage unit A 935 every time allocation of order data is determined.
Save the allocation result to. Communication manager A after saving
915 is called. The communication management unit A915 refers to the scheduling data storage unit A935 and passes the allocation result to the communication management unit B920 of the computer B905.

The communication management unit B920 stores the received allocation result in the scheduling data storage unit B940. When the allocation result is stored in the scheduling data storage unit B940, the operator scheduling unit 930 performs the operator scheduling 165 described in the first embodiment. However, the operator allocation strategy determination 160 is made only once at the beginning. Calculator A90
When all allocation is completed in 0, computer B9
In 05, the operator allocation is determined for the final allocation result and the scheduling ends.

(Fourth Embodiment) In the fourth embodiment, FIGS.
Thus, as an alternative to the fourth embodiment, an example will be described in which two tasks of one computer A1000 having a multitask function, task A1005 and task B1010, perform the process scheduling 130 and the operator scheduling 160 in cooperation with each other.

In task A1005, the process scheduling unit 910 performs the process scheduling 130 described in the first embodiment. Process scheduling 1
In 30, every time the allocation of order data is decided,
Task A1005 is a scheduling data storage unit A9
Save the allocation result in 35. The task management unit 1020 is called after the saving. The task management unit 1020 refers to the scheduling data storage unit A935 and passes the allocation result to the scheduling data storage unit B940 of the task B1010.

When the allocation result is stored in the scheduling data storage unit B940, the operator scheduling unit 930 of the task B1010 performs the operator scheduling 165 described in the first embodiment. However,
Determining the operator allocation strategy 160 as in the third embodiment
Is only done once at the beginning.

When all the allocations are completed in task A1005, task B1010 determines the operator allocation for the final allocation result and finishes the scheduling.

[0062]

【The invention's effect】

(1) Originally, "person" cannot be scheduled unless "person" is determined, but it resolves the contradiction that the scheduling result must be known to determine "person". However, there is an effect that scheduling can be performed using the virtual production master. In addition, since the rule base is used to set the virtual production master, even if the production master is set virtually, "combination explosion", which tends to be a problem in the search for all solutions in the scheduling problem, does not occur, and in a comparatively short time. There is an effect that a satisfactory solution can be obtained. In addition, there is an effect that it is possible to bring the schedule to be obtained in the solution space of scheduling in a practical and practical direction by using the rule of thumb. (2) Since the scheduling is localized by replacing the "object" and the "person" with the partial scheduling problem in which the scheduling is performed separately, the combination explosion due to the full solution search, which is often a problem in scheduling, does not occur.
There is an effect that a satisfactory solution can be obtained in a relatively short time. In addition, after the process scheduling using the virtual production master, the operator scheduling that assigns the operators is performed, so even if the scheduling is performed separately, it is possible to obtain a scheduling result that considers "things" and "people". effective.

(3) Since the process scheduling result and the operator scheduling result can be called and used,
There is an effect that the scheduling method according to the strategy can be selected by referring to the contents saved in the subsequent scheduling. In addition, there is an effect that scheduling that reflects the work history of the operator, that is, work load averaging and carrier determination can be performed.

(4) Since there is room for human thinking in the operator scheduling stage, the work history and work load of the operator can be averaged even if the scheduling is localized. Further, there is an effect that the average career of each operator can be improved.

(5) Since the attendance date and the working time of the operator are set after the fixed scheduling result is seen, there is an effect that the working system suitable for the actual situation of production can be set.

(6) When the scheduling result does not meet the preset evaluation criteria, the scheduling is redone by changing the process scheduling strategy, and the solution space of the scheduling is moved in the direction of the schedule with a higher degree of satisfaction. Without using
By repeating the rescheduling, it is possible to obtain a schedule with higher satisfaction.

(7) Since the schedule can be partially changed while the production constraint is satisfied, there is an effect that a good schedule can be sequentially obtained interactively.

(8) If the result does not meet the preset evaluation criteria by making the production master fixed by making the empirical rule into a strategy in advance and changing the strategy to reschedule, it is more satisfactory. Since the solution space of the scheduling is searched for for the schedule, the production master is fixed within a meaningful range, so that there is an effect that a good schedule can be obtained successively.

(9) Since the operator scheduling is started by using two computers before the process scheduling is completed, there is an effect that the time until the final fixed schedule is obtained can be shortened.

(10) The process scheduling and the operator scheduling are performed in cooperation by the two tasks of one multi-task compatible computer, and the scheduling of the corresponding part of each schedule is completed in a shorter time. If there is any inconvenience in the results on the way, you can cancel the scheduling and change the conditions or interactively modify the schedule, and you will not waste wasted scheduling time without any inconvenience. There is an effect that it can be obtained in a short time.

[0071]

[Brief description of drawings]

FIG. 1 is a diagram showing an outline of production planning scheduling in the present invention.

FIG. 2 is a conceptual diagram of a virtual process master.

FIG. 3 is a diagram showing an outline of process scheduling, which is the first-stage scheduling in the present invention.

FIG. 4 is a diagram showing a procedure of process scheduling.

FIG. 5 is a diagram showing an outline of operator scheduling, which is the second-stage scheduling in the present invention.

FIG. 6 is a diagram showing a procedure of operator scheduling.

FIG. 7 is a diagram showing an outline of an operator holiday setting method.

FIG. 8 is a diagram showing an outline of a schedule modification.

FIG. 9 is a diagram showing a state of cooperative scheduling by two computers, which is an alternative of the implementation device of the present invention.

FIG. 10 is a diagram showing a state of cooperative scheduling by two tasks which is an alternative of the implementation device of the present invention.

[Explanation of symbols]

100: Production process schedule, 140: Process schedule result, 170: Production process schedule

Claims (12)

[Claims] 1. A step of deciding a scheduling strategy by a knowledge base based on an empirical rule extracted from past process scheduling results and a virtual production master creation in which a frame of the number of operators required for each process is provisionally set. Steps,
A process scheduling system consisting of steps for performing process scheduling based on a virtual production master, and an operator scheduling for assigning an operator to the operator frame of the virtual production master from the process scheduling result From the step of developing scheduling data, the step of setting an operator allocation strategy based on empirical rules, and the step of operator scheduling that allocates operators to the operator frame of the virtual production master. The operator scheduling system described above is used to perform the process scheduling using the above virtual production master, and then perform the operator scheduling to allocate the actual operator to the operator frame in the process schedule obtained. Production process scheduling method and performing scheduling. 2. If the result of the operator scheduling does not meet a preset evaluation criterion, the virtual production master creation strategy is changed and the process scheduling is rescheduled. The production process scheduling method described. 3. A virtual production master in which a frame of the number of operators required for each process is provisionally set is used.
The production process scheduling method described. 4. A virtual production master in which a frame for the number of operators required for each process is provisionally set by a knowledge base based on empirical rules extracted from past process scheduling results. Item 1. A production process scheduling method according to item 1. 5. A part of the items that need scheduling,
The production process scheduling method according to claim 1, wherein after provisionally setting based on a rule base obtained based on an empirical rule, after scheduling the remaining items, finalized scheduling of the provisionally set items is performed. 6. The production process scheduling method according to claim 1, wherein the operator scheduling is performed by referring to the saved allocation history of each operator. 7. The operator scheduling is performed by reducing the operator arrangement in advance and creating the process schedule that takes the longest time, and then performing the operator scheduling to increase the operator arrangement and shorten the process time of the production master. 1. The production process scheduling method described in 1. 8. The production process scheduling method according to claim 1, wherein the attendance date and working hours of the operator are set in accordance with a change in the operator operating rate by looking at the result of the operator scheduling. 9. The production process scheduling method according to claim 1, wherein the result of the operator scheduling is saved each time for reference in the next operator scheduling. 10. A production process scheduling apparatus, wherein process scheduling and operator scheduling are performed in cooperation with each other by using two computers. 11. A production process scheduling apparatus, wherein process scheduling and operator scheduling are performed in cooperation with each other by two tasks of a single multitasking computer. 12. A "problem" for a scheduling problem using a rule of thumb obtained by analyzing a scheduling result.
The production process scheduling method according to claim 1, wherein the partial scheduling of each of the "problem of" thing "" and the "operator" (problem of "person") is replaced.