Shift generation system, shift generation method, and sift generation program

Abstract

To provide a shift generation system which eliminates cumbersomeness of trials and errors when optimizing shift conditions in automatic shift generation.SOLUTION: A shift generation system is provided, comprising a reception unit for receiving shift conditions and member information, a generation unit for generating a shift for members, an achievement assessment unit for assessing the state of achievement of the shift conditions by the generated shift, a prediction unit for predicting an effect of a change in shift conditions on the assessment, and a presentation unit for presenting the effect predicted by the prediction unit.SELECTED DRAWING: Figure 10

Description

[Technical field]

[0001] The present invention relates to a shift generation system, a shift generation method, and a shift generation program. [Background technology]

[0002] Traditionally, genetic algorithms have been used to create staff shifts for an organization. In automatic shift generation using genetic algorithms, multiple shifts are generated as individuals for each generation based on set shift conditions (rules). Then, they are evolved into individuals with higher evaluation values ​​that indicate the degree to which the shift conditions are satisfied.

[0003] However, there are a relatively large number of shift conditions to be set in the automatic generation of shifts using a genetic algorithm, and it is not easy to set the shift conditions appropriately. In other words, if the shift conditions are set too strictly, the number of solutions may be extremely small, or the evaluation value may not converge to 100%, resulting in no solution. In addition, it is not easy for a user to recognize whether the shift conditions are set so that the evaluation value can converge to 100%, because there are many shift conditions to be set. Therefore, a trial and error process is required to change the shift conditions, generate shifts, and calculate the evaluation value repeatedly, which is a cumbersome problem.

[0004] The following prior art is disclosed in the following patent document. A schedule plan is used as a parent chromosome, a child chromosome is generated by crossover, mutations and biases are performed on the child chromosome, and the degree to which the child chromosome satisfies preset conditions is evaluated. Then, parent chromosomes or child chromosomes with poor evaluation values ​​are eliminated. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] JP 2001-175639 A Summary of the Invention [Problem to be solved by the invention]

[0006] However, the above-mentioned prior art has a problem in that it is not possible to eliminate the troublesome trial and error involved in optimizing shift conditions in automatic generation of shifts.

[0007] The present invention has been made in consideration of the above circumstances. That is, an object of the present invention is to provide a shift generation system, a shift generation method, and a shift generation program that can eliminate the troublesome trial and error involved in optimizing shift conditions in automatic shift generation. [Means for solving the problem]

[0008] The above object can be achieved by the following means.

[0009] (1) A shift generation system having a receiving unit that receives shift conditions and member information, a generation unit that generates shifts for members based on the shift conditions and member information, an achievement evaluation unit that evaluates the achievement state of the shift conditions in the generated shift, a prediction unit that predicts the impact of a change to the shift conditions on the evaluation, and a presentation unit that presents the impact obtained by the prediction unit.

[0010] (2) The shift generation system described in (1) above, wherein the achievement evaluation unit evaluates the achievement state for each shift condition, and the prediction unit predicts the impact on the evaluation based on whether the evaluation improves by limiting the shift conditions to any one of the shift conditions for which the achievement state evaluated by the achievement evaluation unit does not satisfy a predetermined criterion.

[0011] (3) The shift generation system described in (2) above, wherein the prediction unit predicts the impact on the evaluation based on whether or not all of the limited shift conditions are achieved by limiting the shift conditions to two or more shift conditions including the shift condition under which the evaluation has improved and a shift condition other than the shift condition under which the evaluation has improved.

[0012] (4) The shift generation system according to (1) above, wherein the generation unit generates the shift using a genetic algorithm.

[0013] (5) The shift generation system described in (2) above has a control unit that, when a shift condition is detected in which the achievement state does not satisfy a predetermined standard even after a predetermined time has elapsed since the start of shift generation during generation of the shifts by the generation unit using a genetic algorithm, causes the generation unit to generate the shift based on the detected shift condition, and the prediction unit predicts whether the evaluation will improve based on the shift generated based on the detected shift condition.

[0014] (6) The shift generation system described in (2) above, wherein the generation unit generates the shift based on a plurality of the shift conditions, and the reception unit has a control unit that, when one of the plurality of shift conditions is received, causes the generation unit to generate the shift based on the one shift condition, and the prediction unit predicts whether the evaluation will improve based on the shift generated based on the one shift condition.

[0015] (7) A shift generation method executed by a shift generation system that generates shifts for members, the shift generation method comprising: a step (a) of accepting shift conditions and member information; a step (b) of generating the shifts for members based on the shift conditions and member information; a step (c) of evaluating the achievement state of the shift conditions in the generated shift; a step (d) of predicting the impact of a change in the shift conditions on the evaluation; and a step (e) of presenting the impact obtained in the step (d).

[0016] (8) The shift generation method according to (7) above, wherein in the step (c), the achievement state is evaluated for each shift condition, and in the step (d), the effect on the evaluation is predicted based on whether the evaluation improves by limiting the shift conditions to any one of the shift conditions for which the achievement state evaluated in the step (c) does not satisfy a predetermined criterion.

[0017] (9) In the step (d), the shift conditions are limited to two or more shift conditions including the shift condition under which the evaluation has improved and a shift condition other than the shift condition under which the evaluation has improved, and the impact on the evaluation is predicted depending on whether all of the limited shift conditions are achieved. The shift generation system described in (8) above.

[0018] (10) The shift generation method according to (7) above, wherein in the step (b), the shift is generated using a genetic algorithm.

[0019] (11) The shift generation method described in (8) above, further comprising a step (f) of generating the shift based on the detected shift condition upon detecting a shift condition in which the achievement state does not satisfy a predetermined standard even after a predetermined time has elapsed since the start of the shift generation during the generation of the shifts for each generation using a genetic algorithm in the step (b), and in the step (d), predicting whether the evaluation will improve based on the shift generated based on the detected shift condition.

[0020] (12) The shift generation method according to (8) above, wherein in the step (b), the shift is generated based on a plurality of the shift conditions, and in the step (a), when one of the plurality of shift conditions is accepted, a step (g) is included in which the shift is generated based on the one shift condition, and in the step (d), a prediction is made as to whether the evaluation will improve based on the shift generated based on the one shift condition.

[0021] (13) A shift generation program for causing a computer to execute the shift generation method according to any one of (7) to (12) above. Effect of the Invention

[0022] The system generates shifts for members based on the received shift conditions and member information, and evaluates the achievement of the shift conditions for the generated shifts. It also predicts and displays the impact of changes to the shift conditions on the evaluation. This eliminates the need for trial and error when optimizing shift conditions in automatic shift generation. [Brief description of the drawings]

[0023] [Figure 1] 1 is a diagram showing a schematic configuration of an entire system according to an embodiment of the present invention; [Diagram 2] 2 is a block diagram showing a schematic configuration of an information processing terminal; [Diagram 3] FIG. 13 is a diagram showing an example of a screen for accepting shift conditions. [Figure 4] FIG. 2 is a block diagram showing a schematic configuration of a server. [Diagram 5] FIG. 2 is a block diagram showing the functions of a CPU. [Figure 6] FIG. 13 is a diagram illustrating an example of a shift. [Figure 7A] FIG. 13 is an explanatory diagram for explaining an evaluation of the achievement state of a shift condition by changing the shift condition. [Figure 7B] FIG. 13 is an explanatory diagram for explaining an evaluation of the achievement state of a shift condition by changing the shift condition. [Figure 8A] FIG. 13 is an explanatory diagram for explaining evaluation of the achievement state of the shift conditions by changing the shift conditions to limit them to an achievable shift condition and one other shift condition. [Figure 8B] FIG. 13 is an explanatory diagram for explaining evaluation of the achievement state of the shift conditions by changing the shift conditions to limit them to an achievable shift condition and one other shift condition. [Figure 9] 1 is an example of a flowchart illustrating an operation of the system. [Figure 10] 13 is an example of a flowchart illustrating the operation of a prediction process of the system. [Figure 11] 13 is a flowchart illustrating another example of the operation of the prediction process of the system. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0024] Hereinafter, a shift generation system, a shift generation method, and a shift generation program according to an embodiment of the present invention will be described with reference to the attached drawings. In the description of the drawings, the same elements are given the same reference numerals, and duplicated descriptions will be omitted. In addition, the dimensional ratios of the drawings are exaggerated for the convenience of explanation, and may differ from the actual ratios.

[0025] FIG. 1 is a diagram showing a schematic configuration of an entire system 10 according to an embodiment of the present invention.

[0026] As shown in FIG 1, the system 10 is configured with an information processing terminal 100 and a server 200. The information processing terminal 100 and the server 200 are configured to be mutually connectable via a network. The server 200 is, for example, a cloud server, but may also be an on-premise server (server device) or the like. The server 200 constitutes a shift generation system. The server 200 and the information processing terminal 100 may constitute a shift generation system.

[0027] The system 10 may be installed within the premises of an organization, or some or all of its components may be installed outside the premises (e.g., the headquarters building of a corporation that operates multiple facilities, etc.). An organization includes any organization that employs multiple members (personnel). A member includes any personnel who work according to a work shift (hereinafter also simply referred to as a "shift").

[0028] For ease of explanation, the following description will be given by taking an example in which the organization is an organization that runs a nursing care facility and shifts are created for the staff who provide care at the nursing care facility.

[0029] (Information processing terminal 100) The information processing terminal 100 is a terminal used by a user such as a facility director, manager, or administrator of a nursing facility, and is a desktop PC, a notebook PC, a tablet PC, a smartphone, or the like.

[0030] FIG. 2 is a block diagram showing a schematic configuration of the information processing terminal 100. As shown in FIG.

[0031] 2, the information processing terminal 100 has a CPU (Central Processing Unit) 110, a ROM (Read Only Memory) 120, a RAM (Random Access Memory) 130, a storage 140, a communication interface 150, and an operation display unit 160. Each component is connected to each other via a bus so as to be able to communicate with each other.

[0032] The CPU 110 controls the above components and performs various arithmetic processing in accordance with programs recorded in the ROM 120 or storage 140. The specific functions of the CPU 110 will be described later.

[0033] The ROM 120 stores various programs and various data.

[0034] The RAM 130 serves as a working area for temporarily storing programs and data.

[0035] Storage 140 is configured with a hard disk drive (HDD), a solid state drive (SDD), etc., and stores various programs including an operating system and various data. For example, an application for receiving input (including instructions, etc.) from a user and transmitting various information to and from other devices such as server 200 is installed in storage 140. In addition, an application for outputting (displaying) information on operation display unit 160 is installed in storage 140.

[0036] The communication interface 150 is an interface for communicating with other devices. As the communication interface 150, a wired or wireless communication interface conforming to various standards is used.

[0037] The operation display unit 160 is, for example, a touch panel display, which displays various information and accepts various inputs from the user.

[0038] CPU 110 accepts staff information input by a user on operation display unit 160. Staff information constitutes member information. Staff information includes information about staff used to create shifts, such as the number of staff, qualifications acquired, job type, and working style. Staff include full-time and part-time care staff, nursing staff, and registered dietitians. CPU 110 transmits the accepted staff information to server 200.

[0039] The CPU 110 accepts the shift conditions input by the user on the operation display unit 160. The shift conditions are conditions that the shift to be created must meet, and are rules for creating a shift. The shift conditions may include the number of people required per day for each shift symbol, and consecutive setting restrictions for shift symbols, such as a paid holiday following a night shift. The shift symbol is a unique symbol corresponding to a combination of working hours and working time periods. The shift conditions may include the number of consecutive days available for work, the number of consecutive days available for vacation, the number of public holidays (per week, per month) for each staff member, the working hours (per week, per month) for each staff member, and a shift symbol that can be set for each staff member. The shift conditions may include the number of working days (per week, per month) for each staff member, and the desired working days for each staff member. The CPU 110 transmits the accepted shift conditions to the server 200.

[0040] 3 is a diagram showing an example of a screen for accepting shift conditions. The screen for accepting shift conditions is displayed on operation display unit 160. CPU 110 accepts shift conditions input by the user on the screen for accepting shift conditions.

[0041] In the example of Fig. 3, the number of people required per day for each shift symbol (the number of people required for each shift) is entered as a shift condition on the shift condition reception screen. In other words, it is entered as a shift condition that the "night" shift symbol is assigned to one of the staff members belonging to the unit "Unit B" all day every month.

[0042] (Server 200) FIG. 4 is a block diagram showing a schematic configuration of the server 200. As shown in FIG.

[0043] 4, the server 200 includes a CPU 210, a ROM 220, a RAM 230, a storage 240, and a communication interface 250. Each component is connected to each other via a network or a bus so as to be able to communicate with each other. The CPU 210 constitutes a control unit.

[0044] The configurations and basic functions of the CPU 210, ROM 220, RAM 230, storage 240, and communication interface 250 are similar to those of the corresponding elements of the information processing terminal 100, and therefore will not be described repeatedly. Specific functions of the CPU 210 will be described later.

[0045] The storage 240 has installed therein programs for the CPU 210 to execute various processes. The storage 240 also stores member information and shift conditions received from the information processing terminal 100 or the like.

[0046] 5 is a block diagram showing the functions of the CPU 210. The CPU 210 operates according to a program to function as a reception unit 211, a shift generation unit 212, an achievement evaluation unit 213, an impact prediction unit 214, and a presentation unit 215. The shift generation unit 212 constitutes a generation unit. The impact prediction unit 214 constitutes a prediction unit.

[0047] (Identifying and presenting unattainable shift conditions) The reception unit 211 receives the shift conditions and staff information. Specifically, the reception unit 211 receives the shift conditions and staff information by receiving them from the information processing terminal 100 via the communication interface 250, for example. Since the shift conditions are conditions that the created shift must satisfy, a plurality of shift conditions can usually be received as conditions that the created shift must satisfy. The reception unit 211 can store the received shift conditions and staff information in the storage 240.

[0048] The shift generation unit 212 generates staff shifts based on the shift conditions and staff information. The shift generation unit 212 generates shifts using, for example, a genetic algorithm. The shift generation unit 212 may generate shifts using tabu search or the like. A shift is a shift in which a shift symbol is assigned to each staff member for each day. For simplicity of explanation, the following description will be given taking a case where a shift is generated using a genetic algorithm as an example.

[0049] In automatic generation of shifts using a genetic algorithm, multiple shifts are generated as individuals for each generation based on the set shift conditions. Then, crossover, mutation, selection, etc. are repeated between the shifts to evolve into individuals with higher evaluation values ​​that indicate the degree to which the shift conditions are satisfied. In the genetic algorithm, an evaluation value is calculated for each individual. The evaluation value is the degree to which the shift conditions are satisfied. The evaluation value for each individual is calculated as the sum of corrected evaluation values ​​obtained by multiplying the evaluation value for each shift condition used to generate the individual by a weighting coefficient. In other words, the evaluation value for each individual is the sum of corrected evaluation values ​​calculated for all shift conditions used to generate the individual. Then, among the multiple individuals generated for each generation, individuals with relatively low evaluation values ​​are selected, and the individual with the highest evaluation value is finally generated.

[0050] Specifically, for example, when two shift conditions are used to generate a shift (individual), the corrected evaluation value for each shift condition is calculated by the following formula.

[0051] Corrected evaluation value a of shift condition A = weighting coefficient α × evaluation value of shift condition A Corrected evaluation value b of shift condition B = weighting coefficient β × evaluation value of shift condition B Then, the evaluation value of the individual (overall evaluation value) is calculated, for example, by the following formula.

[0052] Individual evaluation value = Corrected evaluation value a + Corrected evaluation value b Individuals are selected based on their evaluation values. Therefore, the weighting coefficient determines the shift conditions that are prioritized in shift generation for each generation. The weighting coefficient constitutes the priority of each shift condition in shift generation (calculation).

[0053] FIG. 6 is a diagram showing an example of the generated shift.

[0054] As shown in Figure 6, a shift symbol is assigned to each employee for each day. The shift symbols "day," "early," "late," "night," "morning," and "public" refer to day shift, early start, late start, night shift, substitute day off for night shift, and public day off, respectively.

[0055] The achievement evaluation unit 213 evaluates the achievement state of the shift conditions (degree of fulfillment of the shift conditions) for the generated shift as an evaluation value. The achievement evaluation unit 213 calculates and outputs an evaluation value for each shift condition for each continuously generated individual (shifts generated using a genetic algorithm). For example, if the shift condition is the number of people required per day for each shift symbol, the evaluation value may be the total product of the fulfillment rates for the number of people required for each shift symbol. In this case, when the fulfillment rates for all shift symbols are 1 (100%), the evaluation value is 1 (100%).

[0056] The influence prediction unit 214 predicts the influence of the change of the shift condition on the evaluation by the achievement evaluation unit 213. When multiple shift conditions are set, the influence prediction unit 214 detects a shift condition in which the achievement state evaluated by the achievement evaluation unit 213 does not satisfy a predetermined criterion. Specifically, the influence prediction unit 214 detects, for example, a shift condition in which the evaluation value does not become 100% set as a predetermined criterion even after a predetermined time has elapsed since the shift generation unit 212 started generating a shift. The predetermined criterion is preferably 100%, but is not limited thereto, and may be appropriately set by experiment in terms of the calculation time and the rate of increase in the evaluation value. The influence prediction unit 214 causes the shift generation unit 212 to generate a shift by limiting the shift condition to any one of the specified shift conditions. The influence prediction unit 214 may predict the influence on the evaluation depending on whether the evaluation by the achievement evaluation unit 213 improves by limiting the shift condition to one. Specifically, when the evaluation value for a shift generated based on one shift condition improves to 100%, the impact prediction unit 214 predicts that changing the shift condition will have an impact on the evaluation value. When the evaluation value for a shift generated based on one shift condition does not improve to 100%, the impact prediction unit 214 predicts that changing the shift condition will not have an impact on the evaluation value.

[0057] During generation of shifts for each generation by the shift generating unit 212 using a genetic algorithm, the influence prediction unit 214 may detect a shift condition whose achievement state does not satisfy a predetermined criterion even after a predetermined time has elapsed since the start of shift generation. When a shift condition whose achievement state does not satisfy a predetermined criterion is detected, the CPU 210 may cause the shift generating unit 212 to generate a shift based on any one of the detected shift conditions. When one shift condition out of a plurality of shift conditions is accepted by the accepting unit 211, the CPU 210 may cause the shift generating unit 212 to generate a shift based on the one shift condition.

[0058] 7A and 7B are explanatory diagrams for explaining an evaluation of the achievement state of a shift condition due to a change in the shift condition.

[0059] FIG. 7A shows an example in which the achievement state of the shift conditions is not improved by changing the shift conditions. In the example of FIG. 7A, the evaluation value is 80% for a shift generated based on all shift conditions that the shift to be created must meet. The evaluation value is also 80% for a shift generated based on only one shift condition A. Therefore, even if the shift conditions are changed to one shift condition A, the achievement state of shift condition A is not improved. In this case, shift condition A is identified as a shift condition that cannot be achieved in the first place in shift generation based on staff information.

[0060] FIG. 7B shows an example in which the achievement state of the shift conditions is improved by changing the shift conditions. In the example of FIG. 7B, the evaluation value is 80% for a shift generated based on all shift conditions that the shift to be created must meet. And the evaluation value is 100% for a shift generated based on only one shift condition A. Therefore, the achievement state of shift condition A is improved by changing the shift conditions. In this case, shift condition A is not an unachievable shift condition in shift generation based on staff information. Therefore, shift condition A is identified as a shift condition that can be achieved by increasing the priority in shift generation using a genetic algorithm.

[0061] The presentation unit 215 presents the influence of the change of the shift condition on the evaluation of the achievement state of the shift condition obtained by the influence prediction unit 214. Specifically, the presentation unit 215 presents whether or not the evaluation of the achievement state of the shift condition is improved by limiting the shift condition to one shift condition. For example, the presentation unit 215 transmits the changed shift condition (one shift condition) and the evaluation value of the achievement state of the changed shift condition to the information processing terminal 100 via the communication interface 250, and displays them on the operation display unit 160 of the information processing terminal 100. In this way, the influence of the change of the shift condition on the evaluation of the achievement state of the shift condition is presented. The presentation unit 215 may present the shift condition before and after the change, and the evaluation value of the achievement state of the shift condition before and after the change.

[0062] The presentation unit 215 may present the changed shift conditions and an evaluation value of the achievement state of the shift conditions by transmitting them to a device other than the information processing terminal 100. The presentation unit 215 may present the changed shift conditions and an evaluation value of the achievement state of the shift conditions by forming an image on paper in an image forming device and outputting it.

[0063] The changed shift conditions and an evaluation value of the achievement state of the changed shift conditions are presented to the user, so that the user can know whether the changed shift conditions are achievable or not.

[0064] (Prediction of conflicts between achievable shift conditions and other shift conditions) The influence prediction unit 214 limits the shift conditions to a shift condition in which the evaluation of the achievement state of the shift condition has improved due to the change of the shift condition, and other shift conditions other than the shift condition, and causes the shift generation unit 212 to generate a shift. That is, the influence prediction unit 214 changes the shift conditions to limit the combination of an achievable shift condition and the other shift conditions, and causes the shift generation unit 212 to generate a shift. The other shift conditions may be one or more. In the following, for simplicity of explanation, the explanation will be given assuming that there is one other shift condition.

[0065] The influence prediction unit 214 predicts the influence of a change in the shift conditions on the evaluation by the achievement evaluation unit 213, depending on whether all of the limited shift conditions are achieved.

[0066] 8A and 8B are explanatory diagrams for explaining evaluation of achievement state of a shift condition by changing the shift condition, that is, limiting to an achievable shift condition and one other shift condition.

[0067] In Fig. 8A, even if the change to limit the shift conditions is made, the evaluation values ​​of all the limited shift conditions are not 100%. This shows that it is impossible to create a shift that satisfies both the achievable shift condition A and another shift condition B. In other words, it shows that a conflict occurs between the shift condition A and the shift condition B.

[0068] In FIG. 8B, by changing the shift conditions, all the evaluation values ​​of the limited shift conditions are 100%. This shows that it is possible to create a shift that satisfies both the achievable shift condition A and another shift condition B. In other words, it shows that there is no shift solution that satisfies both shift condition A and shift condition B, and there is no conflict between them.

[0069] The presentation unit 215 presents whether or not all of the limited shift conditions are achieved by changing the shift conditions to limit them to achievable shift conditions and one other shift condition. The presentation unit 215 transmits, for example, two shift conditions including the achievable shift conditions after the change and the evaluation values ​​of the achievement states of the two shift conditions to the information processing terminal 100 via the communication interface 250. As a result, the presentation unit 215 causes the operation display unit 160 of the information processing terminal 100 to display them. As a result, the influence of the change of the shift conditions to limit them to achievable shift conditions and one other shift condition on the evaluation of the achievement state of the shift conditions is presented.

[0070] Two shift conditions including achievable shift conditions after the change and an evaluation value of the achievement state of the two shift conditions are presented. This allows the user to understand whether the achievable shift condition is causing a conflict with other shift conditions.

[0071] The operation of the system 10 will now be described.

[0072] 9 is an example of a flowchart showing the operation of the system 10. The processing shown in this flowchart can be executed by the CPU 210 controlling each unit in accordance with a program stored in the storage 240 of the server 200.

[0073] The CPU 210 starts the shift generation process (S1). For example, the CPU 210 transmits a command to the information processing terminal 100 to display a menu on the information processing terminal 100. The CPU 210 then starts the shift generation process by receiving a notification from the information processing terminal 100 that a button for starting the shift generation process on the menu has been selected.

[0074] The CPU 210 accepts the shift conditions and staff information (S2). The CPU 210 can accept the shift conditions and staff information by receiving information input by a user at the information processing terminal 100.

[0075] The CPU 210 generates and presents a shift based on the shift conditions and staff information (S3). The CPU 210 may present the generated shift by transmitting it to the information processing terminal 100 and displaying it on the information processing terminal 100. The CPU 210 may present the generated shift by transmitting it to a device other than the information processing terminal 100. The CPU 210 may present the generated shift by transmitting it to an image forming device and forming an image on paper.

[0076] In step S3, CPU 210 may present the achievement state of each shift condition together with the shift.

[0077] In step S3, the prediction process shown in Fig. 10 and Fig. 11 may be executed. That is, for example, a determination is made as to whether there is a shift condition for which the evaluation value does not become 100% even after a predetermined time has elapsed (see step S102 in Fig. 10).

[0078] The CPU 210 determines whether a change to the shift conditions has been accepted (S4). The CPU 210 can accept a change to the shift conditions by receiving information input by a user at the information processing terminal 100. For example, when an unattainable shift condition is presented, the user can change the shift condition to an achievable shift condition.

[0079] When the CPU 210 determines that a change in the shift conditions has been accepted (S4: YES), it generates and presents a shift based on the changed shift conditions (S3). When the CPU 210 determines that a change in the shift conditions has not been accepted (S4: NO), it ends the process.

[0080] 10 is an example of a flowchart showing the operation of the prediction process of the system 10. This flowchart is a flowchart for identifying and presenting unachievable shift conditions. The process shown in this flowchart can be executed by the CPU 210 controlling each unit according to a program stored in the storage 240 of the server 200.

[0081] The CPU 210 starts the shift generation process (S101). For example, the CPU 210 displays a menu on the information processing terminal 100 by transmitting to the information processing terminal 100. Then, the CPU 210 starts the shift generation process by receiving a notification from the information processing terminal 100 that a button for starting the shift generation process on the menu has been selected.

[0082] The CPU 210 creates shifts for each generation based on the shift conditions and staff information, and determines whether there are any shift conditions for which the evaluation value will not reach 100% even after a predetermined time has passed. That is, the CPU 210 detects any shift conditions for which the evaluation value will not reach 100% even after a predetermined time has passed (S102). If the CPU 210 determines that there are no shift conditions (not detected) for which the evaluation value will not reach 100% even after a predetermined time has passed (S102: NO), it presents shifts that satisfy all shift conditions and ends the process.

[0083] When the CPU 210 determines that there is (has been) a shift condition that does not result in a 100% evaluation value even after a predetermined time has elapsed (S102: YES), it executes step S103. That is, the CPU 210 generates a shift based on only one of the shift conditions that does not result in a 100% evaluation value (S103).

[0084] The CPU 210 determines whether the evaluation value of the one shift condition in the shift generated in step S103 is 100% (S104).

[0085] When the CPU 210 determines that the evaluation value of the one shift condition in the shift generated in step S103 is 100% (S104: YES), it executes step S105. That is, the CPU 210 presents that the evaluation value can be increased by increasing the priority of the shift condition (S105).

[0086] On the other hand, when the CPU 210 determines that the evaluation value of the one shift condition in the shift generated in step S103 is not 100% (S104: NO), it executes step S106. That is, the CPU 210 presents that it is impossible to make the evaluation value of the shift 100% (S106).

[0087] 11 is another example of a flowchart showing the operation of the prediction process of the system 10. This flowchart is a flowchart for identifying and presenting unachievable shift conditions, as well as predicting conflicts between achievable shift conditions and other shift conditions. The process shown in this flowchart can be executed by the CPU 210 controlling each unit according to a program stored in the storage 240 of the server 200.

[0088] The CPU 210 starts the shift generation process (S201). For example, the CPU 210 displays a menu on the information processing terminal 100 by transmitting to the information processing terminal 100. Then, the CPU 210 starts the shift generation process by receiving a notification from the information processing terminal 100 that a button for starting the shift generation process on the menu has been selected.

[0089] The CPU 210 creates shifts for each generation based on the shift conditions and staff information, and determines whether there are any shift conditions for which the evaluation value will not reach 100% even after a predetermined time has passed. That is, the CPU 210 detects any shift conditions for which the evaluation value will not reach 100% even after a predetermined time has passed (S202). If the CPU 210 determines that there are no shift conditions (not detected) for which the evaluation value will not reach 100% even after a predetermined time has passed (S202: NO), it presents shifts that satisfy all shift conditions and ends the process.

[0090] When the CPU 210 determines that there is (has been) a shift condition that does not result in a 100% evaluation value even after a predetermined time has elapsed (S202: YES), it executes step S203. That is, the CPU 210 generates a shift based on only one of the shift conditions that does not result in a 100% evaluation value (S203).

[0091] The CPU 210 determines whether the evaluation value of the one shift condition in the shift generated in step S203 is 100% (S204).

[0092] When the CPU 210 determines that the evaluation value of the one shift condition in the shift generated in step S203 is 100% (S204: YES), it executes steps S205 to S209. When the CPU 210 determines that the evaluation value of the one shift condition in the shift generated in step S203 is not 100% (S204: NO), it executes step S206.

[0093] The CPU 210 generates a shift based only on the one shift condition used for generating the shift in step S203 and the other shift conditions (S205).

[0094] The CPU 210 presents that it is impossible to make the evaluation value of the shift condition 100% (S206). Specifically, the CPU 210 may present that it is impossible to make the evaluation value of one shift condition used to generate the shift in step S203 100%.

[0095] The CPU 210 determines whether or not the evaluation values ​​of the shift conditions in the shift generated in step S205 are all 100% (S207).

[0096] When the CPU 210 determines that the evaluation values ​​of all the shifts generated in step S205 are not 100% (S207: NO), it executes step S208. That is, the CPU 210 presents that increasing the priority of the shift condition used to generate the shift in step S203 will lower the evaluation values ​​of the other shift conditions (S208). Specifically, the CPU 210 may notify one of the shift conditions used to generate the shift in step S203 and present that the shift condition in question is in conflict with another shift condition.

[0097] When the CPU 210 determines that the evaluation value of each shift in the shifts generated in step S205 is all 100% (S207: YES), it executes step S209. That is, the CPU 210 notifies that the evaluation value will increase by increasing the priority of the shift condition used to generate the shift in step S203 (S209). Specifically, the CPU 210 may notify one shift condition used to generate the shift in step S203 and notify that the evaluation value will increase by increasing the priority of the shift condition.

[0098] The embodiment provides the following advantages.

[0099] The system generates shifts for members based on the received shift conditions and member information, and evaluates the achievement of the shift conditions for the generated shifts. It also predicts and displays the impact of changes to the shift conditions on the evaluation. This eliminates the need for trial and error when optimizing shift conditions in automatic shift generation.

[0100] Furthermore, the achievement state is evaluated for each shift condition. Then, the impact on the evaluation is predicted based on whether the evaluation improves by limiting the shift conditions to one of the shift conditions whose evaluated achievement state does not satisfy a predetermined standard. This makes it possible to effectively present shift conditions that are impossible to achieve in the first place in a short time. This makes it possible to more simply and effectively eliminate the cumbersome trial and error involved in optimizing shift conditions in automatic shift generation.

[0101] In addition, the shift conditions are limited to two or more shift conditions including the shift conditions for which the evaluation has improved and the shift conditions other than the shift conditions for which the evaluation has improved.Then, the impact on the evaluation is predicted depending on whether or not all of the limited shift conditions are achieved.This makes it possible to quickly and effectively detect shift conditions that are in conflict with other shift conditions.

[0102] Furthermore, the shifts are generated using a genetic algorithm, which more effectively eliminates the need for trial and error when optimizing shift conditions in automatic generation of shifts.

[0103] In addition, when a shift condition is detected during generation-by-generation shift generation, the system generates a shift based on the detected shift condition when a predetermined time has elapsed since the start of shift generation and the achievement state does not meet a predetermined standard. Then, based on the shift generated based on the detected shift condition, it is predicted whether the evaluation will improve. This can further reduce the complexity of manual processing when optimizing shift conditions in automatic shift generation and contribute to efficient shift creation.

[0104] In addition, when one of the multiple shift conditions used to generate shifts is accepted, a shift is generated based on that one shift condition. Then, based on the shift generated based on that one shift condition, it is predicted whether the evaluation will improve. This can further reduce the complexity of manual processing when optimizing shift conditions in automatic shift generation, and contribute to efficient shift creation.

[0105] The present invention is not limited to the above-described embodiment, but can be modified in various ways within the scope of the claims.

[0106] For example, the information processing terminal 100 and the server 200 may each include components other than those described above, or may not include some of the components described above.

[0107] Furthermore, the information processing terminal 100 and the server 200 may be configured as separate devices, or may be configured as a single device.

[0108] Furthermore, the functions of each component may be realized by other components. For example, at least a part of the processes described as being executed by the server 200 may be executed by the information processing terminal 100 or other devices. Furthermore, by incorporating the functions of the information processing terminal 100 into the server 200, the information processing terminal 100 may be omitted.

[0109] In addition, the processing units of the flowcharts in the above embodiments are divided according to the main processing contents in order to facilitate understanding of each process. The manner in which the processing steps are divided does not limit the present invention. Each process can be further divided into more processing steps. One processing step may execute more processes. Furthermore, multiple steps may be executed simultaneously or in combination.

[0110] The means and methods for performing various processes in the system according to the above-mentioned embodiment can be realized by either a dedicated hardware circuit or a programmed computer. The above-mentioned program may be provided by a computer-readable recording medium such as a flexible disk or a CD-ROM, or may be provided online via a network such as the Internet. In this case, the program recorded on the computer-readable recording medium is usually transferred to and stored in a storage unit such as a hard disk. The above-mentioned program may be provided as a standalone application software, or may be incorporated into the software of the device as one function of the system. [Explanation of symbols]

[0111] 100 Information processing terminal, 110 CPUs, 120 ROMs, 130 RAM, 140 storage, 150 communication interface, 160 Operation display section, 200 servers, 210 CPUs, 211 Reception Department, 212 shift generation unit, 213 Achievement Evaluation Section, 214 Impact Forecasting Department, 215 Presentation Department; 220 ROMs, 230 RAM, 240 Storage, 250 communication interface.

Claims

1. A reception unit that receives shift conditions and member information; A generation unit that generates member shifts based on the shift conditions and member information; an achievement evaluation unit that evaluates an achievement state of the shift conditions in the generated shift; A prediction unit that predicts the effect of a change in the shift condition on the evaluation; a presentation unit that presents the influence obtained by the prediction unit; A shift generation system comprising:

2. The achievement evaluation unit evaluates the achievement state for each of the shift conditions, 2. The shift generation system according to claim 1, wherein the prediction unit predicts the impact on the evaluation based on whether the evaluation improves by limiting the shift conditions to any one of the shift conditions in which the achievement state evaluated by the achievement evaluation unit does not satisfy a predetermined criterion.

3. The shift generation system according to claim 2, wherein the prediction unit predicts the impact on the evaluation based on whether or not all of the limited shift conditions are achieved by limiting the shift conditions to two or more shift conditions including the shift condition under which the evaluation improved and the shift condition other than the shift condition under which the evaluation improved.

4. The shift generation system according to claim 1 , wherein the generation unit generates the shifts using a genetic algorithm.

5. A control unit causes the generation unit to generate the shift based on the shift condition detected when the shift condition is detected such that the achievement state does not satisfy a predetermined standard even after a predetermined time has elapsed since the start of the generation of the shift during the generation of the shift for each generation by the generation unit using a genetic algorithm; The shift generation system according to claim 2 , wherein the prediction unit predicts whether the evaluation will improve based on the shift generated based on the detected shift condition.

6. The generation unit generates the shift based on a plurality of the shift conditions; A control unit that causes the generation unit to generate the shift based on one of the shift conditions when one of the shift conditions is received by the reception unit, The shift generation system according to claim 2 , wherein the prediction unit predicts whether the evaluation will improve based on the shift generated based on the one of the shift conditions.

7. 1. A method of shift generation performed by a shift generation system for generating shifts for members, comprising: (a) receiving shift conditions and member information; (b) generating the shifts for members based on the shift conditions and member information; (c) evaluating the achievement state of the shift conditions in the generated shift; (d) predicting the effect of changes in the shift conditions on the evaluation; A step (e) of presenting the influence obtained in the step (d); The shift generation method includes:

8. In the step (c), the achievement state is evaluated for each of the shift conditions; 8. The shift generation method of claim 7, wherein in step (d), the impact on the evaluation is predicted based on whether the evaluation improves by limiting the shift conditions to any one of the shift conditions whose achievement state evaluated in step (c) does not satisfy a predetermined criterion.

9. 9. The shift generation system of claim 8, wherein in step (d), the shift conditions are limited to two or more shift conditions including the shift condition under which the evaluation has improved and the shift condition other than the shift condition under which the evaluation has improved, and the impact on the evaluation is predicted depending on whether all of the limited shift conditions are achieved.

10. 8. The method for generating shifts according to claim 7, wherein in the step (b), the shifts are generated using a genetic algorithm.

11. During the generation of the shifts for each generation using a genetic algorithm in the step (b), when a shift condition is detected in which the achievement state does not satisfy a predetermined criterion even after a predetermined time has elapsed since the start of the generation of the shifts, a step (f) is included, in which the shifts are generated based on the detected shift condition; 9. The method of claim 8, wherein in the step (d), it is predicted whether the evaluation will improve based on the shift generated based on the detected shift condition.

12. In the step (b), the shift is generated based on a plurality of the shift conditions; In the step (a), when one of the shift conditions is accepted, the shift is generated based on the one shift condition.

9. The shift generation method according to claim 8, wherein in the step (d), it is predicted whether or not the evaluation will improve based on the shift generated based on the one of the shift conditions.

13. A shift generation program for causing a computer to execute the shift generation method according to any one of claims 7 to 12.

Images