JP2002324156A - Apparatus, method, and program for schedule generation, and computer readable recording medium with schedule generation program recorded thereon - Google Patents

Abstract

PROBLEM TO BE SOLVED: To automatically generate an efficient work schedule being a work schedule generated according to the ability of a plurality of persons in charge, respectively. SOLUTION: A schedule generation apparatus is provided with an information accepting means (S1) for accepting input of request information, a time table storage means for storing a time table wherein work assignment data are assigned in time series every person in charge, and a decision means (S19) for deciding at least a person in charge from among the plurality of persons in charge on the basis of the stored time table data and accepted request information.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a schedule creation device, a schedule creation method, a schedule creation program, and a computer-readable recording medium storing the schedule creation program, and more particularly to creating a work schedule for a plurality of persons in charge. The present invention relates to a schedule creation device, a schedule creation method, a schedule creation program, and a computer-readable recording medium recording the schedule creation program.

[0002]

2. Description of the Related Art An air conditioner, a large electric product or a gas product is fixedly installed in a building such as a general home, office or factory. For this reason, when these facilities break down, it is difficult to remove the facilities from the building for the purpose of repair. For this reason, a repair person from a company that provides equipment repair service (hereinafter referred to as a “service company”) goes to a place where a failed equipment is installed to perform repairs. In a service company, a repair request is received by telephone or facsimile from a person who manages equipment at a general home, office, or factory where the failed equipment is installed, and a repair person is dispatched accordingly.

[0003]

However, since a repair request has been accepted until the number of requests that can be repaired is, for example, on a daily or half-day basis, the request for repair is received immediately by telephone or facsimile. Could not answer the visit time.

[0004] Also, of the received requests, requests generated in the area in which the person in charge is assigned are assigned to the repair staff. For this reason, work has not been allocated according to the ability of the repair staff. In addition, the assignment of the request did not take into account the travel time of the repair staff, so the staff had to decide the order of the visits themselves, and in some cases, the time spent moving was increased. was there.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems, and an object of the present invention is to provide a schedule creating apparatus capable of automatically creating work schedules for a plurality of persons in charge. To provide a schedule creation method.

Another object of the present invention is to provide a schedule creating apparatus and a schedule creating method capable of creating a work schedule according to the abilities of a plurality of persons in charge.

It is still another object of the present invention to provide a schedule creation program that allows a computer to create a work schedule for each of a plurality of persons in charge, and a computer-readable recording medium that stores the schedule creation program. is there.

[0008]

According to one aspect of the present invention, there is provided a schedule creating apparatus, comprising: a receiving unit for receiving an input of request information; Time table storage means for storing the time table for each of a plurality of persons in charge, and determination means for determining at least one person in charge among the plurality of persons based on the stored time table and the received request information. Is provided.

According to the present invention, at least one person in charge is determined from a plurality of persons in charge based on a time table in which work assignment data is allocated in a time series and request information. For this reason, there is a vacancy in the time table, and the person in charge matching the request information is determined. As a result, it is possible to provide a schedule creation device that can automatically create work schedules for a plurality of persons in charge.

[0010] Preferably, the information processing apparatus further includes ability data storage means for storing ability data for determining the ability of each of the plurality of persons in charge, and the determining means determines the plurality of persons in charge based on the stored person's ability data. At least one person in charge is determined.

According to the present invention, at least one of the plurality of persons in charge is determined based on the stored skill data of the persons in charge. Therefore, it is possible to provide a schedule creation device capable of creating a work schedule according to the ability of the person in charge.

[0012] Preferably, the determining means determines with higher probability the person in charge having higher stored ability data.

[0013] According to the present invention, the higher the ability of a person in charge, the higher the probability of work being assigned. Therefore, the higher the ability of a person in charge, the priority is assigned to work. For this reason, the work that the person in charge is good at is given priority, and a schedule with good work efficiency can be created.

[0014] Preferably, the apparatus further comprises a responsible district storage means for storing a district in which a plurality of persons are mainly in charge and a district in which a plurality of persons in charge are in charge, and the deciding means is specified by position information included in the received request information. The person in charge of the assigned area including the location to be assigned is determined with a higher probability than the person in charge of the auxiliary.

According to the present invention, work in the area in which the person in charge is assigned is given priority, so that it is possible to create a schedule in which travel time is minimized.

[0016] Preferably, the information processing apparatus further comprises work history information storage means for storing work performed by a plurality of persons in the past as work history information, and the determining means comprises: position information included in the received request information; By comparing the history information with the history information, the person in charge having the work history information matching the position information is determined with a higher probability.

According to the present invention, the work history information, which is a record of a plurality of persons working in the past, is compared with the position information included in the request information. Determined with high probability. For this reason, work is assigned with priority to a person who has worked in the past at the requested location. For this reason, the person in charge who has visited once is given priority, so that the person in charge can move to the work site quickly, and the communication between the person in charge and the client can proceed smoothly. For this reason,
A travel time can be shortened, and a schedule can be created that allows the work to proceed smoothly.

Preferably, the deciding means decides with a higher probability for a person who is not assigned work assignment data in the time table.

According to the present invention, the probability that a task is assigned to a person whose work assignment data is not assigned in the time table increases. For this reason, the work is assigned with priority given to a person who can afford the work. As a result, it is possible to equally assign work to a plurality of persons in charge.

[0020] Preferably, the deciding means is further configured such that the position specified by the position information included in the received request information is specified by the position information included in the work allocation data allocated before the time slot to be allocated. The closer the person in charge is, the higher the probability is determined.

According to the present invention, the position specified by the position information included in the request information is close to the position specified by the position information included in the work allocation data allocated before the time slot to be allocated. The person in charge is determined with a higher probability. For this reason, the person in charge who has a short distance between the previous work place and the next work place is given priority, so that the traveling distance is shortened,
It is possible to create an efficient schedule that minimizes wasted time required for moving.

Preferably, the apparatus further comprises ability data storage means for storing ability data for determining the ability of each of a plurality of persons in charge, wherein the determining means sets a higher evaluation point for a person having higher stored skill data. Point setting means, assignment evaluation point setting means for setting higher evaluation points for persons not assigned work assignment data in the timetable, and the position specified by the position information included in the received request information is assigned. Distance evaluation point setting means for setting a higher evaluation point for a person closer to the position specified by the position information included in the work allocation data allocated before the time zone to be set, and a capability evaluation point setting means, Based on the evaluation points set by the allocation evaluation point setting means and the distance evaluation point setting means, a person who can work is determined.

According to the present invention, a higher evaluation point is set for a person having a higher stored ability data, and a higher evaluation point is set and received for a person to whom no work assignment data is allocated in the time table. The higher the evaluation point is set, the closer the person specified by the position information included in the request information is to the position specified by the position information included in the work assignment data assigned before the time slot to be assigned. You. Then, the work assignment data is assigned to the time table based on the set evaluation points. For this reason,
The optimal person in charge can be determined by comprehensively considering the ability of the person in charge, the availability of the timetable, and the moving distance.

Preferably, the deciding means includes a time selecting means for selecting a person to whom no work assignment data has been assigned at the designated time included in the received request information.

According to the present invention, a person who has not been assigned work assignment data at the designated time included in the request information is selected based on a time table in which work assignment data is assigned in chronological order. For this reason, a person who can work at the designated time is selected, so that the number of persons to be compared for determination can be reduced, and the processing speed can be increased.

Preferably, the deciding means compares the work level specified by the failure information included in the request information with the stored capability data of the person in charge and determines the person who can work among the plurality of persons. And a capability selecting means for selecting from the following.

According to the present invention, the work level specified by the failure information included in the request information is compared with the capability data of the person in charge, and the person in charge who can work is selected. For this reason, persons whose abilities do not reach the work level are excluded, so that the number of persons compared for determination can be reduced, and the processing speed can be increased. Also,
Since a task that has not reached the task level is not assigned, a schedule according to the ability of the person in charge can be created.

According to another aspect of the present invention, a schedule creation method includes the steps of: receiving input of request information;
Determining at least one person in charge among a plurality of persons in charge, based on the time table to which the work assignment data is allocated in chronological order and the received request information.

According to the present invention, at least one person in charge is determined from a plurality of persons in charge based on the time table and the request information in which the work assignment data is allocated in chronological order. For this reason, there is a vacancy in the time table, and the person in charge matching the request information is determined. As a result, it is possible to provide a schedule creation method capable of automatically creating work schedules for a plurality of persons in charge.

According to still another aspect of the present invention, the schedule creation program includes a step of receiving an input of request information, a plurality of steps based on a time table in which work allocation data is allocated in time series and the received request information. Determining at least one person in charge from among the persons in charge.

According to the present invention, one person in charge is determined from a plurality of persons in charge based on a time table in which work assignment data is allocated in a time series and request information.
For this reason, there is a vacancy in the time table, and the person in charge matching the request information is determined. As a result, it is possible to provide a schedule creation program that enables a computer to automatically create work schedules of a plurality of persons in charge, and a computer-readable recording medium that records the schedule creation program.

[0032]

Embodiments of the present invention will be described below with reference to the drawings. The same reference numerals in the drawings denote the same or corresponding members, and description thereof will not be repeated.

FIG. 1 is a diagram schematically showing a repair receiving system according to one embodiment of the present invention. Referring to FIG. 1, a repair reception system 1 includes a schedule creation device 1
00 and a personal computer (hereinafter referred to as a “client P
C) 201A, 201B, 201C and portable terminals 202A, 202B.

The schedule creation device 100 can be constituted by a personal computer, a UNIX (registered trademark) workstation, or the like. Further, a general-purpose computer may be used. The schedule creation device 100 can execute a program for functioning as a Web server.

Client PCs 201A, 201B, 2
01C is composed of a personal computer or the like, and can execute browser software.

The schedule creation device 100 and the client PCs 201A, 201B, 201C are connected to a wide area network 210 such as the Internet. For this reason, the client PCs 201A, 201
B and 201C are between the schedule creation device 100 and
Communication can be performed via the network 210.

In the schedule creation device 100, the Web
Page is stored in the client PC 201A, 2
In response to a request from the browser software started by the client PC 20B, the client PC 20
1A, 201B, and 201C. Client P
In C201A, 201B, and 201C, the Web page received from the schedule creation device 100 is displayed on the display by the browser software started up in each of them.

Thus, the client PC 201
A, 201B, 201C and schedule creation device 100
The transmission and reception of information is performed between the terminal and the server. Here,
The browser software and the Web page are used for communication between the client PCs 201A, 201B, and 201C and the schedule creation device 100. However, the present invention is not limited to this, and communication may be performed using a dedicated communication protocol. .

The portable terminals 202A and 202B are constituted by portable personal computers or the like. Here, the mobile terminals 202A and 202B are connected to the network 2
10, but the schedule creation device 1
As long as communication can be performed with the schedule creation device 100, the communication with the schedule creation device 100 may be performed directly without using the network 210. You may.

In the schedule creation device 100, the client PCs 201A, 201B, 20
Based on the request information received from 1C, a work schedule for a plurality of repair staff is created. The created schedule includes the portable terminals 202A and 20 carried by the repair staff.
2B. The repair person in charge of the mobile terminal 202A,
The schedule data received at 202B is transmitted to the portable terminal 2
By looking at the 02A display, the user can check his / her own work schedule.

In the present embodiment, the network 210 is described using the Internet as an example, but a local area network or the like may be used.

In the figure, three client PCs 20 are shown.
Although 1A, 201B, 201C and two mobile terminals are shown, the number is not limited to this.

FIG. 2 is a block diagram showing a schematic configuration of the schedule creation device in the present embodiment. Referring to FIG. 2, schedule creation device 100 includes a control unit 101 for controlling the entire schedule creation device, an input unit 102 for inputting necessary information, and an output unit 103 for outputting information. And the schedule creation device 10
0 includes a data communication unit 104 which is an interface for connecting to the network 210, a storage unit 110, and an external storage device 105.

The control unit 101 includes a central processing unit (CPU)
And a read-only memory (ROM) for storing a program to be executed by the CPU, and a random access memory (RAM) used as a work area necessary for executing the program by the CPU.

The input unit 102 is a keyboard or a mouse. The user of the schedule creation device 100 is used to input necessary information.

The output unit 103 is a display such as a liquid crystal display device or a cathode ray tube or a printer. In accordance with an instruction from the control unit 101, necessary information is displayed or printed.

The data communication unit 104 is connected to the control unit 101. The data communication unit includes the schedule creation device 100 and the client PCs 201A, 201B, 201
C can be communicated via the network 210.

The storage unit 110 is a magnetic storage device such as a hard disk drive or a magneto-optical storage device. The storage unit 110 stores a time table file 111 described later,
Person in charge master file 112, district master file 11
3. Store the responsible person district distribution master file 114, the basic work point master file 115, the responsible person technical rank file 116, and the work history file 117.

The external storage device 105 is a magneto-optical storage device, and reads a schedule creation program to be executed by the control unit 101 recorded on the recording medium 106,
Data can be written to the recording medium 106 according to an instruction from the control unit 101.

As the recording medium 106, a medium that fixedly holds a program such as a magnetic disk, an optical disk, an IC card, an optical card, or a semiconductor memory such as a flash memory can be used. Alternatively, the medium may be a medium that carries the program fluidly so that the program or data is downloaded from the network. The external storage device 105 stores such a recording medium 106
Is a device that can write or read data corresponding to

The control unit 101 executes a schedule creation program described later, and uses the information stored in the storage unit 110 to execute the client PC 201.
Based on the request information input from any one of A, 201B, and 201C, an optimal person is determined from a plurality of persons, and a schedule creation process for creating a timetable of the plurality of persons is performed.

In the present embodiment, the schedule creation device 100 is connected to the network 210 and receives request information from the client PCs 201A, 201B, and 201C via the network 210. Without connecting to the network 210,
0 may be configured alone. In this case, the schedule creation device 100 inputs the request information received by the operator by telephone or facsimile from the input unit 102.
Then, information such as the visit date and time and the name of the person in charge, which is output from the output unit such as a display by the schedule creation device 100, is notified to the requester by telephone or facsimile.

FIG. 3 is a diagram showing an example of the person in charge master file stored in the schedule creating apparatus 100 according to the present embodiment. Referring to FIG. 3, person in charge master file 112 stores data consisting of items of person in charge, name, affiliation, telephone number, and address. The person-in-charge master file 112 stores data unique to the person in charge for each person in charge. The person in charge code is a unique code assigned to each person in charge, and one person in charge is specified by the person in charge code.

The clerk master file 112 stores the name, affiliation, telephone number and address of the clerk in association with the clerk code. Therefore, if a person in charge code is designated using the person in charge master file 112, the name, affiliation, telephone number and address of the person in charge associated with the person in charge code can be read.

FIG. 4 is a diagram showing an example of a time table file created by the schedule creating apparatus 100 according to the present embodiment. Time table file 111
Is a file for storing time tables of a plurality of persons in charge. Referring to FIG. 4, the person in charge code is "11".
A timetable is shown for four persons in charge of “1”, “222”, “333”, and “444”. One cell in the timetable indicates 15 minutes. The abscissa indicates the passage of time. Here, the time table from 9:00 to 15:00 is shown. The shaded portion indicates the work assignment data to which the work has already been assigned. For example, for the person in charge having the person in charge code “111”, 9:00 to 1
Between 0:00 and 12:00 to 13:00, work assignment data 11 and work assignment data 12 are assigned, respectively. For the remaining time zones, it indicates that work assignment data has not been assigned. The person in charge code is "2
The person in charge of “22” is assigned two pieces of work assignment data 21 and 22. The person in charge of person in charge “333” is assigned one piece of work assignment data 31 and the person in charge code is “444”. Person in charge of 3 work assignment data 4
1, 42 and 43 are allocated.

FIG. 5 is a diagram showing an example of a district master file stored in the schedule creating apparatus 100 according to the present embodiment. The district master file 113 is a file for storing district master data that defines a geographical position. The district master data is data in which a point is defined in a region where one side is divided by a square of 1 km, and the district is defined by a set of points. In addition, for example, a point may be defined in an area where the telephone numbers are the same. FIG. 5 shows an example in which a set of points surrounded by a square having a side of 1 km is set as a district.

Referring to FIG. 5, points L12, L11, L
A district A including 43 and L21, a district B including L41 and L42, and a district C including points L31 and L22 are shown. As described above, if the address or the telephone number is designated using the district master file 113, it is possible to read which district the point determined by the address or the telephone number belongs to. For example, when the address belongs to the point L12, the address belongs to the district A.

Since the district master file 113 defines a point as a square having a side of 1 km, the distance between the two points can be easily obtained. For example, point L
11 and the point L43 are shifted by two in the horizontal direction. Therefore, the distance between the point L11 and the point L43 is about 2 k
m.

FIG. 6 is a diagram showing an example of the person in charge district distribution master file stored in the schedule creating apparatus 100 according to the present embodiment. The person in charge district distribution master file is a file for storing district distribution master data for each person in charge. FIG. 6A shows that the person in charge code is “11”.
1 shows the district distribution master data of the person in charge of FIG.
(B) shows the district distribution master data of the person in charge having the person in charge code “222”, and FIG. 6 (C) shows the person in charge code “3”.
33 shows the district allocation master data of the person in charge of FIG.
(D) shows the district distribution master data of the person in charge whose person code is “444”.

The person in charge district master data is data comprising a person in charge code, a district and a district division in charge. The person in charge code is a person in charge code defined in the person in charge master file 112. The district item is a district defined in the district master file 113. The assigned district division is a division in which “1” indicates the main charge and “2” indicates the sub charge. Indicates that the main division is in charge of the district in preference to the sub division.

For example, referring to FIG. 6A, it is defined that the person in charge having the person in charge code of “111” is in charge of district A as the main person in charge. This person in charge indicates that no district other than the district A is in charge. FIG.
Referring to (B), the person in charge having the person in charge code of “222” is in charge of the district B as the main person, and the district B and the district C
Is in charge of the sub. This means that the person in charge having the person in charge code of “222” is in charge of all of the districts A, B, and C. When the load is small and the load becomes large in the district A or the district C, it is in charge. Referring to FIG. 6C, the person in charge code is “33”.
The person in charge of "3" has the district C as the main and the district A as the sub-charge. Referring to FIG. 6 (D), the person in charge having the person in charge code "444" has district B as the main charge and district A as the sub charge.

FIG. 7 is a diagram showing an example of a basic work point master file stored in the schedule creation device 100 according to the present embodiment. The basic work point master file 115 stores basic work points that define work time for each work. The basic operation point is specified by the operation basic code and the model. Referring to FIG.
For example, the basic work code “00” is defined as a code whose content indicates “does not cool”. As described above, the operation basic code is also a code that defines a symptom of the failure of the air conditioning equipment.

The basic work point whose work basic code is “00” is defined as “4” when the model belongs to the small air conditioner (SA) product category, and the model is included in the room air conditioner (HA) product category. "3" is defined if the model belongs to the product, and "6" is defined if the model belongs to the commercial air conditioner (HH) product category. Basic work point is "1"
Means that the basic working time is 15 minutes. Therefore, when the basic model of work is “00” and the failed model belongs to the small air conditioner (SA) product category, it indicates that the basic work time is one hour.

When the basic work point varies for each model, the basic work point may be defined for each model, not for each product category.

FIG. 8 is a diagram showing an example of the technical staff rank file stored in the schedule creating apparatus 100 according to the present embodiment. The person in charge technical rank file is a file for storing a technical rank indicating the repair capability of the person in charge. The technical rank is defined for each person in charge and for each product category. When it is necessary to define the technical rank for each model, it is sufficient to define the technical rank for each model, not for each product category.

Referring to FIG. 8, the person in charge code is "11".
The person in charge of "1" has a technical rank of "40" for a model whose product category belongs to a small air conditioner (SA), and has a technical rank of "40" for a model whose product category belongs to a room air conditioner (HA). It is defined that a model whose product classification belongs to a commercial air conditioner (HH) has a technical rank of “40”. Also, for the person in charge having the person in charge code "333", the small air conditioner (SA)
A technology rank of “0” is defined for a model belonging to the product category of “A”, and a technology rank of “20” is defined for a model belonging to the product category of the room air conditioner (HA). A technology rank of “0” is defined for the models belonging to If the technical rank is defined as “0”, it indicates that the device does not have the ability to repair a model belonging to the product category.

The work history file 117 stores work history data including items such as a person-in-charge code of a person in charge of repair, a visit date and time, an address of a visited place, a repaired model, a failure symptom, and repair contents. This is a file to store.

The evaluation point setting master file 118 is a file for storing data defining evaluation points for work assignment. Details will be described later.

Hereinafter, a schedule creation process executed by the schedule creation device 100 will be described. Here, in order to simplify the explanation, the air conditioner of the model belonging to the small air conditioner (SA) whose product classification belongs to the failure from the requester (customer) of the point indicated by the star in the area A of FIG. A case in which request data indicating that the symptom of “does not cool” is input will be described. Also, from the same request source, a work history that the person in charge with the person in charge code “111” visited once two months ago and the person in charge of “444” visited five months ago. It is assumed that data is stored in the work history file 117 of the storage unit 110.

FIG. 9 is a flowchart showing the flow of a schedule creation process executed by the schedule creation device 100 according to the present embodiment. Referring to FIG. 9, in the schedule creation processing, first, input of request data is accepted (step S1). If the input of the request data is accepted, the process proceeds to step S3, and if not, the process of accepting the request data input is repeated.

The request data is input to the client PC 2
In response to a transmission request from any of 01A, 201B, and 201C, a request data input screen is transmitted from the schedule creation device 100 to the client PC that has made the transmission request. The request data input screen is a Web page and is stored in the storage unit 110 in advance. Upon receiving the request data input screen, the client PC that has made the transmission request displays the received request data input screen on the display. The requester who is a user of the client PC inputs request data using a keyboard or a mouse according to the displayed request data input screen. The input request data is transmitted to the schedule creation device 100. When the schedule requesting device 100 receives the input request data, the input of the request data is accepted.

When the operator of the schedule creation device 100 directly inputs request data without connecting the schedule creation device 100 to the network 210, the request is received by telephone or facsimile from the input unit 102 of the schedule creation device 100. The requested data is input. Also in this case, the client PC 201
The same data as the request data input from A, 201B and 201C is input from the input unit 102.

FIG. 10 is a diagram showing an example of the request data input screen. Request data input screen 300 includes an area for receiving input of information for specifying a requester. FIG.
, A request data input screen 300 includes an area 302 for inputting the name of the requester, an area 301 for inputting a phonetic name, an area 303 for inputting a postal code, an area 304 for inputting an address, Area 30 for inputting a telephone number
5, an area 306 for inputting a facsimile number, and an area 307 for inputting an e-mail address.

If only the requester is specified, at least the name and address of the requester need only be input.
In this case, the area 302 and the area 304 are essential input items.

The request data input screen 300 includes an area for receiving input of information necessary for repair. The request data input screen 300 includes an area 308 for inputting a model name, an area 309 for inputting a model number, an area 310 for inputting a product name,
An area 311 for inputting a product classification, an area 312 for inputting an installation location, an area 313 for inputting a year when a failed air conditioner was purchased, an area 314 for inputting a purchased month, and a symptom appearing when an air conditioner fails. An area 315, an area 316 for inputting specific contents thereof, and an area 3 for inputting an abnormality code displayed on a remote controller of the air conditioner.
17, and a comment field 3 in which characters and the like can be arbitrarily input
18 inclusive.

Here, an area 308 for inputting the model name,
An area 315 for inputting a symptom is an essential input item.
Thereby, the basic work points required for the work can be read from the basic work point master file. Other items are optional input items.
The data input and received on the request data input screen 300 are:
Mobile terminal 2 of the person in charge with the created timetable
02A and 02B.

In step S1 for receiving input of request data, in addition to the request data shown in FIG.
An input of a date and time at which a visit for repair is desired can be accepted.

In the reception of the input of the desired time, first, the designated time input screen is transmitted from the schedule creation device 100 to the client PC which has requested the transmission. The designated time input screen is a Web page and is stored in the storage unit 110 in advance. Upon receiving the designated time input screen, the client PC that has made the transmission request displays the received designated time input screen on the display. Client PC
The user inputs a designated time using a keyboard or a mouse according to the displayed designated time input screen. The input designated time is set in the schedule creation device 10
0 and received by the schedule creation device 100.

FIG. 11 is a diagram showing an example of the designated time input screen. The designated time input screen 320 is an input screen for inputting the date and time when the repair staff wants the visitor to visit. Referring to FIG. 11, designated time input screen 320
Is an area to identify the date and time you want to visit,
An area 321 for inputting a month and an area 322 for inputting a day
And an area 323 for inputting a time zone. The time zone is
It is possible to input in units of 15 minutes. When the search button 324 is pressed, the areas 321, 322, 32
3 is transmitted to the schedule creation device 100.

Returning to FIG. 9, when the input of the request data is completed, in step S3, the address of the request source is
The person in charge of the district to which the requester belongs is selected. This corresponds to the district master file 113 shown in FIG.
This is performed by referring to the person in charge district distribution master file shown in FIG. Here, the address of the requester will be described as a star point in the district master file shown in FIG. Step S1 based on the district master file
The location of the star is specified from the address of the request data input and received, and the district A including the location of the star is derived from the district master file 113.

Then, the person in charge of the district A as the main or sub is selected by referring to the person in charge district master data shown in FIG. The person in charge of the district A in the main or sub area has the person in charge code "11
1 "," 222 "," 333 ", and" 444 ", and four persons in charge are selected.

Next, a person having the technical level of repairing the model is selected from the received request data (step S4). This determination is made by referring to the technical staff rank file 116 shown in FIG. It is determined whether or not each of the four staff members selected in step S3 has a technical level. The person without the skill level is not selected, and only the person with the skill level is selected.

Here, the model included in the request data is
It is assumed that a model belonging to a small air conditioner (SA) product category has been input. Therefore, referring to FIG. 8, the person in charge whose technical rank of the small air conditioner (SA) is not “0” is selected. Here, the person in charge code is “333”
The technical rank of the small air conditioner (SA) is "0"
The technical rank of other persons is not “0”.
Therefore, among the persons selected in step S3,
The person in charge code is "111", "222" and "44"
The person in charge of "4" will be selected. This is because a person who cannot repair a model belonging to the product class of the small air conditioner (SA) cannot perform a repair work corresponding to the request data, so that such person is excluded from the subsequent processing. . As a result, the number of persons in charge of subsequent processing is reduced, so that the processing speed can be increased.

In this case, the person having the technical rank “0” is not selected.
In addition to the file 16, a file in which whether or not the person in charge has the technical level is recorded for each product category is stored in the storage unit 110, and the person having the technical level is selected by referring to this file. Is also good. When the presence or absence of the work ability of the person in charge is determined not by product category but by model, the presence or absence of work ability by model may be recorded instead of product category. Further, in the case where home electric appliances such as a refrigerator and a washing machine are to be repaired without being limited to the air conditioning equipment, a file may be used that includes the capability of each product such as the air conditioning equipment, the refrigerator and the washing machine. .

Returning to FIG. 9, when a person having a technical level capable of dealing with the failure is selected in step S 4, the time table of the selected person is stored in the time table file 111 stored in the storage unit 110. Is read. Here, it is assumed that the time table shown in FIG. 4 has been read. Referring to FIG. 4, a time table in which the person in charge code is “333” is included, and the person in charge code is “3”
Since the person in charge of "33" is not selected in step S4,
The time table read in step S5 is a time table of a person in charge whose person code is "111", "222", and "444".

Returning to FIG. 9, a work point for each person in charge is calculated (step S6). The work point is calculated using the following equation (1) using the basic work point, the technical rank work point coefficient, and the daily coefficient.

Work point = (Basic work point) × (Technical rank point coefficient) / (Daily coefficient) (1) The work point is a value obtained by rounding a decimal point.

The basic work point is read from the basic work point master file shown in FIG. here,
For models belonging to the small air conditioner (SA) product category,
Basic work code "00" corresponding to the symptom of "not getting cold"
Request data was entered. Therefore, the basic work point “4” is read.

FIG. 12 is a diagram showing an example of the technical rank work point coefficient table. This technical rank work point coefficient table is stored in the storage unit 110. The technical rank work point coefficient table is a table that defines work point coefficients for each technical rank. If the technical rank is 30 or less, the work point coefficient is 1.
When the technical rank is more than 30 and less than or equal to 60, the work point coefficient is defined as 0.8, and when the technical rank is 70 or more, the work point coefficient is defined as 0.7. . The technical rank is a technical rank for each person in charge stored in the person in charge technical rank file shown in FIG.

As described above, the work point coefficient is defined as a smaller value as the technical rank is higher. This is because, since the work point is a value indicating the work time, the work time is shorter for a person having higher skill.

For example, the person in charge having the person in charge code “111” has a technical rank of 40. Therefore, the work point coefficient is 0.8. Contact code is "222"
The person in charge has a work point coefficient of 0.7 because the technical rank is 70. The person in charge having the person in charge code of “444” has the technical rank of 20, so the work point coefficient is 1.0.

FIG. 13 is a diagram showing an example of calculation of a work point. Referring to FIG. 13, the person in charge code is "111".
Has a technical rank of "40", a basic work point of 4 points, and a work point coefficient of 0.8. As the daily coefficient, for example, when working 8 hours a day, the daily coefficient becomes 100%, and when working overtime, the coefficient is changed according to the overtime hours. When the daily coefficient is 120%, 2 when 8 hours is 100%
It indicates that you work overtime for 1.6 hours, which is 0%. Therefore, the work point is calculated as 3 points (3p) from the above equation (1).

For the person in charge having the person in charge code of “222”, the technical rank is “70”, the basic work point is 4 points, the technical rank work point coefficient is 0.7, and the daily coefficient is 120. %. The working point in this case is 2 points (2p) from the above equation (1).
Is calculated as

Similarly, for the person in charge having the person in charge code “444”, the technical rank is “20”, the basic work point is 4 points, the technical rank work point is 1.0, and The coefficient is 120%. The working point in this case is 3 points (3
p).

The work point thus calculated is 1
The value indicates that the point is 15 minutes. For example, when the number of work points is 2 points, it indicates that a work time of 30 minutes is required.

Returning to FIG. 9, when the work point is calculated for each person in charge in step S6, it is determined in next step S7 whether or not a time has been designated. If there is a time designation, the process proceeds to step S9; otherwise, the process proceeds to step S8.

In step S8, candidates to which work points can be assigned are extracted. In the assignment of the work points, the movement points are calculated in consideration of the movement distance, and candidates are extracted by adding the calculated movement points to the work points. In addition, candidates are extracted from the time table for each person in charge read in step S5. Hereinafter, extraction of candidates will be described more specifically.

FIG. 14 is a diagram showing candidates that can be assigned to the latest time table. Contact person code is "111"
As for the person in charge, the work point was 3 points. Therefore, as a candidate in which three cells can be included, a candidate between the work allocation data 11 and the work allocation data 12 (candidate 5
1) and whether or not assignment is possible after the work assignment data 12 (candidate 52) is determined in consideration of the movement point.

Referring to FIG. 5, work assignment data 11 is work at point L11. The work of the candidate 51 is a work at a point indicated by an asterisk in FIG. The point L11 and the point indicated by the star are shifted by one cell in the horizontal direction and one cell in the vertical direction.
In this case, the distance between the point L11 and the star point is 2.
0 km. Similarly, the work assignment data 12 after the candidate 51 is the work at the point L12. The star point and the point L12 are shifted by one square in the horizontal direction. Therefore, the distance between the star point and the point L12 is 1.0
km.

The moving point is calculated using the following equation (2), taking the moving point coefficient into consideration for the distance.

Moving point = distance / moving point coefficient (2) The moving point is rounded off to the nearest decimal point.

The moving point coefficient is a coefficient determined for each district. Here, the moving point coefficient of the area A is 2.0. The moving point coefficient is a value indicating a distance that can be moved in 15 minutes. The moving point coefficient is set to a small value in a district where cars are often congested and the distance that can be moved in a predetermined time is short, and conversely, a district is set to a large value in a district where cars are less congested.

In addition, one moving point is 15 points.
A value indicating minutes. Therefore, in FIG. 14, the moving point occupies one square for each point.

The moving point from the point L11 to the point indicated by the star is calculated using the equation (2). Since the distance between the point L11 and the star is 2.0 km, the moving point from the point L11 to the point of the star is one point (1p). Similarly, the moving point from the point of the star to the point L12 has a distance of 1.0 km, and is regarded as one point.

Therefore, the candidate 51 needs a moving point (1p) from the point L11 to the star point, a working point (3p), and a moving point (1p) from the star point to the point L12. You. Thus, candidate 51
Is data obtained by adding a moving point before and after a work point.

Work assignment data 11 and work assignment data 12
Since there are eight squares between them, it can be seen that the candidate 51 can be allocated.

As for the candidate 52, the work assignment data 12 exists before, and the work assignment data is not assigned later. Therefore, in this case, the work assignment data 1
Only the movement points from the point L12 where the work 2 is performed to the point indicated by the star are considered. Since the moving point from the point L12 to the star point is one point, the candidate 52
Is 4 points in total, which indicates that it is possible to assign immediately after the work assignment data 12.

In this embodiment, when a plurality of candidates can be assigned to the same person in charge, the candidate with the smaller moving point before the work point is given priority. As for the candidate 51 and the candidate 52, the moving point is 1 point. In such a case, the earlier candidate is selected. Here, the candidate 51 is selected. Note that a later candidate may be selected.

For the person in charge having the person in charge code "222", the number of work points is two. Before the work assignment data 21, only two squares are vacant, so that the user cannot move and cannot be assigned considering the movement points. Four points are left between the work assignment data 21 and the work assignment data 22. It is determined whether the moving point is satisfied by two points obtained by subtracting the two working points.

The work assignment data 21 corresponds to the point L21 in FIG.
The work in. Since the point L21 and the point indicated by the star are shifted by two squares in the vertical direction, the distance between the point indicated by the star and the point L21 is 2.0 km, and the moving point is one point. Further, the work assignment data 22 indicates the work at the point L22 in FIG. Since the star point and the point L22 are shifted three in the horizontal direction and three in the vertical direction, the distance between the star point and the point L22 is 6.0 km,
The movement points are three points. The sum of the moving point (1p) from the point L21 to the point of the star and the moving point (3p) from the point of the star to the point L22 is 4
Is the point. Therefore, a work point cannot be allocated between the work allocation data 21 and the work allocation data 22. Similarly, after the work assignment data 22, a total of 5 is obtained by adding the movement point (3p) from the point L22 to the star point and the work point (2p).
Points. Since only four points are available after the work assignment data 22, they cannot be assigned. Therefore, for the person in charge with the person in charge code "222",
Work based on the request information cannot be allocated.

Looking at the person in charge having the person in charge code "444", the work points are three points from FIG. There is a 5-point space between the work assignment data 41 and the work assignment data 42. Since the distance between the point L41 and the point indicated by the star is 5.0 km and the number of moving points is three, a work point cannot be assigned.

Work assignment data 42 and work assignment data 43
There is an empty space of 8 squares between and. The moving point between the point L42 and the star point is three points, and the moving point between the star point and the point L43 is one point. Movement point (3p + 1) to work point (3p)
Since the total obtained by adding p) is 7 points, the candidate 53 can be assigned.

Therefore, in step S8, candidate 51 is extracted for the person in charge having the staff code "111", and candidate 5 is found for the person in charge having the staff code "444".
3 is extracted.

Returning to FIG. 9, when candidates to which work points can be assigned are extracted in step S8, the technical rank work evaluation points, the district charge evaluation points, the past history evaluation points, and the remaining courses are determined for each candidate. Evaluation points and movement evaluation points are calculated (steps S13, S14, S15, S16,
S17).

FIG. 15 is a diagram showing an example of the evaluation point setting master file stored in the schedule creation device according to the present embodiment. Evaluation point setting master file 118
Is the data that defines the technical rank evaluation point for the technical rank, the district evaluation point for the division in charge of the district manager, the past history evaluation point determined by the past history, the remaining man-hours evaluation point for the remaining man-hours, and the moving distance evaluation point for the moving point Is a file for storing.

Referring to FIG. 15, the technical rank evaluation points are:
When the technical rank is 30 or less, it is defined as “1”, when the technical rank is more than 30 and 60 or less, it is defined as “2”, and when the technical rank is 70 or more, it is defined as “3”. You.

As described above, a person having a higher ability for a basic task defined by a model and a symptom has a higher technical rank evaluation point, so that the probability of assignment of a task is higher.

The district charge evaluation point is defined as “6” when the charge district division is main, and is defined as “3” when it is sub. Since the person in charge is higher in the case where the responsible district classification is main than in the case where the sub district is assigned, the work in the area in which the responsible person is in charge is assigned with priority.

The past history evaluation points are stored in the work history file 11
7 is defined as “4” when there is work history data indicating that the user has visited within 3 months, and is defined as “2” when there is work history data indicating that the user has visited more than 3 months ago. If there is no work history data that is defined and indicates that a visit has been made in the past, it is set to “0”. The past history evaluation score is defined as a higher score when there is a closer visit history. For this reason, work is assigned in priority to a person who has visited in the past.

The number of remaining steps indicates the number of points (point number) to which neither the working point nor the moving point is assigned in the time table. The remaining man-hours evaluation point is defined as “1” when the remaining man-hours points are 10 points or less, and is defined as “2” when the remaining man-hours points exceed 10 points and 20 points or less. If the score is 21 points or more, it is defined as "3".

Since the number of remaining man-hours increases as the number of remaining man-hours increases, the work is assigned with priority over the person in charge of the number of remaining man-hours.

The moving distance evaluation points are determined based on the moving points. However, only the moving point before the working point is considered as the moving point. The moving distance evaluation point is
If the moving point is 2 points or less, it is defined as "3". If the moving point is more than 2 points and 4 points or less, it is defined as "2". If the moving point is 5 points or more, "1". Is defined. In this way, the moving distance point is set to be smaller as the moving point increases. For this reason, work is assigned to the person in charge who moves as short as possible.

The technical rank evaluation points shown in FIG.
The district charge evaluation score, the past history evaluation score, the remaining course evaluation score, and the travel distance evaluation score are merely examples, and these can be arbitrarily changed.

In step S18 in FIG. 9, the candidate having the largest total evaluation score is selected for the candidates 51 and 53. FIG. 16 is a diagram illustrating a calculation example of the comprehensive evaluation points. As for the candidate 51 with the person in charge code of “111”,
Since the technical rank is 70, the technical rank evaluation point is “3”. On the other hand, the technical rank of the candidate 53 having the person-in-charge code of “444” is 20, so that the technical rank evaluation point is “2”.

As for the district charge evaluation point, the person in charge having the charge code of “111” has the district charge evaluation point of “6” because it is the main charge district division for the district A.
The person in charge with the person in charge code of “444” is in the sub charge area division for the district A, so the district charge evaluation point is “3”.

Regarding the past history evaluation point, the person in charge with the person in charge code of “111” has the work history data indicating that he has been dispatched two months ago, so the past history evaluation point is “4”. Become. The person in charge code "444" has been visited 5 months ago, so the past history evaluation score is "2".
Becomes

Regarding the remaining man-hours evaluation point, the person in charge having the person-in-charge code of “111” has 16 points of the remaining man-hours.
The remaining man-hours evaluation point is “2”. The person in charge code is "44
The person in charge of “4” has 13 remaining man-hour points, so the remaining man-hour evaluation point is “2”.

Regarding the moving distance evaluation point, the moving distance evaluation point of the candidate 51 is “3” because the moving point is one point. As for the candidate 53, since the number of moving points is three, the moving distance evaluation point is “2”.

The total of the technical rank evaluation point, the district evaluation point, the past history evaluation point, the remaining course evaluation point, and the travel distance evaluation point is “18” for the candidate 51 of the person in charge “111”, and The candidate 53 with the user code “444” is “11”. The person in charge code is "1
Since the total of the evaluation points of “11” is large, the candidates 51 extracted as allocatable are allocated to the time table, and the person in charge with the person code “111” is determined to be the person who can work (FIG. 9). Step S19).

In this embodiment, the candidates to be assigned to the time table are determined by comparing the evaluation points obtained by simply summing the evaluation points. However, the total weighted evaluation points are used. Is also good.

Also, without using all of the technical rank evaluation point, the district charge evaluation point, the past history evaluation point, the remaining course evaluation point, and the travel distance evaluation point, one or a combination of two or more of them can be used as candidates. May be determined.

Returning to FIG. 9, when the person in charge is determined in step S19, the name of the person in charge and the visiting time of the determined person are output (step S20). In this case, the name of the person in charge having the person in charge code “111” is read from the person in charge master file 112, and the read out name of the person in charge and the start time 10:15 of the work of the assigned candidate 51 are represented by The data is transmitted to the requested client PC via the data communication unit 104 and the network 210.

Then, the visit time is confirmed by the person in charge from the client PC having received the name and time of the person in charge, and it is determined whether or not an input indicating approval has been received (step S21). If an approval input has been received, the process proceeds to step S22; otherwise, the process ends. In step S22, the determined candidate 51 is assigned to the time table of the person in charge whose person code is "111", and the time table is updated.

FIG. 17 is a diagram showing an example of the output screen. Referring to FIG. 17, the output screen displays “The visit date and time is the shortest, xxxxx year / month / day from 10:15 to 11
It will be 0:00. And "The name of the person in charge of the visit is 〇〇〇〇." Is displayed.

This output screen is created as a Web page and transmitted to the client PC that transmitted the request data via the data communication unit 104 and the network 210. When the client PC receives the output screen,
Display the received output screen on the display. The user of the client PC can check when and who will come by looking at the displayed output screen. After this confirmation, the user presses the OK button, and then presses the reception completion button, so that data for approval can be transmitted to the schedule creation device 100. Further, by pressing the reception clear button, the schedule creation processing can be ended without transmitting the approval data.

FIG. 18 is another diagram showing an example of the output screen. Upon receiving the approval data, the schedule creation device 100 sends the output screen shown in FIG. 18 created as a Web page to the client PC that sent the request data. The client PC that has received the output screen shown in FIG. 18 displays the received output screen on the display, thereby confirming the content of the request made by the client PC, the date and time of the visit, and the person in charge. Here, by pressing the correction button, the data once approved can be deleted and the schedule can be created again.

In the present embodiment, the candidate with the highest evaluation score is selected in step S18. However, a plurality of candidates are selected by assigning priorities in descending order of the total evaluation score. You may. For example, the candidate 51 is selected as the candidate with the highest priority, and the candidate 53 is selected in the next priority. Then, information (visit date and time and name of the person in charge) regarding the candidates 51 and 53 to which the priorities are added is output, and the requester is made to select. In this case, the assignment of the work assignment data to the time table in step S19 is performed after a candidate is selected by the client.

Returning to FIG. 9, if it is determined in step S7 that time has been designated, the flow advances to step S9. Step S
In 9, a candidate that can assign a work point at a designated time is extracted. In this case, it is determined in the time table read in step S5 whether or not the work point can be allocated at the designated time, and if the work point can be allocated, the candidate is extracted. It is determined in step S9 whether or not a candidate has been extracted. If the candidate has been extracted, the process proceeds to step S13; otherwise, the process proceeds to step S11.

At step S11, an empty state table is output. The vacancy status table is a table that displays a time zone during which a visit can be made.

The vacancy table is created as a Web page, and the data communication unit 104 and the network 21
0 to the client PC that transmitted the request data.

FIG. 19 is a diagram showing an example of the vacancy status table. Referring to FIG. 19, the horizontal axis indicates the flow of time, and indicates the time that can be visited by day. For example, 2
On April 1, 001, 10:00 to 12:00 and 1
If it is from 3:00 to 15:00, it is indicated that it is possible to visit.

The availability table is created based on the time table of the person in charge. If at least one of the timetables of the person in charge has a vacancy, it is displayed as a workable time zone in the vacancy table.

When the client PC receives the vacancy status table, it displays it on the display. The requester, who is a user of the client PC, can check the displayed availability table to see when it is possible to visit any time, select his favorite time, and specify the time. Can do it.

In step S12, a new time designation input is accepted. This is performed by transmitting the designated time input screen shown in FIG. 11 to the client PC.

As described above, in the schedule creation device according to the present embodiment, at least one of the plurality of persons is determined based on the model and the symptoms of the failure sent from the requester. , The name of the person in charge and the date and time of the visit are the client
Sent to C. For this reason, the requester can know who will visit and when, and can make preparations in advance. Further, the work assignment data assigned to the time table of the person in charge is assigned according to the ability of the person in charge, so that an efficient work schedule can be automatically created.

As described above, since a person having a higher ability for the basic task defined by the model and the symptom has a higher probability of being assigned to the task, the task that the person is good at is given priority and an efficient schedule is created. be able to.

Further, since the work in the area in which the person in charge is assigned is given priority, the travel time can be reduced as much as possible.

Furthermore, since the work assigned to the person who has visited in the past is given priority, the work can be promptly moved to the requested place, and the work is performed because the requester and the person in charge have an acquaintance. A schedule that can smoothly proceed.

Further, since the work is assigned with priority over the person in charge who has a large number of remaining works, it is possible to create a schedule capable of equally assigning the work to a plurality of persons.

Further, since the work is assigned to the person in charge who moves as short as possible, it is possible to create an efficient schedule which minimizes unnecessary time required for moving.

Furthermore, a person who does not have a technical level capable of dealing with a failure or a person who is not in charge of the requested area is excluded from the work assignment in advance. Processing speed can be increased.

Although the present embodiment has been described with respect to the schedule creation device, the invention may be considered as a method for executing the schedule creation process shown in FIG. 9 or a program for causing a computer to execute the schedule creation process. It goes without saying that you can do it.

The embodiments disclosed this time are to be considered in all respects as illustrative and not restrictive. The scope of the present invention is defined by the terms of the claims, rather than the description above, and is intended to include any modifications within the scope and meaning equivalent to the terms of the claims.

[Brief description of the drawings]

FIG. 1 is a diagram schematically showing a repair reception system according to one embodiment of the present invention.

FIG. 2 is a block diagram illustrating a schematic configuration of a schedule creation device according to the present embodiment.

FIG. 3 is a diagram showing an example of a person in charge master file stored in a schedule creation device according to the present embodiment.

FIG. 4 is a diagram showing an example of a time table file created by the schedule creation device according to the present embodiment.

FIG. 5 is a diagram showing an example of a district master file stored in the schedule creation device according to the present embodiment.

FIG. 6 is a diagram showing an example of a responsible person district distribution master file stored in the schedule creation device according to the present embodiment.

FIG. 7 is a diagram illustrating an example of a basic work point master file stored in the schedule creation device according to the present embodiment.

FIG. 8 is a diagram showing an example of a person-in-charge technical rank file stored in the schedule creation device according to the present embodiment.

FIG. 9 is a flowchart illustrating a flow of a schedule creation process executed by the schedule creation device according to the present embodiment.

FIG. 10 is a diagram illustrating an example of a request data input screen.

FIG. 11 is a diagram showing an example of a designated time input screen.

FIG. 12 is a diagram illustrating an example of a technical rank work point coefficient.

FIG. 13 is a diagram illustrating a calculation example of a work point.

FIG. 14 is a diagram showing candidates that can be assigned to the latest time table.

FIG. 15 is a diagram showing an example of an evaluation point setting master file stored in the schedule creation device according to the present embodiment.

FIG. 16 is a diagram illustrating a calculation example of a total evaluation point.

FIG. 17 is a diagram illustrating an example of an output screen.

FIG. 18 is another diagram showing an example of the output screen.

FIG. 19 is a diagram showing an example of a vacancy status table.

[Explanation of symbols]

Reference Signs List 1 repair reception system, 100 schedule creation device, 101 control unit, 102 input unit, 103 output unit, 104 data communication unit, 105 external storage device, 1
06 recording medium, 110 storage unit, 111 time table file, 112 person in charge master file, 113
District master file, 114 person in charge district distribution master file, 115 basic work point master file,
116 Technical person in charge rank file, 117 work history file, 210 network, 300 request data input screen, 320 designated time input screen, 201A, 20
1B, 201C Client PC, 202A, 202
B Mobile terminal.

Claims (13)

[Claims] 1. A receiving means (S) for receiving an input of request information.
1), a time table storage means (111) for storing, for each of a plurality of persons, a time table in which work assignment data is allocated in chronological order, based on the stored time table and the received request information, Determining means (S18) for determining at least one person in charge among a plurality of persons in charge.
Schedule creation device. 2. The apparatus further comprises ability data storage means (116) for storing ability data for determining the ability of each of a plurality of persons in charge, wherein said determining means determines a plurality of persons based on the stored person's ability data. The schedule creation device according to claim 1, wherein at least one contact person is determined from the contact persons. 3. The deciding means (S18) decides with higher probability as the person in charge with the stored ability data is higher.
The schedule creation device according to claim 2. 4. A responsible district storage means (1) for storing a district mainly in charge of the plurality of persons in charge and a district supplementarily in charge of the plurality of persons in charge.
14), and the determining means (S18) further comprises: a person in charge of the person in charge of the area in charge including the position specified by the position information included in the received request information. The schedule creation device according to claim 1, wherein the schedule creation device also determines with high probability. 5. A work history information storage means (11) for storing work performed by the plurality of persons in the past as work history information.
7), wherein the determining means (S18) checks the position information included in the received request information with the stored work history information, and has a task having work history information matching the position information. 2. The schedule creation device according to claim 1, wherein the scheduler determines the schedule with higher probability. 6. The schedule creation device according to claim 1, wherein the determining means (S18) determines with higher probability the person who is not assigned work assignment data in the time table. 7. The determining means (S18) determines that the position specified by the position information included in the received request information is the position included in the work allocation data allocated before the time slot to be allocated. The schedule creation device according to claim 1, wherein a person in charge closer to the position specified by the information is determined with a higher probability. 8. A capability data storage means (116) for storing capability data for determining a capability for each of a plurality of persons in charge, wherein said determination means gives a higher evaluation score to a person having the higher stored skill data. Ability evaluation point setting means (S1
3), assignment evaluation point setting means (S16) for setting a higher evaluation point for a person to whom work assignment data is not assigned in the time table, and specified by position information included in the received request information. A distance evaluation point setting means (S17) for setting a higher evaluation point for a person whose position is closer to the position specified by the position information included in the work allocation data allocated before the time slot to be allocated. 2. The at least one person in charge among a plurality of persons in charge is determined based on the evaluation points set by the ability evaluation point setting means, the allocation evaluation point setting means, and the distance evaluation point setting means. 2. The schedule creation device according to 1. 9. The method according to claim 1, wherein said determining means includes time selecting means for selecting a person to whom no work assignment data is assigned at a designated time included in said received request information. A schedule creation device as described. 10. The deciding means collates a work level specified by the failure information included in the request information with the stored capability data of the person in charge, and assigns a person who can work to the plurality of persons in charge. Ability selection means (S
The schedule creation device according to any one of claims 1 to 9, further comprising (4). 11. A step (S1) of receiving input of request information, and a time table (111) in which work allocation data is allocated in a time series and the received request information,
Deciding at least one person in charge among a plurality of persons in charge (S18). 12. A step (S1) of receiving input of request information, and a time table (111) in which work allocation data is allocated in a time series and the received request information,
Deciding at least one person in charge among a plurality of persons in charge (S18).
Schedule creation program. 13. A computer-readable recording medium on which the schedule creation program according to claim 12 is recorded.