Information processing method, information processing system, server, and program

Abstract

To support allocating resources to tasks.SOLUTION: An information processing method causes a computer to execute: an extraction step of extracting two or more tasks corresponding to at least one common allocation candidate resource in allocation candidate resource groups of a plurality of tasks for which the allocation candidate resource groups are registered, respectively; a first display step of displaying the two or more tasks and the allocation candidate resources included in allocation candidate resource groups corresponding to the two or more tasks; an accepting step of repeatedly accepting operations of a user to temporarily allocate one allocation candidate resource to one task of the two or more tasks, the one allocation candidate resource being included in an allocation candidate resource group corresponding to the one task; and a second display step of displaying the two or more tasks, and the temporary allocation resources which are allocation candidate resources temporarily allocated to the two or more tasks.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present disclosure relates to an information processing method, an information processing system, a server, and a program. [Background technology]

[0002] The matching system described in Patent Document 1 aims to achieve good matching between projects and human resources in system development (for example, paragraph 0009 of Patent Document 1). To achieve this aim, the matching system uses information about the project to be developed (period, price, skills) and information about the human resources (timing, price, skills, deliverables, evaluation) to calculate a basic score (basic information score) and a skill score (effective score) regarding the compatibility between the project and the human resources, and calculates an integrated score (integrated score) regarding the compatibility between the project and the human resources based on both scores (for example, claim 1 of Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent Publication No. 7304302 Summary of the Invention [Problem to be solved by the invention]

[0004] However, as mentioned above, the above-mentioned matching systems, while taking into consideration the skills required by the job and the skills possessed by the person, only manage to match one job with one person who is best suited to the job.

[0005] An object of the present disclosure is to provide an information processing method, an information processing system, a server, and a program that support the allocation of resources to cases. [Means for solving the problem]

[0006] An information processing method according to one aspect of the present disclosure includes: an extraction step of extracting, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display step of displaying the two or more jobs and the allocation candidate resources included in a group of allocation candidate resources corresponding to the two or more jobs; a receiving step of repeatedly receiving a request from a user to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job; The computer executes a second display step of displaying the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs. [Effects of the Invention]

[0007] According to the information processing method disclosed herein, it is possible to allocate the plurality of resources to the plurality of cases, and further, it is possible to allocate the plurality of resources so as to satisfy all of the conditions of the plurality of cases. [Brief explanation of the drawings]

[0008] [Figure 1] 1 shows the configuration of an information processing system JSS according to a first embodiment. [Figure 2] 2 shows the configuration of a terminal TM according to the first embodiment. [Figure 3] 1 shows the configuration of a server SV according to the first embodiment. [Figure 4] 1 shows a storage unit KI(SV) of a server SV in the first embodiment. [Figure 5] Attributes ZS of project AK and personnel JZ in embodiment 1 are shown. [Figure 6] 1 shows a condition JK of a case AK in the first embodiment. [Figure 7] Attributes ZS of human resource JZ in embodiment 1 are shown. [Figure 8]1 shows a group of candidate human resources WKJG for allocation and candidate human resources WKJ for allocation in the first embodiment. [Figure 9] 4 is a flowchart showing the operation of the information processing system JSS according to the first embodiment. [Figure 10] 10 shows an example of a human resource list presented in a resource list output step of the first embodiment. [Figure 11] 10 shows an example of a case list presented in a case list output step of the first embodiment. [Figure 12] 1 shows the case AK, allocation candidate talent WKJ, and provisionally allocated talent KWJ of the first embodiment. [Figure 13] 10 shows a tentative allocation of allocation candidate talent WKJ in the first embodiment (part 1). [Figure 14] 10 shows the provisional allocation of allocation candidate talent WKJ in the first embodiment (part 2). [Figure 15] 10 shows the provisional allocation of allocation candidate talent WKJ in embodiment 1 (part 3). [Figure 16] 10 shows the provisional allocation of allocation candidate talent WKJ in embodiment 1 (part 4). [Figure 17] 10 shows the provisional allocation of allocation candidate talent WKJ in embodiment 1 (part 5). [Figure 18] 10 shows the provisional allocation of allocation candidate talent WKJ in embodiment 1 (part 6). [Figure 19] 10 shows the provisional allocation of allocation candidate talent WKJ in embodiment 1 (part 7). [Figure 20] 8 shows the provisional allocation of the allocation candidate talent WKJ in the first embodiment (part 8). [Figure 21] 9 shows the provisional allocation of the allocation candidate talent WKJ in the first embodiment (part 9). [Figure 22] 10 shows the tentative allocation of the allocation candidate talent WKJ in the first embodiment (part 10). [Figure 23] 10 shows the operation of the information processing system JSS according to the first modification of the first embodiment. [Figure 24] 10 shows the operation of the information processing system JSS according to the second modification of the first embodiment. [Figure 25] 10 is a flowchart showing the operation of the information processing system JSS according to the second embodiment. [Figure 26] Calculation of the condition sum JG in the second embodiment is shown below. [Figure 27] Calculation of the attribute total ZG in the second embodiment is shown below. [Figure 28] 1 shows the hardware configuration of the information processing system JSS according to the first and second embodiments. [Figure 29] 1 shows a hardware configuration based on software realization of the information processing system JSS of the first and second embodiments. DETAILED DESCRIPTION OF THE INVENTION

[0009] An embodiment of an information processing system according to the present disclosure will be described.

[0010] First Embodiment The information processing system JSS according to the first embodiment will be described.

[0011] Configuration of First Embodiment FIG. 1 shows the configuration of the information processing system JSS according to the first embodiment.

[0012] <Configuration of the information processing system JSS> The information processing system JSS of the first embodiment includes a terminal TM and a server SV, as shown in Fig. 1. The terminal TM and the server SV are connected via a network NW (e.g., the Internet). The terminal TM is used by a user US (e.g., a company employee).

[0013] <Configuration of Terminal TM> FIG. 2 shows the configuration of the terminal TM according to the first embodiment.

[0014] As shown in FIG. 2, the terminal TM has an input / output unit NY(TM), a processing unit SY(TM), a storage unit KI(TM), and a communication unit TU(TM).

[0015] The input / output unit NY(TM) may, for example, (1) display the project AK (shown in FIGS. 4 and 8) and the allocation candidate talent WKJ (shown in FIG. 8) to the user US, (2) be used by the user US to provisionally allocate the allocation candidate talent WKJ to the project AK (shown in FIG. 13, for example), and (3) display the project AK and the provisionally allocated talent KWJ (shown in FIG. 13, for example) to the user US. The input / output unit NY(TM) may, for example, be a keyboard, a mouse, an LCD monitor, a printer, or a touch panel.

[0016] The processing unit SY(TM) controls and monitors the overall operation of the terminal TM, and performs processing related to, for example, input / output by the input / output unit NY(TM), storage by the memory unit KI(TM), and communication by the communication unit TU(TM).

[0017] The storage unit KI(TM) stores, for example, data necessary for processing by the processing unit SY(TM).

[0018] The communication unit TU(TM) communicates with the server SV via the network NW.

[0019] <Server SV configuration> FIG. 3 shows the configuration of the server SV in the first embodiment.

[0020] As shown in FIG. 3, the server SV of the first embodiment includes a processing unit SY(SV), a storage unit KI(SV), and a communication unit TU(SV).

[0021] The processing unit SY(SV) controls and monitors the overall operation of the server SV, and performs processing related to storage by the storage unit KI(SV) and communication by the communication unit TU(SV), for example.

[0022] The storage unit KI(SV) stores, for example, data necessary for processing by the processing unit SY(SV).

[0023] The communication unit TU (SV) communicates with the terminal TM via the network NW.

[0024] <Job Database DB (AK), Human Resources Database DB (JZ)> FIG. 4 shows the storage unit KI(SV) of the server SV of the first embodiment.

[0025] The storage unit KI(SV) (shown in FIG. 3) of the server SV has a case database DB(AK) and a human resources database DB(JZ) as shown in FIG.

[0026] As shown in Fig. 4, the project database DB(AK) includes multiple projects AK, more specifically, project A, project B, project C, etc. Project A, project B, project C, etc. are, for example, consulting jobs for which multiple companies request the provision of human resources JZ.

[0027] As shown in Fig. 4, the human resources database DB(JZ) includes multiple human resources JZ, more specifically, human resources S, human resources T, human resources U, etc. Human resources S, human resources T, human resources U, etc. are people who are familiar with consulting work and can be assigned to, for example, the above-mentioned projects A, B, C, etc.

[0028] <Conditions JK for Project AK, Attributes ZS for Personnel JZ> FIG. 5 shows attributes ZS of a job AK and a human resource JZ in the first embodiment.

[0029] At least one condition JK is set for each project registered in the project database DB(AK). A "condition JK" is a requirement for a project AK, such as the amount of money (which may be the client's budget for the project or an estimated amount set by the contractor depending on the project content), man-hours, the skills required of the personnel in charge (e.g., strategic consulting skills, integrated consulting skills, accounting consulting skills, the required background of the personnel in charge, the required qualifications of the personnel in charge, etc.), and a schedule (e.g., information indicating the planned period for executing the project, delivery date, etc.). A "man-hour" is information indicating the amount of work required to complete a project AK, and the unit of man-hours may be, for example, "person-hours (a unit representing the amount of work one person can complete in one hour), "person-days (a unit representing the amount of work one person can complete in one day), "person-months (a unit representing the amount of work one person can complete in one month)," etc. Each project AK may be set with any one of the above conditions JK, or multiple conditions JK may be set. For example, as shown in Figure 5, multiple conditions JK are defined for project A, more specifically, amount, labor hours, skills, schedule, etc.

[0030] Each project AK registered in the project database DB(AK) may have at least one slot to which one talent JZ is assigned. In other words, one project AK may be handled by one talent JZ, or by multiple talents JZ according to the number of slots. The number of slots in each project AK is not particularly limited, and the number of slots may be set appropriately depending on the content of each project AK. The above conditions JK may be set for each slot, or the content of the conditions JK set for each slot may be different. In other words, multiple slots may be set for one project AK, and corresponding conditions JK may be set for each of the multiple slots.

[0031] Furthermore, information about each project AK registered in the project database DB(AK) may include information about the probability of receiving an order. "Probability of receiving an order" is information indicating the possibility that the project AK will result in an order from a customer, and may be expressed as a numerical value such as a percentage, with a confirmed order being 100%, or may be expressed as a graded evaluation such as "confirmed order," "high probability of receiving an order," "medium probability of receiving an order," "low probability of receiving an order," or "unknown."

[0032] Information about each talent JZ included in the talent database DB includes at least one attribute ZS of the talent JZ. Examples of the "attributes" of a talent JZ include monetary value (price), man-hours, skills (e.g., strategic consulting skills, integrated consulting skills, financial consulting skills, the talent's past career history, and the talent's qualifications), and job title. The "man-hours" attribute ZS of a talent JZ may be expressed as the talent JZ's utilization rate or as the available man-hours that can be allocated to new projects. If a talent JZ handles not only external project-related tasks but also internal tasks such as internal clerical work, the man-hours required for such internal tasks may be subtracted from the basic man-hours and registered as the available man-hours in the talent database DB. Furthermore, if a talent JZ has an ongoing project that has already been assigned to it, the available man-hours may be calculated by subtracting the man-hours of the assigned project from the available man-hours and registered in the talent database DB. Furthermore, the "amount" as an attribute ZS of a talent JZ may be, for example, an amount equivalent to the talent JZ's salary for a specified period, a unit price per project, or a unit price per unit of man-hours. If a talent JZ also handles internal work, the actual unit price calculated by multiplying the basic unit price per specified period by the allocable man-hours may be registered in the talent database DB as the amount of the talent JZ.

[0033] The information about each human resource JZ may include any one of the above attributes ZS, or multiple attributes ZS may be set. For example, as shown in FIG. 5, a human resource S has multiple attributes ZS, more specifically, amount (price), man-hours, skill, etc. Furthermore, the information about each human resource JZ may include information about the schedule of each human resource JZ in addition to information about the above attributes ZS.

[0034] <Conditions JK for project AK, attributes ZS for talent JZ, and candidate talent group WKJG for allocation> FIG. 6 shows the condition JK of the case AK in the first embodiment.

[0035] FIG. 7 shows attributes ZS of a human resource JZ in the first embodiment.

[0036] In the following, for ease of explanation and understanding, it is assumed that the lowercase letters s, t, u, etc. indicate the conditions JK specified in project AK, i.e., projects A, B, C, etc., and also indicate the attributes ZS possessed by human resources JZ, i.e., human resources S, T, U, etc.

[0037] As shown in Figure 6, for example, project A has conditions JK specified as amounts s, t, u, man-hours s, t, u, and skills s, t, u. In other words, the suitable personnel JZ to be assigned to project A are personnel JZ with amounts s, t, u, man-hours s, t, u, and skills s, t, u, as shown in Figure 7, i.e., personnel S, T, and U.

[0038] Furthermore, for example, project B has conditions JK stipulating amounts s, u, v, w, man-hours s, u, v, w, and skills s, u, v, w. In other words, the suitable personnel JZ to be assigned to project B are personnel JZ with amounts s, u, v, w, man-hours s, u, v, w, and skills s, u, v, w, as shown in Figure 7, i.e., personnel S, U, V, and W.

[0039] The above-mentioned cases A and B share conditions JK in that they are suitable for talent S and U, but on the other hand, they differ in conditions JK in that case A has talent T as a suitable talent JZ in addition to talent S and U, and case B has talent V and W as suitable talent JZ in addition to talent S and U.

[0040] On the other hand, as shown in Figure 7, for example, human resource S has attributes ZS specified as amount s, labor hours s, and skill s.In other words, as shown in Figure 6, human resource S is suitable for assignment to project A, which has specified amount s, labor hours s, and skill s.

[0041] For example, talent T has attributes ZS defined as amount t, man-hours t, and skill t. In other words, as shown in Figure 6, talent T is suitable for assignment to projects A and D, which have specified amount t, man-hours t, and skill t.

[0042] The above-mentioned human resources S and T may differ from each other in terms of amount s and amount t, and therefore their attributes ZS may differ from each other as a whole; similarly, their labor hours s and labor hours t may differ from each other, and therefore their attributes ZS may differ from each other as a whole; and similarly, their skills s and skills t may differ from each other, and therefore their attributes ZS may differ from each other as a whole.

[0043] The server SV of the first embodiment generates a group of candidate talents WKJG for allocation for each project AK, as shown in Fig. 6. The group of candidate talents WKJG for allocation is a collection of one or more talents JZ selected as candidates to be allocated to each project AK.

[0044] As shown in Figure 6, for example, the group of candidate talents for allocation WKJG(A) is a group of talents S, T, and U who are candidates for allocation to project A, and similarly, the group of candidate talents for allocation WKJG(B) is a group of talents S, U, V, and W who are candidates for allocation to project B, and similarly, the group of candidate talents for allocation WKJG(D) is a group of talents T and U who are candidates for allocation to project D.

[0045] <Allocation candidate talent WKJ> FIG. 8 shows the allocation candidate group WKJG and allocation candidate WKJ in the first embodiment.

[0046] As shown in Figure 8, for example, between Project A, Project B, and Project D, there is some commonality in the talent JZ that can be assigned, in other words, the talent JZ that is a candidate for assignment (hereinafter referred to as "candidate talent WKJ for assignment").

[0047] More specifically, for example, between the group of candidate talents WKJG(A) for allocation of project A and the group of candidate talents WKJG(B) for allocation of project B, talent S is common as the candidate talent for allocation WKJ.

[0048] Furthermore, between the group of candidate talents for allocation WKJG(A) for project A and the group of candidate talents for allocation WKJG(D) for project D, talent T is common as a candidate talent for allocation WKJ.

[0049] Furthermore, the group of candidate talents for allocation WKJG(A) for project A, the group of candidate talents for allocation WKJG(B) for project B, and the group of candidate talents for allocation WKJG(D) have talent U in common as the candidate talent for allocation WKJ.

[0050] Here, as shown in Figure 8, the above-mentioned "common" means (1) that, for example, it is sufficient that at least one person S is common between projects A and B; in other words, it is not necessary that two or more people S and U are common between projects A and B; and (2) that, for example, it is sufficient that one person S is common between two projects A and B; in other words, it is not necessary that one person U is common between three or more projects A, B, and D.

[0051] Correspondence The processing unit SY (SV) in embodiment 1 corresponds to the "extraction unit," "reception unit," "first display output unit," and "second display output unit" in the claims, the input / output unit NY (TM) in embodiment 1 corresponds to the display on which the processing results by the "first display output unit" and "second display output unit" in the claims are displayed, and the input device (e.g., touch panel, keyboard, mouse, etc.) on which the user US performs selection operations in the "reception unit," and the talent JZ, candidate talent for allocation WKJ, and candidate talent group for allocation WKJG in embodiment 1 correspond to the "resource," "candidate resource for allocation," and "candidate resource group for allocation," respectively, in the claims.

[0052] Operation of the First Embodiment The operation of the information processing system JSS of the first embodiment will be described.

[0053] FIG. 9 is a flowchart showing the operation of the information processing system JSS according to the first embodiment.

[0054] The operation of the information processing system JSS of the first embodiment will be described with reference to the flowchart of FIG.

[0055] On the display screen of terminal TM before step ST11, multiple cases AK (cases A, B, C, etc.) and conditions JK (conditions s, t, u, etc.) contained in the case database DB(AK) may be displayed in a matrix format as illustrated in Figure 6, under transmission from the communication unit TU(SV) of server SV, or multiple talents JZ (talent S, T, U, etc.) and attributes ZS (attributes s, t, u, etc.) contained in the talent database DB(JZ) may be displayed in a matrix format as illustrated in Figure 7.

[0056] Alternatively, the display screen of the terminal TM may display a UI (user interface) for setting up a case AK for registering the case AK in the system based on a request from the user US. The server SV may accept the selection of the allocation candidate talent WKJ by the user US in step ST11 via the UI for setting up the case.

[0057] Step ST11: The user US uses the terminal TM to select at least one candidate talent WKJ for allocation to one job AK, and the selection by the user US is transmitted to the server SV. This selection of candidate talent WKJ for allocation by the user US is performed for each job AK.

[0058] 6, for example, the user US selects talents S, T, and U as candidate talents WKJ to be assigned to project A in accordance with the conditions JK of project A. For other projects B-E, candidate talents WKJ to be assigned are selected in the same manner as project A in accordance with the conditions JK set for each project AK.

[0059] When the user US selects candidate talents WKJ for allocation, the server SV may first transmit a list of talents JZ registered in the talent database DB to the terminal TM (resource list output process). This list of talents JZ may be a list sorted in the order in which they are registered in the talent database DB, or a list of talents JZ corresponding to a single job for which candidate talents WKJ are being selected. In the latter case, the server SV receives from the user US the designation of a single job AK for which candidate talents WKJ are being selected, and reads out the conditions JK set for that single job. The server SV then performs a process of sorting the multiple talents JZ registered in the talent database DB so that talents JZ that meet the conditions of a single job AK are placed at the top of the list by comparing the attributes ZS of each talent JZ registered in the talent database DB with the conditions JK set for the single job AK. Through this sorting process, the server SV outputs a list of talents JZ corresponding to the single job AK. In other words, a list of talent JZ corresponding to one project AK means a list in which talent JZ who meet the conditions JK of one project AK are placed at the top of the list.

[0060] In the resource list output process described above, the server SV may calculate the matching rate of each talent JZ for a project AK. For example, if multiple conditions JK are set for one project AK, the matching rate of each talent JZ for one project AK may be calculated for each talent JZ by using the number of items in the set conditions JK as the denominator and the number of items in the conditions JK that are satisfied by the attributes ZS of each talent JZ as the numerator. In other words, if one talent JZ satisfies only the amount condition JK out of the three conditions JK of a project AK (amount, labor hours, and skills), the matching rate of that talent JZ for the project AK is calculated to be "1 / 3 (approximately 33%)."

[0061] Alternatively, the matching rate may be calculated for each item of the conditions JK. For example, if three types of conditions JK, namely, amount, man-hours, and skills, are set for one project AK, the server SV may calculate the matching rate for amount, the matching rate for man-hours, and the matching rate for skills for each talent JZ.

[0062] In this case, the skill matching rate may be calculated, for example, using the following method: If four types of skills are set in the skill conditions JK of a single project AK, the number of set skills is used as the denominator and the number of skills satisfied by each talent JZ is used as the numerator to calculate the skill matching rate of each talent JZ for that project AK. In other words, the skill matching rate of a talent JZ who has only one of the four skills set for a single project AK is calculated to be "1 / 4 (25%)."

[0063] The matching rate for monetary amounts may be calculated, for example, using the following method. If one project AK is scheduled for four months from April to July 2024, and the budgeted amount for one project AK (condition JK) is set on a monthly basis, the percentage of months in which the budgeted amount (condition JK) exceeds the unit price (attribute ZS) of each talent JZ (in other words, the percentage of months in which "unit price ≦ budget" is met) is calculated as the matching rate for monetary amounts. The unit price of each talent JZ when calculating the matching rate may be the "actual unit price" or the "basic unit price."

[0064] The matching rate for man-hours may be calculated in the same way as the matching rate for monetary amounts. For example, if one project AK is scheduled for four months from April to July 2024, and the man-hours required for one project AK (condition JK) are set on a monthly basis, the percentage of months in the four months in which the man-hours of each talent JZ (which may be the basic man-hours, the allocable man-hours, or the available man-hours) exceed the man-hours of the project AK (in other words, the percentage of months in the four months in which the condition "man-hours of the project ≦ man-hours of the talent") is met is calculated as the matching rate for man-hours.

[0065] In addition, the matching rate may be calculated by combining some of the multiple conditions. For example, the matching rate may be calculated by combining the amount and labor hours. If one project AK is scheduled for four months from April to July 2024, the percentage of months in which each talent JZ meets both the conditions "unit price ≦ budget" and "project labor hours ≦ talent labor hours" may be calculated as the matching rate for the amount and labor hours.

[0066] When the matching rate of each talent JZ for a project AK is calculated as described above, the server SV may output a list of talent JZ by sorting the multiple talent JZs registered in the talent database DB in descending order of matching rate, so that talent JZs with higher matching rates are placed higher in the list. FIG. 10 shows an example of a list of talent JZs sorted based on matching rate. When the matching rate is calculated for each condition JK, a priority order for sorting may be set, or sorting may be performed based on the total matching rate for multiple conditions JK (FIG. 10 illustrates the latter case). When a priority order is set, for example, the skill matching rate may be given first priority, and the talent JZs may be sorted in descending order of skill matching rate. Then, for groups of talent JZs with the same skill matching rate, the talent JZs for each group of talent JZs may be sorted in descending order of "amount and labor hours" matching rate.

[0067] The list of talent JZ generated by the server SV is sent to the terminal TM and presented on the display screen of the terminal TM. The user US selects one or more candidate talents WKJ to be assigned to a single project AK via the list displayed on the terminal TM. The server SV accepts the selection by the user US and generates a group of candidate talents WKJG to be assigned in step ST, which will be described later. By selecting candidate talents WKJ to be assigned based on the list of talents JZ sorted as described above, it becomes easier to find talents JZ suitable for each project AK, and it also becomes easier to individually optimize talent allocation for each project AK.

[0068] 6-8 illustrate an example in which talent JZ who meets the conditions JK set for each project AK are selected as allocation candidate talent WKJ, but the present invention is not limited to such a case, and talent JZ who do not meet some or all of the conditions JK set for the project AK may be selected as allocation candidate talent WKJ. Furthermore, if at least one slot is set for a project AK, allocation candidate talent WKJ for one project AK may be selected for each slot included in the project AK. In this case, the server SV accepts the user US's selection of allocation candidate talent WKJ for each slot and generates an allocation candidate talent group WKJG for each slot.

[0069] Step ST12: The processing unit SY(SV) of the server SV accepts the selection of allocation candidate talent WKJ for each project AK by the user US in step ST11, and generates an allocation candidate talent group WKJG for each project AK (generation process). For example, as illustrated in Fig. 6, the processing unit SY(SV) generates an allocation candidate talent group WKJG(A) including talents S, T, and U who are allocation candidate talent WKJ for project A. For the other projects B-E, similarly to project A, an allocation candidate talent group WKJG is generated including one or more talents JZ designated as allocation candidate talent WKJ by the user US.

[0070] Step ST13: In the server SV, the processing unit SY (SV) extracts cases AK having common allocation candidate human resources WKJ among a plurality of cases AK (cases A, B, C, . . . ).

[0071] As shown in FIG. 8, the processing unit SY (SV) extracts the cases A and B from among the cases A to E because the talent S, who is the allocation candidate talent WKJ, is common to the cases A and B.

[0072] As shown in FIG. 8, the processing unit SY (SV) extracts the cases A and D from among the cases A to E because T, who is the allocation candidate human resource WKJ, is common to the cases A and D.

[0073] As shown in FIG. 8, the processing unit SY (SV) extracts the cases A, B, and D from among the cases A to E because U, who is the allocation candidate human resource WKJ, is common to the cases A, B, and D.

[0074] To summarize the above, the processing unit SY (SV) extracts cases A, B, and D from cases A to E as shown in FIG.

[0075] The extraction process by the processing unit SY (SV) exemplified in step ST13 may be performed by accepting the designation of a predetermined period (for example, one month from January 1 to January 31, 2024) and then identifying projects within that predetermined period that share a common allocation candidate talent WKJ. Alternatively, the extraction process exemplified in step ST13 may be performed by accepting the designation of any one project AK from among multiple projects AK to which talent JZ will be assigned. In this case, if a planned schedule is registered for the specified project AK, other projects AK that share at least one allocation candidate talent WKJ set for the specified project AK may be identified during the schedule period. Alternatively, during the extraction process, the designation of any one talent JZ registered in the talent database DB may be accepted, and projects AK in which the talent JZ is included as a common allocation candidate talent WKJ may be extracted.

[0076] Before the extraction process of step ST13, the server SV may present a case list including multiple cases AK to the user US (case list output process). For example, the server SV may accept a designation of a predetermined period (e.g., April 2024 (one month)) from the user US, extract cases AK that are scheduled for the period designated by the user US from the case database DB, and output a case list consisting of the extracted cases AK.

[0077] In this case list output step, the server SV may refer to the information regarding the order probability registered for each case AK in the case database DB and output a case list in which the cases AK are sorted based on the order probability. For example, the server SV may extract cases AK for which the allocation of a human resource JZ has not been completed during the period specified by the user US, sort these extracted cases AK in descending order of order probability, and output the case list. Specifically, if the order probability of each case AK is expressed as a graded evaluation of "Order Confirmed," "Order Probability: High," "Order Probability: Medium," and "Order Probability: Low or Unknown," the cases AK are sorted in descending order of order probability based on this graded evaluation (i.e., in the order of "Order Confirmed," "Order Probability: High," "Order Probability: Medium," and "Order Probability: Low or Unknown"). Figure 11 shows an example of a case list sorted by order probability. The allocation of a human resource JZ to cases AK for which an order has been confirmed should be performed with the highest priority. For cases AK for which an order has not been confirmed, the allocation of a human resource JZ should be performed with priority given to cases AK with a high probability of being accepted. By presenting the user US with a list of projects sorted by probability of receiving the order as described above, the user US can see at a glance which projects AK should be assigned to the talent JZ as a priority.

[0078] When sorting the cases AK based on the probability of receiving an order as described above, if there are multiple cases AK with the same level of probability of receiving an order, the server SV may sort the two or more cases AK with the same level of probability of receiving an order in descending order of the number of slots to which talent JZ has not yet been assigned, and output the case list. In Figure 11, of the cases XX and YY in the "confirmed order" state, case XX has more "undetermined slots" to which talent JZ has not yet been assigned than case YY, so case XX is ranked higher than case YY. In Figure 11, cases with "high probability of receiving an order," "medium probability of receiving an order," and "low or unknown probability of receiving an order" are also sorted in descending order of the number of "undetermined slots." Sorting the cases AK in this manner makes the allocation priority clearer.

[0079] 11 may include a project that is "confirmed" and for which the allocation of human resource JZ has been completed during the period specified by user US (for example, project YZ in FIG. 11). Such a project that is "confirmed" and "allocation completed" may be placed at the bottom of the project list.

[0080] Furthermore, when outputting a project list such as that shown in FIG. 11, the server SV may display an "unassigned" icon for each project AK in a manner that allows the user US to ascertain whether or not a group of allocation candidates WKJG is registered in the unassigned slot and / or the number of allocation candidates WKJ registered in the unassigned slot. In FIG. 11, the number attached to the "unassigned" icon indicates the number of allocation candidates WKJ registered in the unassigned slot. If the "unassigned" icon does not have a number attached, it indicates that no allocation candidates WKJ have been selected for the unassigned slot (i.e., no allocation candidates WKJG have been registered). By displaying the unassigned slot icon in this manner, the user US can check at a glance the setting status of the allocation candidates WKJ and can also at a glance as to which projects AK should be prioritized for allocation candidates WKJ. Note that by designating (tapping or clicking) an unassigned slot icon without a number, the process proceeds to step ST11, where the server SV presents a UI for accepting the user US's selection of allocation candidates WKJ.

[0081] In the extraction process of step ST13, the server SV may accept from the user US the specification of a project AK or slot that will be the starting point of the extraction process via a project list such as the one shown in FIG. 11. For example, if the user US selects the unassigned slot of project YY in FIG. 11 (an unassigned slot with four assigned candidate talents WKJ selected) as the starting point of the extraction process, the server SV identifies the assigned candidate talents WKJ (four people) registered in the selected unassigned slot and identifies other project AKs that include one or more of the identified assigned candidate talents WKJ as assigned candidate talents WKJ. Through this process, the server SV extracts project YY and other project AKs that overlap with project YY in terms of at least one assigned candidate talent WKJ. By using a sorted project list such as the one shown in FIG. 11, the extraction process can be performed more efficiently.

[0082] Note that, when the extraction process of step ST13 is executed after accepting the designation of project AK and / or talent JZ, a stepwise extraction process may be executed. For example, when the designation of talent S is accepted, project A and project B, which include talent S as allocation candidate talent WKJ, are extracted. After this extraction, allocation candidate talent WKJ (talents T, U, V, and W) other than talent S set in the extracted projects A and B are identified. Then, another project (project D in this example) including one or more of the identified talents T, U, V, and W as allocation candidate talent WKJ may be extracted, and this extraction result (project D) may be reflected in the initial extraction result (projects A and B) to output the final extraction result (projects A, B, and D). The same applies when project AK is designated. For example, when the designation of project A is accepted, talents S, T, and U set as allocation candidate talent WKJ in project A are identified. Then, other projects (projects B and D) including one or more of talents S, T, and U as allocation candidate talent WKJ are extracted. After this extraction, candidate talents WKJ for allocation other than talents S, T, and U set in the initially extracted projects B and D (talents V and W who are not set in project A but are set in project B or D) are identified. Then, other projects that include one or more of the identified talents V and W as candidate talents WKJ for allocation may be extracted, and this extraction result may be reflected in the initial extraction results (projects A, B, and D). For example, if there is a project G in which talents V and W have been selected as candidate talents WKJ for allocation, this project G may be included in the extraction results illustrated in FIG. 8.

[0083] FIG. 12 shows the job AK, allocation candidate talent WKJ, and provisionally allocated talent KWJ in the first embodiment.

[0084] Step ST14: In the server SV, the communication unit TU(SV) transmits the job AK and the allocation candidate human resources WKJ to the terminal TM, and the terminal TM displays the received job AK and allocation candidate human resources WKJ.

[0085] More specifically, as shown in Figure 12, the communication unit TU (SV) of the server SV transmits the above-mentioned extracted cases A, B, D, talents S, T, U who are candidate talents WKJ for assignment for case A, talents S, U, V, W who are candidate talents WKJ for assignment for case B, and talents T and U who are candidate talents WKJ for assignment for case D, while the terminal TM displays, for example, the above-mentioned cases A, B, D and the above-mentioned talents S, T, U, V, W in a matrix format as shown in Figure 12 (however, at this point, the provisionally assigned talent KWJ column is blank).

[0086] For example, for project A, terminal TM may rearrange and display talents S, T, and U who are candidate talents WKJ for allocation in an order more suitable for project A, and similarly, may rearrange and display talents S, U, V, and W who are candidate talents WKJ for allocation for another project B, and talents T and U who are candidate talents WKJ for allocation for another project D.

[0087] 13 to 22 show the provisional allocation of the allocation candidate talent WKJ in the first embodiment.

[0088] Step ST15: User US, while referring to the cases AK (cases A, B, D) and the candidate talents WKJ (talent S, T, U, V, W) (shown in Figure 12) displayed in matrix format on terminal TM, provisionally assigns talent JZ from among talents S, T, U, V, W whom he / she wishes to provisionally assign to cases A, B, D, and transmits to server SV that talent JZ has been provisionally assigned.

[0089] Step ST16: In the server SV, the communication unit TU(SV) transmits the job AK and the provisionally assigned human resource KWJ to the terminal TM, and in the terminal TM, the input / output unit NY(TM) displays the job AK and the provisionally assigned human resource KWJ.

[0090] The above-mentioned steps ST15 and ST16 are, for example, as follows.

[0091] On the terminal TM on which the projects AK (projects A, B, D) and candidate talents WKJ (talents S, T, U, V, W) shown in Figure 12 are displayed, the user US tries to provisionally assign, for example, to project A, talent S, one of talents S, T, and U who are candidate talents WKJ included in the group of candidate talents WKJG(A) for project A (shown in Figure 8), as provisionally assigned talent KWJ, in the first (1) provisional assignment, as shown in Figure 13.

[0092] On the terminal TM on which the projects AK (projects A, B, D), candidate talents for assignment WKJ (talents S, T, U, V, W), and provisionally assigned talent KWJ (talent S) shown in Figure 13 are displayed, the user US tries to provisionally assign talent T to project A, for example, from talents T and U, who are the remaining candidate talents for assignment WKJ included in the group of candidate talents for assignment WKJG(A) for project A, in (2) provisional assignment following (1) provisional assignment, as shown in Figure 14.

[0093] Instead of the (2) provisional allocation shown in Figure 14, user US may provisionally allocate, for example, to project B, talent U from among talents S, U, V, and W, who are candidate talents WKJ for allocation included in the group of candidate talents WKJG(B) for project B (shown in Figure 8), as shown in Figure 15.

[0094] Instead of the (2) provisional allocation shown in Figure 14 and the (2) provisional allocation shown in Figure 15, user US may, for example, provisionally allocate talent T to project D, as shown in Figure 16, from talents T and U who are candidate talents WKJ for allocation included in the group of candidate talents WKJG(D) for project D (shown in Figure 8).

[0095] On terminal TM, which displays projects AK (projects A, B, D), candidate talent WKJ for assignment (talents S, T, U, V, W), and provisionally assigned talent KWJ (talents S, T) as shown in Figure 14, user US tries to provisionally assign talent U, the last candidate talent WKJ for assignment included in the group of candidate talent WKJG(A) for assignment of project A, to project A, for example, as shown in Figure 17, in provisional assignment (3) following provisional assignment (2) shown in Figure 14.

[0096] On terminal TM, which displays projects AK (projects A, B, D), candidate talent WKJ (talents S, T, U, V, W), and provisionally assigned talent KWJ (talents S, T, U) as shown in Figure 17, user US tries to provisionally assign talent V to project B, for example, as shown in Figure 18, from among talents S, U, V, and W, who are candidate talent WKJ for assignment included in the group of candidate talent WKJG(B) for project B, and who are other than talents S and U who have been provisionally assigned to project A in (1) provisional assignment and (3) provisional assignment, in (4) provisional assignment following (3) provisional assignment shown in Figure 17.

[0097] On terminal TM, which displays projects AK (projects A, B, D), candidate talent WKJ (talents S, T, U, V, W), and provisionally assigned talent KWJ (talents S, T, U, V) as shown in Figure 18, user US tries to provisionally assign, for example, W, the last candidate talent WKJ included in the group of candidate talent WKJG(B) for assignment of project B, to project B in provisional assignment (5) following provisional assignment (4) as shown in Figure 18, as shown in Figure 19.

[0098] On terminal TM, which displays project AK (projects A, B, D), allocation candidate talent WKJ (talents S, T, U, V, W), and provisionally assigned talent KWJ (talents S, T, U, V, W) as shown in FIG. 19, user US attempts to provisionally assign one of talents T and U, who are assigned candidate talent WKJ included in the assignment candidate talent group WKJG(D) for project D, to project D, as shown in FIG. 20, following (5) provisional assignment as shown in FIG. 19. However, talents T and U included in the assignment candidate talent group WKJG(D) have already been provisionally assigned to project A in (2) provisional assignment and (3) provisional assignment. Therefore, user US cannot provisionally assign either talent T or U to project D, as indicated by the "?" in FIG. 20.

[0099] Therefore, in order to redo the above-mentioned (1) provisional allocation to (5) provisional allocation (shown in Figure 20), user US tries to provisionally allocate, for example, talent T to project D, out of the talents T and U who are candidate talents WKJ for allocation included in the candidate talent group WKJG(D) for project D, as the first provisional allocation (1) provisional allocation, instead of the first provisional allocation (1) provisional allocation shown in Figure 13, as shown in Figure 21.

[0100] 21, instead of redoing the provisional allocation, as shown in Fig. 22, it is possible to confirm the allocation of personnel S, T, and U to project A, and to confirm the allocation of personnel V and W to project B. Thereafter, by performing the provisional allocations shown in Figs. 12 to 19, for example, for project B, personnel α and β (not shown) that may correspond to personnel S and U and that can satisfy the conditions JK of project B (conditions JK of amount s, man-hours s, and skill s; conditions JK of amount u, man-hours u, and skill u) may be provisionally allocated, and for project D, personnel γ and δ (not shown) that may correspond to personnel T and U and that can satisfy the conditions JK of project D (conditions JK of amount t, man-hours t, and skill t; conditions JK of amount u, man-hours u, and skill u) may be provisionally allocated, and then the allocation may be confirmed in the same manner as in Fig. 22.

[0101] Effects of the First Embodiment As described above, in the information processing system JSS of the first embodiment, when allocating personnel to a plurality of projects AK (projects A, B, C, etc.), various allocation patterns can be confirmed by repeating tentative allocation. In other words, in the information processing system JSS of the first embodiment, it is possible to grasp an overall view of the allocation of personnel to each of a plurality of projects while taking into consideration the relationship with other projects. As a result, in terms of personnel assignment, the information processing system JSS of the first embodiment can achieve both individual optimization for each project and overall optimization for a plurality of projects.

[0102] <Variation 1> FIG. 23 shows the operation of the information processing system JSS according to the first modification of the first embodiment.

[0103] In the information processing system JSS of variant example 1, as shown in Figure 23, when a user US (shown in Figure 1) attempts to provisionally assign, for example, talent U from talents S, T, and U who are candidate talents WKJ in the candidate talent group WKJG(A) for assignment of project A to project A out of projects A, B, and D, if talent U is included in the candidate talent groups WKJG(B) and WKJG(D) for assignment of projects B and D other than project A, the processing unit SY(TM) (shown in Figure 2) of terminal TM (shown in Figure 1) displays talent U in the candidate talent group WKJG(A) for assignment of project A, talent U in the candidate talent group WKJG(B) for assignment of project B, and talent U in the candidate talent group WKJG(D) in an emphasized manner, i.e., a so-called highlight display.

[0104] As described above, in the information processing system JSS of the first modification, when a user US tries to provisionally assign a talent U from the talent allocation candidate group WKJG(A) for a project A to the project A, if the talent U is included in the talent allocation candidate groups WKJG(B) and WKJG(D) for other projects B and D, the input / output unit NY(TM) of the terminal TM highlights the talent U. This alerts the user US that the talent U is common to the talent allocation candidate groups WKJG(A), WKJG(B), and WKJG(D) for projects A, B, and D; in other words, if the talent U is provisionally assigned to the project A, the talent U will no longer be able to be provisionally assigned to the other projects B and D.

[0105] <Variation 2> FIG. 24 shows the operation of the information processing system JSS according to the second modification of the first embodiment.

[0106] In the information processing system JSS of variant example 2, as shown in Figure 24, when a user US (shown in Figure 1) provisionally assigns, for example, talent U from talents S, T, and U who are candidate talents WKJ in the candidate talent group WKJG(A) for assignment of project A to project A out of projects A, B, and D, if talent U is included in the candidate talent groups WKJG(B) and WKJG(D) for assignment of projects B and D other than project A, the processing unit SY(TM) (shown in Figure 2) of terminal TM (shown in Figure 1) displays talent U in the candidate talent group WKJG(A) for assignment of project A, talent U in the candidate talent group WKJG(B) for assignment of project B, and talent U in the candidate talent group WKJG(D) for assignment in a weak tone, i.e., in a manner that makes them unselectable.

[0107] As described above, in the information processing system JSS of the second modification, when the user US provisionally assigns, for example, to a project A, a talent U from the talent allocation candidate group WKJG(A) for the project A, if the talent U is included in the talent allocation candidate groups WKJG(B) and WKJG(D) for the other projects B and D, the input / output unit NY(TM) of the terminal TM will dimly display the talent U. This will alert the user US that the talent U is common to the talent allocation candidate groups WKJG(A), WKJG(B), and WKJG(D) for the projects A, B, and D; in other words, the provisional assignment of talent U to the project A means that the talent U can no longer be provisionally assigned to the other projects B and D.

[0108] Second Embodiment An information processing system JSS according to the second embodiment will be described.

[0109] <Configuration of Second Embodiment> The information processing system JSS of embodiment 2 has a configuration similar to that of the information processing system JSS of embodiment 1 (shown in Figures 1 to 3), and may have the function of allocating human resources JZ to multiple projects AK described in embodiment 1.

[0110] The project AK, human resources JZ, conditions JK, attributes ZS, etc. of the second embodiment are the same as the project AK, human resources JZ, conditions JK, attributes ZS, etc. of the first embodiment (for example, as shown in FIGS. 4 to 8).

[0111] <Operation of the Second Embodiment> The information processing system JSS of the second embodiment has the following steps.

[0112] (1) At least one condition registered for each project AK in the project database DB is read, and a condition total JG, which is the quantitative sum of the read conditions for multiple projects AK, is calculated (first calculation step). For example, the server SV reads the conditions related to "amount" set for each project (Project A-Project E in FIG. 26), adds up the amounts for multiple projects A-Project E, and calculates the condition total JG related to amount. The condition total JG related to man-hours can also be calculated in the same way as above. (2) At least one attribute registered for each talent JZ in the talent database is read, and an attribute total ZG, which is the quantitative sum of the read attributes for multiple talents JZ, is calculated (second calculation step). For example, the server SV reads the attribute related to "amount (unit price)" set for each talent (talent S-talent W in Figure 26), sums the unit prices of multiple talents S-talent W, and calculates the attribute total ZG related to amount. The attribute total ZG for man-hours related to talent JZ can also be calculated in the same way as above. (3) By comparing the above-mentioned condition total JG with the above-mentioned attribute total ZG, the degree of balance between the condition total JG and the attribute total ZG is evaluated. For example, the server SV compares the condition total JG related to the amount (project AK) with the attribute total ZG related to the amount (talent JZ), and determines which of the condition total JG and the attribute total ZG is greater. If the condition total JG is greater, it is evaluated as a talent shortage, and if the attribute total ZG is greater, it is evaluated as a project shortage.

[0113] Here, the "quantitative total" refers to the total of the conditions JK and attributes ZS that can be expressed numerically (for example, the amount of money (for example, yen), the number of man-hours (for example, number of months)).

[0114] Correspondence The processing unit SY (SV) of the second embodiment corresponds to the "first calculation unit," "second calculation unit," and "evaluation unit" in the claims.

[0115] FIG. 25 is a flowchart showing the operation of the information processing system JSS according to the second embodiment.

[0116] FIG. 26 shows the calculation of the condition sum JG in the second embodiment.

[0117] FIG. 27 shows the calculation of the attribute sum ZG in the second embodiment.

[0118] The operation of the information processing system JSS of the second embodiment will be described with reference to FIGS.

[0119] Step ST21: As shown in Fig. 26, the processing unit SY(SV) of the server SV calculates a condition total JG (e.g., amount (budget) s + amount (budget) t + amount (budget) u+... = amount condition total JG; man-hours s + man-hours t + man-hours u+... = man-hour condition total JG) for at least one type of condition JK (conditions s, t, u...) specified in multiple cases AK (cases A, B, C...) stored in the case database DB(AK) of the storage unit KI(SV). Note that the processing unit SY may calculate the condition total JG for each type of condition JK, and for example, calculate the total amount and the total man-hours separately.

[0120] The condition total JG shown in step ST21 may be calculated for each predetermined period (for example, weekly, monthly, or yearly). In this case, only the condition total JG of projects AK scheduled for each predetermined period on a future time axis from the time of calculation may be calculated, or the condition total JG of projects AK set for each corresponding period may be calculated, including not only future time axes but also current and past time axes. Alternatively, the condition total JG may be calculated using projects AK that are registered in the project database DB in the status of "in progress," "not started," or "scheduled for order" at the time of calculation of the condition total JG. Alternatively, the condition total JG may be calculated using projects AK that are in the status of "not started" or "scheduled for order" and to which no human resource JZ is assigned at the time of calculation of the condition total JG.

[0121] Step ST22: As shown in Figure 27, the processing unit SY(SV) of the server SV calculates an attribute total ZG (e.g., amount (price) s + amount (price) t + amount (price) u+, ... = attribute total ZG related to amount; man-hours s + man-hours t + man-hours u+, ... = attribute total ZG related to man-hours) for at least one attribute (attributes s, t, u, ...) possessed by multiple human resources JZ stored in the human resource database DB(JZ) of the memory unit KI(SV). Note that the processing unit SY may calculate the attribute total ZG for each type of attribute ZS, and for example, the total amount and the total man-hours are calculated separately.

[0122] The calculation of the attribute total ZG shown in step ST22 may also be performed for a predetermined period (for example, weekly, monthly, or yearly), as in step ST21. In this case, the attribute total ZG for each predetermined period may be calculated on a time axis in the future from the time of aggregation, or the attribute total ZG for each predetermined period may be calculated including not only the future time axis but also the current and past time axes. The attribute total ZG for the future time axis may be calculated based on the information currently registered in the talent database DB, and when calculating the future attribute total ZG, variable information regarding talent JZ that is determined in the future, such as information regarding talent JZ who are planning to retire or information regarding talent JZ who are planning to receive a salary increase, may be taken into consideration. Furthermore, when calculating the attribute total ZG related to man-hours, the basic man-hours or allocable man-hours of each talent JZ may be summed up, or the available man-hours of each talent JZ at the time of aggregation or the predetermined period to be aggregated may be summed up.

[0123] Step ST23: The processing unit SY (SV) of the server SV compares the calculated condition total JG (e.g., the condition total JG related to the amount = amount (budget) s + amount (budget) t + amount (budget) u +, . . .) with the calculated attribute total ZG (e.g., the attribute total ZG related to the amount (unit price) = amount (price) s + amount (price) t + amount (price) u +, . . .). The processing unit SY (SV) evaluates the degree of balance between the condition total JG and the attribute total ZG through the comparison. The evaluation of the degree of balance performed in this step ST may also be performed at predetermined intervals (e.g., weekly, monthly, or yearly), and may evaluate the degree of balance as actual results at the time of aggregation and on a past time axis, as well as evaluate the degree of balance predicted for the future based on the information currently registered in each database DB.

[0124] When the processing unit SY(SV) evaluates that the condition total JG is less than the attribute total ZG, the user US can use the evaluation as a reference to plan actions to increase the number of cases AK. In particular, the difference between the condition total JG and the attribute total ZG serves as a guide for the procurement amount of cases AK.

[0125] In contrast to the above, when the processing unit SY of the server SV indicates that the attribute total ZG is less than the condition total JG, the user US can plan an action to increase the number of human resources JZ. In particular, the difference between the attribute total ZG and the condition total JG serves as a guide for the procurement amount of human resources JZ.

[0126] The processing unit SY may calculate a procurement target for the projects AK or the talent JZ based on the results of the evaluation of the degree of balance performed in step ST23, and provide the result to the user US. For example, if the evaluation of the degree of balance determines that the number of projects AK is less than the number of talent JZ, the number of projects AK that will serve as the procurement target may be calculated based on the average amount of the projects AK identified from past performance (e.g., (total of monetary conditions JG - total of monetary attributes ZG) / average amount of the projects AK = procurement target for the projects AK). Also, if the evaluation of the degree of balance determines that talent JZ is insufficient for the projects AK, the number of talent JZ that will serve as the procurement target may be calculated based on the average amount (average unit price) of the talent registered in the talent database DB (e.g., (total of monetary conditions JG - total of monetary attributes ZG) / average amount of talent JZ = procurement target for talent JZ). When calculating the procurement target for talent JZ, the results of the evaluation of the degree of balance over a time period prior to the time of calculation are taken into consideration, and if the talent shortage period has continued for a predetermined period or longer (e.g., six months or more, one year or more), a proposal may be made to user US to hire talent JZ. If the talent shortage period has not continued for a predetermined period or longer and is only temporary, a proposal may be made to user US to procure talent from external resources.

[0127] Furthermore, the processing unit SY may identify fluctuation information indicating the degree of increase or decrease in the number of projects AK (such as the fluctuation rate of projects AK, year-on-year comparison, month-on-month comparison, etc.) based on the evaluation result of the degree of balance from the past to the future, and provide the information to the user US. In addition, based on the identified fluctuation information, a future order forecast for projects AK may be performed. In this order forecast, the processing unit SY may calculate the total amount and / or man-hours of the projects predicted in the future. Then, the processing unit SY may evaluate the degree of balance between the predicted total project amount and the total amount attribute ZG calculated in step ST22, or may evaluate the degree of balance between the predicted total project man-hours and the total man-hour attribute ZG calculated in step ST22. Based on the evaluation result of the degree of balance of human resources JZ for such future project forecasts, the processing unit SY may calculate a procurement target for human resources JZ and provide the calculation result to the user US.

[0128] Effects of the Second Embodiment As described above, the information processing system JSS of the second embodiment compares a condition total JG, which is a quantitative sum of at least one condition JK defined in a plurality of projects AK, with an attribute total ZG, which is a quantitative sum of at least one attribute ZS possessed by a plurality of human resources JZ, to evaluate the degree of balance between the condition total JG and the attribute total ZG. This enables the user US to take appropriate action (e.g., making a sales activity plan to procure the project AK, making a recruitment plan to procure the human resources JZ, etc.) according to the degree of balance.

[0129] <Hardware configuration of the embodiment> FIG. 28 shows the hardware configuration of the information processing system JSS according to the first and second embodiments.

[0130] To perform the above-described functions, the information processing system JSS of the first and second embodiments includes a processing circuit SYO, as shown in FIG. 28, and further includes an input circuit NYU and an output circuit SYU as necessary.

[0131] The processing circuit SYO is dedicated hardware that mainly realizes the functions of the processing unit SY(TM) of the terminal TM (shown in FIG. 2) and the processing unit SY(SV) of the server SV (shown in FIG. 3).

[0132] The processing circuit SYO is, for example, a single circuit, a composite circuit, a programmed processor, a parallel programmed processor, an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or a combination thereof.

[0133] The input circuit NYU and the output circuit SYU exchange inputs and outputs related to the operation of the processing circuit SYO with, for example, a terminal TM or an external device outside the server SV.

[0134] <Hardware configuration based on software implementation of the embodiment> FIG. 29 shows a hardware configuration based on software implementation of the information processing system JSS according to the first and second embodiments.

[0135] As shown in FIG. 29, the information processing system JSS of the first and second embodiments includes a processor PRO and a memory circuit KIO, and may further include an input circuit NYU and an output circuit SYU as necessary.

[0136] The processor PRO is a CPU (also called a Central Processing Unit, central processing unit, processing unit, arithmetic unit, microprocessor, microcomputer, or DSP (Digital Signal Processing)) that executes programs. The processor PRO mainly realizes the functions of the processing unit SY(TM) of the terminal TM and the processing unit SY(SV) of the server SV.

[0137] The processor PRO realizes the above-mentioned functions by software, firmware, or a combination of software and firmware. The software and firmware are written as a program PRG and stored in the memory circuit KIO.

[0138] The processor PRO realizes the above-mentioned functions by reading and executing the above-mentioned program PRG from the memory circuit KIO. The above-mentioned program PRG can also be said to cause a computer to execute the procedures and methods of the processing unit SY(TM) of the terminal TM and the processing unit SY(SV) of the server SV.

[0139] Here, the memory circuit KIO is, for example, a non-volatile or volatile semiconductor memory such as RAM (Random Access Memory), ROM (Read Only Memory), flash memory, EPROM (Erasable Programmable Read Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), as well as a magnetic disk, flexible disk, optical disk, compact disk, mini disk, DVD (Digital Versatile Disc), etc.

[0140] Of the functions of the processing unit SY(TM) of the terminal TM and the processing unit SY(SV) of the server SV, some of the functions may be realized by a processing circuit SYO (shown in Figure 28), while other functions may be realized by a processor PRO (shown in Figure 29).

[0141] As described above, the functions of the processing unit SY(TM) of the terminal TM and the processing unit SY(SV) of the server SV can be realized by hardware, software, firmware, or a combination of these.

[0142] The input circuit NYU and the output circuit SYU exchange inputs and outputs related to the operation of the processor PRO with, for example, the terminal TM and the outside of the server SV.

[0143] The above-described embodiment is merely an example for facilitating understanding of the present invention and is not intended to limit the present invention. The present invention can be modified and improved without departing from the spirit thereof, and the present invention naturally includes equivalents thereof. For example, in the above embodiment, "human resources" are used as an example of resources to be allocated to cases, but examples of resources are not necessarily limited to human resources and may include resources other than human resources, such as machines, places, and animals.

[0144] <Example of composition> The information processing method, information processing system, server, and program according to the present disclosure have, for example, the following configuration.

[0145] [Item 1] an extraction step of extracting, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display step of displaying the two or more jobs and the allocation candidate resources included in a group of allocation candidate resources corresponding to the two or more jobs; a receiving step of repeatedly receiving a request from a user to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job; a second display step of displaying the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; 2. A computer-implemented information processing method, comprising: [Item 2] In the first display step, when the user attempts to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job, the computer determines whether or not the one allocation candidate resource is included in another group of allocation candidate resources corresponding to another job of the two or more jobs, and highlights the one allocation candidate resource in the other job that is determined to include the one allocation candidate resource. Item 1. The information processing method according to item 1. [Item 3] In the first display step, when the user tentatively allocates one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job, the computer determines whether or not the one allocation candidate resource is included in another group of allocation candidate resources corresponding to another job of the two or more jobs, and dims the one allocation candidate resource in the other job that is determined to include the one allocation candidate resource. Item 1. The information processing method according to item 1. [Item 4] a resource list output step of presenting a resource list corresponding to one of the jobs to the user when the allocation candidate resource group is registered for the one of the jobs; a generation step of receiving a selection by the user of one or more of the allocation candidate resources to be registered in the one job from the resource list, and generating the allocation candidate resource group corresponding to the one job, An information processing method according to any one of items 1 to 3, wherein in the resource list output step, the computer compares at least one attribute registered for each resource in a resource database with at least one condition required for the one project, rearranges the multiple resources included in the resource database so that resources that satisfy the at least one condition are placed at the top of the resource list, and outputs the resource list corresponding to the one project. [Item 5] a first calculation step of reading at least one condition registered for each project in a project database and calculating a condition total that is a quantitative total of the conditions for the plurality of projects; a second calculation step of reading at least one attribute registered for each resource in the resource database and calculating an attribute total that is a quantitative total of the attributes for a plurality of resources; an evaluation step of evaluating the degree of balance between the condition total and the attribute total by comparing the condition total and the attribute total; 4. The information processing method according to any one of items 1 to 3, further comprising: [Item 6] a case list output step of presenting a case list including the plurality of cases to the user before the extraction step is performed, An information processing method described in any one of items 1 to 3, wherein in the case list output process, the computer refers to the order probability registered for each case in a case database, sorts the cases among the multiple cases for which resource allocation has not been completed in descending order of the order probability, and outputs the case list. [Item 7] Each of the cases has at least one slot to which one resource is assigned; Item 6. An information processing method according to Item 6, wherein in the case list output step, the computer sorts the cases based on the probability of receiving the order, and then sorts two or more cases with the same level of probability of receiving the order in order of the number of unconfirmed slots to which resources are not allocated, thereby outputting the case list. [Item 8] an extracting unit that extracts, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display output unit that displays the two or more jobs and the allocation candidate resources included in an allocation candidate resource group corresponding to the two or more jobs; a receiving unit that repeatedly receives a request from a user to provisionally allocate, to one of the two or more jobs, one allocation candidate resource included in a group of allocation candidate resources corresponding to the one job; a second display output unit that displays the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; An information processing system including: [Item 9] an extracting unit that extracts, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display output unit that displays the two or more jobs and the allocation candidate resources included in an allocation candidate resource group corresponding to the two or more jobs; a receiving unit that repeatedly receives a request from a user to provisionally allocate, to one of the two or more jobs, one allocation candidate resource included in a group of allocation candidate resources corresponding to the one job; a second display output unit that displays the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; Server containing. [Item 10] an extraction step of extracting, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display step of displaying the two or more jobs and the allocation candidate resources included in a group of allocation candidate resources corresponding to the two or more jobs; a receiving step of repeatedly receiving a request from a user to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job; a second display step of displaying the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; A program that causes a computer to execute the following. [Explanation of symbols]

[0146] JSS Information Processing System SV Server TM terminal NW Network US users

Claims

1. an extraction step of extracting, from a plurality of projects each having a registered group of allocation candidate resources, two or more projects having at least one common allocation candidate resource among the group of allocation candidate resources; a first display step of displaying the two or more jobs and the allocation candidate resources included in a group of allocation candidate resources corresponding to the two or more jobs; a receiving step of repeatedly receiving a request from a user to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job; a second display step of displaying the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; 2. A computer-implemented information processing method, comprising:

2. In the first display step, when the user attempts to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more cases to the one case, the computer determines whether or not the one allocation candidate resource is included in another group of allocation candidate resources corresponding to another case of the two or more cases, and highlights the one allocation candidate resource in the other case that is determined to include the one allocation candidate resource. The information processing method according to claim 1 .

3. In the first display step, when the user tentatively allocates one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more cases to the one case, the computer determines whether or not the one allocation candidate resource is included in another group of allocation candidate resources corresponding to another case of the two or more cases, and dims the one allocation candidate resource in the other case that is determined to include the one allocation candidate resource. The information processing method according to claim 1 .

4. a resource list output step of presenting a resource list corresponding to one of the jobs to the user when the allocation candidate resource group is registered for the one of the jobs; a generation step of receiving a selection by the user of one or more of the allocation candidate resources to be registered in the one job from the resource list, and generating the allocation candidate resource group corresponding to the one job, An information processing method according to any one of claims 1 to 3, wherein in the resource list output step, the computer compares at least one attribute registered for each resource in a resource database with at least one condition required for the one project, rearranges the multiple resources included in the resource database so that resources that satisfy the at least one condition are placed at the top of the resource list, and outputs the resource list corresponding to the one project.

5. a first calculation step of reading at least one condition registered for each case in a case database and calculating a condition total that is a quantitative total of the conditions for the plurality of cases; a second calculation step of reading at least one attribute registered for each resource in the resource database and calculating an attribute total that is a quantitative total of the attributes for a plurality of resources; an evaluation step of evaluating the degree of balance between the condition total and the attribute total by comparing the condition total and the attribute total; The information processing method according to any one of claims 1 to 3, further comprising:

6. a case list output step of presenting a case list including the plurality of cases to the user before the extraction step is performed, An information processing method according to any one of claims 1 to 3, wherein in the case list output process, the computer refers to the order probability registered for each case in a case database, sorts the cases among the multiple cases for which resource allocation has not been completed in descending order of order probability, and outputs the case list.

7. Each of the cases has at least one slot to which one resource is assigned, 7. The information processing method of claim 6, wherein in the case list output step, the computer sorts the cases based on the probability of receiving the order, and then, for two or more cases with the same level of probability of receiving the order, sorts them in order of the number of unconfirmed slots to which resources are not assigned, thereby outputting the case list.

8. an extracting unit that extracts, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display output unit that displays the two or more jobs and the allocation candidate resources included in an allocation candidate resource group corresponding to the two or more jobs; a receiving unit that repeatedly receives a request from a user to provisionally allocate, to one job, one allocation candidate resource included in a group of allocation candidate resources corresponding to the one job among the two or more jobs; a second display output unit that displays the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; An information processing system including:

9. an extracting unit that extracts, from a plurality of applications, each of which has a registered group of allocation candidate resources, two or more applications that share at least one allocation candidate resource among the group of allocation candidate resources; a first display output unit that displays the two or more jobs and the allocation candidate resources included in an allocation candidate resource group corresponding to the two or more jobs; a receiving unit that repeatedly receives a request from a user to provisionally allocate, to one job, one allocation candidate resource included in a group of allocation candidate resources corresponding to the one job among the two or more jobs; a second display output unit that displays the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; Server containing.

10. an extraction step of extracting, from a plurality of projects each having a registered group of allocation candidate resources, two or more projects having at least one common allocation candidate resource among the group of allocation candidate resources; a first display step of displaying the two or more jobs and the allocation candidate resources included in a group of allocation candidate resources corresponding to the two or more jobs; a receiving step of repeatedly receiving a request from a user to provisionally allocate one allocation candidate resource included in a group of allocation candidate resources corresponding to one of the two or more jobs to the one job; a second display step of displaying the two or more jobs and provisional allocation resources that are allocation candidate resources provisionally allocated to the two or more jobs; A program that causes a computer to execute the following.

Images