JP3794106B2 - Data management apparatus and storage medium - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a data management apparatus and a storage medium for managing the abolition / start of lower-layer data according to the abolition / start of upper-layer data in data having a hierarchical structure.
[0002]
[Prior art]
Conventionally, in each company, due to various factors such as management policy, system strengthening, project launch, personnel reduction, etc., organizational changes are indispensable operations every year, half year, quarter. In such a personnel data management system that supports organizational change work, by providing this organization (hereinafter referred to as affiliation) with "date of start" and "date of abolition", affiliation generation management can And can be represented on the organization chart by setting the upper affiliation.
[0003]
In addition, in this personnel data management system, affiliation registration work is also performed based on the determination of the affiliation of the user himself / herself by the establishment, abolition, consolidation, etc. of the affiliation.
[0004]
[Problems to be solved by the invention]
However, in such a conventional personnel data management system, affiliation registration work is performed based on the determination of the affiliation of the user himself. For example, the registration operation is performed as specified by the user. For example, even if the higher affiliation is abolished, if the lower affiliation is not specified, data with inconvenience will be created was there.
[0005]
Specifically, the official name of a certain affiliation is displayed as “General Affairs Department General Affairs Division” by combining the “General Affairs Department” on the organization chart with the “General Affairs Department” corresponding to the higher affiliation. In this case, when the general affairs department, which is the higher affiliation, is abolished and the name is changed, the “general affairs department” part of the general affairs department, which is the lower affiliation, must be changed in the same way. If the user does not specify the data change of the subordinate affiliation, inconvenience will occur on the data.
[0006]
However, change of affiliation cannot be cleared up as a simple operation error. For this reason, affiliation registration needs to be reviewed several times, and the number of revisions increases as the number of subordinate affiliations increases, reducing the user's work efficiency.
[0007]
An object of the present invention is to improve the work efficiency associated with the start of abolition of hierarchical data by enabling batch change registration operations for the lower layer data associated with the start of abolition of certain upper layer data having a hierarchical structure. That is.
[0008]
[Means for Solving the Problems]
The invention according to claim 1
Storage means capable of storing affiliation data including an affiliation code indicating the hierarchical classification of each affiliation, start date, abolition date, and affiliation name for each affiliation within an organization having a hierarchical structure;
An input means for inputting the old upper affiliation to be abolished and its abolition date, and the new upper affiliation to be established and its establishment date,
A new affiliation code of a lower affiliation belonging to the lower rank of the new higher affiliation among the lower affiliations located under the old upper affiliation is generated based on the affiliation code of the new upper affiliation, and the generated new affiliation code And the inputted new affiliation data including the input date of the start of the new upper affiliation in the storage means, and the old affiliation of the lower affiliation that causes the abolition date of the old upper affiliation to belong to the lower order of the new higher affiliation Control means for storing in the storage means as the abolition date of affiliation data;
Drawing means for drawing an organization chart of the organization based on the content stored in the storage means;
It is characterized by having.
[0009]
According to the data management device according to claim 1, for each affiliation in an organization having a hierarchical structure, affiliation data including an affiliation code indicating a hierarchical division of each affiliation, a start date, an abolition date, and an affiliation name is obtained. When the old upper affiliation to be abolished and its abolition date, and the new upper affiliation to be established and its start date are input by the input means, the control means lower The new affiliation code of the lower affiliation belonging to the lower affiliation belonging to the new upper affiliation is generated based on the affiliation code of the new upper affiliation, and the generated new affiliation code and the input of the new upper affiliation The new affiliation data of the lower affiliation including the date is stored in the storage means, and the abolition date of the old upper affiliation is recorded as the abolition date of the former affiliation data of the lower affiliation belonging to the lower order of the new upper affiliation. It is stored in the unit, on the basis of the stored contents in the storing means, to draw an organization chart of a tissue.
[0010]
Therefore, the registration operation of the abolition / startup of the subordinate affiliation that has been performed by the user at the same time as the superordinate affiliation can be omitted, and an input error during the registration operation can be avoided. In addition, since the organization chart can be automatically changed and drawn when the affiliation date or establishment date arrives, it is not necessary for the user to change the organization chart according to the affiliation date or establishment date. It becomes. As a result, the work efficiency associated with the abolition / launch of affiliation can be improved.
[0011]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
[0012]
1 to 7 are diagrams showing an embodiment of a computer system to which a data management apparatus of the present invention is applied.
[0013]
First, the configuration will be described.
[0014]
FIG. 1 is a block diagram showing a main configuration of a computer system 1 according to the present embodiment. In FIG. 1, a computer system 1 includes a CPU 2, an input device 3, a printer 4, a display device 5, a RAM 6, a storage device 7, a storage medium 8, and the like, and each part except for the storage medium 8 is connected to a bus 9. Has been.
[0015]
A CPU (Central Processing Unit) 2 expands a system program stored in the storage device 7 and application programs designated from various application programs corresponding to the system to a program storage area (not shown) in the RAM 6, Various instructions or data input from the input device 3 are temporarily stored in the RAM 6, various processes are executed in accordance with the application program stored in the storage device 7 in accordance with the input instructions and input data, and the processing results Is stored in the RAM 6 and displayed on the display device 5. Then, the processing result stored in the RAM 6 is stored in the storage destination in the storage device 7 instructed to be input from the input device 3.
[0016]
Further, the CPU 2 executes higher-level affiliation abandonment processing described later as affiliation generation management processing associated with affiliation / establishment of the organization, and is designated according to the input upper-affiliation abolition date / start date. The affiliation code of the lower affiliation and the abolition / startup information are automatically changed and generated, and the change of the lower affiliation that generated the abolished / founded upper affiliation and the affiliation code is written to the affiliation file in the storage medium 8, and Based on the contents of the written affiliation file, the organization chart is changed and drawn and displayed on the display device 5.
[0017]
The input device 3 includes a cursor key, a numeric input key, various function keys, and the like, and outputs a pressed signal of a pressed key to the CPU 2.
[0018]
The printer 4 prints the print data input from the CPU 2 on a predetermined recording paper and outputs it, and prints the organization chart displayed on the display device 5 in the above-mentioned upper affiliation abandonment process executed by the CPU 2. Output.
[0019]
The display device 5 is composed of a CRT (Cathode Ray Tube) or the like, displays display data input from the CPU 2, and draws based on the contents of the belonging file in the above-mentioned upper affiliation abandonment start processing executed by the CPU 2. Display the organization chart.
[0020]
A RAM (Random Access Memory) 6 forms a memory area for developing various data when the CPU 2 executes the above-described various processing programs. Temporarily store data such as date, abolition date, and affiliation code.
[0021]
The storage device 7 has a storage medium 8 in which programs, data, and the like are stored in advance, and the storage medium 8 is configured by a magnetic or optical recording medium or a semiconductor memory. The storage medium 8 is fixedly attached to the storage device 7 or is detachably mounted. The storage medium 8 includes the system program, various application programs corresponding to the system, and the upper layer abolition establishment process. A program and data processed by each processing program are stored.
[0022]
Further, the program, data, and the like stored in the storage medium 8 may be configured to be received and stored from other devices connected via a communication line or the like, and further connected via a communication line or the like. Another apparatus may be provided with a storage device including the storage medium, and the program and data stored in the storage medium 8 may be used via a communication line.
[0023]
Further, the storage medium 8 stores an affiliation file in which the abolition date, the establishment date, and the generated affiliation code of the lower affiliation that are input for each upper affiliation by the upper hierarchy abolition establishment processing executed by the CPU 2 are written.
[0024]
Next, the operation of the present embodiment will be described.
[0025]
The affiliation file shown in FIG. 2 is stored in advance in the storage medium 8 of the present embodiment, and each affiliation name set in the affiliation file includes an affiliation code setting field, a start date setting field, and an abolition date setting. A column, a hierarchy level (representing the position of the hierarchy to which the affiliation belongs), a setting column and an upper hierarchy (representing the hierarchy of the affiliation to which the affiliation belongs) can be set in association with each other. In the computer system 1 according to the present embodiment, by providing the start date setting field and the abolition date setting field in the affiliation file as described above, it is possible to manage the generation of the affiliation accompanying the abolition / launch of the affiliation in the HR system. And
[0026]
First, the upper affiliation abolition establishment process executed by the CPU 2 will be described based on the flowchart shown in FIG.
[0027]
In addition, in this process of abandoning a higher affiliation, basically, a lower affiliation is not abandoned / started, but a subordinate affiliation / startup is requested by the user in the same way as a higher affiliation abandonment / startup. If the subordinate affiliation is requested to be registered for abolition / startup, the subordinate affiliation corresponding to the following conditions (1) to (3) is excluded from registration.
[0028]
(1) Subordinate affiliation for which the abolition date has been entered (2) Subordinate affiliation for which the abolition date of the upper affiliation has been entered (3) Subordinate affiliation with the same start date as the upper affiliation In FIG. Then, first, an input screen for prompting the input of the old superior affiliation name and the abolition date is displayed on the display device 5. When the old superior affiliation name and the abolition date are input (step S1), the new superior affiliation name and the start date are entered. 2 is displayed on the display device 5, and when the new higher-level affiliation name and the start date are input (step S2), the lower-level affiliation names positioned below the old higher-level affiliation names are shown in FIG. Based on the setting contents in the indicated affiliation file, a display screen is displayed in a list display format, and a designation screen is displayed on the display device 5 for prompting designation of a lower affiliation name belonging to the lower order of the new upper affiliation to be established (step S3).
[0029]
If a subordinate name is specified on this designation screen, the abolition date of the subordinate affiliation is not registered in the abolition date setting field corresponding to the subordinate affiliation in the affiliation file in FIG. It is determined whether or not it is registered on a date earlier than the abolition date of the former higher-order affiliation input in the process of S1 (step S4). If the abolition date is registered in the abolition date setting field corresponding to the subordinate affiliation and the date is before the abolition date of the old superior affiliation entered this time, the specified subaffiliation name is abolished / started When it is determined that it is not a registration target, the display returns to the lower affiliation designation screen in step S3, and the lower affiliation name is designated again.
[0030]
If the abolition date is not registered in the abolition date setting field corresponding to the subordinate affiliation, or if the abolition date registered is earlier than the abolition date of the old superior affiliation, the above step S1 It is determined whether or not the input date of abolition of the old upper affiliation is unregistered in the abolition date setting field of the old upper affiliation in the affiliation file of FIG. 2 (step S5). If the abolition date is registered in the abolition date setting field corresponding to the old upper affiliation, it is determined that the lower affiliation name specified this time is not subject to registration of abolition / startup, and the lower affiliation in step S3 above. Return to the specification screen and specify the subordinate name again.
[0031]
If the abolition date is not registered in the abolition date setting field corresponding to the old higher affiliation, the establishment date registered in the establishment date setting field corresponding to the old higher affiliation in the affiliation file of FIG. Is the same as the start date of the new affiliation input this time (step S6). If the start date of the new affiliation input this time is the same as the start date of the old higher affiliation, it is determined that the lower affiliation name specified this time is not subject to registration of abolition / startup, and the above step S3 Return to the subordinate affiliation designation screen and specify the subordinate affiliation again.
[0032]
FIG. 3 shows an example of the contents of the affiliation file registered by inputting the abolition date of the former higher affiliation with respect to the affiliation file of FIG. 2 by the processing of steps S1 to S6. In the affiliation file shown in FIG. 3, the abolition date “19940401” is registered in the abolition date setting field of “General Affairs Department” as the old superior affiliation, and the establishment date is set in the establishment date setting field of “General Affairs Department” as the new superior affiliation. “19940401” is registered.
[0033]
In addition, in step S6, if the newly entered start date input this time is not the same as the start date of the old higher rank, the lower rank name specified in step S3 is to be registered for abolition / startup. Judgment is made, the assigned code of the specified lower affiliation is made to correspond to the new upper affiliation, and the generated affiliation code is written in the affiliation code setting column corresponding to the lower affiliation name in the affiliation file of FIG. (Step S7).
[0034]
For example, for the affiliation file shown in FIG. 2, the “general affairs department” with the affiliation code “0502” is registered as a new higher affiliation like the affiliation file shown in FIG. 3, and further, as in the affiliation file shown in FIG. When “general affairs section” is designated as the subordinate affiliation of the new higher affiliation “general affairs department”, a new affiliation code “050201” for the lower affiliation “general affairs section” is generated based on the affiliation code of the new upper affiliation. Is written. In addition, when “Personnel Section” is designated as the subordinate affiliation of the new upper affiliation “General Affairs Department”, a new affiliation code “050202” for the lower affiliation “Personnel Section” is generated based on the affiliation code of the new upper affiliation. Has been written.
[0035]
Then, in step S8, it is determined whether or not there is a next lower affiliation of the lower affiliation that has generated the affiliation code with reference to the setting contents of the affiliation file. In other words, the case where the affiliation codes of “General Affairs Division” and “Human Resources Division” are generated as subordinate affiliations of the new upper affiliation “General Affairs Department” shown in FIG. Since “1 person”, “2 person”, “3 person” and the like are set, it is determined that the next lower affiliation exists, and the process returns to the process of step S3, and the lower affiliation name “1 person” is obtained. , The screen returns to the subordinate affiliation designation screen displaying a list of “2” and “3”, and designates the subordinate again.
[0036]
Then, when a lower affiliation name is specified, it is determined whether or not the lower affiliation name is to be abolished / started registration target by the determination process in steps S4 to S6, and if it is determined to be a registration target, Similarly, an affiliation code corresponding to the lower affiliation is generated based on the affiliation code of the new upper affiliation and written in the affiliation code setting field corresponding to the lower affiliation name in the affiliation file shown in FIG. 4 (step S7).
[0037]
That is, in the affiliation file shown in FIG. 4, if the affiliation name “Personnel Section” to which the affiliation code was previously written is designated, “1 Section” or “2 Section” is designated. Based on the affiliation code “050202”, the affiliation codes “05020201” and “05020202” corresponding to the lower affiliation names “1” and “2” are generated and written.
[0038]
When generating / writing the affiliation code of the lower affiliation, the start date input and registered for the new upper affiliation is also written in each start date setting column corresponding to each lower affiliation name. In the affiliation file shown in FIG. 2, the subordinate affiliation names “General Affairs Division” and “Human Resources Division” that are subordinate to the new upper affiliation “General Affairs Department”, and the subordinate affiliation names “1” and “2” that are further subordinate. In each start date setting column, the start date “19940401” is automatically registered, and the setting contents of the layer level setting column and the upper layer setting column are also automatically registered. Furthermore, the abolition date set in the abolition date setting column of the former higher-level affiliation “General Affairs Department” is the subordinate affiliation names “General Affairs Division”, “Human Resources Division”, “1”, “2” The abolition date “19940401” is automatically registered in the abolition date setting fields corresponding to “3” and “Environment Section”.
[0039]
Next, in step S8, when it is determined that there is no next lower affiliation of the lower affiliation that has generated the affiliation code with reference to the setting contents of the affiliation file, reorganization is performed based on the setting contents of the affiliation file shown in FIG. The organization chart is drawn and displayed on the display device 5 (step S9), and the upper affiliation abolition establishment process is terminated.
[0040]
An example of the organization chart drawn by the above-mentioned upper affiliation abolition establishment process is shown in FIGS. FIG. 6 is a diagram showing an organization chart drawn based on the setting contents of the belonging file shown in FIG. 2 before the abolition / establishment of affiliation. FIG. 7 shows the abolition / establishment of affiliation. FIG. 5 is a diagram showing an organization chart drawn based on the setting contents of the belonging file shown in FIG.
[0041]
As described above, in the computer system 1 according to the present embodiment, by executing the upper affiliation abandonment start process as the affiliation generation management process associated with the abolition / startup of the affiliation on the organization, Just enter the abolition / startup of the affiliation (the date of the abolition of the former higher affiliation, the start date of the new higher affiliation), and specify the lower affiliation name that is positioned below it. Since (affiliation code, start date) is automatically generated and written, the registration operation for the abolition / startup of the subordinate affiliation that was previously performed by the user at the same time as the superordinate affiliation can be omitted. Can be avoided.
[0042]
Furthermore, in the above-mentioned higher-level affiliation abandonment process, the hierarchy setting and rank setting of the specified lower affiliation at the time of a higher-level affiliation / startup are automatically set. Can be made easier. As a result, it is possible to improve the work efficiency associated with the establishment of affiliation.
[0043]
Also, in the above upper affiliation abandonment start processing, if the abolishment date set for the specified lower affiliation is set before the new higher affiliation start date entered, the date until the lower affiliation abolition date is reached During that period, the subordinate affiliation code, hierarchy setting, and order setting are changed in response to the change in the setting of the new higher affiliation, and the organization chart is reorganized and drawn based on the changed settings of the lower affiliation. However, when the subordinate affiliation date is reached, a process of deleting the subordinate affiliation from the organization chart is performed, and thereafter, a reorganization drawing process of the organization chart excluding the subordinate affiliation set with the abolition date is performed.
[0044]
In the upper affiliation abandonment start processing executed in the above embodiment, the lower affiliations corresponding to the above conditions (1) to (3) among the lower affiliations requested for registration of abolition / startup specified by the user are Although the case where it is excluded from the registration target has been described, the condition that the subordinate affiliation is excluded from the registration target may be arbitrarily set by the user according to organizational restrictions or the like.
[0045]
In addition, the above-mentioned upper-affiliation abandonment start processing target is not limited to the setting contents of the belonging file in the company organization shown in FIG. Of course, it is possible to set it as the object of the starting process.
[0046]
【The invention's effect】
According to the data processing apparatus of the first aspect of the present invention, it is possible to omit the registration operation of the abolition / startup of the subordinate affiliation, which has been performed by the user at the same time as the superordinate affiliation, and avoid an input error during the registration operation can do. In addition, since the organization chart can be automatically changed and drawn when the affiliation date or establishment date arrives, it is not necessary for the user to change the organization chart according to the affiliation date or establishment date. It becomes. As a result, it is possible to improve the work efficiency associated with the establishment of affiliation.
[0047]
According to the storage medium of the invention described in claim 2, when the old upper affiliation to be abolished and its abolition date, and the new upper affiliation to be established and the start date thereof are input by the input means, Of the subordinate affiliations located in the subordinates, a new affiliation code of the subordinate affiliation that belongs to the subordinate of the new superordinate affiliation is generated based on the affiliation code of the new superior affiliation, and the generated new affiliation code and the input of the new superior affiliation The new affiliation data of the lower affiliation including the start date is stored in the storage means, and the abolition date of the old upper affiliation is stored in the storage means as the abolition date of the lower affiliation old affiliation data belonging to the lower order of the new upper affiliation. Based on the contents stored in the means, the computer can realize the function of drawing the organization chart of the organization. As a result, it is possible to improve the work efficiency associated with the establishment of affiliation.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a main configuration of a computer system 1 according to an embodiment to which a data management apparatus of the present invention is applied.
FIG. 2 is a diagram showing an example of a belonging file stored in the storage medium 8 of FIG.
3 is a diagram showing a state in which an abolition date and an inception date are input and registered with respect to the setting contents in the affiliation file of FIG. 2 by the upper affiliation abolition establishment process of FIG. 5;
4 is a diagram showing a state in which a lower affiliation code is generated and written with respect to the setting contents in the affiliation file of FIG. 3 by the upper affiliation abandonment start process of FIG. 5;
FIG. 5 is a flowchart showing a high-level affiliation abandonment process executed by CPU 2 in FIG. 1;
6 is a diagram showing an organization chart drawn and displayed based on the setting contents in the affiliation file of FIG. 2. FIG.
7 is a diagram showing an organization chart drawn and displayed based on the setting contents in the affiliated file of FIG. 4 by the upper affiliated abolishment start process of FIG. 5;
[Explanation of symbols]
1 Computer system 2 CPU
3 Input device 4 Printer 5 Display device 6 RAM
7 Storage device 8 Storage medium 9 Bus

Claims (2)

Storage means capable of storing affiliation data including an affiliation code indicating the hierarchical division of each affiliation, start date, abolition date, and affiliation name for each affiliation in an organization having a hierarchical structure;
An input means for inputting the old upper affiliation to be abolished and its abolition date, and the new upper affiliation to be established and its inception date,
A new affiliation code of a lower affiliation belonging to the lower rank of the new upper affiliation among the lower affiliations located under the old upper affiliation is generated based on the affiliation code of the new upper affiliation, and the generated new affiliation code And the inputted new affiliation data including the input date of the start of the new upper affiliation in the storage means, and the old affiliation of the lower affiliation that causes the abolition date of the old upper affiliation to belong to the lower order of the new higher affiliation Control means for storing in the storage means as the abolition date of affiliation data;
Drawing means for drawing an organization chart of the organization based on the contents stored in the storage means;
A data management device comprising: Computer
Storage means capable of storing affiliation data including an affiliation code indicating the hierarchical division of each affiliation, start date, abolition date, and affiliation name for each affiliation in an organization having a hierarchical structure,
An input means for inputting the old superior affiliation to be abolished and its abolition date, and the new superior affiliation to be established and its establishment date,
A new affiliation code of a lower affiliation belonging to the lower rank of the new upper affiliation among the lower affiliations located under the old upper affiliation is generated based on the affiliation code of the new upper affiliation, and the generated new affiliation code And the inputted new affiliation data including the input date of the start of the new upper affiliation in the storage means, and the old affiliation of the lower affiliation that causes the abolition date of the old upper affiliation to belong to the lower order of the new higher affiliation Control means for storing in the storage means as the abolition date of affiliation data;
Drawing means for drawing an organization chart of the organization based on the contents stored in the storage means;
A storage medium storing a program for functioning as a storage medium.

Images