JP4084325B2 - Recruitment support device and recruitment support program - Google Patents

Description

  The present invention relates to a recruitment support apparatus that supports recruitment by a communication means, and relates to an apparatus that appropriately selects a recruitment target and reduces a communication burden.

  Japanese Patent Laid-Open No. 2002-342469 discloses a human resource support system that sends a job request from the job seeker to the human resource side by mail communication, and responds from the human resource side by mail communication.

  As described above, when recruiting for a job offer and applying for it, it is conceivable to use communication means such as mail communication.

  If you want to secure the required number of applications within the deadline, it will be more satisfying to tell as many recruitees as possible.

  However, considering the costs associated with communications, the number of people eligible for recruitment cannot be increased without limit.

  Japanese Patent Application Laid-Open No. 2002-24459 discloses a real-time job matching system that matches employment information and job search information and transmits information to the matched employer and job seeker.

  In this way, by matching employment information and job search information, it is possible to increase the expected value for forming an agreement.

However, even if it is assumed that the conditions are matched, in order to secure the required number of applications, the number of applicants for recruitment (in this example, job seekers to contact) is too small or too small. It ’s not too good. If there is too much, the communication cost is wasted. If the number is too small, the risk that the required number of applications will not be secured within the deadline increases.
JP 2002-342469 A JP 2002-24459 A

  The present invention has been made in order to eliminate the above-mentioned disadvantages of the prior art, and its purpose is to provide recruitment support for recruiting and applying for job offers using communication means such as mail communication. It is an object of the present invention to reduce the risk that the required number of applications cannot be secured within the deadline, and to eliminate the waste of communication burden due to recruitment.

The recruitment support apparatus according to the present invention is:
It is characterized by supporting recruitment by communication means (1) Application result database that stores the application results of each applicant who has applied (2) Based on the application results of the applicants, the expected application value of the applicants Expected application value specifying part to be calculated (3) Candidate list storage part for storing candidate groups (4) For each candidate, the application expected value specifying part as an application experienced person is calculated, and a plurality of candidates An initial delivery destination selection unit that selects the plurality of candidates as initial delivery destinations when the total of expected application values for a person satisfies a predetermined relationship with the required number of applications.

  Further, the present invention is characterized by having a recruitment notice delivery unit for sending a notice of recruitment to the initial delivery destination.

The expected value that the initial delivery destination selection unit calculates in the expected application value specifying unit is an expected value that expects an application from the first delivery to the deadline,
The initial delivery destination selection unit calculates a time interval from the first delivery time to the deadline time,
The application expectation value specifying unit calculates the expected value by obtaining the number of applications and the number of applications within the time interval that the experienced applicant has applied from the application results database and dividing the number of results by the number of applications. It is characterized by doing.

The recruitment support device
After the first delivery, for each delivery destination, let the application expectation value at the time of elapse be calculated by the application expectation value specifying part, and the total of the expected application values for all delivery destinations has a predetermined relationship with the total number of applications at the time of elapse. A situation monitoring unit that determines that supplementary delivery is necessary if not satisfied,
Among the distribution destinations, those that have not applied are allowed to calculate the expected value to be applied by the deadline time, and the expected application value specifying unit calculates the total of all the expected application values for one or more additional candidates, The total expected application value, which includes the expected value of the candidate, obtained by letting the expected application value calculation section calculate the expected application value as an experienced application person, subtracts the number of applications at the time of passage from the required number of applications. And a supplementary delivery destination selection unit that selects the further candidate as a supplementary delivery destination when a predetermined relationship is satisfied with respect to the remaining recruitment number.

  The recruitment notification delivery unit transmits a recruitment notice to the supplementary delivery destination.

The program according to the present invention is:
The following procedure is applied to a computer, which has an application record database for storing application results for each application experienced person, and a candidate list storage unit for storing candidate groups, and which serves as a recruitment support apparatus for supporting recruitment by communication means. (1) A procedure for calculating the expected application value of each application candidate based on the application results as an application experience person for each candidate (2) Multiple candidates A procedure for selecting a plurality of candidates as initial distribution destinations when the sum of expected application values for the content satisfies a predetermined relationship with the required number of applications.

  In the present invention, the application expectation value is calculated based on the application results, and based on the application expectation value, the delivery destination is selected including not only the first time but also replenishment so as to secure the required number of people. It is possible to reduce the risk that the required number of applications cannot be secured and to reduce the communication burden due to recruitment.

Embodiment 1 FIG.
Hereinafter, the present invention will be described based on embodiments shown in the drawings.
FIG. 1 is a diagram illustrating a configuration of a recruitment support apparatus. The recruitment support device includes a job offer condition input unit 1, a job offer condition storage unit 2, a required number of people and deadline time input unit 3, a required number of people storage unit 4, a deadline time storage unit 5, a candidate extraction unit 6, a human resource database 7, and a candidate List storage unit 8, initial distribution destination selection unit 9, application expected value specifying unit 10, application record database 11, distribution destination list storage unit 12, recruitment mail distribution unit 13, recruitment result storage unit 14, situation monitoring unit 15, divergence limit Each element includes a value storage unit 16, a supplementary delivery destination selection unit 17, an applicant list generation unit 18, and a recruitment result and application list output unit 19.

  The operation of the recruitment support apparatus will be described. FIG. 2 is a diagram showing an overall processing flow.

  First, the recruitment condition is input by the recruitment condition input unit 1 (S201). In this process, the job offer condition presented by the client requesting the job brokerage is input and stored in the job offer condition storage unit 2. Job offer conditions are examples of recruitment conditions for recruitment.

  FIG. 3 is a diagram illustrating an example of the job offer condition storage unit 2. Records 351 to 353 are provided for each job recruitment request, and items of job ID 301, business ID 302, case ID 303, condition ID 304, and condition 305 are associated with each other. For example, in the request for the job offer ID = W001, the job offer condition is that the user has a “license” that allows him / her to get on the “motor vehicle” in the “delivery” business.

  Next, the necessary number of people and the deadline time are input by the necessary number of people and deadline time input unit 3 (S202 in FIG. 2). In this process, the required number of persons presented by the client and the time limit (expiration time) for waiting for the application for the required number of persons are input and stored in the required number storage unit 4 and the expiration time storage unit 5. As in this example, when recruiting people, it is the necessary number, but when recruiting things, facilities, etc., it is the necessary number or the required number of places. The required number of people is an example of the required number of items for recruitment.

  FIG. 4 is a diagram illustrating an example of the necessary number storage unit 4. A record is provided for each job broker request, and has items of job ID 401 and required number of people 402, which are associated with each other.

  The expiration time storage unit 5 is configured to store the expiration time in association with the job offer ID.

  Next, candidate extraction and ranking are performed by the candidate extraction unit 6 (S203 in FIG. 2). In this process, personnel who meet the job offer conditions are selected from the human resource database 7 and stored in the candidate list storage unit 8 as a list of candidates. At that time, it is also effective to set the priority order according to some condition.

  FIG. 5 is a diagram illustrating an example of a human resource database. A record is provided for each person, and items such as a person ID 501, a name 502, a gender 503, an age 504, an address 505, an e-mail address 506, a telephone number 507, and a license 508 are associated with each other.

  FIG. 6 is a diagram illustrating an example (part 1) of the candidate list storage unit. A record is provided for each candidate who can be recruited, and has items of selection flag 601, personnel ID 602, name 603, gender 604, age 605, address 606, e-mail address 607, telephone number 608, and license 609, respectively. Are associated. Items 602 to 609 are duplicated from the above-described items 501 to 508. In this example, it is assumed that they are arranged from the top in descending order of priority. These candidates may apply for recruitment.

  Next, the initial delivery destination selection unit 9 selects an initial delivery destination (S204 in FIG. 2). In this process, a delivery destination (a recruitment target person who is urged to apply) is first selected from the candidate list and stored in the delivery destination list storage unit 12 as a delivery destination list. In selecting the delivery destination, an appropriate number of applicants is selected based on the expected value of the application.

  Processing for selecting an initial distribution destination will be described in detail. FIG. 7 is a diagram illustrating a processing flow for selecting an initial distribution destination. First, as preprocessing (S701), “0” is set as an initial value for the total expected value that is an internal variable.

  Next, in the candidate list, the following processing is performed in order from the top with respect to the record whose selection flag is “OFF (not yet)” (S702). In other words, candidates that have not yet been distributed are selected and processed in order according to the priority order.

  First, the record is read from the candidate list storage unit 8 (S703). Then, the record is added to the distribution destination list (S704). Duplicate items 602 to 609 excluding the selection flag.

  FIG. 8 is a diagram illustrating an example (part 1) of the distribution destination list storage unit. A record is provided for each distribution destination, and includes items of distribution flag 801, distribution time 802, personnel ID 803, name 804, gender 805 age 806, address 807, e-mail address 808, telephone number 809, and license 810. Attached. The initial value of the distribution flag 801 is “OFF (not yet)”. It becomes “ON (completed)” at the time of actual mail delivery.

  On the other hand, the selection flag of the record in the original candidate list is set to “ON (completed)” (S705). FIG. 9 is a diagram illustrating an example (part 2) of the candidate list storage unit. The candidate list selection flag is set to “ON (completed)” when it is copied to the distribution destination list, as indicated by 951 to 955.

  Then, an initial waiting time is calculated (S706). The initial waiting time is obtained by subtracting the scheduled delivery time from the deadline time acquired from the deadline time storage unit 5. The scheduled delivery time may be set from the outside, or may be automatically set from the deadline time or the required number of people. In addition, when mail is immediately delivered, the current time may be used. Here, the scheduled delivery time specified by some method is used.

  Next, the application expected value at the time when the initial waiting time has elapsed is obtained based on the application results corresponding to the personnel ID (S707). This expected application value is an expected value that is expected to be applied from the first delivery until the deadline. This is performed as an application expected value specifying process by the application expected value specifying unit 10. The application expected value specifying process will be described later in detail with reference to FIG.

  The specified expected application value is added to the total expected value (S708). That is, an overall total expected value obtained by accumulating expected application values for personnel is obtained.

  FIG. 10 is a diagram illustrating an example (initial stage) of changes in the expected application value. In this figure, the vertical axis indicates the expected value for which there is an application by the time indicated by the horizontal axis. The expected value per person is a value between 0 and 1, and increases with the passage of time. In this example, the initial waiting time is 30 minutes. Reference numeral 1001 denotes a line indicating an expected value for the first person indicated by 851 in FIG. Reference numeral 1002 denotes a line indicating the sum of the expected value for the first person indicated by 851 in FIG. 8 and the expected value for the second person indicated by 852. In this order, 1003 is a line indicating accumulation of expected values up to the third person, 1004 is accumulation up to the fourth person, and 1005 is accumulation of expected values up to the fifth person.

  As shown in FIG. 7, it is determined whether the accumulated total expected value satisfies the necessary number of people (S709), and when it is satisfied, the initial delivery destination selection process is terminated. In the example of FIG. 10, the total expected value reaches the required number of three at the fifth person.

  Regardless of this example, it may be determined whether the accumulated total expected value satisfies the required number of persons + the margin value. The margin value may be, for example, a constant or a value that is a predetermined multiple of the required number of people.

  Here, the expected application value specifying process by the expected application value specifying unit 10 performed in S707 and the like will be described.

  FIG. 11 is a diagram showing a flow of expected application value identification processing. The personnel ID and the time interval for specifying the expected value are input (S1101). In S707, since the expected value at the initial waiting time is obtained, the initial waiting time (in this example, 30 minutes) is input as the time interval for specifying the expected value. However, it is also used when an expected value in a time shorter than the initial waiting time is obtained as in a process described later (S1609 in FIG. 16).

  Next, application record data (delivery count, application response time group) corresponding to the personnel ID is acquired from the application record database 11 (S1102).

  FIG. 12 is a diagram illustrating an example of an application record database. A record is provided for each staff member, and has items of a staff ID 1201, a delivery count 1202, and application response times 1204 to 1207, which are associated with each other. For example, the 1251 record has been distributed to M001 personnel in the past 100 times, and the first time there was an application at 21 minutes 39 seconds, and the second time there was no application. Show.

  And the application time of each application response time is counted within the time interval for specifying the expected value (S1103). This count value is the number of applications within the time interval for specifying the expected value.

  Finally, an expected application value at a time interval for specifying the expected value is obtained by dividing the count value by the number of distributions (S1104).

  This expected application value specifying process is used in S1609, S1908, S1910, and S1919, which will be described later, in addition to S707 in FIG.

  When the selection of the initial delivery destination shown in S204 in FIG. 2 is completed, the recruitment mail delivery unit 13 performs recruitment mail delivery to the initial delivery destination (S205 in FIG. 2). In this process, preparation for distributing the recruitment mail to the delivery destination on the delivery destination list and recording the recruitment result is performed. The recruitment mail distribution unit is an example of a recruitment notification distribution unit that distributes the notification of the recruitment, and other communication means such as FAX and voice notification other than mail may be used.

  FIG. 13 is a diagram showing a processing flow of recruitment mail delivery. In the distribution destination list, the following processing is performed in order from the top for the record whose distribution flag is “OFF (not yet)” (S1301). This record means a record that has not actually been sent.

  The recruitment mail form is read into the internal storage area, the recruitment conditions read from the recruitment condition storage unit 2 are set in the body of the recruitment mail (S1302), and the address of the record is set as the destination of the recruitment mail (S1303) ), The created recruitment mail is actually transmitted (S1304).

  Then, the distribution flag of the record in the distribution destination list is set to “ON (completed)”, and the current time is written in the distribution time (S1305). Further, the personnel ID of the record is added to the recruitment result storage unit (S1306).

  When all the “OFF (not yet)” records have been processed (S1307), the process ends.

  FIG. 14 is a diagram illustrating an example (part 2) of the distribution destination list storage unit. As shown in the figure, in FIG. 8, all the records whose distribution flag is “OFF (not yet)” have the distribution flag “ON (completed)” and the distribution time is recorded.

  FIG. 15 is a diagram illustrating an example (part 1) of the recruitment result storage unit. A table is provided for each job recruitment request. The table includes a record for each distribution destination, and includes items of personnel ID 1501, application presence / absence 1502, and application response time 1503, which are associated with each other. Immediately after the first distribution, a personnel ID is set, and “None” is set as an initial value for the items with / without application.

  In the subsequent processing, when an application email is received, the application presence / absence item corresponding to the personnel ID corresponding to the application email sender in the table is changed to “Yes” and the time when the email is received is applied. It is assumed that the response time is set. As described above, the process of changing the application presence / absence item according to the application mail and setting the application response time may be performed automatically by the recruitment support apparatus or by an operator's operation.

  After distribution of the recruitment email shown in FIG. 2 (S205), the situation monitoring unit 15 performs situation monitoring (S206 in FIG. 2). In this process, each determination process of time-out, sufficiency of application for the number of recruited persons, and need for additional recruitment (replenishment) is performed.

  FIG. 16 is a diagram illustrating a processing flow of situation monitoring. First, as preprocessing (S1601), “0” is set as an initial value to the total expected value that is an internal variable.

  If the current time has reached the deadline time (S1602), the status is set to “time out” (S1616) and the process ends.

  All the recruitment result data (personnel ID and application presence / absence) are acquired from the recruitment result storage unit 14 (S1603). Then, the number of records in which the application presence / absence item is “present” is counted. That is, the total number of applications is counted (S1604). If the total number of applications reaches the required number (S1605), the status is set to “satisfied” (S1617), and the process ends.

  If it is neither “time-out” nor “satisfaction”, the following processing is repeated for each personnel ID in the recruitment result data (S 1606). In the processing of S1607 to S1609, the expected application value of each person at the current time is obtained, and the total expected application value of the entire current time is obtained in the processing up to S1611.

  First, the distribution time corresponding to the personnel ID is acquired from the distribution destination list storage unit 12 (S1607), and the elapsed time is calculated (S1608). Specifically, the delivery time is subtracted from the current time, and the difference is defined as the elapsed time.

  Then, using the personnel ID and the elapsed time as input data, the current application expected value (at the elapsed time) is obtained from the application record corresponding to the personnel ID (S1609). This is performed as the above-described expected application value specifying process (FIG. 11). The application expected value is added to the total expected value (S1610). When all the personnel IDs are processed (S1611), the total expected application value (total expected value) is obtained.

  Next, the deviation width of the total number of applications with respect to the total expected value is calculated (S1612). Specifically, the total number of applications is subtracted from the total expected value, and the difference is defined as the gap.

  The concept of the deviation width will be described with reference to FIGS. 17 and 18. FIG. 17 is a diagram illustrating an example (part 2) of the recruitment result storage unit. This example shows that there was only one application after 3 minutes.

  FIG. 18 is a diagram illustrating an example of the transition of the expected application value and the total number of applications. Reference numeral 1801 denotes an accumulated total application expectation value. A line 1802 indicates the total number of applications that have changed from 0 to 1 after 3 minutes. Reference numeral 1803 indicates the current divergence width. If this gap is large, recruitment is added (supplemented).

  For this determination, a deviation limit value preset in the deviation limit value storage unit 16 is acquired (S1613) and compared with the calculated deviation width (S1614). If the deviation width exceeds the deviation limit value, the status is set to “replenishment required” (S1615), and the process ends.

  If the deviation width does not exceed the deviation limit value, the processing from S1601 in FIG. 16 is repeated.

  As shown in FIG. 2, if the status is “time out” or “satisfied” in the situation monitoring (S206), the recruitment is terminated, but if “replenishment is required”, the recruitment target is added, Continue recruitment.

  Therefore, when the status is “replenishment required”, the supplementary delivery destination selection unit 17 selects the supplementary delivery destination (S207 in FIG. 2). In this process, a process of adding a delivery destination is performed until a predetermined expected value is satisfied.

  The supplement delivery destination selection process will be described in detail with reference to FIGS. 19 and 20. FIG. 19 is a diagram showing a processing flow (1/2) for selecting a supplement delivery destination.

  As pre-processing (S1901), “0” is set as an initial value to the total expected value which is an internal variable. All the recruitment result data (personnel ID and application presence / absence) are acquired from the recruitment result storage unit 14 (S1902), and the total number of applications is counted (S1903). Specifically, the records with “Yes” in the “Yes / No” field are counted.

  Then, the calculated number of applications is subtracted from the required number of persons (example of required number of applications) stored in the required number of people storage unit 4 to calculate the remaining number of applications (example of the remaining number of applications) (S1904).

  For each record in which the application presence / absence item is “none”, the personnel ID is specified and the following processing is repeated (S1905). In the following processing (S1906 to S1911), a person who has already sent a recruitment email but has not applied for an application calculates an expected value to apply in the remaining time (from the current time to the deadline).

  FIG. 20 is a diagram illustrating a concept of an expected value to be applied in the remaining time. The expected value 2003 to be applied in the remaining time is the expected value 2002 from the expected value 2001 for which the application from the distribution to the deadline is expected (determined in S1906 to S1908), and the expected value 2002 from the distribution to the present time (determined in S1909 and S1910). Is obtained by subtracting (S1911).

  For this purpose, the distribution time corresponding to the personnel ID is acquired from the distribution destination list storage unit 12 (S1906), and the distribution time is subtracted from the expiration time to calculate the waiting time from the distribution to the expiration (S1907).

  Then, using the personnel ID and the waiting time as input data, an expected application value 2001 that expects an application from distribution to the deadline is obtained from the application record corresponding to the personnel ID (S1908). This process is performed as the expected application value specifying process of FIG.

  Also, the elapsed time is calculated by subtracting the delivery time from the current time (S1909), and the application expectation that expects the application from the delivery to the current time based on the application record corresponding to the personnel ID using the personnel ID and the elapsed time as input data. A value 2002 is obtained (S1910). This process is also performed as the application expected value specifying process of FIG.

  Then, an expected application value 2001 for the remaining waiting time (from the current time to the deadline) is obtained (S1911). The application expectation value of the remaining waiting time is calculated by subtracting the application expectation value 2002 expecting the application from distribution to the present time from the application expectation value 2001 expecting application from distribution to the deadline. Then, the application expectation value of the remaining waiting time is added to the total expectation value (S1912). When all the personnel IDs have been processed (S1913), the process proceeds to the next process. In this way, the expected application value of the remaining waiting time is accumulated in the total expected value, and the total expected application value of the remaining waiting time is obtained.

  Subsequently, processing for selecting a supplementary delivery destination will be described. FIG. 21 is a diagram showing a processing flow (2/2) for selecting a supplement delivery destination.

  As in S702 to S704 for selecting an initial distribution destination, the following processing is performed in order from the top in the candidate list in the selection flag “OFF (not yet)” (S1914). First, the record is read (S1915), and the record (excluding the selection flag, items 602 to 609) is added to the distribution destination list (S1916). Then, the selection flag of the record in the original candidate list is set to “ON (completed)” (S1917).

  In this way, the expected value of the added delivery destination is added to the total expected value. The concept of the total expected value will be described. FIG. 22 is a diagram illustrating an example of the transition of the expected application value (correction stage). Reference numeral 2201 denotes the total of the expected application values for the remaining waiting time obtained up to S1913. Reference numeral 2102 denotes a total obtained by adding the expected values of the added first person, and 2103 denotes a total up to the expected value of the second person.

  In order to obtain the expected value of the personnel to be added in this way, the waiting time from the scheduled delivery time to the deadline time is calculated (S1918). Specifically, the scheduled delivery time is subtracted from the deadline time. When processing immediately, the current time may be used as the scheduled delivery time. The scheduled delivery time may be determined in consideration of the time required for processing and other required time. It may be automatically determined by the apparatus, or may be stored inside by an operator's operation.

  Then, based on the application results corresponding to the personnel ID, an expected application value for applying from supplementary delivery to the deadline is obtained based on the calculated waiting time (S1919). This process is also performed as an application expected value specifying process.

  Then, the application expected value is added to the total expected value (S1920). When the total expected value thus summed up the remaining number of users (S1921), the process is terminated. In the example of FIG. 22, when the expected value of the second person is added, the remaining number (two persons) is reached and the process of selecting the supplementary delivery destination is completed.

  The distribution destination list storage unit in FIG. 23 illustrates an example in which the personnel ID “M008” of the record 2356 and the personnel ID “M017” of the record 2357 are added as distribution destinations.

  In this way, the delivery destination is supplemented, and the recruitment email delivery unit 13 performs recruitment email delivery to the supplementary delivery destination (S208 in FIG. 2). In this process, the recruitment mail delivery process of FIG. 13 is performed as in S205.

  The recruitment result storage unit of FIG. 24 shows an example in which the personnel ID “M008” of the record 2456 and the personnel ID “M017” of the record 2457 are added as the recruitment results.

  As described above, when the number of applicants is small, the operation is performed so that recruitment is appropriately added. Then, when there are enough applicants to be “satisfied”, or when there are not enough applicants and the time limit is reached and “time has expired”, processing is performed in accordance with the end of the recruitment.

  First, an applicant list is generated by the applicant list generator 18 (S209 in FIG. 2). In this process, a list of applicants is generated. FIG. 25 is a diagram illustrating an example of an application list.

  The applicant list generation unit 18 searches the recruitment result storage unit 14 for records where the application presence / absence item is “present”, and identifies the personnel ID of the record. Records that match these personnel IDs are selected from the distribution destination list storage unit 12, and those records are added to the records in the applicant list, thereby generating an application list.

  Next, the solicitation result and the solicitation result output by the solicitation list output unit 19 and the applicant list are output (S210 in FIG. 2). In this process, the application result is read from the recruitment result storage unit 14, the number of records in which the application presence / absence item is “present” is output as the application number (recruitment result), and the above-described application list is output. .

In the above-described example, a value that is invariant with respect to time is used as the deviation limit value in the determination in S1614 in FIG. 16, but the initial distribution time is subtracted from the current time as in the following equation. A value that varies according to a given elapsed time may be used.
Elapsed time = current time-initial delivery time;
Deviation limit value = function (elapsed time);
Alternatively, the deviation rate may be calculated and determined based on the deviation rate. For example, it may be determined whether the deviation rate exceeds a predetermined threshold, and if it exceeds, the status may be set to “replenishment required”. The deviation rate can be obtained by dividing the deviation width by the total expected value.
Deviation rate = Deviation width / Total expected value;
The recruitment support apparatus is a computer, and each element can execute processing by a program. Further, the program can be stored in a storage medium so that the computer can read the program from the storage medium.

It is a figure which shows the structure of a recruitment assistance apparatus. It is a figure which shows the whole processing flow. It is a figure which shows the example of a job offer condition memory | storage part. It is a figure which shows the example of a required number memory | storage part. It is a figure which shows the example of a personnel database. It is a figure which shows the example (the 1) of a candidate list memory | storage part. It is a figure which shows the processing flow of selection of an initial delivery destination. It is a figure which shows the example (the 1) of a delivery destination list memory | storage part. It is a figure which shows the example (the 2) of a candidate list memory | storage part. It is a figure which shows the example (initial stage) of transition of an application expected value. It is a figure which shows the flow of an application expected value specific process. It is a figure which shows the example of an application performance database. It is a figure which shows the processing flow of recruitment mail delivery. It is a figure which shows the example (the 2) of a delivery destination list memory | storage part. It is a figure which shows the example (the 1) of an offer result memory | storage part. It is a figure which shows the processing flow of a condition monitoring. It is a figure which shows the example (the 2) of an offer result memory | storage part. It is a figure which shows the example of transition of an application expected value and an application total number. It is a figure which shows the processing flow (1/2) of selection of a supplement delivery destination. It is a figure which shows the concept of the expectation value applied in remaining time. It is a figure which shows the processing flow (2/2) of selection of a supplement delivery destination. It is a figure which shows the example (correction stage) of a transition of an application expected value. It is a figure which shows the example (the 3) of a delivery destination list memory | storage part. It is a figure which shows the example (the 2) of an offer result memory | storage part. It is a figure which shows the example of an application list.

Explanation of symbols

  1 job offer condition input unit, 2 job offer condition storage unit, 3 required number of people and deadline time input unit, 4 required number of people storage unit, 5 deadline time storage unit, 6 candidate extraction unit, 7 human resource database, 8 candidate list storage unit, 9 initial distribution destination selection unit, 10 expected application value specifying unit, 11 application record database, 12 distribution destination list storage unit, 13 recruitment mail distribution unit, 14 recruitment result storage unit, 15 situation monitoring unit, 16 deviation limit value storage unit, 17 supplement delivery destination selection unit, 18 applicant list generation unit, 19 recruitment result and application list output unit.

Claims (6)

Recruitment support device that supports recruitment by communication means, and has the following elements: (1) As a result of application for each applicant , notification of recruitment is sent to the applicant Application record database that stores the number of distributions delivered and the application response time for each delivery (2) For those who have applied for the application, the application application time is counted within the time interval for specifying the expected value, and the number of applications counted Divide the number of times by the number of distributions and calculate the expected application value according to the time interval for specifying the expected value of the experienced applicant. (3) Candidate list storage unit that stores the candidate group ( 4) for each candidate, as the time interval at which the initial wait time to identify the expected value from the delivery scheduled time deadline time, to calculate the applicants expected value of the initial wait time has elapsed time to apply the expected value specifying unit, double When the sum satisfies a predetermined relationship to require applicants number of the related candidates initially applicants expected waiting time elapse, the initial distribution destination selection section for selecting the plurality of candidates as the initial delivery destination
(5) After the first delivery, for each delivery destination, let the application expectation value specifying unit calculate the application expectation value at the present time with the elapsed time from the delivery time to the current time as the time interval for specifying the expectation value, A situation monitoring unit that repeats the process of determining that supplementary distribution is necessary when the total of the application expectation values at the current time regarding the distribution destination does not satisfy the predetermined relationship with the total number of applications
(6) When it is determined that supplement delivery is necessary,
For delivery destinations that do not apply, the waiting time from the delivery time to the deadline time is set as the time interval for specifying the expected value, and the expected application value expected to be applied from the delivery to the deadline is calculated in the expected application value specification unit. In addition, let the elapsed time from the delivery time to the current time be the time interval for specifying the expected value, and let the expected application value specification unit calculate the expected application value that expects the application from the delivery to the present time, and from the delivery to the deadline Subtract the expected application value expected from the distribution to the present time from the expected application value expected for the current application to obtain the expected application value for the remaining waiting time, and add up the expected application values for all these remaining waiting times. ,
For one or a plurality of further candidates, the application expected value is the expected application value expected to be applied from supplementary delivery to the deadline, with the waiting time from the scheduled delivery time to the deadline time as the time interval for specifying the expected value. Let the specific part calculate,
The total expected value obtained by adding the expected application value expected from the supplementary delivery to the deadline is added to the total expected application value of the remaining waiting time, and the remaining application number is obtained by subtracting the current total number of applications from the required number of applications. On the other hand, a replenishment distribution destination selection unit that selects the further candidate as a replenishment distribution destination when the total expected value satisfies a predetermined relationship . 2. The recruitment support apparatus according to claim 1, further comprising a recruitment notification delivery unit that sends a recruitment notice to the initial delivery destination and the supplementary delivery destination . The recruitment support apparatus according to claim 1, wherein the initial delivery destination selection unit selects the plurality of candidates as initial delivery destinations when a total of expected application values satisfies a required number of applications. When the status monitoring unit calculates the divergence width by subtracting the total number of applications at the present time from the total expected value that is the total of the expected application values for all distribution destinations at the current time, and the divergence width exceeds the predetermined divergence limit value 2. The recruitment support apparatus according to claim 1, wherein it is determined that supplementary delivery is necessary. 2. The recruitment support apparatus according to claim 1, wherein the supplementary delivery destination selection unit selects the further candidate as the supplementary delivery destination when the total expected value satisfies the remaining recruitment number. Application results database for storing the number of distributions of notifications of recruitment to application applicants and application response time for each distribution , and candidate list for storing candidates as application results for each application experience A program for causing a computer to be a recruitment support apparatus that has a storage unit and supports recruitment by communication means to execute the following procedure
(1) For each candidate, count the number of applications whose application response time is within the initial waiting time interval from the scheduled delivery time to the deadline time, divide the counted number of applications by the number of distributions, If the expected application value at the time when the waiting time has elapsed is calculated, and the total of the expected application values at the time when the initial waiting time has elapsed for the plurality of candidates satisfies the predetermined relationship with the required number of applications, the plurality of candidates To select as the initial delivery destination
(2) Procedure for sending notification of recruitment to the initial delivery destination
(3) For each delivery destination after the first delivery, count the number of times that the application response time is within the elapsed time interval from the delivery time to the current time, divide the counted number of times by the number of times of delivery, and apply at the present time. A procedure to calculate the expected value and repeat the process of determining that supplementary delivery is necessary when the total of expected application values for all distribution destinations does not satisfy the predetermined relationship with the total number of applications at the current time
(4) When it is determined that supplement delivery is necessary,
The distribution destinations that do not apply are counted the number of applications whose application response time is within the waiting time interval from the distribution time to the deadline time, and the application number from the distribution to the deadline is divided by the number of distribution times Calculate the expected application value, count the number of applications that are within the elapsed time interval from the distribution time to the current time, divide the counted application number by the distribution number, and expect the application from distribution to the present time Calculate the application expectation value, subtract the application expectation value that expects the application from the delivery to the present time from the application expectation value that expects the application from the delivery to the deadline, and obtain the application expectation value of the remaining waiting time. Total expected application values for all remaining waiting times,
For one or more candidates, count the number of applications whose application response time is within the waiting time interval from the scheduled delivery time to the deadline time, divide the counted number of applications by the delivery count, Calculate the application expectation value that expects application by the deadline,
The total expected value obtained by adding the expected application value expected from the supplementary delivery to the deadline is added to the total expected application value of the remaining waiting time, and the remaining application number is obtained by subtracting the current total number of applications from the required number of applications. On the other hand, when the total expected value satisfies a predetermined relationship, a procedure for selecting the further candidate as a supplementary delivery destination
(5) A procedure for sending a notice of recruitment to the supplementary delivery destination.

Images