JP6211276B2 - Work place planning apparatus, work place planning program, and work place planning method - Google Patents

Description

  The present invention relates to a work place planning apparatus, a work place planning program, and a work place planning method.

Conventionally, planning of a period and an area that occupies a place for performing work such as assembly of a mechanical device has been performed manually.
Conventional manual work requires time to create a plan, so it is not possible to make a timely revision of the work plan according to the change or addition of work, input errors, omissions, etc. There was a problem that it might occur. In addition, the creation of a work plan by hand requires skillful techniques, and it takes time and effort to inherit the techniques.
Furthermore, there is a demand for efficiently creating a more appropriate work plan for a limited work place.

  Here, in Patent Document 1, the allocation possible period of the planned arrangement target is obtained based on the prohibition constraint, and the planned arrangement target is sequentially arranged in the order from the smallest allocation margin obtained from this allocation possible period. A production plan creation device is described in which priorities are set for physical constraints, and the layout is corrected so as to be satisfied according to the priority order of the recommended constraints based on the placement of the planned placement objects.

JP-A-5-346926

  However, since the production plan creation device described in Patent Document 1 does not consider the size of the planned placement target, it is not possible to create a more appropriate work plan for a limited work place.

  The present invention has been made in view of such circumstances, and in consideration of the size of a part to be worked, a work place that can efficiently allocate a limited work place to a work request. An object is to provide a place planning apparatus, a work place planning program, and a work place planning method.

  In order to solve the above problems, the work place planning apparatus, the work place planning program, and the work place planning method of the present invention employ the following means.

Work place planning device according to the first aspect of the present invention, for each required work requests a task, Ri area der required for the working requirements, the area occupied and the is determined by the size of the work target component Storage means for storing the occupation period of the occupation area, and allocating means for assigning the work request according to the occupation area and the occupation period to a divided area in which work places where work is performed are virtually divided into a plurality of areas in advance. And evaluation means for evaluating the assignment by the assignment means based on the unassigned work request generated by the assignment by the assignment means.

  According to this configuration, the work place where the work is performed is virtually divided into a plurality of divided areas in advance, and the divided areas are assigned for each occupied area and occupied period required for the work request. That is, in this configuration, the work place is considered one-dimensional, and work requests are allocated on a map that is two-dimensional with the work place and the period. The occupied area is mainly determined by the size of the part to be worked. The occupation period is determined by, for example, a work period and a delivery date for each work request.

The storage means stores the occupation area and occupation period of the work place required for the work request, and the assignment means assigns the work request to the divided area according to the occupation area and the occupation period.
Further, the allocation is evaluated by the evaluation means based on the unallocated work request generated by the allocation. An unassigned work request is, for example, a work request that has not been assigned because its occupation area and occupation period overlap with other work requests.

  In this way, this configuration virtually divides the work place and assigns the divided area to the work request according to the occupation area and the occupation period required for the work request, so the size of the part to be worked on is taken into consideration. Thus, it is possible to efficiently allocate a limited work place to the work request.

  In the first aspect, a first constraint that is a constraint that cannot be changed and a second constraint that is a constraint that can be changed are set in the work request. The work request is allocated according to the occupied area, the occupied period, the first constraint, and the second constraint, and the evaluation means determines the degree of change in the unassigned work request and the second constraint. Based on this, it is preferable to evaluate the allocation by the allocation means.

  According to this configuration, since the restrictions are set in detail for each work request, it is possible to assign a more appropriate work place as a whole to the work request.

  In the first aspect, it is preferable that the second constraint is a priority assignment of the work request with high priority of the division area assigned to the work request, completion timing of the work request, and high order accuracy. .

  This configuration can allocate a more appropriate work place as a whole to the work request.

  In the first aspect, the assigning means can assign the work request to the division area within a period in which work can be completed ahead of schedule based on a delivery date of the work request, and the evaluation means is unassigned. The assignment by the assigning means is evaluated based on an evaluation value based on the number of the work requests, the deviation from the priority of the classification area assigned to the work requests, and the deviation from the delivery date of the completion time of the work requests. It is preferable to do.

  According to this configuration, it is possible to assign work requests more reliably.

  In the first aspect, the first constraint includes a tool required for the work request, and the allocation unit uses the tool set in the work request within the occupation period set in the work request. If it is not possible, it is preferable to advance the completion timing of the work request.

  According to this configuration, it is possible to assign work requests more reliably.

Work place planning device according to the second aspect of the present invention, for each required work requests a task, Ri area der required for the working requirements, the area occupied and the is determined by the size of the work target component Assigning the work request according to the occupation area and the occupation period to a divided area in which a work place where the work is performed is virtually divided into a plurality of computers, including a storage unit that stores the occupation period of the occupation area. It is made to function as an allocation means and an evaluation means for evaluating the allocation by the allocation means based on the unallocated work request generated by the allocation by the allocation means.

Work place planning device according to the third aspect of the present invention, for each required work requests a task, Ri area der required for the working requirements, the area occupied and the is determined by the size of the work target component The work request is assigned to the first step of reading the occupation period of the occupied area from the storage means and the divided area where the work place where the work is to be performed is virtually divided in advance according to the occupied area and the occupied period. A second step and a third step of evaluating the allocation based on the unallocated work request generated by the allocation.

  According to the present invention, there is an excellent effect that a limited work place can be efficiently allocated to a work request in consideration of the size of a part to be worked.

It is a figure which shows an example of the work plan map which concerns on embodiment of this invention. It is a block diagram which shows the electric constitution of the work place planning apparatus which concerns on embodiment of this invention. It is a schematic diagram of the work place data which concerns on embodiment of this invention. It is a schematic diagram of the component data which concerns on embodiment of this invention. It is a schematic diagram of order data according to an embodiment of the present invention. It is a schematic diagram of order data according to an embodiment of the present invention. It is a schematic diagram of the division | segmentation work possible area | region data which concerns on embodiment of this invention. It is a functional block diagram which shows the function of the work place planning apparatus which concerns on embodiment of this invention. It is a flowchart which shows the flow of the work place planning process which concerns on embodiment of this invention. It is a figure which shows the process of allocation of the order which concerns on embodiment of this invention. It is a figure which shows the work plan map produced | generated by allocation of the order which concerns on embodiment of this invention. It is a schematic diagram required for description of the change of the priority order of order accuracy according to the embodiment of the present invention.

  Hereinafter, an embodiment of a work place planning apparatus, a work place planning program, and a work place planning method according to the present invention will be described with reference to the drawings.

  In the present embodiment, for example, a work place where a work required for a turbine component or the like is performed is virtually divided into a plurality of divided regions in advance. More specifically, when the work place is a factory, the division area is determined by dividing the factory into a plurality of predetermined directions. Then, a divided area is allocated for each occupied area that is an area required for a work request (hereinafter referred to as “order”) and an occupied period of the occupied area. That is, in the present embodiment, the work place is considered one-dimensional, and an order is allocated on a map (hereinafter referred to as “work plan map”) in which the work place and the period are two-dimensional.

Note that the order according to the present embodiment is, for example, a work request received from a customer, for example, manufacture or repair of parts constituting the turbine. Moreover, although the work place which concerns on this embodiment is a factory as an example, it is not restricted to this, A work place may be outdoors.
The occupied area is mainly determined by the size of the part to be worked. The occupation period is determined by, for example, a work period and a delivery date for each work request.

  FIG. 1 is an example of a work plan map.

  In the example of FIG. 1, the vertical axis indicates a divided area where work places are divided, and as an example, the vertical axis is divided based on pillars in a factory. In the work plan map, passages in factories are also subject to classification, but usually the passages are not used as work places. On the other hand, the horizontal axis of the work plan map is a period, and, for example, one month is divided into three.

  Each area indicated by hatching in the work plan map is an assigned order, and the vertical length of each order corresponds to the occupation area required for the order, and the horizontal length corresponds to the occupation period. The sorting area is allocated for each order so as to satisfy the occupation area and occupation period of the order and not overlap with other orders.

  FIG. 2 is a block diagram showing an electrical configuration of the work place planning apparatus 10 according to the present embodiment. The work place planning apparatus 10 is a so-called personal computer. The work place planning apparatus 10 assigns orders to the divided areas according to the occupation area and the occupation period, and generates a work plan as shown in the work plan map.

  The work place planning apparatus 10 according to the present embodiment includes a CPU (Central Processing Unit) 12 that controls the operation of the work place planning apparatus 10 as a whole, a ROM (Read Only Memory) 14 in which various programs and various data are stored in advance, and a CPU 12. RAM (Random Access Memory) 16 used as a work area at the time of execution of various programs according to the above, and an HDD (Hard Disk Drive) 18 as storage means for storing various programs and various data.

  Further, the work place planning device 10 is configured by a keyboard, a mouse, and the like, and includes an operation input unit 20 that receives input of various operations, an image display unit 22 such as a liquid crystal display device, and other information processing devices that display various images And an external interface 24 that transmits and receives various data to and from other information processing apparatuses and printing apparatuses.

  The CPU 12, ROM 14, RAM 16, HDD 18, operation input unit 20, image display unit 22, and external interface 24 are electrically connected to each other via a system bus 26. Accordingly, the CPU 12 accesses the ROM 14, the RAM 16, and the HDD 18, grasps the operation state of the operation input unit 20, displays an image on the image display unit 22, and various types of information processing apparatuses via the external interface 24. Data can be transmitted and received.

  The operation input unit 20 receives the above-described order, absolute constraint, and consideration constraint, and the input order and various conditions are stored in the HDD 18 as order data. An absolute constraint is a constraint that cannot be changed. A consideration constraint is a constraint that can be changed, in other words, a constraint that is preferably satisfied as much as possible.

制約条件Ａ１は、オーダが要する占有面積の広さであり、何れのオーダにも当てはまる絶対制約である。制約条件Ａ２は、オーダが要する区分け領域が予め特定の区分け領域に指定されている場合の制約条件である。制約条件Ａ３は、オーダが部品を分割する作業を要し、分割作業が可能な区分け領域が限定されている場合の制約条件である。
制約条件Ａ２，Ａ３は、全てのオーダに対して設定される制約条件ではないが、制約条件Ａ２，Ａ３が設定されたオーダに対しては絶対制約となる。 Table 1 below shows examples of absolute constraints and consideration constraints. Note that the absolute constraints and consideration constraints shown in Table 1 are examples.
In addition, as will be described in detail later, the suitability of the work plan generated by the work place planning apparatus 10 is determined based on the unassigned order in which the division area is not assigned and the deviation from the consideration constraint set in the order (violation). Degree). As described above, since the restrictions are set in detail for each order, the work place planning apparatus 10 can assign a more appropriate work place to the order as a whole.

The constraint condition A1 is an area occupied by the order, and is an absolute constraint applicable to any order. The constraint condition A2 is a constraint condition when a segmented area requiring an order is designated in advance as a specific segmented area. The constraint condition A3 is a constraint condition in the case where the order requires a work for dividing a part, and a partition area in which the work can be divided is limited.
The constraint conditions A2 and A3 are not constraint conditions set for all orders, but are absolute constraints for orders for which the constraint conditions A2 and A3 are set.

  Further, the constraint condition A4 is a constraint condition set for an order for which the constraint condition A2 is not set, and is the priority of the segmented area assigned to the order. The restriction condition A5 is a restriction condition that is set in order to cause an increase in cost if work is performed at an order other than its own factory, such as another company's factory, and a restriction condition that it is desirable to minimize the unallocated order. It is.

The constraint condition B1 is the length of the period required for the work of the order, and is an absolute constraint that applies to any order. The constraint condition B2 is a constraint condition when the month and day of the occupation period are designated in advance. The constraint condition B3 is a case where a tool is necessary to perform the order work, and the order can be performed simultaneously only for the number of tools held. The tool includes a jig for fixing the component.
The constraint conditions B2 and B3 are not constraint conditions set for all orders, but are absolute constraints for orders for which this constraint condition is set.

  The constraint condition B4 is a constraint condition set for an order for which the constraint condition B2 is not set. The order completion time (hereinafter referred to as “work completion time”) does not have to be the same as the delivery date. This is a restriction condition that the work may be completed.

  Further, the constraint condition C1 is a constraint condition in which an order accuracy, which is the certainty of an order, is set for each order, and an order with a high order accuracy is preferentially allocated to a classification area.

  Further, the HDD 18 stores work place data indicating a factory division area in advance.

FIG. 3 is a schematic diagram of work place data stored in the HDD 18.
In the present embodiment, as an example, a minimum area in a factory is managed by “number”, and an area obtained by integrating a plurality of adjacent minimum areas is defined as a divided area (A, B, C, D, E,...). Further, the minimum area indicated by the number “◯” is an area that can be used as a work place. The minimum area indicated by “Δ” is a passage or the like, and is an area that is not normally used but can be used as a work place. The minimum area indicated by the number “x” is an area that cannot be used as a work place.

Further, as shown in the example of FIG. 4, the HDD 18 stores component data indicating the occupation area and the construction period as the occupation period and the priority of the segmented area for each component that can be ordered.
In the priorities of the divided areas of the component data shown in FIG. 4, the order of “◎”, “◯”, and “Δ” is the order of the divided areas that is desirable for performing work on each component. On the other hand, “x” is an undesired segmented area when performing work. Note that the priority of the segmented area is not limited to this, and may be indicated by a numerical value, for example.

In the case of a part for which two or more classification areas are designated as the priority of the classification area, the constraint condition A4 is set as a consideration restriction for the part. On the other hand, in the case of a component in which only one segmented area is designated as the priority of the segmented area, the constraint condition A2 is set as an absolute constraint for that component.
As described above, the occupation area, the occupation period, and the priority of the segmented area are set in advance for each component.

FIG. 5 is an example of order data stored in the HDD 18.
The order is managed by “id”. Further, the “advanceable period” is a period in which the work can be completed ahead of schedule based on the delivery date of the order. An order for which the advanceable period is set to “0” is an order in which the month and day of the occupation period are set and the absolute constraint indicated by the constraint condition B2 is set.
The “order accuracy” is “A”, “B”, “C”, and “D” in the order of the orders that are sure to be received. However, the order accuracy is not limited to this, and may be indicated by a numerical value such as 100% or 70%, for example.

  FIG. 6 is another example of order data, which is an example of an order that requires a tool for work or requires parts to be divided.

FIG. 7 is an example of divided workable area data indicating a segmented area that is limited as a workable area for an order that requires part division, that is, an order for which the constraint condition A3 is set.
In the example of FIG. 7, an order that requires division of a part indicates that the work can be performed only in a divided area in which any of the divided areas A to J and any of the divided areas K to P are combined.

  FIG. 8 is a functional block diagram showing functions of the work place planning apparatus 10.

  The work place planning apparatus 10 includes an allocating unit 40, an evaluating unit 42, and a priority changing unit 44, and these functions are included in the CPU 12 that executes the program.

  The assigning unit 40 assigns orders to the divided areas indicated in the work place data according to the occupation area and occupation period indicated in the order data, as well as absolute constraints and consideration constraints, and generates a work plan.

  The evaluation unit 42 evaluates the allocation by the allocation unit 40 based on an unallocated order generated by the allocation by the allocation unit 40.

  The priority changing unit 44 changes the priority of the order to which the sorting area is assigned.

  Then, when the priority of the consideration constraint is changed by the priority changing unit 44, the assigning unit 40 assigns an order to the divided area again, and the evaluating unit 42 evaluates the assignment.

  FIG. 9 is a flowchart showing a flow of work place planning processing (work place planning program) executed by the CPU 12 of the work place planning apparatus 10 according to the present embodiment. The work place planning process is executed when an instruction to start execution is input via the operation input unit 20. The execution of the work place planning process is performed every time an order is input or every preset period for reviewing the work plan. The work place planning process is a process based on the local search method.

  First, in step 100, a plurality of orders indicated in the order data stored in the HDD 18 are read out, and the orders are rearranged in the order of higher order accuracy.

  In the next step 102, the fixed orders are assigned to the sorting areas in the order of the order accuracy. The fixed order is, for example, an order in which a segmented area is specified by an absolute constraint.

  In the next step 104, the unfixed order, that is, the order not allocated in step 102 is allocated to the segmented area according to the absolute constraint and the consideration constraint, and a work plan is generated. Since the consideration constraint can be changed as described above, the segmented area is allocated to the order as much as possible while the consideration constraint is changed.

  In the next step 106, the generated work plan is evaluated based on the evaluation value calculated by the evaluation function based on the unallocated order and the degree of change of the consideration constraint. That is, the smaller the number of unallocated orders and the smaller the degree of change in consideration constraints, the higher the evaluation of the work plan and the smaller the evaluation value. A work plan having an evaluation value of “0” is the most preferable work plan.

  In the next step 108, it is determined whether or not the evaluation value is better than the best evaluation value calculated so far. If the determination is affirmative, the process proceeds to step 110. If the determination is negative, the process proceeds to step 112. To do. Note that when the work plan is generated by the first assignment and the evaluation value is calculated, there is no other evaluation value to be compared, and thus this step 108 is omitted.

  In step 110, the best value is updated, and the work plan for which the best value has been calculated is stored in the HDD 18.

  In step 112, it is determined whether or not the evaluation value is “0” or the number of work plan generations has reached a predetermined number of repetitions. In the case of an affirmative determination, the work plan for which the best value has been calculated is set as the most suitable work plan, and the work place planning process is terminated. On the other hand, in the case of negative determination, the routine proceeds to step 114.

  In step 114, the order of priority for allocating the sorting area is changed, and the process returns to step 104.

  Here, allocation, evaluation, and change of priority in the work place planning process will be described in detail. As described above, the allocation is performed by the allocation unit 40, the evaluation is performed by the evaluation unit 42, and the priority order is changed by the priority order changing unit 44.

  The allocation unit 40 sets the work completion time of the order. It is desirable that work completion time and delivery date are the same. This is because if there is a discrepancy between the work completion time and the delivery date, it is necessary to secure a storage location for the parts that have been operated. In order to secure this storage location, a cost will be generated. However, the work completion time of the order for which the consideration constraint B4 is set may be within a period in which the work can be completed ahead of schedule with reference to the delivery time, that is, between [Delivery time-Possible to advance] and delivery time. Specifically, if the delivery date is the end of December 2012 and the advanceable period is one month, the work completion time may be between the end of November 2012 and the end of December 2012.

  The assigning unit 40 sets the set delivery date as the work completion time, and determines whether or not the tool required by the order can be used in accordance with the work completion time. The case where the tool cannot be used is a case where the tool has already been used by another order. The number of tools is determined in advance according to the actual number.

  When the tool cannot be used within the occupation period according to the work completion time, the assignment unit 40 advances the work completion time within the advance possible period and determines whether the tool can be used according to the new work completion time. . For example, when one month is divided into three, the new work completion time is 10 days ahead of the delivery date.

  This is repeated as long as the tool can be moved forward until the tool can be used. If the order does not require a tool, the above process is not performed.

  Next, the assigning unit 40 assigns orders to the sorting areas. As shown in FIG. 10, the allocating unit 40 can change the sorting area together with the change of the work completion time for the order in which the priority is set in the sorting area by the consideration constraint. In this case, the evaluation unit 42 calculates the evaluation value for each different combination of the work completion time for the order and the assigned segmented area, and the combination with the best evaluation value is selected as described later.

  Note that the passage is not normally set as a segmented region, but may be used as a segmented region of the passage when it is desirable to assign an order to the segmented region across the passage.

  When the allocation unit 40 allocates a tool or a classification area to an order, the allocation unit 40 cannot allocate the tool or the classification area to other orders.

  Further, the consideration constraint may include a constraint that makes it possible to work by dividing the order. The order for which the consideration constraint is set is divided into a plurality of processes, and a plurality of different segment areas need to be allocated to all the divided processes.

  The allocation unit 40 generates such a work plan as shown in FIG. 11 by performing such allocation for each order.

  It should be noted that an order in which a tool cannot be used within an advance-possible period and an order in which a sorting area cannot be assigned are unassigned orders.

  Next, the order priority order change performed by the priority order changing unit 44 will be described with reference to FIG.

Each block 62 constituting the list 60 of FIG. 12 indicates an order, and the number of each order indicates a priority order to which a segmented area is assigned. In other words, the lower the number, the higher the priority order in which the sorting area is allocated. This list 60 is generated for each order having the same order accuracy.
An order in which “O” is described is an order to which a segmented area is allocated, and an order in which “X” is described is an unallocated order. The lower the order of priority, the higher the possibility of being unassigned. In the example of FIG. 12, orders (3), (6), (8), and (9) are unassigned orders.

Therefore, the priority changing unit 44 first selects the order in which the segmented areas are assigned in the descending order of priority (hereinafter referred to as “first allocation order”, in the example of FIG. 12, order (1)). .
Next, the priority changing unit 44 selects an unallocated order (hereinafter referred to as “latest unallocated order”, in the example of FIG. 12, order (9)) from the lowest priority.
Next, the priority changing unit 44 changes the priority of the selected latest unassigned order before the earliest assigned order, and lowers the priority of orders after the earliest assigned order by one. The priority change unit 44 repeats the change of the priority for a predetermined number of times (N1 times) within the process of step 114 once.

In this way, the priority order of the orders to which the sorting area is assigned is changed in the order list 60 having the same order accuracy.
Then, the allocation unit 40 performs the next allocation with the priority order changed in this way.

  On the other hand, even when the divided areas are assigned to all orders, the priority order changing unit 44 changes the priority order by randomly selecting and replacing two orders. The priority changing unit 44 repeats the change of the priority for a predetermined number of times (N2 times) within the process of step 114.

  The evaluation value is calculated by the evaluation unit 42 as follows.

The evaluation unit 42 evaluates the allocation by the allocation unit 40 based on the unallocated order and the degree of change of the consideration constraint.
More specifically, the evaluation unit 42 uses an unassigned order, a deviation from the priority of the classification area for the order, and a deviation from the delivery date of the work completion time of the order as evaluation indexes. That is, the degree of change of the consideration constraint is the magnitude of the deviation from the priority of the sorting area with respect to the order and the magnitude of the deviation from the delivery date of the work completion time of the order.
Then, the evaluation unit 42 calculates an evaluation value based on the evaluation index using an evaluation function, and evaluates the assignment by the assignment unit 40.

  Each evaluation index is given a penalty value as its value increases. Since the degree of weighting varies depending on the evaluation index, the penalty value varies depending on the evaluation index.

Table 2 is an example of penalty values.

As described above, the work place planning apparatus 10 according to the present embodiment includes, for each order that is a requested work, the HDD 18 that stores an occupied area that is an area required for the order and an occupied period of the occupied area, An allocation unit 40 that allocates orders according to the occupation area and the occupation period, and an unallocated order generated by the allocation, for the divided areas where the work places where work is performed are virtually divided into a plurality of areas are allocated. An evaluation unit 42 for evaluation.
As described above, the work place planning apparatus 10 virtually divides the work place, and assigns the divided area to the order according to the occupied area and the occupied period required for the order, so the size of the part to be worked is taken into consideration. Thus, a limited work place can be efficiently allocated to the order.

  As mentioned above, although this invention was demonstrated using the said embodiment, the technical scope of this invention is not limited to the range as described in the said embodiment. Various changes or improvements can be added to the above-described embodiment without departing from the gist of the invention, and embodiments to which the changes or improvements are added are also included in the technical scope of the present invention.

  The flow of the work place planning process described in the above embodiment is also an example, and unnecessary steps can be deleted, new steps can be added, and the processing order can be changed within the scope not departing from the gist of the present invention. May be.

  For example, the present invention sets the probability of reading the work plan for which the best value has been calculated as the evaluation value from the HDD 18 every predetermined number of repetitions, and when the work plan is read, the priority order is changed in step 114 based on the work plan. The order may be repeatedly assigned to the sorting area. Thereby, even if the deviation of the evaluation value of the generated work plan from the best value becomes large by repeating the assignment of orders, the deviation can be eliminated.

  Further, in the above embodiment, the case where one condition is specified (specification area designation) as the fixed order has been described. However, the present invention is not limited to this, and a plurality of conditions are included in the fixed order. May be specified. For example, in the case of fixing the order by specifying the month and date of the occupation period in addition to the designation of the division area, the allocation process to the classification area of the order for which the month and day of the occupation period are specified is added to the work place planning process The iterative process is repeated.

10 Work place planning device 18 HDD
40 Allocation unit 42 Evaluation unit

Claims (5)

For each work request that is a required work, a storage unit that stores an occupied area that is an area required for the work request and an occupation period of the occupied area;
Allocating means for allocating the work request to a divided area in which work places where work is performed are virtually divided into a plurality of areas;
Evaluation means for evaluating the assignment by the assignment means;
A work place planning device comprising:
In the work request, a first constraint that is a constraint that cannot be changed and a second constraint that is a constraint that can be changed are set.
The allocating means allocates the work request according to the occupying area, the occupying period, the first constraint, and the second constraint with respect to the division area,
The evaluation means evaluates the assignment by the assignment means based on the unassigned work request and the degree of change of the second constraint;
The second constraint is a priority assignment of the work request having a high priority of the division area assigned to the work request, a completion time of the work request, and an order accuracy .
A work place planning apparatus characterized by that . The assigning means can assign the work request to the division area within a period in which work can be completed ahead of schedule based on a delivery date of the work request,
The evaluation means is based on an evaluation value based on the number of unassigned work requests, a deviation from the priority of the division area assigned to the work requests, and a deviation from a delivery date of the completion time of the work requests. work place planning device according to claim 1, wherein evaluating the assignment by the assignment means. The first constraint includes a tool required for the work request,
The work according to claim 1 or 2 , wherein when the tool set in the work request cannot be used within the occupation period set in the work request, the allocating unit advances the completion time of the work request. Place planning device. For each work request that is a required work, a computer comprising storage means that stores an occupied area that is an area required for the work request and an occupation period of the occupied area,
Allocating means for allocating the work request to a divided area in which work places where work is performed are virtually divided into a plurality of areas;
Evaluation means for evaluating the assignment by the assignment means;
A work place planning program to function as
In the work request, a first constraint that is a constraint that cannot be changed and a second constraint that is a constraint that can be changed are set.
The allocating means allocates the work request according to the occupying area, the occupying period, the first constraint, and the second constraint with respect to the division area,
The evaluation means evaluates the assignment by the assignment means based on the unassigned work request and the degree of change of the second constraint;
The second constraint is a priority assignment of the work request having a high priority of the division area assigned to the work request, a completion time of the work request, and an order accuracy .
Work place planning program characterized by that . For each work request that is a requested work, a first step of reading from the storage means an occupied area that is an area required for the work request and an occupation period of the occupied area;
A second step of assigning the work request to a divided area in which work places where work is performed are virtually divided into a plurality of areas;
A third step for evaluating the allocation in the second step ;
A work place planning method including
In the work request, a first constraint that is a constraint that cannot be changed and a second constraint that is a constraint that can be changed are set.
The second step assigns the work request to the segmented area according to the occupied area, the occupied period, the first constraint, and the second constraint,
The third step is to evaluate the allocation by the second step based on the unallocated work request and the degree of change of the second constraint.
The second constraint is a priority assignment of the work request having a high priority of the division area assigned to the work request, a completion time of the work request, and an order accuracy.
A work place planning method characterized by that .

Images