JP2012103810A - Schedule generation program, device, and method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To generate a schedule so that a plurality of users impartially actualize desires.SOLUTION: A first schedule associated with an arrangement satisfying desire data, including an identifier of a user and desired time set by the user, and a rule of an arrangement in which time within a predetermined period and the user are made to correspond to each other, at least partially is generated based upon the desire data stored in a desire data storage part storing the desire data, and the rule. Then the first schedule and the rule are compared with each other to determine whether the first schedule includes an arrangement which does not satisfy the rule based upon a result of the comparison. When the first schedule includes the arrangement which does not satisfy the rule, some desired time included in the desire data is excluded based upon data stored in a desire actualization state data storage part stored with data associated with past desire actualization states by users, and a second schedule is generated based upon desired time of the desire data other than the excluded desired time.

Description

  The present technology relates to a schedule generation technology.

  For example, when creating a work schedule for nurses, in addition to the wishes of each nurse, conditions that must be met in the performance of the work (number of employees, continuous work not exceeding the standard, prohibited work such as night work not continuing) It is required to generate a work schedule that does not become a pattern, satisfies the conditions regarding the skill level of the working nurse, matches the patient's symptoms, etc.). . Conventionally, when a work schedule cannot be generated so as to satisfy all of the nurse's wishes and such conditions, the administrator who creates the work schedule (such as the nurse manager) gives priority to the conditions that must be satisfied in the performance of the work. A work schedule will be generated.

  On the other hand, there is a conventional technique for creating a work shift based on, for example, a condition desired by a worker and a work shift record created in the past.

JP 2008-269256 A

  Here, when the work schedule is created with priority given to the conditions that should be satisfied in the execution of the work, the nurses who cannot realize the hopes are dissatisfied. However, in creating a conventional work schedule, the decision of whether to adopt hope or not is largely due to the best of the administrator, and it is not always necessary to consider whether each nurse has achieved hope fairly. Was not. In other words, in the conventional work schedule creation, fair work selection cannot be automatically performed. Furthermore, the burden and effort of the administrator who creates the work schedule is also increased.

  In addition, the technique disclosed in Patent Document 1 cannot create a work shift that satisfies a condition (for example, the number of personnel, etc.) that should be satisfied for business execution, for example.

When reflecting not only such work schedules but also the desires of personnel assigned based on schedules in the generation of various schedules such as the use of facilities, the above-mentioned problems exist, but appropriate The correct solution is not shown.
Therefore, the objective of this technique is providing the technique for producing | generating a schedule so that hope may be implement | achieved as fairly as possible with respect to several users as one side surface.

  The method includes: (A) desired data stored in a desired data storage unit that stores desired data including a user identifier and a desired date and time set by the user; Generating a first schedule relating to the arrangement satisfying the desired data and at least a part of the rule based on the arrangement rule to be associated, and storing the first schedule in a data storage unit; and (B) data Comparing the first schedule stored in the storage unit with the rule, and determining whether the first schedule includes an arrangement that does not satisfy the rule based on the comparison result; When it is determined that one schedule includes an arrangement that does not satisfy the above rule, a desired realization that stores data on past desired realization status for each user Based on the data stored in the status data storage unit, a part of the desired date and time included in the desired data stored in the desired data storage unit is excluded, and the desired date and time other than the excluded desired date and time among the desired data And generating a second schedule and outputting the second schedule.

  It becomes possible to generate a schedule so as to realize hope as fairly as possible to a plurality of users.

FIG. 1 is a system configuration diagram of the embodiment. FIG. 2 is a functional block diagram of the scheduling server. FIG. 3 is a diagram illustrating an example of a desired input screen. FIG. 4 is a diagram illustrating a processing flow according to the embodiment. FIG. 5 is a diagram illustrating an example of data stored in the desired data storage unit. FIG. 6 is a diagram illustrating an example of data stored in the patient DB. FIG. 7 is a diagram illustrating an example of essential personnel data. FIG. 8 is a diagram showing an example of the desired data in the schedule table format. FIG. 9 is a diagram illustrating an example of the initial schedule table. FIG. 10 is a diagram illustrating a processing flow of the second schedule generation processing. FIG. 11 is a diagram illustrating an example of data stored in the satisfaction degree DB. FIG. 12 is a diagram for explaining the desired priority. FIG. 13 is a diagram for explaining the desired priority. FIG. 14 is a diagram illustrating a calculation example of the desired priority. FIG. 15 is a diagram illustrating an example of ranking of desired priorities. FIG. 16 is a diagram for explaining the second schedule generation process. FIG. 17 is a diagram illustrating an example of desired data after deletion of a specific desired input. FIG. 18 is a diagram illustrating an example of a schedule table generated in the second schedule generation process. FIG. 19 is a diagram illustrating a processing flow of the second schedule generation processing. FIG. 20 is a diagram for explaining the second schedule generation process. FIG. 21 is a diagram for explaining the second schedule generation process. FIG. 22 is a diagram for explaining the second schedule generation process. FIG. 23 is a diagram showing a processing flow according to the present embodiment. FIG. 24 is a diagram illustrating a processing flow of the third schedule generation processing. FIG. 25 is a diagram for explaining the third schedule generation process. FIG. 26 is a diagram for explaining the third schedule generation process. FIG. 27 is a diagram for explaining the third schedule generation process. FIG. 28 is a diagram for explaining the third schedule generation process. FIG. 29 is a diagram for explaining the third schedule generation process. FIG. 30 is a diagram for explaining the third schedule generation process. FIG. 31 is a diagram for explaining the third schedule generation process. FIG. 32 is a diagram for explaining the third schedule generation process. FIG. 33 is a diagram illustrating an example of basic data. FIG. 34 is a diagram illustrating an example of data stored in the updated satisfaction DB. FIG. 35 is a diagram for explaining processing verification according to the present embodiment. FIG. 36 is a diagram for explaining the verification of the processing according to the present embodiment. FIG. 37 is a diagram for explaining processing verification according to the present embodiment. FIG. 38 is a diagram for explaining the verification of the processing according to the present embodiment. FIG. 39 is a diagram for explaining the verification of the processing according to the present embodiment. FIG. 40 is a diagram for explaining the verification of the processing according to the present embodiment. FIG. 41 is a functional block diagram of a computer.

  FIG. 1 shows a system according to an embodiment of the present technology. The following describes a system for generating a nurse work schedule as an example. As shown in FIG. 1, in the system according to the present embodiment, for example, a nurse terminal operates a network 1 that is, for example, a LAN (Local Area Network), and a nurse terminal 5 that is a personal computer operated by the nurse director, for example. For example, a plurality of nurse terminals 7 that are personal computers are connected to a scheduling server 3 that performs main processing in the present embodiment. The scheduling server 3 may have other functions such as a login management function and attendance management for nurses, for example. However, the scheduling server 3 is not a main part in the present embodiment, and will not be described below. Further, the teacher terminal 5 and the nurse terminal 7 may be switched according to a user who is logged in to the scheduling server 3 or may be a dedicated terminal. Furthermore, a device other than a personal computer may function as a terminal.

  Next, FIG. 2 shows a functional block diagram of the scheduling server 3. The scheduling server 3 includes a rule database (DB) 31, a patient DB 32, an instruction input unit 33, a schedule generation unit 34, a schedule data storage unit 35, a schedule processing unit 36, a desired input unit 37, and desired data. The storage unit 38, the satisfaction DB 39, the desired priority calculation unit 40, the schedule DB 41, the basic data storage unit 42, the satisfaction DB update unit 43, and the output unit 44 are included.

  The desire input unit 37 stores, for example, the desired data received from the nurse terminal 7 in the desired data storage unit 38. For example, according to an instruction from the instruction input unit 33, the schedule generation unit 34 performs a scheduling process on the data stored in the desired data storage unit 38 according to the data of the rule DB 31 and the patient DB 32, The result is stored in the schedule data storage unit 35. The schedule processing unit 36 performs processing using data stored in the schedule data storage unit 35, the rule DB 31, and the desired data storage unit 38, and registers final schedule data in the schedule DB 41. In some cases, the schedule processing unit 36 cooperates with the schedule generation unit 34 and the desired priority calculation unit 40. The desired priority calculation unit 40 updates the data stored in the desired data storage unit 38 using the data stored in the satisfaction DB 39 and the desired data storage unit 38. Further, the schedule processing unit 36 generates data for updating the satisfaction degree DB 39 from the desired data used for generating the schedule registered in the schedule DB 41 and stores the data in the basic data storage unit 42. The satisfaction DB update unit 43 updates the satisfaction DB 39 using data stored in the basic data storage unit 42 and the satisfaction DB 39. The output unit 44 outputs the schedule data registered in the schedule DB 41 to the requesting terminal or the like.

  Next, the operation of the scheduling server 3 will be described with reference to FIGS. For example, in response to access from the nurse terminal 7, the wish input unit 37 of the scheduling server 3 transmits the desired input page data to the nurse terminal 7, and when the nurse terminal 7 receives the desired input page data, The input page is displayed on the display device. For example, a desired input screen as shown in FIG. 3 is displayed. In the example of FIG. 3, the nurse name or user ID is displayed, and one or more desired data sets including a desired date, a desired work style, and a desired degree are input. It has become. In the example of FIG. 3, three desired data sets (hereinafter, the desired input represented by the desired data set may be called “desired”) have already been input. Note that the desired work mode is, for example, day shift, vacation, early departure, late departure, night shift, semi-night shift, or the like. The desired level is a level representing the desired strength (or importance level), and is displayed in 10 levels here. However, 1 is the weakest hope and 10 is the strongest hope. Further, in the present embodiment, there is an upper limit on the desired number in January, and it is not possible to input multiple requests on the same day. Further, it is assumed that there is an upper limit to the total desired degree in January. The desired data set input in this way is transmitted from the nurse terminal 7 to the scheduling server 3 in accordance with an instruction from the nurse.

  Upon receiving the desired data set from the nurse terminal 7, the desired input unit 37 of the scheduling server 3 stores the desired data set in the desired data storage unit 38 (FIG. 4: step S1). For example, data shown in FIG. 5 is stored in the desired data storage unit 38. In the example of FIG. 5, the nurse name or user ID, the desired date, the desired work mode, the desired degree, and the desired priority are registered. However, the desired priority is not registered in this step.

  For example, after accepting the input of such a desired data set by the nurse for a certain period, the nurse operates the teacher terminal 5 and instructs the instruction input unit 33 of the scheduling server 3 to generate a schedule. The instruction input unit 33 instructs the schedule generation unit 34 to generate a schedule in response to an instruction from the teacher terminal 5. In response to an instruction from the instruction input unit 33, the schedule generation unit 34 performs scheduling processing on the desired data stored in the desired data storage unit 38 according to the rule DB 31 and the patient DB 32, and generates an initial schedule table. And stored in the schedule data storage unit 35 (step S3). The schedule generation unit 34 according to the present embodiment is an existing schedule generation engine that generates schedule data according to the rule DB 31 and the patient DB 32.

  In the rule DB 31 in the present embodiment, the rules regarding the number of employees for each work style, the rules for the allowable number of consecutive work days, the rules for the prohibited work pattern, and the prohibitions on the ranks of nurses, etc. Rules for rank combinations and rules for nurse combinations to be avoided are registered. The prohibited work pattern includes, for example, a pattern in which night work is not possible for two consecutive days. Moreover, the rule about the prohibition rank combination includes, for example, a rule that night shift between newcomers is not possible. That is, the rule DB 31 stores rules for associating nurses and the like with work days and work states (including the concept of time zones).

  The patient DB 32 stores data as shown in FIG. 6, for example. In the example of FIG. 6, a patient ID, a patient name, a disease name, a severity, an essential nursing rank, a scheduled hospitalization date, and a scheduled discharge date are registered. For example, the higher the required nursing rank, the higher the nurse assigned.

  The schedule generation unit 34 determines the required personnel configuration for each day of the period in which the schedule should be generated from the rules regarding the personnel for each work style registered in the rule DB 31 and the required nursing rank of the patient DB 32. Pre-processing is performed. Then, for example, essential personnel data as shown in FIG. 7 is generated and registered in the rule DB 31 in this embodiment. In the example of FIG. 7, data on the number of essential personnel calculated for each date and each work style is included.

  Thereafter, the schedule generation unit 34 satisfies the rules described above and the desires of the nurse included in the desired data set stored in the desired data storage unit 38, and schedules the schedule so as to satisfy the required number of personnel as much as possible. Generate. Since such processing has been performed conventionally, it will not be described further.

  For ease of explanation below, the desired data set stored in the desired data storage unit 38 is also expressed as desired data in the same format as the schedule table. That is, as shown in FIG. 8, each nurse is represented as a table in which a desired work style and desired degree are arranged every day. For example, “day (3)” represents that he / she desired day shift with a degree of desire 3. Similarly, “vacation (7)” indicates that a vacation is desired with a desired degree of 7.

  And the schedule production | generation part 34 produces | generates an initial schedule table as shown, for example in FIG. In the example of FIG. 9, the assignment result of the daily work schedule is included for each nurse. However, as described above, at this stage, the assignment is made so as to satisfy all the desires of all the nurses, and the required number of personnel may not be satisfied. In the example of FIG. 9, the desired degree of work is set by indicating the desired degree. In addition, in the example of FIG. 9, the error that does not satisfy the required number of personnel and the total of the insufficient number are also shown, but the error has not yet been determined in step S <b> 3.

  Thereafter, the schedule processing unit 36 checks whether an error exists in the initial schedule table stored in the schedule data storage unit 35 (step S5). Here, for each day, the number of employees in each work style is counted and compared with the required number of staff in each work form shown in FIG. 7. If the counted number of staff does not reach the required number of staff, it is judged as an error. To do. In addition, since the number of shortages may be used in the following processing, after counting the number of shortages for each work style, the total number of shortages is calculated as indicated by the numbers in the bottom line of FIG. If no error exists in the initial schedule table (step S7: No route), the process proceeds to the process of step S19 in FIG.

  On the other hand, when an error exists in the initial schedule table, the schedule processing unit 36 performs a second schedule generation process (step S9). The second schedule generation process will be described with reference to FIGS.

  The schedule processing unit 36 instructs the desired priority calculating unit 40, and the desired priority calculating unit 40 satisfies the desired priority for each desired data set stored in the desired data storage unit 38 according to the instruction. It calculates using the data stored in the degree DB 39 and stores it in the desired data storage unit 38 (FIG. 10: step S21).

  For example, data shown in FIG. 11 is stored in the satisfaction DB 39. In the example of FIG. 11, satisfaction, a history of a desired number that is the number of desired inputs, a history of a desired realized number that is the number of realized desired inputs, and a desired realization rate are registered for each nurse. It has become. The satisfaction level in the satisfaction level DB 39 is the difference between the desired level included in the desired data set for the realized wish and the desired level included in the desired data set for the hope not realized. The history of the desired number includes, for example, six months and the total, and the same applies to the history of the desired number of realizations. The desired realization rate is a value calculated by the sum of the desired realization number / the total desired number (the desired realization degree is a value multiplied by 100).

  In step S21, the second satisfaction degree is calculated for each nurse on the assumption that all the desired inputs have been realized this time. Specifically, for each nurse, the second satisfaction level = past satisfaction level + the desired level total included in the current desired data set is calculated. Further, under the same assumption, the second desired realization rate is calculated for each nurse. Specifically, for each nurse, the second desired realization rate = (total number of desired realizations from the last 5 months + number of desired inputs this time) / (total desired numbers from the last 5 months + current The number of desired inputs). Further, the desired priority is calculated for each nurse as follows.

ここでＡ＝注目する希望データセットに含まれる希望度、Ｂ＝第２の満足度、Ｃ＝第２の希望実現率×１００（＝第２の希望実現度）である。

Here, A = desired degree included in the target desired data set, B = second satisfaction degree, C = second desired realization rate × 100 (= second desired realization degree).

  The denominator of equation (1) is the square root of the sum of the second satisfaction squared and the second desired realization squared. This represents the individual's overall satisfaction, that is, the individual's overall satisfaction. The second desired degree of realization represents the degree of realization of hope as the number of times, but this alone cannot represent the overall satisfaction of the individual. That is, the satisfaction is not increased unless only a low hope is realized and a high hope is not realized. Therefore, in order to compensate for such a problem of desired realization, the second satisfaction expressed by the difference between the realized desired degree and the unrealized desired degree is used. This point will be described with reference to FIGS.

  For example, as shown in FIG. 12, it is assumed that the second satisfaction degree, the second desired realization degree, and the personal total satisfaction degree are calculated for each nurse.

  This is represented by a graph as shown in FIG. In the example of FIG. 13, the horizontal axis represents the second satisfaction level, and the vertical axis represents the second desired realization level, and nurses A, B, and C are plotted on such a plane. Yes. The personal overall satisfaction indicates the distance from the origin of this plane, and the greater the distance from the origin, the greater the value, and the overall satisfaction increases. On the contrary, when the second satisfaction level = 100 and the second desired realization level = 100 are set as reference points, the closer to the reference point, the higher the overall satisfaction. In FIG. 13, a line equidistant from the reference point is represented by an arc so that the same satisfactory point can be easily understood even if the angle from the reference point is different.

  In the formula (1), the denominator is set to such individual satisfaction, and the desired degree of hope is set for the numerator. The priority is higher for nurses with lower values and less satisfaction. On the other hand, if the desired degree is a large value, the desired priority is a large value, and if the desired degree is a small value, the desired priority is a small value.

  However, Formula (1) is an example. For example, in the above description, it is assumed that the second satisfaction level and the second desired realization level are treated equally. However, the second satisfaction level and the second desired realization level may be changed so as to be weighted. Furthermore, although the square root is calculated, the same value can be obtained without calculating the square root.

  By executing step S21, a value is set in the desired priority column of FIG.

  When the desired priority is calculated in this way, the schedule processing unit 36 sorts the desired inputs in ascending order based on the desired priority (step S23). For example, when the desired priority is calculated for each desired input as shown in FIG. 14, ranking is performed in ascending order of the desired priority as shown in FIG. The numerical values shown in FIG. As mentioned above, if the preference priority is small, the preference input is a low value or a preference for a nurse who is already highly satisfied, so the preference entry is deleted preferentially. . Here, the desired input of nurse B on July 2, 2010 is the lowest desired priority.

  Then, the schedule processing unit 36 sets the counter i to 1 (step S24), and temporarily deletes the desired input of the i-th desired priority in the desired data (step S25). As indicated by a circle in FIG. 16, if “desired input of nurse B on July 2, 2010” which is the desired input having the lowest desired priority in the desired data is temporarily deleted, the desired data is The state is as shown in FIG. This reduces the conditions to be met. For example, the desired data stored in the desired data storage unit 38 is copied, and the desired input to be deleted is deleted from the desired data to be copied.

  Then, the schedule processing unit 36 instructs the schedule generation unit 34 to execute the scheduling process, and the schedule generation unit 34 performs the scheduling process on the desired data after the specific desired input is deleted, the rule DB 31 and the patient DB 32. The schedule table is generated and stored in the schedule data storage unit 35 (step S27). Since this process is the same as the process in step S3 except that the desired data after the specific desired input is deleted is used, no further description will be given.

  For example, it is assumed that a schedule table as shown in FIG. 18 is generated. Compared with the initial schedule table shown in FIG. 9, the assigned work schedule is slightly changed.

  Then, the schedule processing unit 36 compares the schedule table stored in the schedule data storage unit 35 with the essential personnel data (for example, FIG. 7) stored in the rule DB 31, and the day when the number of essential personnel is not satisfied. It is determined whether or not there is an error (step S29). For example, as shown in the bottom line of FIG. 18, an error remains.

  If no error exists (step S31: No route), the schedule processing unit 36 sets no error, for example, for the schedule table generated this time (step S33), and returns to the original process via the terminal C. Return. In this way, if the deletion target is replaced in the order of lower priority, and the process ends when there are no errors, the desired input to be deleted is minimized, that is, the number of nurses who are dissatisfied is minimized. Schedule generation.

  On the other hand, if an error exists (step S31: Yes route), the schedule processing unit 36 performs a process of restoring the desired data (step S35). For example, the desired data after deleting a specific desired input is discarded, and the original desired data stored in the desired data storage unit 38 is validated. Then, the schedule processing unit 36 increments the counter i by 1 (step S37), and proceeds to the processing of FIG.

  Shifting to the description of the processing in FIG. 19, the schedule processing unit 36 determines whether the counter i exceeds the total number of desired inputs (step S <b> 39). If not, the process returns to step S25 via the terminal E. On the other hand, if the counter i exceeds the total number of desired inputs, the schedule processing unit 36 sets an error to the schedule table generated this time (step S41), and returns to the original process.

  As described above, even if the desired input to be deleted is changed and the scheduling process is performed in ascending order of the desired priority, the error may not be resolved.

  For example, when the presence of an error is confirmed in FIG. 18, as shown in FIG. 20, “the desired input of nurse B on July 2, 2010” which is the desired input having the lowest desired priority is displayed. Return to the original state, and select “the desired input of nurse C on July 1, 2010” which is the desired input having the second lowest desired priority. Then, as shown in FIG. 21, “the desired input of nurse C on July 1, 2010” which is the desired input having the second lowest desired priority is temporarily deleted, and the schedule generating unit 34 Then, the scheduling process is performed. Then, for example, a schedule table as shown in FIG. 22 is generated. Compared with the schedule table of FIG. 18, the error is resolved on July 1, 2010, but the error remains in other parts. Therefore, although description is omitted below, the second lowest desired priority is restored and the desired input having the third lowest preferred priority is temporarily deleted. Such processing is repeated until the error is resolved. In this example, it is assumed that the error is not resolved even if the desired input with the highest desired priority is deleted.

  Returning to the description of the processing in FIG. 4, the schedule processing unit 36 confirms whether an error is set in the schedule table stored in the schedule data storage unit 35 (step S <b> 11). The processing shifts to the processing in FIG.

  Shifting to the description of the processing in FIG. 23, the schedule processing unit 36 determines whether an error is set (step S15). If there is no error, the process proceeds to step S19. On the other hand, if an error is set, the schedule processing unit 36 performs a third schedule generation process (step S17). The third schedule generation process will be described with reference to FIGS.

  The schedule processing unit 36 identifies the day with the largest total shortage from the initial schedule table stored in the schedule data storage unit 35 (FIG. 24: step S51). For example, it is assumed that the initial schedule table is as shown in FIG. 25, and the numerical value shown in the bottom line is the total number of shortages. Then, July 1, 2010 is specified in the example of FIG.

  Then, the schedule processing unit 36 selects the desired input having the lowest desired priority among the remaining desired inputs on the specified day as the desired data (the deletion generated in the process of the previous step S53 when the repeated process is performed). Desired data deleted from (desired desired data) is generated and stored in a storage device such as a main memory (step S53). In the example of FIG. 25, two desired inputs are included on July 1, 2010. As shown in FIG. 26, the desired input of the nurse C has a lower priority. Therefore, as schematically shown in FIG. 27, the desired input of nurse C on July 1, 2010 is specified from the desired data, and the desired data after deletion is generated as shown in FIG.

  If there is no remaining desired input on the specified date, the day with the next largest number of shortages is specified, and the desired data with the lowest desired priority among the remaining desired inputs on that day is selected. Delete from.

  Thereafter, the schedule processing unit 36 instructs the schedule generation unit 34 to perform the scheduling process, and the schedule generation unit 34 performs the scheduling process on the desired data after deletion according to the rule DB 31 and the patient DB 32, and the schedule A table is generated and stored in the schedule data storage unit 35 (step S55). Since this process is the same as the process in step S3 except that the desired data after the specific desired input is deleted is used, no further description will be given.

  For example, it is assumed that a schedule table as shown in FIG. 29 is generated. Compared to the initial schedule shown in FIG. 25, the error of July 1, 2010 has been eliminated, and the number of shortages has also decreased. In step S55, the shortage is not calculated.

  Then, the schedule processing unit 36 compares the schedule table stored in the schedule data storage unit 35 with the essential personnel data (for example, FIG. 7) stored in the rule DB 31, and the day when the number of essential personnel is not satisfied. It is determined whether or not there is an error (step S57). If there is an error, the total number of shortages is calculated by adding up the shortage for each work style. In the example of FIG. 29, it is assumed that an error remains as shown in the bottom line.

  When there is an error (step S59: Yes route), the schedule processing unit 36 identifies the day with the largest total shortage from the schedule table generated in step S55 (step S61). In the example of FIG. 29, July 4, 2010 is specified. Then, the process returns to step S53.

  Returning to step S53, the desired inputs of nurse A and nurse C remain, and from FIG. 14, the desired input of nurse C has a lower priority of preference, as indicated by a circle in FIG. I understand. Therefore, desired data (for example, FIG. 31) is generated by further deleting the desired input of the nurse C on July 4, 2010. As described above, in the third schedule generation process, the desired input is cumulatively deleted, and an error-free schedule table is generated somehow early.

  When the schedule table is generated again in step S55, for example, a schedule table as shown in FIG. 32 is obtained. In the example of FIG. 32, errors still remain. Therefore, the day with the most deficient personnel is specified. In the example of FIG. 32, July 4, 2010 and July 3, 2010 are specified. Thus, even when a plurality of days are specified, the desired input with the lowest desired priority is specified among those days. From FIG. 14, in the example of FIG. 32, the desired input of nurse B on July 3, 2010 is identified and deleted.

  Such processing is repeated until there is no error. When it is determined in step S59 that there is no error (step S59: No route), the schedule processing unit 36 sets no error for the schedule table in which there is no error. (Step S63). Then, the process returns to the original process.

  In this way, in order to eliminate errors, in order from the day when the total number of shortage personnel is large, desired inputs are cumulatively deleted in a form taking into account the desired priority, and an error-free schedule table is generated.

  Although there is a possibility that an error does not disappear in this process, in such a case, an error will occur regardless of how the personnel are arranged. Therefore, it is not assumed that there is a fundamental shortage of personnel.

  Returning to the description of the processing in FIG. 24, the schedule processing unit 36 stores the data of the schedule table stored in the schedule data storage unit 35 and set with no error or the data of the initial schedule table without error. Register in the schedule DB 41. In addition, the schedule processing unit 36 obtains the satisfaction DB 39 from the desired data used when generating the schedule table in which no error is set or from the initial desired data when there is no error in the initial schedule table. Basic data to be updated is generated and stored in the basic data storage unit 42.

  If the desired data such as shown in FIG. 27 cannot realize only the desired input of nurse B on July 2, 2010, basic data as shown in FIG. 33 is generated. That is, for each nurse, the desired degree for each desired input, the satisfaction degree calculated from the desired degree, the desired number, and the desired realized number are calculated. The desired degree for each desired input is a positive value if realized, and a negative value if not realized. Then, if you add the desired degrees, you will be satisfied with this month. The desired number is the number of desired inputs, and the desired realization number is the number of realized desired inputs. “Realized” means that it remains in the desired data without being deleted.

  Then, the satisfaction level DB update unit 43 updates the satisfaction level DB 39 using the basic data stored in the basic data storage unit 42 (step S19). The satisfaction DB 39 is updated to a state as shown in FIGS. Specifically, for satisfaction, the current satisfaction as shown in FIG. 33 is added to the past satisfaction. Further, for the desired number history, the oldest desired number data is discarded, the current desired number as shown in FIG. 33 is registered, and the total desired number is recalculated. Similarly, with respect to the history of the desired number of realizations, the data of the oldest desired realization number is discarded, the current desired realization number as shown in FIG. 33 is registered, and the total of the desired realization numbers is calculated again. Further, with respect to the desired realization rate, the desired realization number is recalculated from (total desired number) / (total desired number) from the total desired number after update and the total desired number after update.

  By performing the processing as described above, data used for the next schedule generation is prepared.

  Thereafter, the output unit 44 transmits the data of the schedule table stored in the schedule DB 41 to, for example, the teacher terminal 5 that has instructed the schedule generation (step S20). The teacher terminal 5 receives the data of the schedule table and displays it on the display device. In this way, an error-free schedule table can be obtained. That is, the labor of the nurse chief is greatly reduced. In addition, as described above, priority is given to the desired inputs with an index that reflects the satisfaction of the nurse, and the desired inputs are deleted according to the priorities in order to eliminate errors. A schedule table is generated in a manner that imparts

  In the processing described above, a schedule table is generated in three stages. The first-stage schedule table is an initial schedule table generated to satisfy all desired inputs. The schedule table at the second stage is a schedule table generated while replacing the desired input to be deleted according to the desired priority when there is an error in the initial schedule table. The third-stage schedule table is a schedule table that is generated by deleting desired probabilities in order of increasing degree of error and in order of priority when errors cannot be resolved in the second-stage schedule table. .

  In the present embodiment, the overall satisfaction is highest if there is no error in the first-stage schedule table, and the satisfaction is reduced by the first-stage schedule table at the second stage, and further at the third stage. descend. This point will be verified.

  For example, as shown in FIG. 35, it is assumed that all desired inputs are realized. That is, when the initial schedule table is adopted and the basic data of FIG. 35 is obtained, the data (only a part) of the satisfaction DB 39 as shown in FIG. 36 is obtained. The satisfaction level, the desired realization rate, and the personal overall satisfaction level can be obtained by the same calculation as that when the data shown in FIG. 34 is generated. On the other hand, the overall satisfaction is calculated as the sum of the individual overall satisfaction.

  Next, consider the case where only the desired input of nurse B on July 2, 2010, which has the lowest desired priority, has not been realized, that is, the second-stage schedule table is adopted. Then, basic data as shown in FIG. 37 is obtained, and data (only a part) of the satisfaction degree DB 39 as shown in FIG. 38 is obtained. In this way, the overall personal satisfaction of the nurse B is lowered, and the overall satisfaction is also lowered.

  In addition, an error-free schedule table cannot be generated in the second stage, and there is no error by deleting the desired input of nurse A on July 5, 2010, which has the highest desired priority among the desired inputs 3 Assume that a stage schedule table is generated. If it does so, the basic data as shown in FIG. 39 will be obtained, and the data (only a part) of satisfaction DB39 as shown in FIG. 40 will be obtained. Thus, the personal overall satisfaction of the nurse A is lowered, and the overall satisfaction is further lowered.

  Since the level of satisfaction gradually decreases as the level increases, an error-free schedule table is generated as early as possible at each level to maintain the overall level of satisfaction as much as possible.

  Although one embodiment of the present technology has been described above, the present technology is not limited to this. For example, the functional block diagram of the scheduling server 3 shown in FIG. 2 is an example, and may not match the actual program module configuration.

  As for the processing flow, as long as the processing result does not change, it is possible to change the processing order or perform the processing in parallel.

  For example, the generation of the second stage schedule table and the generation of the third stage schedule table can be performed in parallel if the desired priority level can be calculated. If an error-free schedule table is created in the second stage schedule table generation, there is no problem if the third stage schedule table is generated in parallel if the process is terminated at that time. In this way, if a schedule table without error at the second stage cannot be made, a final solution can be obtained immediately.

  As described above, it is not only applicable to the nurse's work schedule generation, but can be applied to other work schedule generation. Furthermore, the present invention can be applied to other technical fields in which scheduling is performed so as to impart a satisfactory feeling in consideration of a past desired realization state.

  Furthermore, although the work mode is set in units of days, other units of time may be used.

  Note that the scheduling server 3, the teacher terminal 5 and the nurse terminal 7 described above are computer devices, and as shown in FIG. A display control unit 2507 to be connected, a drive device 2513 for the removable disk 2511, an input device 2515, and a communication control unit 2517 for connecting to a network are connected by a bus 2519. An operating system (OS) and an application program for executing the processing in this embodiment are stored in the HDD 2505, and are read from the HDD 2505 to the memory 2501 when executed by the CPU 2503. The CPU 2503 controls the display control unit 2507, the communication control unit 2517, and the drive device 2513 according to the processing content of the application program, and performs a predetermined operation. Further, data in the middle of processing is mainly stored in the memory 2501, but may be stored in the HDD 2505. In an embodiment of the present technology, an application program for performing the above-described processing is stored in a computer-readable removable disk 2511 and distributed, and installed from the drive device 2513 to the HDD 2505. In some cases, the HDD 2505 may be installed via a network such as the Internet and the communication control unit 2517. Such a computer apparatus realizes various functions as described above by organically cooperating hardware such as the CPU 2503 and the memory 2501 described above and programs such as the OS and application programs. .

  The above-described embodiment can be summarized as follows.

  In the scheduling method according to the present embodiment, (A) scheduling data within a predetermined period (at least including designation about time and including other accompanying conditions) and desired data including a user identifier A step of generating a first schedule by performing a scheduling process on the desired data stored in the desired data storage unit to be stored according to a predetermined rule, and storing the first schedule in the data storage unit; and (B) a data storage unit And (C) a portion where the first schedule does not comply with the rules (for example, a portion where a shortage of personnel has occurred) is included. In some cases, the desired realization status that stores data on past desired realization status for each user Based on the data stored in the data storage unit, the part of the schedule setting wishes included in the desired data stored in the desired data storage unit is deleted, and the scheduling process for the desired data after the deletion is performed according to the above rules And a second schedule generation step of generating a second schedule that is completely compliant with the above-described rules and storing the second schedule in the schedule data storage unit.

  In this way, if a schedule setting request that cannot be realized in consideration of the desired status is specified, it is possible to generate a schedule that realizes the schedule setting request as fairly as possible to a plurality of users. become.

  Note that the desired data described above may further include a degree of desire representing the strength of the desired schedule setting. In that case, the second schedule generation step described above includes (C1) data regarding the past desired realization status stored in the desired realization status data storage unit for each schedule setting request included in the desired data; A priority order determining step for determining the priority order from the desired degree; and (C2) changing the schedule setting requests to be deleted among the schedule setting requests included in the desired data in the order of lower priority, The scheduling process may include a step of repeating until the second schedule is generated.

  In this way, it is possible to make the schedule setting request that cannot be realized as low a priority as possible, and to minimize the decrease in satisfaction.

  Further, the data regarding the past desired realization status includes the number of times that the desired schedule setting is realized and the total number of desired desired schedule settings, and the difference between the desired desired setting and the undesired desired desired setting. May be included. In this case, it is assumed that the priority determination step described above assumes that (C11) the schedule setting request included in the desired data is realized for each user from the data regarding the desired realization status and the desired data. Calculating a second number that is the number of times that the schedule setting request is realized, a second total number that is the total number of schedule setting requests, and a second satisfaction level that is the satisfaction level; For each schedule setting request included in the data, the desired realization according to the ratio of the second number to the second total number for the user regarding the schedule setting request and the second satisfaction for the user regarding the schedule setting request Calculating a desired priority that is a ratio of a desired degree with respect to the user's overall satisfaction calculated from the degree, and (C13) a desired priority By sorting in ascending order, it may include the steps of determining the priority of the scheduled setting desired to be included in the desired data.

  In this way, an objective desired priority can be calculated. Specifically, user satisfaction can be quantified based on the total satisfaction of the user, taking into account not only the number of times the desired schedule setting has been realized but also the degree of satisfaction that reflects the desired degree of schedule setting that has been realized. It is like that.

  In addition, the above-described total user satisfaction may be calculated by adding the square of the desired degree of realization and the square of the desired degree of realization. These may be weighted and added, or a square root may be calculated.

  Further, in the second schedule generation step described above, (C3) the scheduling process is performed on the desired data after deleting the schedule setting request with the highest priority from the desired data, but the second schedule is not generated. In the first schedule stored in the schedule data storage unit, a unit time specifying step for specifying a unit time of scheduling that should be most corrected based on the rule, and (C4) a unit specified from the desired data The schedule setting request with the lowest priority among the schedule setting requests for time is deleted, and a scheduling process is performed on the desired data after the deletion according to the rule, thereby generating a third schedule and storing it in the data storage unit A third schedule generation step, and (C5) data When the third schedule stored in the storage part includes a part that does not comply with the rules, the unit time specifying step is performed on the third schedule instead of the first schedule until the second schedule is generated. In addition, a step of performing a third schedule generation step using the desired data after deletion as the desired data may be further included.

  In this way, a schedule can be generated so as to satisfy the rules. Further, although errors are resolved based on unit time, since the priority order based on the desired priority is also used, it is possible to suppress a decrease in satisfaction due to schedule setting requests that cannot be realized as much as possible.

  Note that the desired data described above may further include a degree of desire that represents the strength of the desired schedule setting. In that case, the second schedule generation step described above includes (CC1) data regarding the past desired realization status stored in the desired realization status data storage unit for each schedule setting request included in the desired data. A priority order determining step for determining a priority order from the desired degree, and (CC2) a unit time for specifying a scheduling unit time to be most modified based on a rule in the first schedule stored in the schedule data storage unit A specific step and (CC3) by deleting the schedule setting request having the lowest priority among the schedule setting requests for the specified unit time from the desired data, and performing scheduling processing on the desired data after the deletion according to the rule The third schedule is generated and stored in the data storage unit. If the third schedule stored in the joule generation step and the (CC4) data storage unit includes a part that does not comply with the rules, the third schedule is used instead of the first schedule until the second schedule is generated. A step of performing a unit time specifying step for the schedule and performing a third schedule generation step using the desired data after deletion as the desired data. Such variations are also possible.

  It is possible to create a program for causing a computer to carry out the processing described above, such as a flexible disk, an optical disk such as a CD-ROM, a magneto-optical disk, and a semiconductor memory (for example, ROM). Or a computer-readable storage medium such as a hard disk or a storage device. Note that data being processed is temporarily stored in a storage device such as a RAM.

  The following supplementary notes are further disclosed with respect to the embodiments including the above examples.

(Appendix 1)
On the computer,
The desired data stored in the desired data storage unit (FIG. 2:38) for storing the desired data including the user identifier and the desired date and time set by the user, the date and time within a predetermined period, and the user. A first schedule relating to the arrangement that satisfies the desired data and at least a part of the rule is generated based on the arrangement rule to be associated, and the first schedule is stored in a data storage unit (FIG. 2:35). (FIG. 4: S3)
The first schedule stored in the data storage unit is compared with the rule, and based on the comparison result, it is determined whether the first schedule includes an arrangement that does not satisfy the rule. 4: S5)
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, it is stored in a desired realization status data storage unit (FIG. 2:39) that stores data related to past desired realization status for each user. Based on the stored data, a part of the desired date / time included in the desired data stored in the desired data storage unit is excluded, and based on a desired date / time other than the excluded desired date / time among the desired data. Then, the second schedule is generated and the second schedule is output (FIG. 4: S9-FIG. 23: S17).
Schedule generation program for executing processing.

(Appendix 2)
In the second schedule generation,
The schedule generation program according to appendix 1, wherein a desired date and time to be excluded is changed among the desired dates and times until the second schedule that does not include an arrangement that does not satisfy the rule is generated.

(Appendix 3)
The desired data further includes a degree of hope representing strength of hope for the desired date and time by the user,
The computer further includes:
Based on the data related to the past desired realization status stored in the desired realization status data storage unit and the desired degree, a process for determining each priority for each desired date and time included in the desired data is executed. (FIG. 10: S21, S23)
In the process of deleting the desired date and time, the desired date and time to be excluded is determined among the desired dates and times based on the priorities for each desired date and time (FIG. 10: S25-FIG. 19: S39). )
The schedule generation program according to attachment 1 or 2.

(Appendix 4)
The data relating to the past desired realization status includes the first number of past desired dates and times, the first total number of past desired dates and times, the desired degree of realized past desired dates and the past desired dates and times not realized. Including satisfaction, which is the difference in the degree of hope,
In the process of determining the priority,
A second number of times that is the sum of the number of desired dates and times and the first number of times included in the desired data for each user based on the data regarding the past desired realization status and the desired data; A second total number that is the sum of the number of desired dates and times and the first total number, and a second satisfaction level that is the satisfaction level are calculated (FIG. 10: S21).
For each desired date and time included in the desired data, from the desired realization according to the ratio of the second number of times to the second total number and the second satisfaction level for the user for the desired date and time An overall satisfaction level is calculated, and based on the user overall satisfaction level, a desired priority that is a ratio of the desired level with respect to the desired date and time is calculated (FIG. 10: S21).
By sorting the desired priorities in ascending order, the priority order of the desired date and time included in the desired data is determined (FIG. 10: S23).
The schedule generation program according to attachment 3.

(Appendix 5)
Computer
The desired data stored in the desired data storage unit (FIG. 2:38) for storing the desired data including the user identifier and the desired date and time set by the user, the date and time within a predetermined period, and the user. A first schedule relating to the arrangement that satisfies the desired data and at least a part of the rule is generated based on the arrangement rule to be associated, and the first schedule is stored in a data storage unit (FIG. 2:35). (FIG. 4: S3)
The first schedule stored in the data storage unit is compared with the rule, and based on the comparison result, it is determined whether the first schedule includes an arrangement that does not satisfy the rule. 4: S5)
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, it is stored in a desired realization status data storage unit (FIG. 2:39) that stores data related to past desired realization status for each user. Based on the stored data, a part of the desired date / time included in the desired data stored in the desired data storage unit is excluded, and based on a desired date / time other than the excluded desired date / time among the desired data. Then, the second schedule is generated and the second schedule is output (FIG. 4: S9-FIG. 23: S17).
A schedule generation method for executing processing.

(Appendix 6)
Based on the desired data stored in the desired data storage unit for storing the desired data including the user identifier and the desired date and time set by the user, and the arrangement rule for associating the user with the date and time within a predetermined period Generating a first schedule related to the arrangement satisfying the desired data and at least a part of the rule, and storing the first schedule in a data storage unit;
Means for comparing the first schedule stored in the data storage unit with the rule;
Means for determining whether the first schedule includes an arrangement that does not satisfy the rule based on the comparison result;
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, based on data stored in a desired realization status data storage unit that stores data regarding past desired realization status for each user. Means for excluding some desired dates and times included in the desired data stored in the desired data storage unit;
Means for generating a second schedule based on a desired date and time other than the desired date and time excluded from the desired data, and outputting the second schedule;
A schedule generation device.

3 Scheduling server 31 Rule DB
32 Patient DB
33 Instruction input unit 34 Schedule generation unit 35 Schedule data storage unit 36 Schedule processing unit 37 Desired input unit 38 Desired data storage unit 39 Satisfaction DB
40 Desired priority calculation unit 41 Schedule DB
42 basic data storage unit 43 satisfaction DB update unit 44 output unit

Claims (6)

On the computer,
Based on the desired data stored in the desired data storage unit for storing the desired data including the user identifier and the desired date and time set by the user, and the arrangement rule for associating the user with the date and time within a predetermined period Generating a first schedule for the arrangement that satisfies the desired data and at least a portion of the rules;
Storing the first schedule in a data storage unit;
Comparing the first schedule stored in the data storage unit with the rule;
Based on the result of the comparison, it is determined whether the first schedule includes an arrangement that does not satisfy the rule,
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, based on data stored in a desired realization status data storage unit that stores data regarding past desired realization status for each user. A part of the desired date and time included in the desired data stored in the desired data storage unit,
A schedule generation program for executing a process of generating a second schedule based on a desired date and time other than the excluded desired date and time in the desired data and outputting the second schedule. In the second schedule generation,
The schedule generation program according to claim 1, wherein a desired date and time to be excluded is changed among the desired dates and times until the second schedule that does not include an arrangement that does not satisfy the rule is generated. The desired data further includes a degree of hope representing strength of hope for the desired date and time by the user,
The computer further includes:
Based on the data related to the past desired realization status stored in the desired realization status data storage unit and the desired degree, a process for determining each priority for each desired date and time included in the desired data is executed. ,
3. The schedule generation program according to claim 1, wherein, in the process of deleting the desired date and time, a desired date and time to be excluded is determined from the desired dates and times based on the priorities for the desired dates and times. . The data relating to the past desired realization status includes the first number of past desired dates and times, the first total number of past desired dates and times, the desired degree of realized past desired dates and the past desired dates and times not realized. Including satisfaction, which is the difference in the degree of hope,
In the process of determining the priority,
A second number of times that is the sum of the number of desired dates and times and the first number of times included in the desired data for each user based on the data regarding the past desired realization status and the desired data; Calculating a second total number that is the sum of the number of desired dates and times and the first total number, and a second satisfaction level that is the satisfaction level,
For each desired date and time included in the desired data, from the desired realization according to the ratio of the second number of times to the second total number and the second satisfaction level for the user for the desired date and time Calculate overall satisfaction,
Based on the user overall satisfaction, a desired priority that is a ratio of the desired degree for the desired date and time is calculated,
The schedule generation program according to claim 3, wherein the priority order of the desired date and time included in the desired data is determined by sorting the desired priorities in ascending order. Computer
Based on the desired data stored in the desired data storage unit for storing the desired data including the user identifier and the desired date and time set by the user, and the arrangement rule for associating the user with the date and time within a predetermined period Generating a first schedule related to the arrangement that satisfies the desired data and at least a part of the rule, and storing the first schedule in a data storage unit,
Comparing the first schedule stored in the data storage unit with the rule;
Based on the result of the comparison, it is determined whether the first schedule includes an arrangement that does not satisfy the rule,
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, based on data stored in a desired realization status data storage unit that stores data regarding past desired realization status for each user. A part of the desired date and time included in the desired data stored in the desired data storage unit,
A schedule generation method for generating a second schedule based on a desired date and time other than the excluded desired date and time in the desired data and executing the process of outputting the second schedule. Based on the desired data stored in the desired data storage unit for storing the desired data including the user identifier and the desired date and time set by the user, and the arrangement rule for associating the user with the date and time within a predetermined period Generating a first schedule related to the arrangement satisfying the desired data and at least a part of the rule, and storing the first schedule in a data storage unit;
Means for comparing the first schedule stored in the data storage unit with the rule;
Means for determining whether the first schedule includes an arrangement that does not satisfy the rule based on the comparison result;
When it is determined that the first schedule includes an arrangement that does not satisfy the rule, based on data stored in a desired realization status data storage unit that stores data regarding past desired realization status for each user. Means for excluding some desired dates and times included in the desired data stored in the desired data storage unit;
Means for generating a second schedule based on a desired date and time other than the desired date and time excluded from the desired data, and outputting the second schedule;
A schedule generation device.

Images