JP2002024493A - Schedule management method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make automatically selectable and extractible helper candidates who can be dispatched in a time band that is desired by a user. SOLUTION: A home-visit care enterpriser registers a weekly servable time band of a helper on an unshown data base in step S1 when the basic items of the helper are registered. In step S2 of this registration mode, the servable time of the helper is individually changed according to the desired contents of the user and the helper. This changed and registered time is defined as a time when the matching is possible with the user's schedule. When the user designates his/her time requiring a helper, it is judged in step S3 whether or not a free helper is available in the time desired by the user. When the helper is available, it is checked whether the helper is available and also kept idle in that time to choose the helper from a list of idle helpers in step S4. Then, the chosen helper is dispatched to the user to start the service in step S5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a schedule management method for managing a schedule of a helper and a user in home visiting care.

[0002]

2. Description of the Related Art In April 2000, when the nursing care insurance system was started, support tools for home-visit nursing care providers have become available. As the support tool, for example, there is a method in which a home visit nursing care company manages a helper's work schedule and a user's desired schedule, and sets a helper's schedule according to the user's wish. When a home-visit nursing care provider performs a schedule matching between a helper and a user, the person in charge is determined from helpers who are available at the time desired by the user. Visiting nursing care is to carry out visiting nursing care in accordance with a nursing care service plan (hereinafter referred to as a care plan) created by a home visit nursing care provider. Since the care plan is created on a monthly basis, during actual operation, changes such as changes in time and helpers may occur individually, and the home visit nursing care business operator may cancel the service or substitute a helper every time. The task of searching occurs. When searching for a substitute helper, it is necessary to check the schedule of the helper and search for a helper whose time zone desired by the user is available. However, since the relationship between the helper and the user is human, they are compatible and not all helpers are good. In addition, when the number of helpers and users increases, it is extremely difficult for the home-visiting nursing care provider to memorize even the compatibility between the helpers and the users and to schedule them.

[0003]

When a care plan is created, it is necessary to create a care plan that meets the wishes of the user, and for visiting care, it is necessary to actually contract a helper dispatch. For this reason, home care providers need to determine helpers to be dispatched according to the care plan. Basically, helpers are mainly part-time workers, and the working hours are different for each helper. Therefore, it is very difficult to uniformly ascertain the available hours of each helper.

The present invention has been made in view of the above circumstances, and has as its object to provide a schedule management method that enables a user to automatically select and extract a helper candidate that can be dispatched during a desired time zone. I do.

[0005]

According to a first aspect of the present invention, a procedure for registering a helper working time zone in a first database and reading the working time zone from the first database are provided. A procedure, a procedure for registering the user desired time in the second database, a procedure for reading the user desired time from the second database, a user desired time read in this procedure, and a helper read in the procedure. And extracting a helper by taking schedule matching with the working hours.

The second invention is characterized in that, when extracting a helper, a helper who has been in charge of the user in the past is preferentially selected from the extracted helpers.

According to a third aspect of the present invention, when a specific helper that is incompatible with a specific user is registered in a database and a schedule matching of a specific user is performed, a helper that is previously incompatible with the database is registered. Are automatically excluded from schedule matching.

[0008]

Embodiments of the present invention will be described below with reference to the drawings. [First Embodiment] In FIG. 1, when registering basic items of a helper in a database, an in-home visiting care company firstly inputs an unillustrated working hours of the helper in step S1 in step S1. From the first database through a computer. At the time of this registration, in step S2, the change of the workable time is individually registered in the second database in accordance with the contents desired by the user and the helper. Next, the user's desired time is registered in the third database. The user's desired time is read from the third database, and schedule matching between the time and the working hours of the helper registered in the first database is performed. The time at which the two match in this matching is defined as the time at which schedule matching is possible. This schedule matching possible time is shown in FIG. 4 described later.

After that, when the user designates the desired time at which the helper is required, the data of the first and third databases is read into the computer, and at step S3, the helper who is available at the time desired by the user is provided. Is determined. If the result of the determination is "Yes", a list of available helpers is displayed on a display device (not shown) in step S4,
Also, it is displayed whether the helper's time is working hours and the helper has no reservation, and then the helper is selected from the database. After that, the helper selected in step S5 is dispatched to the user to perform the service. After the helper is dispatched, if the user wants to change the use contents, "Yes", the process returns from step S6 to step S2, reads the desired contents of the second database, and starts the process again from step S3. If “No” in the step S6, the process returns to the step S3 to be in a standby state.

[0010] By dispatching a helper according to the above-described procedure, it is possible to reserve a helper who can easily work.

[Second Embodiment] In home-visit nursing care, there is a special relationship of entering a user's home. for that reason,
It is more secure for a user to be assigned to a specific helper than to an unspecified number of helpers. In addition, since a specific helper grasps the features and desires of the user, he / she knows what the user wants and how to handle it. Therefore, the schedule matching function described later can be easily performed by automatically extracting a helper who has been in charge of the user's desired time in the past, and that time is a workable time and has no schedule. It becomes possible.

FIG. 2 shows a flow of a procedure in the second embodiment. It should be noted that the same processing procedures as those in FIG. In FIG. 2, the user's desired time is first determined from the workable hours of the helper registered in the first and second databases and the desired content of the user, and the desired time of the user registered in the third database. Then, the schedule is matched between the read time and the working hours of the helper registered in the first database (steps S1, S2, S3). The time at which the two match in this matching is defined as the time at which schedule matching is possible. This schedule matching possible time is shown in FIG. 4 described later.

Next, at step S7, a helper B candidate who has experience of care for the user A in the past is selected from a plurality of helpers whose working hours are vacant using the first database according to the request from the user A. To list on a display device (not shown). After the listing, the helper B is determined by a schedule matching function described later, the helper B is dispatched, and the service is performed (steps S4 and S5). Subsequent processing is the same as in the first embodiment.

[Third Embodiment] In home care, there is a one-to-one relationship between the helper and the user, and there is a compatibility between them. Home-visit nursing care has a special characteristic that a helper who is another person enters the user's home.
The compatibility between the user and the helper is an important factor. In a support tool for home-visit nursing care providers, a system in which the work status of the helper is input in advance when matching the schedule between the helper and the user. FIG. 3 shows a third embodiment in which schedule matching can be performed in consideration of compatibility between a helper and a user when a request is made.

In FIG. 3, the same processing steps as those in FIGS. 1 and 2 are denoted by the same reference numerals. The working hours of the helper registered in the first and second databases and the user's request are shown. First, the user's desired time is read from the contents and the user's desired time registered in the third database, and schedule matching is performed between the time and the helper's working time zone registered in the first database ( Steps S1, S2, S3). Next, step S8
Then, it is determined whether the compatibility between the user A and the helper B is compatible. At first, since the compatibility cannot be determined, the user A is determined as “Yes”.
A helper B whose working hours are vacant is determined by the schedule matching function according to the request from
And provide services.

Here, if a compatibility problem arises between the helper B dispatched from the user A and the user A requests to change the helper, the compatibility between the helper B and the user A is required. Are registered in the second database (step S2). A new schedule matching is performed for the user A, and a new helper is selected (step S4). At this time, the helper B that is not compatible with the user A is automatically deleted from the helper candidates, and it is determined that the helper C is dispatched by using the schedule matching function (step S5).

Further, when the user A requests to add or change a service (step S6), if the schedule of the helper C is tight, the helper whose time is available is identified by using the schedule matching function. Decide a helper to dispatch. At this time, the helper B that did not previously match is automatically deleted from the helper candidates, and decides to send the helper D using the schedule matching function.

FIG. 4 is a flowchart of the schedule matching function. The same processing procedures as those in FIG. In FIG. 4, the workable hours of the helper are registered in advance in step S1.
Then, the computer extracts a desired helper from the first database. Next, the user's desired schedule is input to a computer (not shown) in step S9, and it is determined in step S10 whether or not there is any helper available for working hours at the desired time that matches the user's schedule. In the case of "Yes", the vacant helper is selected from the list displayed on the display device (not shown) in step S4, and then the helper is dispatched (step S5).

FIG. 5 is a system configuration diagram of each of the above embodiments. In FIG. 5, the database section 11 includes a schedule information database 11a, a care manager information database 11b, a helper information database 11c, a user information database 11d, and a basic information database. 1
1e. The database unit 11 is connected to a management unit 13 including a computer by a relay unit 12 including a user interface unit. Management unit 1
3 processes each information of the database unit 11 based on each of the above-described modes, and displays the processing result on a display device 14 including a display.

[0020]

As described above, according to the present invention,
Helpers who can work at the desired time of the user can be automatically extracted, and helpers who have experience in the past at the desired time of the user can be automatically extracted. In addition, it is no longer necessary to dispatch helpers who are incompatible with specific users, and it is also possible for home care workers to perform schedule matching without worrying about helpers who are not compatible with specific users. There are advantages such as being able to.

[Brief description of the drawings]

FIG. 1 is a flowchart showing a first embodiment of the present invention.

FIG. 2 is a flowchart showing a second embodiment of the present invention.

FIG. 3 is a flowchart showing a third embodiment of the present invention.

FIG. 4 is a flowchart illustrating a schedule matching function.

FIG. 5 is a system configuration diagram of each embodiment.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 11 ... Database part 12 ... Relay part 13 ... Management part 14 ... Display device

Claims (3)

[Claims] 1. A procedure for registering a helper working time zone in a first database, a procedure for reading a working time zone from the first database, a procedure for registering a desired user time in a second database, and a procedure for using the second database. Reading a user's desired time, and extracting a helper by performing schedule matching between the user's desired time read in this procedure and the helper working time zone read in the above procedure. Schedule management method. 2. The schedule management method according to claim 1, wherein, when extracting a helper, a helper who has been in charge of a user in the past is preferentially selected from the extracted helpers. Characteristic schedule management method. 3. The schedule management method according to claim 1, wherein after registering a specific helper that is incompatible with a specific user in the database, when performing schedule matching of the specific user, the scheduler is previously registered in the database. A schedule management method characterized in that helpers that do not match each other are automatically excluded from schedule matching.