JP2000029945A - Schedule management system, method therefor and recording medium recorded with control program therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a schedule management system capable of allowing a user to grasp at a glance where the user himself should go and which work the user himself should execute at present. SOLUTION: A destination reason generating means 21 generates a reason why a user should move to a destination calculated by a destination deciding means 22. The destination deciding means 22 calculates a work to be given the highest priority from among works to be executed by the user today based on the judged result of a workability judging means 24, and calculates when and where the user should move. The workability judging means 24 judges whether or not each work of the user can be executed as scheduled by using position information from a portable terminal position obtaining means 11, schedule data managed by a schedule managing means 23, the content of a terminal workable knowledge 26, the content of a moving time knowledge 25, and the present time. An in-time to spare execution work retrieving means 27 makes a plan for the execution of a work to be executed today without interrupting the execution of the work given the highest priority.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a schedule management system, a schedule management method therefor, and a recording medium on which a control program is recorded. More particularly, the present invention relates to a portable terminal system which can be freely carried by a user and a user who works in an office. The present invention relates to a management method for managing schedule information using a system in which office computers are connected to each other via a wireless network.

[0002]

2. Description of the Related Art At present, portable terminal systems are widely used because they can be easily carried by users, and many businessmen manage their own schedules on the portable terminal systems.

[0003] When these schedule management systems,
Register your schedule, such as where and what to do, in chronological order, and check your registered schedule at a later date, or receive an alarm from the system that the scheduled time has come, so that you can take action on your own This is a system for reference when planning.

In recent years, portable terminal systems capable of acquiring position information of users have begun to be commercialized, and a schedule management system has been proposed which takes into account travel time between scheduled execution locations using this information.

[0005] For example, as the above system,
Japanese Patent Application Laid-Open No. Hei 5-134498 (hereinafter referred to as Reference 1)
And a technology disclosed in Japanese Patent Application Laid-Open No. 7-209451 (hereinafter referred to as Document 2).

[0006] In Document 1, the time required for movement is calculated by referring to the map database from the current position of the user acquired by the portable terminal system and the position where the next work registered in the schedule database is executed. , If you estimate that you won't be on time for the next job,
A system for automatically changing the start time of the next task is disclosed.

Document 2 discloses a system capable of calculating the time required for a user's movement in the same manner as the technique described in Document 1, and sounding an alarm to the user at a timing in consideration of the movement time at these two points. Is disclosed. For example, if a user is in a place where it takes time to move, an alarm is sounded early.

[0008]

In general, when a user goes out, he or she does not merely act on the work registered in the schedule database in chronological order. If the meeting at the meeting was prolonged and it was too late for the next meeting, I did another job without attending the next meeting, and when I returned to my office, there was no work that I needed to do today, but unread Because many e-mails are stored, he often makes his own action plan in consideration of various factors such as returning to the office.

In the above-described conventional schedule management system, since the schedule management system assists in reliably executing the schedule registered in the schedule database, as described above, what kind of action should be taken next In order to plan whether or not it is necessary, operations such as confirming the work in chronological order on the calendar, sorting and displaying the work in order of priority, and receiving an e-mail if necessary are necessary.

[0010] Therefore, in the conventional schedule management system, when used for making an action plan, it merely provides indirect information to the user, and it is the user who collects and organizes the indirect information. This imposes a heavy burden on the user.

In addition, when the portable terminal system is used on the go, only a very simple operation is allowed, so that the operation of switching some screens as in the above example is complicated and cannot be used easily.

Further, in the conventional schedule management system, there is a problem that a place where a certain task is executed is fixed. For example, tasks such as creating a simple report can be performed anywhere with a notebook-type personal computer. However, in the above schedule management system, the place to be executed is input in advance, and an alarm is taken in consideration of the time to move there. Etc. are sounded.

[0013] This is thought to be due to the fact that with the spread of working styles such as telecommuting, the main work is often performed in a plurality of places such as offices and homes. The problem is that the execution place is fixed.

Accordingly, an object of the present invention is to solve the above-mentioned problems, and to provide a schedule management system and a schedule management system capable of grasping at a glance where the user himself should go and what kind of work should be performed at present. An object of the present invention is to provide a management method and a recording medium on which a control program is recorded.

Another object of the present invention is to calculate a place where a job can be executed from the current position of the user or the type of terminal being carried without specifying the place to execute the work. The present invention provides a schedule management system that can be presented to a user, a schedule management method therefor, and a recording medium recording a control program therefor.

[0016]

A schedule management system according to the present invention includes a portable portable terminal system, and an office computer that communicates with the portable terminal system via a wireless network. A schedule management system for managing schedule information of an owner of the mobile terminal system in a computer, wherein the mobile terminal system includes:
A portable terminal input / output unit that displays the schedule information and inputs a request to the office computer, and a portable terminal position acquisition unit that acquires current position information of the portable terminal system;
Schedule management means for managing the schedule information; terminal workable knowledge for accumulating workable information indicating a processing device capable of processing the work for each type of work constituting the schedule information; The travel time knowledge accumulating a preset travel time between the set points, the portable terminal system position information acquired from the portable terminal position acquisition means via the wireless network, and the schedule management means are managed by the schedule management means. Work possibility determining means for determining whether or not each of the tasks can be executed as scheduled based on the schedule information, the contents of the terminal work possible knowledge, the contents of the travel time knowledge, and the current time; A place where a work plan to be executed after the current time is generated based on the determination result of the gender determination means, and which should be moved based on the plan It includes a destination determining means for calculating the destination indicating, and a destination reason generation unit that generates a selection reason indicating the reason should be moved to the destination calculated by the destination determining unit.

In another schedule management system according to the present invention, in addition to the above-described configuration, alternative office knowledge for accumulating information indicating a place where the work can be processed and an alternative place for each type of work is stored in the office computer. The destination determining means is configured to make an execution plan with a short travel time based on the alternative place knowledge.

A schedule management method according to the present invention includes a portable portable terminal system and an office computer communicating with the portable terminal system via a wireless network, wherein the office computer communicates with the portable terminal system. A schedule management method of a schedule management system that manages schedule information of an owner of the mobile terminal system, wherein the mobile terminal system displays the schedule information and inputs a request to the office computer; Acquiring the position information of the terminal computer. The office computer stores, in the office computer, workable information indicating a processing device capable of processing the work for each type of work constituting the schedule information. The contents and the processing equipment Whether or not each of the tasks can be executed as scheduled based on the content of travel time knowledge that accumulates a preset travel time between the set points, the position information acquired from the portable terminal system, the schedule information, and the current time. Determining whether the work is to be executed after the current time based on the determination result, and calculating a destination indicating a point to be moved based on the plan; and calculating the calculation. Generating a selection reason indicating a reason for moving to the specified destination.

In another schedule management method according to the present invention, in addition to the above-mentioned steps, for each type of work, information indicating a place at which the work can be processed and information indicating a substitute place are stored based on the contents of alternative place knowledge. And making an execution plan with a short travel time.

A recording medium storing a schedule management control program according to the present invention is a schedule management system including a portable portable terminal system and an office computer communicating with the portable terminal system via a wireless network. A recording medium recording a schedule management control program for causing the office computer to manage schedule information of an owner of the portable terminal system, wherein the schedule management control program displays the schedule information on the portable terminal system. And inputting a request to the office computer to obtain the current location information of the portable terminal system, and the schedule management control program causes the office computer to Stores workable information indicating a processing device capable of processing the work for each type of work to be configured. Stores the contents of a terminal workable knowledge and a preset travel time between points where the processing device is disposed. It is determined whether or not each of the tasks can be executed as scheduled from the content of the traveling time knowledge to be performed, the position information acquired from the portable terminal system, the schedule information, and the current time, and based on the determination result, And a destination indicating a point to be moved is calculated based on the plan, and a selection reason indicating a reason for moving to the calculated destination is generated.

According to another aspect of the present invention, there is provided a recording medium recording another schedule management control program, wherein the schedule management control program causes the office computer to store information indicating a place where the work can be processed and an alternative place for each type of the work. An execution plan with a short travel time is created based on the contents of the accumulated alternative location knowledge.

That is, the first schedule management system of the present invention comprises a portable terminal system that can be freely carried by a user, an office computer in which the user works in an office, and a wireless communication between the portable terminal system and the office computer. And a wireless network that communicates with each other.

The portable terminal system comprises portable terminal input / output means for displaying schedule information to the user or inputting a command to the system by the user, and portable terminal position acquiring means for acquiring current position information.

The office computer has a schedule management means for managing a user's personal schedule, and categorizes each job into several types, and uses which computer for each type of job to execute the user. Terminal work knowledge that indicates whether or not it is possible to do so, travel time knowledge that calculates the travel time of two locations, location information of the mobile terminal system transmitted from the mobile terminal location acquisition means via a wireless network, and schedule management Work possibility determination using the schedule data managed by the means, the terminal work possible knowledge, the travel time knowledge, and the current time to determine whether each job of the user registered in the schedule management means can be executed as scheduled. Means and the highest priority among the tasks that the user should perform today based on the judgment result of the work possibility judgment means. Destination determining means for calculating the work to be performed and when and where to move the user, and performing the work to be done today without hindering the execution of the highest priority work calculated by the destination determining means And a destination reason generating means for generating a reason why the user needs to move to the destination calculated by the destination determining means.

By configuring the portable terminal system and the office computer as described above, the user can easily make an action plan simply by looking at the display without performing a complicated operation.

Further, the second schedule management system of the present invention adds, to the first schedule management system, alternative place knowledge indicating what kind of work the user can perform for each place. This makes it possible to dynamically determine the execution place of the work. for that reason,
This makes it possible for the destination determination means to make an execution plan with as few movements as possible.

Further, the third schedule management system according to the present invention requires the second schedule management system to periodically monitor a directory of a predetermined file system (hereinafter, referred to as a sentence spool) and determine whether it is necessary to do so. For example, by adding a means of automatically registering a new job "processing text in the text spool" to the schedule database managed by the schedule management means, it is possible to create an action plan that takes into account factors other than the schedule. It becomes possible.

More specifically, the schedule management system of the present invention dynamically calculates a place where each job is executed,
Work feasibility determining means for evaluating the feasibility of each work in consideration of the travel time there and the priority of the work, and the feasibility of each work calculated by the work feasibility determination means. Destination determining means for planning where the user should move next.

Thus, it is possible to easily make an action plan by looking at the destination advice displayed by the schedule management system without performing complicated operation by the user himself.

Further, the work possibility determination means has a function of calculating a spare time until the user starts moving, and by using this function, it is possible to determine when the user should start moving. It is possible to give advice.

As described above, if the user has a margin of time until the next schedule, the user uses the time to make a decision such as performing a sudden job that is not registered in the schedule management system. Is also possible.

Further, the schedule management system according to the present invention calculates, in addition to the advice of the destination, the highest priority work, the work to be executed today, and the work to be canceled at the same time, and based on these, the destination of the destination presented to the user. A destination reason generating means for explaining the reason for the advice to the user is provided, and it is also possible to make an action plan in accordance with the advice if the user is satisfied with the reason for the destination advice, and to take another action if the user is not satisfied with the reason.

Furthermore, in the schedule management system according to the present invention, an alternative place knowledge that organizes the knowledge of what kind of work the user can execute for each place, and a terminal that organizes each computer used by the user Workability knowledge is provided, and workability determination means dynamically determines the execution place using these, so that for work where the place is not determined until immediately before execution, advise the destination as well as other work Becomes possible.

On the other hand, the schedule management system according to the present invention includes status monitoring means for monitoring the status of the main computer in the user's office and automatically generating a new job if necessary. It is also possible to make an action plan that takes into account other factors. For example, the situation monitoring means monitors the user's new e-mail and automatically generates a job of processing the e-mail, thereby advising the user of an action plan in consideration of the e-mail reception situation. It is also possible.

[0035]

Next, an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a schedule management system according to one embodiment of the present invention. In the figure, a schedule management system according to one embodiment of the present invention includes a portable terminal system 1 that a user can freely carry, an office computer 2 for a user to work in an office, a portable terminal system 1 and an office computer 2. And a wireless network 3 that enables them to communicate with each other using wireless.

The portable terminal system 1 includes a control memory 10 for storing programs to be executed by the respective units, a portable terminal position acquiring means 11 for acquiring current position information, and displaying schedule information to a user, And a portable terminal input / output means 12 for inputting a command to the system.

The office computer 2 has a control memory 20
Destination reason generating means 21 and destination determining means 22
Schedule management means 23, workability determination means 24, travel time knowledge 25, and terminal workability knowledge 26
And a work-in-progress search means 27 within the extra time.

The control memory 20 stores the office computer 2
Each section stores a program to be executed. still,
As the control memories 10 and 20, a ROM (Read Only Memory), a floppy disk, or the like can be used.

The destination reason generating means 21 generates the reason why the user needs to move to the destination calculated by the destination determining means 22. The destination determining means 22 calculates the job to be executed with the highest priority from the tasks to be executed by the user based on the judgment result of the work possibility judging means 24, and determines when and where the user should move. calculate. The schedule management means 23 manages a user's personal schedule.

The work possibility determination means 24 is the position information of the portable terminal system 1 transmitted from the portable terminal position acquisition means 11 via the wireless network 3, the schedule data managed by the schedule management means 23, and the contents of the terminal work possible knowledge 26. It is determined whether or not each job of the user registered in the schedule management unit 23 can be executed as scheduled using the content of the travel time knowledge 25 and the current time.

The travel time knowledge 25 accumulates information for calculating the travel time at two locations. The terminal work possible knowledge 26 classifies each work into several types and stores information for indicating which computer can be used by the user for each type of work. The work-to-be-executed within spare time search means 27 does not hinder the execution of the highest priority work calculated by the destination determination means 22
Make an action plan for what you need to do today.

In the above-mentioned schedule management system, each user performs his / her main work such as creating materials, using e-mail, and managing schedules in his / her office. It is assumed that at least one portable terminal system 1 that performs a part of the main work such as checking the schedule by connecting to the computer 2 on the go is used. However, it is assumed that each user can use only one portable terminal system 1 at a time.

Here, each of the office computer 2 and the portable terminal system 1 has an ID for identifying each device.
It is assumed that (identification information) (hereinafter, referred to as a machine ID) is allocated. In the embodiment of the present invention, the machine ID is described as "office computer" or "machine A" for the sake of simplicity of description, but may be realized by numbering with an integer.

The wireless network 3 is a PHS (Personal)
PIAFS (PHS I), which is a digital network using nal Handyphone System
internet Access Forum Stan
Dard) or the like may be used. At this time, if a commercially available network card or the like is used for the office computer 2 and the portable terminal system 1, the PIAFS can be easily used.

As the portable terminal position acquisition means 11 of the portable terminal system 1, for example, GPS (Global Pos)
A device that can acquire latitude, longitude, and altitude using an artificial satellite such as an ionizing system, a PHS that can estimate an approximate position from the position of an antenna performing communication, or the like may be used.

As the portable terminal input / output means 12, a GUI (Gr.) Used for a personal computer or the like is used.
An input / output unit using an apical user interface, an input / output unit that operates by voice or dial, such as a PHS, or the like may be used. The present embodiment will be described on the assumption that the user goes out with the portable terminal system 1 based on the GUI.

FIG. 2 is a diagram showing a display example of the portable terminal input / output means 12 of FIG. In the figure, a portable terminal input / output means 12 displays a destination advice display section 121 for displaying when and where the user should move, and why the user should go to the destination displayed on the destination advice display section 121. The advice reason display unit 122 displays information for explaining the reason to the user, and a destination advice button 123 which is a button for the user to input a request for new advice to the schedule management system. ing.

The destination advice display section 121 includes an area 1211 for displaying a destination and an area 1222 for displaying when to move to the destination. FIG.
In the case of the display example shown in (1), it is indicated that the user should go to "Sales Office A" in an "urgent" manner.

In this embodiment, for simplicity of explanation,
The location is described as “sales office A” or “office”. In addition, the user's own office location is simply referred to as "office".
Will be described as follows.

The advice reason display section 122 is an area in which the reason for giving the destination advice can be displayed in several lines of text. One line is provided for each reason. Is displayed. Each reason is an area 1221 for displaying a job name, an area 1222 for displaying when the task was to be executed, an area 1223 for displaying a position at which the task is to be executed, and what the user does with the job. An area 1224 indicating whether or not it is necessary
And an area 1225 indicated by a mark “★” indicating that the job to be executed has the highest priority.

In the case of the display example shown in FIG. 2, there are four reasons to go to "business office A""urgently", the first reason is to perform "inventory check E", and the second reason. Is to participate in “Conference C” with the highest priority, the third reason is to cancel “Conference A”, and the fourth reason is to cancel “Conference B”.

Here, the jobs canceled as in the third reason and the fourth reason do not meet the start time even if they move from the current time to the execution place of these jobs, or because they have executed these jobs. It is determined that it is better not to execute the job because it is not in time for the start time of the job that should be given the highest priority.

As described above, the display contents of the destination advice display section 121 and the advice reason display section 122 are generated by the office computer 2 when the user presses the destination advice button 123, and are generated via the wireless network 3. Are sent to the portable terminal input / output means 12 and displayed on the respective display areas. The operation of the office computer 2 will be described by sequentially describing the method of generating these display contents.

FIG. 3 is a flowchart showing a destination advice display process according to an embodiment of the present invention. FIG. 3 shows a flow from when the user presses the destination advice button 123 to when the advice is displayed on the mobile terminal input / output unit 12.

FIG. 4 is a diagram showing a configuration example of a schedule database managed by the schedule management means 23 of FIG. In the figure, one line indicates one job, and the first column indicates a job name (“meeting A”, “meeting B”, “meeting C”, “meeting D”, “stock check E”) which means the name of the job. , "Report F", "Conference G", etc.).

The second column is an item of the execution date and time indicating the execution date and time of a work (hereinafter, referred to as an appointment) whose execution date and time is determined, such as a meeting or a meeting with a person. End time "format.

The third column shows the deadline date and time to complete the work (hereinafter referred to as ToDo work) which may be executed at any time if the work is completed by the deadline date and time for creating a report and the like. , Which is described in the format of "AD / month / day deadline time (time spent until completion)".

The job is appointment or ToDo
Work is either categorized. In the case of an appointment, the execution date has a value, but the deadline has no value. Conversely, in the case of the ToDo work, the deadline date has a value, but the execution date has no value. However, in FIG. 4, items having no value are left blank.

The fourth column shows the priority of the work as "A", "B",
This is the item represented by “C”. Here, the priority "A" is the most important work, the priority "B" is the second most important work after the priority "A", and the priority "C" means that it is not so important. There is no need to use this notation; for example, numbers from “1” to “5” may be used.

The fifth column is an item indicating the position at which the work is executed. However, the work described as “*” in FIG. 4 means that the work can be executed anywhere regardless of the position.

The sixth column is an item for the user to classify the work contents into a plurality of types in advance (hereinafter referred to as "work types") and to specify which work type the work belongs to. In the example of FIG. 4, each job is “word processor”, “meeting”, “stock check”, and “OHP (Over Head)
d Projector).

FIG. 5 is a diagram showing an example of calculating today's remaining work by the schedule management means 23 of FIG. In the figure, the schedule management means 23 searches the above schedule database and retrieves "98/05/11 13: 0".
0 ”The remaining work for today is“ Conference A ”,“ Conference B ”,“ Conference C ”,“ Conference D ”,“ Stock Check E ”,
From "Report F" and "Conference G", six cases of "Conference A", "Conference B", "Conference C", "Conference D", "Stock Check E", and "Report F" were searched. It is shown that.

The display processing of the destination advice according to one embodiment of the present invention will be described with reference to FIGS. When the user presses the destination advice button 123 of the portable terminal input / output unit 12, the portable terminal input / output unit 12
Obtains the current position from the portable terminal position obtaining means 11 (FIG. 3).
Step S001).

Thereafter, the portable terminal input / output means 12 includes the current date and time, the position information obtained in step S001, and the machine ID of the portable terminal system 1 in the request message for requesting destination advice, and The data is transmitted to the work possibility determination means 24 via the network 3 (step S002 in FIG. 3). This request message is, for example, “9
At 13:00 on May 11, 2008, we use Machine A at the location of Sales Office A, but please advise where to go next. ".

In the present embodiment, a natural language is used for intuitively understanding the meaning of the description of a message passing through the wireless network 3. However, in practice, it is easier to use a formal language for mounting. It is.

When the work possibility determination means 24 receives the request message from the portable terminal input / output means 12, it first sends to the schedule management means 23 the work to be executed by the user from now on (hereinafter referred to as the remaining work today). A search is requested (step S003 in FIG. 3).

From the schedule database, the schedule management means 23 determines, as the remaining work today, the work whose execution date and time is today and that will be performed in the future from the current time (condition 1), and the deadline date and time is n days ahead of the current time. Jobs that match any of the two conditions up to (condition 2) are searched. In this case, the condition 1 means an appointment to be held today, and the condition 2 means a ToDo work to be completed n days from today. Here, n is an integer of 0 or more, and intuitively means how many days before the user starts the ToDo operation. In the present embodiment, an example will be described in which n = 1, that is, work is started from one day before, but this value is a value that can be freely set by the user.

The current date and time are set to “98/05/11 13:
00, and when the remaining jobs are searched today from the schedule database in FIG. 4, the search result is as shown in FIG.
"Conference A", "Conference B", "Conference C", "Conference D",
There are six jobs, "Inventory Check E" and "Report F".

The schedule management means 23 sends the work remaining today retrieved by the above method to the work possibility determination means 24.
If no remaining work is found today as a result of the search by the schedule management means 23, the result “No corresponding work” is sent to the work possibility determination means 24.

If there is at least one work remaining today sent from the schedule management means 23 (step S004 in FIG. 3), the work possibility determination means 24 checks each of the work remaining today sent from the schedule management means 23. The feasibility is calculated (step S005 in FIG. 3).

Here, the calculation of the feasibility means, for a certain work, the execution position of the work, the moving time to the execution position,
Considering the machine you are using, you need to calculate how much time you have before you get to the job, or if you can't make it anymore.

More specifically, the function for calculating feasibility (hereinafter referred to as feasibility evaluation function) is a feasibility evaluation function [(machine ID), (work), (position), (time)].
→ [(Destination candidate), (Destination use machine ID),
(Destination travel time), (execution start margin time)]. However, the function is the function name [(input argument)]
→ Described in the form of (calculation result), the input argument (machine ID) indicates the machine ID of the machine used by the user at (time) at (time), and (work) Are described in the schedule database items [(job name), (execution date and time), (deadline date and time), (priority), (position), (work type)] shown in FIG.

(Destination candidate) means a position where (job) of the input argument is to be executed, (Destination use machine ID) means a machine ID of a machine used in (Destination candidate), and (Destination travel time) Means the time it takes for the user to move from the (position) of the input argument to (destination candidate), and (time to start execution) means the time from the (time) of the input argument until the user starts moving. are doing.

In some cases, the input argument (position) is the same as the output (destination candidate). In this case, it means that there is no need to move, and (destination movement time) is “0”. If the value of the output (execution start margin time) is negative, it means that the output cannot be completed in time.

The work possibility determination means 24 executes the feasibility evaluation function [(the work to be evaluated today of remaining work)] for each of the remaining work sent from the schedule management means 23 (the portable terminal input / output in step S002). (Current position sent from the means 12), (current time)].

Upon receiving the feasibility table from the workability determination means 24, the destination determination means 22 determines a recommended destination from the feasibility table (FIG. 3).
Step S006).

When a destination to be recommended is found (step S007 in FIG. 3), the destination determining means 22 sends (highest priority work) and (recommended work list) to the destination reason generating means 21 (step S008 in FIG. 3). Destination reason generating means 2
1 receives the (highest priority work), the (recommended work list), and the executable table from the destination determining means 22, creates a destination reason table, and uses the destination reason table as a response to the destination advice. 12 (step S009 in FIG. 3).

When the portable terminal input / output means 12 receives the destination reason table from the destination reason generating means 21, it creates and displays the screen (destination advice screen) shown in FIG. 2 based on the table (step S012 in FIG. 3). ).

On the other hand, if there is no work remaining today sent from the schedule management means 23, that is, if there is no applicable work, the work possibility determination means 24 returns (step S009 in FIG. 3). Then, in order to inform the destination determining means 22 that there is no remaining work today, "No corresponding job" is sent to the destination determining means 22 (step S010 in FIG. 3).

When the destination determining means 22 receives “No corresponding job”, or when a recommended destination is not found, that is, when the value of (highest priority job) is “No corresponding job” (FIG. 3, step S007) ), "No advice" is sent to the mobile terminal input / output means 12 as the answer of the destination advice (step S011 in FIG. 3). That is, in the above case, the schedule management system cannot advise the user where to go next.

When the portable terminal input / output means 12 receives "no advice" from the destination determination means 22, it creates and displays the screen shown in FIG. 2 (the screen for destination advice) based on this (step S012 in FIG. 3). ).

FIG. 6 is a flowchart showing the operation of judging the feasibility of each task by the work possibility judging means 24 of FIG. 1. FIG. 7 is a diagram showing a configuration example of the terminal work possible knowledge 26 of FIG. 8 is a diagram showing a configuration example of the travel time knowledge 25 of FIG. 1, and FIG. 9 is a diagram showing the work possibility determination means 24 of FIG.
FIG. 4 is a diagram showing a configuration example of an executable table generated by the process shown in FIG.

The operation of determining the feasibility of each task by the work possibility determining means 24 will be described with reference to FIGS. Hereinafter, a method of calculating the feasibility evaluation function [“machine W”, “work X”, “position Y”, “time Z”] will be described.

First, the work possibility judging means 24 determines the items to be output (destination candidates),
D), (destination travel time), and (execution start margin time) are respectively set to “position Y”, “machine W”, “0”, “0: 0”.
0 ”.

Next, the work possibility determination means 24 compares the (position) value of “position Y” with the “position” of “work X” (step S101 in FIG. 6), and if they are equal, sets the value of (destination candidate) to “position Y”. , And if different, the value of (destination candidate) is set to (position) of “work X”. However, if the value of (position) of “work X” is “*”, it means that “work X” can be executed anywhere, and the above comparison is always treated as equal. Therefore, in this case, the value of (destination candidate) is set to “position Y”.

If the value of (position) of “position Y” is different from the value of (position) of “work X”, if the value of (destination candidate) is “office”, The value is set to the machine ID of the office computer 2, and the value of the other (destination use machine ID) is set to “machine W” (step S102 in FIG. 6).

If the value of (position) of “position Y” is equal to the value of “position” of “work X”, the work possibility determining means 24 can execute the “work X” using the (machine ID). It is determined using the terminal work possible knowledge 26 (step S103 in FIG. 6).

The work possibility determining means 24 determines in step S10
When the value of (destination use machine ID) is set in 2,
In the same manner as in step S103, it is determined using the terminal workable knowledge 26 whether or not “computer X” can be executed by the computer indicated by (destination use machine ID) (step S104 in FIG. 6).

However, in step S102 (destination candidate)
Is changed to “office”, the (destination use machine ID) is the machine ID of the office computer 2
Note that it has been changed to For example, when the user uses “machine A” at “sales office A”, the possibility of executing “meeting A” on the first line in FIG. "Sales office A", "Conference A"
(Position) is "office", and the process proceeds to step S102 because the value is different.

Next, in step S102 (destination candidate)
Is changed to "office", and (the destination machine ID) is changed to "office computer" with this change. Finally, in step S104, since the work type of "Conference A" is "Conference" and the value of the item of the conference in the record of "Office Computer" shown in FIG. Becomes "executable".

The work possibility determining means 24 determines in step S10
3 or if it is determined that execution is not possible in step S104, the value of (destination candidate) is set to "office" and the destination use machine ID is set to "office computer" (FIG. 6).
Step S105).

In other words, if the “work X” cannot be executed even if the “argument” is moved to the “position Y” of the input argument or the “position” of the “work X” of the input argument, all the types of the office computer can be used. In such a situation, the user would return to the office and perform work.

That is, the value of (destination candidate) is “office” and the destination machine ID is “office computer”. The execution position of "Work X" is "Office"
In this case, the value of the destination candidate may already be "office" in step S102. In this case, nothing is performed in step S105.

The work possibility determination means 24 determines in step S10
When it is determined that the job can be executed in step 3, it is not necessary to move to execute “work X”, and the value of the destination movement time is set to “0” time (step S10 in FIG. 3).
6).

The work possibility determining means 24 determines in step S10
Assuming that the destination use machine ID is “office computer” in 5, the time required to move from “position Y” to the office is calculated using the travel time knowledge 25, and the calculated time is substituted for (destination travel time) ( FIG. 6 step S
107).

The work possibility determining means 24 determines in step S10
When it is determined that the execution is possible in step 4, the time required to move from “position Y” to the (destination candidate) is calculated using the movement time knowledge 25, and the calculated time is substituted for (destination movement time) (FIG. 6 steps S108).

The work possibility determining means 24 sets the start time of (work date and time) as the start time of (work X) when the (work date) has a value in (execution date and time), that is, in the case of an appointment. Also, the work possibility determining means 24 sets the (work deadline) to “work X” when the (work deadline) has a value for (work deadline), that is, in the case of a ToDo work.
Start time.

If “work X” is an appointment, the work possibility determination means 24 determines that (execution allowance time) = (start time of “work X”) −
The execution start margin time is calculated using the formula of “time Z” − (destination travel time).

If the “work X” is a ToDo work, the work possibility determining means 24 determines that (time to start execution) = (deadline date of “work X”)
The execution start margin time is calculated using the following formula: (time required until completion of the deadline date and time of “work X”) − “time Z” − (destination movement time) (FIG. 6)
Step S109).

The work possibility determination means 24 performs the above-described steps for all of the remaining work today, and stores the result as a workability table shown in FIG.
Send to

The first item of the terminal workable knowledge 26 shown in FIG. 7 is the machine ID of the office computer 2 or the portable terminal system 1, and the second and subsequent items are the work type. The terminal work possible knowledge 26 indicates whether or not the user can execute the work belonging to the work type of the second item or later using the device of the first item.

In the example shown in FIG. 7, “○” indicates that execution is possible, and “×” indicates that execution is not possible. For example, in "Machine A", "OH
"P" is not feasible, but "word processor", "meeting",
This indicates that operations relating to “mail”, “schedule”, and “stock check” can be executed.

It is assumed that the office computer can execute all kinds of work. Therefore, as in the first record shown in FIG. 7, in the record of the office computer, all values are “「 ”.

The work possibility determining means 24 first determines the value of (destination use machine ID) in order to determine whether or not "work X" can be executed using the computer indicated by (destination use machine ID). The terminal workable knowledge 26 is searched using the key as a key.

In the retrieved record, the work possibility determination means 24 is executable if the value of the item that matches the value of (work type) of “work X” is “「 ”,
If it is "x", it is determined that execution is not possible.

For example, a method of determining the feasibility of the “report F” on the sixth line shown in FIG. 5 when the user uses “machine A” will be described. As shown in FIG. 5, “Report F” is a work type “OHP”, and the value of the item “OHP” in the record whose machine ID is “Machine A” shown in FIG. Therefore, it is determined that “Report F” is “executable” for “Machine A”.

The position is described in the first row and the first column of the travel time knowledge 25 shown in FIG. 8, and the number at the intersection indicates the time required to move between the two points of the row and the column in minutes. Is shown. In the case of the example shown in FIG. 8, "office" and "sales office A"
Means 20 minutes.

In the feasibility table shown in FIG. 9, the work possibility determination means 24 obtains the items shown in FIG. 5 by the operation shown in FIG.
D), (Destination travel time), and (Execution start margin time). Note that in the feasibility table, (execution start margin time) is described in a format of “± day: hour: minute”.

Further, the values shown in FIG.
A user like the example shown in "13/98/98 13:
This is an example in which the case where the user is in “sales office A” with “machine A” at “00” is calculated. That is, for each of the remaining work shown in FIG. 5, the feasibility evaluation function [“Machine A”, (the remaining work today) in FIG. 5, “Sales office A”, “98
/ 05/11 13:00 ”].
Note that these values are calculated using the contents shown in FIG. 7 as the terminal work possible knowledge 26 and the contents shown in FIG.

For example, the work of the first record shown in FIG. 5 proceeds in the order of step S101 → step S102 → step S104 → step S108 → step S109 in FIG.

In this case, in step S102, (destination candidate) = “office” and (destination use machine ID) =
"Office computer". Step S1
08, (destination travel time) = “20 minutes”, and in step S109, execution start margin time = (98/05/11 13:00) − (98/05/11 13:00) − (00:20) = “− 00:20”.

FIG. 10 is a flowchart showing a destination calculation process by the destination determining means 22 of FIG.
FIG. 4 is a diagram showing an example of destination candidates calculated by the destination determining means 22 of FIG. 1. FIG. 10 shows an operation in which the destination determining means 22 calculates a recommended destination from the feasibility table. However, in the processing operation shown in FIG. 10, (recommended work list), (recommended work candidate list), and (highest priority work) are used as variables.

The (recommended job list) is a list of jobs to be preferentially executed among the jobs listed in the feasibility table. However, the work items are the same as the items in the feasibility table. In other words, each job is [(job name),
(Execution date / time), (deadline date / time), (priority), (position), (work type), (destination candidate), (destination use machine ID), (destination movement time), (execution start margin time)] Describe.

The (recommended job candidate list) is a list for temporarily storing jobs as candidates for the (recommended job list). However, the work items are the same as the items in the feasibility table.

(Highest priority work) is the work to be given the highest priority. In the middle of the processing operation shown in FIG. 10, a plurality of tasks are included in the element, but finally, only one task is included in the element. However, the work items are the same as the items in the feasibility table.

The destination determining means 22 includes, in the feasibility table sent from the work feasibility determining means 24, an appointment (condition 1) in which the value of (execution margin time) is positive and (execution margin time). ToDo work in which the value of is positive and the value of (deadline date) is today (condition 2)
Are set in the (recommended job candidate list) (step S201 in FIG. 10).
In the case of the example shown in FIG. 9, four items other than “Conference A” in the first column are the values of the (recommended job candidate list) (see FIG. 11).

When the number of elements (the number of jobs in the recommended job candidate list) is 0 (step S20 in FIG. 10)
2) The processing operation is terminated with the values of (highest priority work) and (recommended work list) set to "no corresponding work".

The destination determining means 22 determines that the number of elements in the (recommended work candidate list) is larger than 0 (the number of elements is 5 in the example shown in FIG. 9) (step S20 in FIG. 10).
2), the job with the highest (priority) among the jobs in the recommended job candidate list is set to (the highest priority job) (FIG. 10)
Step S203).

However, the magnitude relation of (priority) is “A”>
It is assumed that “B”> “C”. In the case of the example shown in FIG. 11, since “conference C” is the highest at (priority) = “A”, “conference C”
To (highest priority job).

When the number of elements of (highest priority work) is two or more, that is, when there are a plurality of highest priority jobs (step S204 in FIG. 10), the destination determining means 22 determines (highest priority work).
Among the jobs, the job with the shortest execution start time is set as the (highest priority job) (step S205 in FIG. 10).

Further, the destination determining means 22 determines that the work having the shortest execution start time is (highest priority work) when the number of elements of (highest priority work) is 2 or more, that is, when there are a plurality of highest priority jobs. (Step S206 in FIG. 10),
Among the jobs of (highest priority job), the job with the shortest moving time is set as (highest priority job) (step S20 in FIG. 10).
7).

Further, the destination determining means 22 determines that the work with the shortest moving time is the (highest priority work), but the number of elements of the (highest priority work) is two or more, that is, when there are a plurality of the highest priority work ( (Step S208 in FIG. 10), the jobs that are higher in the order of (recommended job candidate list) (the highest priority jobs)
(Step S209 in FIG. 10).

In this case, the plurality of jobs (the highest priority job) selected in the processing up to step S207 have the same values of the priority, the execution start margin time, and the destination movement time, and any one of the jobs is executed with priority. It is difficult to determine what should be. Therefore, the destination determining means 22 designates the upper job in the order of (recommended job candidate list) as (highest priority job). However, the order of the (recommended work candidate list) is not significant, but is only one method for determining one highest priority job.

The above steps S204, S206, S2
If it is determined in 08 that the number of elements is 1, or if one job is determined in step S209, the destination determining unit 22 deletes (highest priority job) from the (recommended job candidate list).

The destination determining means 22 searches for a work that can be executed before the execution of the (highest priority work) without hindering the execution of the (highest priority work) obtained in each of the above steps. The result is set in (recommended work list) (step S211 in FIG. 10). However, as a result of the search, a job that can be executed before (the highest priority job) may not be found. In this case, the value of the (recommended job list) is set to empty.

In order to perform this search, the destination determining means 22 uses the feasibility table sent from the work feasibility determining means 24 and the (highest priority work) calculated in each of the above steps to search for the work to be performed within the extra time. To the means 27.

When the destination determining means 22 creates the (recommended work list) in step S211, the processing operation ends. However, if there is no job in the (recommended job list), the value of the (recommended job list) is set to "no corresponding job", and the destination determining unit 22 outputs the destination reason generating unit 2
Send "No corresponding job" to 1.

In the case of the example shown in FIG. 9, as described above, when the processing operation shown in FIG. 10 is applied, (highest priority work) is "conference C", and (recommended work list) is "stock check E". Becomes

FIG. 12 is a flowchart showing a search operation for a job which can be executed before (highest priority job) by the in-margin execution job search means 27 of FIG. 1, and FIG. 13 is a flowchart showing the feasibility of each destination candidate. FIG. 1 is a diagram showing an evaluation example, and FIG.
FIG. 4 is a diagram showing an example of a calculation result of (highest priority work) by the destination determining means 22 of FIG. 1, and FIG. 15 is a diagram showing a configuration example of a destination reason table generated by the destination reason generating means 21 of FIG. is there.

With reference to FIGS. 12 to 15, a description will be given of the operation of searching for a job that can be executed before (highest priority job) by the job execution within time allowance search means 27. FIG. Here, in FIG.
Shows a search operation of (recommended work list) performed by (a), and (reference work), (search result list), and (search result candidate) are used as variables for simplification of explanation.

[0131] The in-margin execution work search means 27 searches for work that can be executed before (reference work) without hindering execution of (reference work). The initial value of (reference job) is (top priority job), but the value changes as the processing operation proceeds.

(Search result list) is a search result that is returned from the execution work within time allowance search means 27 to the destination determination means 22, and (Search result candidate) is temporarily stored at the stage of creating the (Search result list). It is a list of jobs stored as the candidates.

The in-margin execution work search means 27 sets (reference work) to the (highest priority work) sent from the destination determination means 22 and initializes (reference work) (FIG. 12).
Step S301).

The execution work search means 27 within the spare time executes the “work L” for each work (hereinafter referred to as “work L”) of the feasibility table sent from the destination determination means 22 ( In order to check whether or not the execution of the (reference work) is possible, the (reference work) and “work L” are sent to the work possibility determination means 24, and a calculation of the feasibility evaluation function is requested (step S302 in FIG. 12). .

When the work possibility determination means 24 receives the (reference work) and “work L” from the execution work within time allowance search means 27, the work possibility evaluation function [(machine ID), (reference work), (reference work) (Position of “work L”), (end time of “work L”)] are calculated (step S303 in FIG. 12).

However, if the “work L” is an appointment, the work possibility determination means 24 calculates (the end time of “work L”) from the formula (end time) = (start time of the execution date and time of “work L”). Ask for.

When “work L” is a ToDo work, (end time) = MIN [((work L's (deadline date and time)), (current time) + ((work L's destination travel time) )) + ((Time spent included in (deadline date and time) of “work L”))] (the end time of “work L”). Here, MIN [x, y] means the smaller one of the arguments x and y, and the magnitude relation of time is defined to be greater in the future than in the past.

The work possibility determination means 24 determines that the value of (executable start time) of the calculation result of the workability evaluation function is “0: 0”.
In the case of "0:00" or more, "executable" is answered to the execution task search means 27 within the extra time, and when the value is negative, "executable" is answered (step S304 in FIG. 12).

The work-in-progress search means 27 executes step S30 for all the work in the feasibility table.
The processing from step 2 to step S304 is performed to determine the feasibility of each task (step S305 in FIG. 12).

FIG. 13 shows the results of the feasibility when the (highest priority work list) is set to “meeting C” in the third column of the feasibility table for the feasibility table shown in FIG. , Added to the eleventh column of the feasibility table. However, in the feasibility table, feasibility is described as “「 ”, and feasibility is described as“ x ”.

For example, a method of calculating the feasibility of “stock check E” on the fifth line of the feasibility table shown in FIG. 9 will be described below. However, the current time is "98/05 /
1113: 00 ”.

First, in step S302, the spare work execution work search means 27 sends "meeting C" as the (reference work) and "stock check E" as the "work L" to the work possibility determination means 24.

The work possibility determining means 24 determines in step S30
At 3, the “end check time” of “inventory check E” = MIN [“9” because “inventory check E” is a ToDo operation.
8/05/12 12:00 "," 98/05/11
13:00 "+" 0 minute "+" 1:00 "] =" 98/0
5/11 14:00 "is obtained.

Therefore, the work-in-progress retrieval means 27 within the extra time
Are feasibility evaluation functions [“Machine A”, “Conference C”,
"Sales office A", "98/05/11 14:00"] is calculated.

This calculation is performed in the processing operation shown in FIG.
Step S101 → Step S103 → Step S10
6 → The sequence proceeds to step S109. As a result, (execution start margin time) = “98/05/11 15:00” −
"98/05/11 14:00"-"0 minute" = "+
0:01:00 ", and since the value is positive, execution becomes possible.

The execution work within time allowance search means 27 determines that the execution is possible according to the work (condition 1) whose execution allowance time is equal to or more than “+00: 00” and the result of the flow from step S302 to step S304. Work (condition 2)
Are set as (search result candidates) that satisfy both of the two conditions (step S306 in FIG. 12).

Jobs satisfying the conditions 1 and 2 can be intuitively started from the current position and time (condition 1), and after the job is completed (highest priority job). This indicates that the work can be started (condition 2).

The calculation result example shown in FIG. 14 is a result of applying step S306 to the evaluation example shown in FIG. Of the jobs of the evaluation example shown in FIG. 13, the condition 1 is “meeting B”, “meeting C”, “meeting D”, “stock check E”, and “report F”, and the condition 2 is satisfied. Are "meeting A" and "inventory check E", so that "inventory check E" satisfies both conditions. In this example, only one job satisfies the condition. However, there may be a plurality of jobs or no job.

If there is no job in the (search result candidate) (step S30 in FIG. 12)
7) Send the (search result list) to the destination determining means 22 and end the processing operation.

The work-in-progress search means 27 has a job in the (search result candidate) (for example, when there is one (search result candidate) as in the example shown in FIG. 14) (step in FIG. 12). S307), it is determined whether there are a plurality of (search result candidates) (step S308 in FIG. 12).

If it is determined that there are a plurality of (search result candidates) within the spare time, the work with the highest (priority) among the plurality of (search result candidates) jobs is determined as the (search result candidate). (Step S309 in FIG. 12).

The work-to-be-executed within spare time search means 27 determines that there is a plurality of (search result candidates) even if the work having the highest (priority) is (search result candidate) (step S3 in FIG. 12).
10) Among the plurality of (search result candidate) jobs, the job with the shortest (executable time) is set as the (search result candidate) (FIG. 12, step S311).

If there is a plurality of (search result candidates) (S312 in FIG. 12) even if the work with the shortest (executable time) is the (search result candidate), the plurality of (searches) Among the jobs of the (result candidate), the job with the smallest (destination travel time) is set as the (search result candidate) (step S313 in FIG. 12).

Even if the work with the shortest (destination travel time) is the (search result candidate), if there are a plurality of (search result candidates) (step S314 in FIG. 12), the executable work search means 27 can execute the workability table. Are set as values of (search result candidates) in the order of (step S in FIG. 12).
315).

In this case, the plurality of jobs (search result candidates) selected in the processing up to step S314 have the same value in the priority, the execution start margin time, and the destination movement time, and any one of the jobs is executed with priority. It is difficult to determine what should be. Therefore, the work-to-be-executed within time margin search means 27 sets the work located in the order of the feasibility table as the value of (search result candidate). However, the order of the feasibility tables is not significant, but is only one method for determining one search result candidate.

The above steps S308, S310, S3
12. If it is determined in S314 that there is only one (search result candidate), or if one job is determined in step S315, the in-time execution work search means 27 determines that the (search result candidate) is a ToDo work and When the reference job is an appointment, (deadline date and time) = MIN [((deadline date and time of (search result candidate)), ((start time) of (execution date and time) of (reference job)) − ((search result candidate) ) From (position) to (position) of (reference work))], the value of (deadline date and time) is changed.

[0157] In addition, the work-in-progress retrieving means 27 within the extra time allows the (search result candidate) to be ToDo work and the (reference work) to be T
In the case of oDo work, (deadline date and time) = MIN [((search result candidate) (deadline date and time)), ((base job) (deadline date and time))
-(Time spent) of (Deadline date) of (Reference work))
The value of the (deadline date and time) is changed to the value obtained by the expression of-((moving time from (position) of (search result candidate) to (position) of (reference work))) (step S316 in FIG. 12). .

However, (moving time from (position) of (search result candidate) to (position) of (reference work)) is calculated from moving time knowledge 25 by (position) and (reference work) of (search result candidate). (Position) and the travel time between two points are obtained.

The in-margin execution work search means 27 adds (search result candidate) to the (search result list). However,
The (search result list) is added to the first line of the (search result list) so that the (search result list) is in the order in which the user should execute.

Further, the work-in-progress retrieval means 27 within the extra time
Sets (search result candidate) to (reference job) in order to search for a job that can be executed without hindering execution of (search result candidate) before the job of (search result candidate), and proceeds to step S302. Return.

In the example shown in FIG. 14, since “stock check E” is a ToDo operation, first, the (deadline date and time) is changed as follows. "Conference C", which is (standard work)
Is an appointment, (deadline date and time) = MIN [((""
12:00 "), (" 05/05/11 15:00
0 ")-(" 0 minutes ")] =" 98/05/11 15:
00 ”.

As a result, the in-floor execution work search means 27 adds “inventory check E” to the (search result list), sets “reference work” to “inventory check E”, and returns to step S302. That is, the execution work search means 27 within the spare time searches for work that can be executed before this without hindering the execution of the “inventory check E”.

Next, the in-time-period work search means 27 repeats steps S302 to S305, and checks whether or not all the work in the feasibility table can be executed before "inventory check E".

As a result, there is no work that can be executed, and there is no work that satisfies the condition of step S306. Therefore, the operation search means 27 within the margin time ends the processing operation in step S307. Finally, in this example, the (search result list) consists only of "stock check E". That is, the only job that can be executed before the highest priority job, “meeting C”, is “inventory check E”.

In the destination reason table shown in FIG. 15, each row indicates one reason. The first item is the item that puts a “★” mark on the job that has the highest priority among the jobs to be performed, the second item is the name of the job, and the third item is when the job should be executed. , The fourth term indicates the position where the task is performed, and the fifth term indicates what the user needs to do the task.

The method of creating the data of each item includes the following three steps. First, in step 1, for each job in the (recommended job list), the first item is set to empty, and the second item is set to (job name) in the (recommended job list).

In the third section, when (recommended job list) is an appointment, the start time of (execution date and time)
When the (recommended job list) is ToDo work, (deadline date / time)-((expiration date / time) (time spent)) is set, and (destination candidate) of (recommended job list) is set in the fourth term.

In the fifth item, when the (recommended job list) is an appointment, "participation" is indicated, and when the (recommended job list) is T
“Execute” is set in the case of oDo work. However, the order in which the data is set in the destination reason table is the same as the order of the data in the (recommended job list). That is, they are set in the order of execution by the user. When the value of the (recommended work list) is "no corresponding work", the process proceeds to step 2.

In step 2, (highest priority work)
In the same manner as in step 1, the destination reason table is added to the end. However, the value of the first item is “★”. Note that the process proceeds to step S008 only when (highest priority job) is found in step S007 in FIG. 3, so that data is always added to the destination reason table in this step.

In step 3, in the work in the executable table, for the work in which the value of (execution allowance time) is smaller than the value of (execution allowance time) in (highest priority work), the destination is determined in the same manner as in step 1. Set at the end of the reason table. However, the fifth item is a character string “cancel”.

The above example, that is, (recommended work list)
Is “Inventory Check E”, (Top Priority Work) is “Conference C”, and today's remaining work is as shown in FIG. 9, “Inventory Check E” is added in Step 1 and Step 2 , "Conference C" is added, and in Step 3, "Conference A" and "Conference B" are added to generate the destination reason table shown in FIG.

Next, the respective regions 1211, 1212 and 1212 in FIG.
A display method of 1221, 1222, 1223, 1224, and 1225 will be described. However, "no advice"
Is received, “particularly nothing” is displayed in the area 1211 for displaying the advice of the destination, and the other area 1211 is displayed.
12,1221,1222,1223,1224,12
25 does not display anything.

In the area 1211, the value of the fourth term of the data of the first record indicating the execution position of the user of the work to be executed first in the destination reason table is displayed. In the area 1212, the value of the third term (execution start time) of the data in the first line, which means the execution start time of the work to be executed first in the destination reason table, is compared with the current time. (Execution start time)? (Current time) <1
In the case of time, a character string of “urgent” is displayed, and 1 hour ≦ (execution start time)? In the case of (current time), a character string of “(execution start time)? (Current time) after” is displayed.

Regions 1221, 1222, 1223, 12
24 and 1225 are respectively the second term of the destination reason table,
It corresponds to the third, fourth, fifth, and first items, and displays the values of the corresponding items for all the jobs in the destination reason table. However, at this time, the order of the work in the destination reason table and the order of the work displayed in the area 122 are displayed so as to be the same. The destination reason table shown in FIG. 15 is displayed on the portable terminal input / output means 12, as shown in FIG.

FIG. 16 is a block diagram showing a configuration of a schedule management system according to another embodiment of the present invention. In the figure, a schedule management system according to another embodiment of the present invention stores an alternative location knowledge 28 in the office computer 2.
The configuration is the same as that of the embodiment of the present invention shown in FIG. 1 except for adding, and the same components are denoted by the same reference numerals. The operation of these same components is the same as in the embodiment of the present invention.

The alternative place knowledge 28 is a table showing what kind of work can be executed for each place. The contents of the table 28 are determined by the work possibility determination means 24 to evaluate the workability of each work. Sometimes referred to.

FIG. 17 is a diagram showing a configuration example of the alternative location knowledge 28 of FIG. In the figure, the first column of the alternative location knowledge 28 represents a location, the second column represents a machine used in the location of the first column, and the third and subsequent columns represent types of work. "○" in the table means that it is executable,
"X" means that it cannot be executed. However, “executable” means that the user can execute using the machine having the value in the second column.

For example, in the place "office 2" in the third column, "word processor", "OHP", "mail",
Jobs belonging to the type of "schedule" can be executed using "machine Y" as long as the user moves to that location without preparing to bring a particular machine, but "meeting" , The job belonging to the type “inventory check” is not executable. Since it is assumed that all work can be performed in the user's own office, the "office"
Indicates that the value is “○” for all items.

The above-mentioned alternative place knowledge 28 is used for calculation of the feasibility function of the workability determination means 24. In one embodiment of the present invention, the feasibility function moves to the location indicated by the (location) of each task, or the user's "office"
This is a function for determining whether it is possible to start each job when moving to. Thus, each task must be performed only at the location indicated by the task (location) or at the "office".

Therefore, in another embodiment of the present invention, a function of searching for a place that can be executed at a position indicated by (position) of work and a position other than “office” by using the substitute place knowledge 28 is added. ing.

FIG. 18 shows the work possibility determination means 24 of FIG.
Is a flowchart showing the operation of determining the feasibility of each task according to the above. The processing operation illustrated in FIG. 18 includes Step S105 and Step S107 of the processing operation illustrated in FIG. 6, and includes Step S105A, Step S105B, and Step S1.
05C, step S105D, and step S107A, respectively. Therefore, these steps S1
05A, step S105B, step S105C, step S105D, and step S107A will be described below.

The processing operation proceeds to step S105A of FIG. 18 when it is impossible to execute both the current position and the (position) of “work X” which is the work whose feasibility is being checked. In step S105A, an executable place is searched.

First, a place where the item of the value of “work X” (work type) is “○” is searched from the alternative place knowledge 28. For example, (work type) of “work X” is “OHP”
When the alternative location knowledge 28 shown in FIG. 17 is used, the execution can be performed in “office” and “office 2”. However, since "office" is assumed to be capable of performing all tasks, at least one value has been found in this search result.

In step S105B, it is determined whether there are a plurality of search results. If there are a plurality of search results, step S1 is performed to determine one of the plurality of search results.
Proceed to 05C, and if there is only one search result, step S1
Proceed to 05D.

In step S105C, the travel time with respect to "position Y" is calculated using the travel time knowledge 25 for each of the jobs in the search result, and the place with the shortest travel time is determined as the destination. For example, when “position Y” is “sales office A”, travel time knowledge is as shown in FIG. 8, and the search results are “office” and “office 2”, the travel time is “20 minutes”,
It is “5 minutes”, and it is decided to move to “Office 2”. However, when there are a plurality of places where the moving time is the shortest, any one may be selected at random.

In step S105D, the value of (destination candidate) is set to the value of (position) in the above search result, and (destination use machine ID) is set to the value of (machine) in the above search result.

In step S107A, the time required for the movement from “position Y” to (destination candidate) is calculated using the movement time knowledge 25 and substituted for (destination movement time), and the flow advances to step S109.

As described above, since the work possibility determining means 24 has a function of searching for an executable position of each job by using the substitute location knowledge 28, each job is registered in the schedule database in advance. It is possible to make an action plan when the user moves to a position other than.

FIG. 19 is a block diagram showing a configuration of a schedule management system according to another embodiment of the present invention. In the figure, a schedule management system according to another embodiment of the present invention includes a status monitor 29 in the office computer 2.
The configuration is the same as that of the other embodiment of the present invention shown in FIG. 16 except that is added. The same components are denoted by the same reference numerals. The operation of these same components is the same as in the other embodiments of the present invention.

The status monitoring means 29 periodically monitors a predetermined directory (hereinafter referred to as a sentence spool), and if necessary, performs a new job of “processing a sentence in the sentence spool” in schedule management. This is a means for automatically registering in the schedule database managed by the means 23.

In the following, for simplification of the description, an example will be described in which the mail spool directory in which the user temporarily stores newly received electronic mail is a text spool. That is, when a new mail is received, the status monitoring means 29 automatically registers a job of "processing this mail" in the schedule database. However, it is not always necessary to set the mail spool directory of the e-mail to the document spool. For example, notes about tasks that must be processed in the future may be stored in a certain directory, and this directory may be used as a document spool.

FIG. 20 is a block diagram showing a configuration of the status monitoring means 29 of FIG. In the figure, status monitoring means 2
Reference numeral 9 denotes a timer 291 for issuing an event indicating the elapse of time at fixed intervals, a document spool 293 for temporarily storing newly received e-mail, and a document 291 when an event is received from the timer 291. Spool 293
And a job generation unit 292 for generating a job for processing the electronic mail in the document spool 293 and registering the job in a schedule database managed by the schedule management unit 23.

The timer 291 determines in advance the time interval for notifying the elapse of time to other blocks (for example, every 10 minutes), and uses the function of a clock provided as a standard in a computer or OS to make the time interval. Every time the time elapses, the message "Elapsed time" is sent to the job generating means 2.
Notify 92.

The received new mail exists in the text spool 293 as a text file for each mail. When the user reads the mail, the text file of this mail is deleted from the text spool 293. Therefore, by counting the number of files existing in the text spool 293, the user can know the number of unread mails.

When the job generating means 292 receives the message "Elapsed time" from the timer 291, it automatically registers the job "Process this mail" in the schedule database.

FIG. 21 is a flowchart showing the processing operation of the work generation means 292 of FIG. The processing operation of the work generation means 292 will be described with reference to FIGS.

The job generating means 292 first sets the sentence spool 2
The number of files in the directory 93 (hereinafter referred to as the number of mails) is counted (step S401 in FIG. 21). If there is no file (step S402 in FIG. 21), the job generating means 292 ends the processing operation.

If the file exists (step S402 in FIG. 21), the job generation means 292 sets the job name: “mail processing”, the execution date / time: “no value”, and the deadline date / time to “today” · ( Date / time) is “normal leaving time” / (time to complete) = MIN [“60 minutes”, number of mails ×
M]], priority: 0 <number of mails <5 = “C”, 5 <= number of mails <10 = “B”, 10 ≦ number of mails = “A”, position: “*”, work type: “mail” Is generated as a new job (step S403 in FIG. 21).

Here, the normal leaving time, which is the closing date and time (date and time), means the standard time when the user leaves the house from the company without working overtime, and is registered in advance by the user. MIN [x, y] means the smaller of the arguments x and y. M represents the average time spent processing one mail, and an appropriate value such as "10" is registered in advance.

However, it is not always necessary to calculate (time spent until completion) by the above method. For example, (time spent until completion) may be calculated from the number of bytes of the mail file, or may be calculated by another method.

The priority conditions “5” and “10” are
This is a value that can be customized for each user. Also, the value of the priority need not necessarily be calculated by the above method. For example, for a user who uses application software for sending and receiving mail that can specify a priority, a method of setting the work priority to “A” when a high-priority mail is received may be considered.

The job generation means 292 sends the information of the work to the schedule management means 23 in order to register the work in the schedule database (step S404 in FIG. 21).

When the schedule management unit 23 receives the job to be registered from the job generation unit 292, if the deadline date and time is today and the job with the job name “mail processing” is already registered, the schedule management unit 23 generates the job. Means 292
Is the job that was generated last time, and because the content is old, overwrite it with the job that has just been received. If the deadline date is today and there is no job whose job name is "e-mail processing", the schedule management means 23 adds the currently received job to the schedule database (step S40 in FIG. 21).
5).

As described above, the job for processing the electronic mail is automatically created by the job generating means 292 according to the reception state of the electronic mail, and if necessary, the job for processing the electronic mail is performed. Mobile terminal input / output means 1
2 advises the user. Therefore, the user can determine his or her destination only by looking at the display on the portable terminal input / output means 12 without performing an operation of receiving the e-mail and checking the situation.

As described above, the destination determining means 22 generates information indicating where the user should go, and displays the information on the portable terminal input / output means 12 to make an action plan of where to go and what to do. Conventionally, when a user displays a schedule on the time axis, sorts and displays the schedule according to priority, and has to integrate information obtained by performing multiple operations such as searching by execution position. On the other hand, the user can easily make an action plan simply by looking at the display without performing a complicated operation.

Further, the destination determining means 22 calculates a margin time to the next schedule in consideration of the traveling time, and displays it on the portable terminal input / output means 12, so that sudden work may occur at a destination. If the user often wants to know the time to the next schedule, such as when the user has done it, the user can know the time to the next schedule simply by looking at the display without performing any complicated operation. it can.

Further, the mobile terminal input / output means 12 advises the user when and where to go, and lists the top priority jobs, the jobs to be executed today, and the jobs to be canceled. The display allows the user to understand the reason for the destination advice and follow the advice. Of course, the user does not need to follow the advice if he is not satisfied with the reason.

Furthermore, the work possibility determination means 24 dynamically determines the execution place using the substitute place knowledge 28 and the terminal work possible knowledge 26, so that the execution place of each work is fixed in the conventional system. Because it has been done, it is difficult to support a job whose location is not determined until immediately before execution. On the other hand, a job whose location is not determined until immediately before execution can be handled in the same way as other jobs.

When making a decision on whether to return to his or her office from whereabouts, the user is not limited to today's schedule, but one of the criteria is whether mail or fax has arrived. Therefore, in the conventional system, it was necessary to perform an operation such as checking whether a new e-mail has arrived from a destination. However, the status monitoring unit 29 determines the status of the user's office computer (for example,
By monitoring new e-mails, etc., and automatically generating new jobs if necessary, it is possible to operate other than schedules (in this case, e-mail (Reception situation) can be made.

[0210]

As described above, according to the schedule management system of the present invention, the portable terminal system includes a portable terminal system and an office computer that communicates with the portable terminal system via a wireless network. A schedule management system for managing schedule information of an owner of a portable terminal system in an office computer, comprising: a portable terminal input / output means for displaying schedule information on the portable terminal system and inputting a request to the office computer; A mobile terminal position obtaining unit for obtaining the position information of the scheduler, a schedule management unit for managing the schedule information in the office computer, and a processing device capable of processing the work for each type of work constituting the schedule information. Store workable information Terminal workable knowledge, travel time knowledge to accumulate a preset travel time between the locations where the processing devices are located, and mobile terminal system position information obtained via a wireless network from mobile terminal position obtaining means. Work possibility determination means for determining whether or not each work can be executed as scheduled from schedule information managed by the schedule management means, the contents of the terminal workable knowledge, the contents of the travel time knowledge, and the current time; A destination determining means for generating a work plan to be executed after the current time based on the determination result of the possibility determining means and calculating a destination indicating a point to be moved based on the plan; and a destination determining means. Now, by providing destination reason generation means for generating a reason for moving to a destination, the user himself / herself should perform where There is an effect that can be grasped at a glance.

Further, according to another schedule management system of the present invention, in addition to the above-mentioned means, an alternative place knowledge for storing information indicating a place where the work can be processed and an alternative place is stored for each type of work. Including in the computer, the destination determination means makes an execution plan with a short travel time based on the alternative location knowledge, so that the user's current location and the terminal being carried can be specified without specifying the execution location of the work There is an effect that a place where a job can be executed is calculated from the type of the information and the like, and can be presented to the user.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a schedule management system according to an embodiment of the present invention.

FIG. 2 is a diagram showing a display example of the portable terminal input / output unit of FIG. 1;

FIG. 3 is a flowchart showing a destination advice display process according to an embodiment of the present invention.

FIG. 4 is a diagram showing a configuration example of a schedule database managed by the schedule management means of FIG. 1;

5 is a diagram showing an example of calculating today's remaining work by the schedule management means of FIG. 1;

FIG. 6 is a flowchart showing an operation of determining the feasibility of each task by the work possibility determination unit of FIG. 1;

FIG. 7 is a diagram showing a configuration example of terminal work possible knowledge of FIG. 1;

FIG. 8 is a diagram showing a configuration example of travel time knowledge of FIG. 1;

FIG. 9 is a diagram showing a configuration example of an executable table generated by the work possibility determining unit of FIG. 1;

FIG. 10 is a flowchart showing a destination calculation process by the destination determining means of FIG. 1;

11 is a diagram showing an example of destination candidates calculated by the destination determining means of FIG. 1;

FIG. 12 is a flowchart showing a search operation for a job that can be executed before (highest priority job) by the job search within execution time in FIG. 1;

FIG. 13 is a diagram illustrating an example of evaluating the feasibility of each destination candidate.

FIG. 14 shows a result of the destination determining means shown in FIG. 1 (highest priority work).
FIG. 9 is a diagram illustrating an example of a calculation result of the calculation.

FIG. 15 is a diagram showing a configuration example of a destination reason table generated by the destination reason generating means of FIG. 1;

FIG. 16 is a block diagram showing a configuration of a schedule management system according to another embodiment of the present invention.

FIG. 17 is a diagram illustrating a configuration example of alternative place knowledge in FIG. 16;

18 is a flowchart showing an operation of determining the feasibility of each task by the work possibility determination unit of FIG.

FIG. 19 is a block diagram showing a configuration of a schedule management system according to another embodiment of the present invention.

FIG. 20 is a block diagram showing a configuration of the status monitoring means of FIG. 19;

FIG. 21 is a flowchart showing a processing operation of the work generation means of FIG. 19;

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 mobile terminal system 2 office computer 3 wireless network 10, 20 control memory 11 mobile terminal position acquisition means 12 mobile terminal input / output means 21 destination reason generation means 22 destination determination means 23 schedule management means 24 workability determination means 25 travel time knowledge 26 Terminal work possible knowledge 27 Execution work search means within extra time 28 Alternative place knowledge 29 Situation monitoring means 121 Destination advice display section 122 Advice reason display section 291 Timer 292 Work generation means 293 Document spool

Claims (27)

[Claims] 1. A portable terminal system, comprising: a portable terminal system; and an office computer communicating with the portable terminal system via a wireless network. The office computer transmits schedule information of an owner of the portable terminal system. A schedule management system for managing, comprising: a mobile terminal input / output unit for displaying the schedule information and inputting a request to the office computer to the mobile terminal system; and acquiring current position information of the mobile terminal system. A portable terminal position acquisition unit, wherein the office computer has a schedule management unit that manages the schedule information, and a processing device that can process the work for each type of work that constitutes the schedule information. Terminals that can store information Travel time knowledge that accumulates a preset travel time between points where the processing device is disposed, position information of the portable terminal system acquired from the portable terminal position acquisition unit via the wireless network, and the schedule Work possibility determining means for determining whether or not each of the tasks can be executed as scheduled based on the schedule information, the contents of the terminal workable knowledge, the contents of the travel time knowledge, and the current time managed by management means And destination determination means for generating a work plan to be executed after the current time based on the determination result of the work possibility determination means and calculating a destination indicating a point to be moved based on the plan, A destination reason generating means for generating a selection reason indicating a reason for moving to the destination calculated by the destination determining means. System. 2. When a command requesting advice of a next destination is input from the portable terminal input / output unit, the destination calculated by the destination determination unit and the selection reason generated by the destination reason generation unit are displayed. 2. The schedule management system according to claim 1, wherein the schedule management system is configured to display the information on a portable terminal input / output unit. 3. The work possibility determination unit includes a unit that calculates a point at which the work is to be performed using a current position of the portable terminal system and the content of the travel time knowledge,
3. The schedule management system according to claim 1, wherein the calculated point at which the work is to be executed is displayed on the portable terminal input / output unit. 4. A means for calculating a highest-priority task to be executed with a particular priority after the current time, and calculating the current time and the highest-priority task without hindering the execution of the highest-priority task. The office computer further includes a work-in-progress search means for making an execution plan of a work executable between the execution time and the work-in-floor search work means. 4. The schedule management system according to claim 1, wherein an execution plan is displayed on the portable terminal input / output unit. 5. The destination deciding means includes a means for searching for a job to be canceled among the schedules to be executed after the current time, and displays the job to be canceled on the portable terminal input / output means. The schedule management system according to any one of claims 1 to 4, wherein the schedule management system is configured as described above. 6. The portable terminal input / output means includes a display area for displaying the destination, a display area for displaying when to move to the destination, and a display area for displaying a reason for selecting the display content. The schedule management system according to any one of claims 1 to 5, further comprising: 7. The office computer includes, for each type of the job, alternative location knowledge that stores information indicating a place where the job can be processed and an alternative location, and the destination determining unit determines the destination based on the alternative location knowledge. 7. The schedule management system according to claim 1, wherein an execution plan with a short moving time is set. 8. A storage means for storing information of a predetermined type, a status monitoring means for monitoring the contents of said storage means and generating a new job when the stored content changes, and said status monitoring. Means for registering the new work generated by the means in the schedule information, in the office computer, wherein the destination determination means makes an action plan in consideration of the work newly registered in the schedule information. 8. The method according to claim 1, wherein
The schedule management system according to any one of the above. 9. The status monitoring means includes means for recognizing a change in status at regular time intervals and correcting a job generated based on a previous recognition result to one corresponding to the latest status. 9. The schedule management system according to claim 8, wherein the decision means is configured to make an action plan based on the latest situation including the work corrected by the situation monitoring means. 10. A portable mobile terminal system,
An office computer that communicates with the portable terminal system via a wireless network, and a schedule management method for a schedule management system that manages schedule information of the owner of the portable terminal system in the office computer, The mobile terminal system includes a step of displaying the schedule information and inputting a request to the office computer, and a step of obtaining current location information of the mobile terminal system. The content of the terminal workable knowledge that stores workable information indicating a processing device capable of processing the work for each type of work constituting the information and a preset travel time between points where the processing device is provided Of travel time knowledge and mobile terminal Determining from the position information obtained from the stem, the schedule information, and the current time whether or not each of the tasks can be executed as scheduled; and, based on the determination result, the tasks to be executed after the current time. And a step of calculating a destination indicating a point to be moved based on the plan, and a step of generating a selection reason indicating a reason for moving to the calculated destination. Schedule management method. 11. The mobile terminal system displays a destination calculated when a command for requesting advice of a next destination is input from the mobile terminal system and a generated selection reason on the mobile terminal system. The schedule management method according to claim 10. 12. The step of determining whether each of the tasks can be executed as scheduled includes calculating a point at which the task is to be executed using a current position of the portable terminal system and the content of the travel time knowledge. 12. The schedule management method according to claim 10, further comprising the step of: displaying the calculated point at which the work is to be executed on the portable terminal system. 13. A step of calculating a highest-priority task to be executed with a special priority after the current time, and calculating the current time and the highest-priority task without hindering execution of the highest-priority task. Setting an execution plan of an executable work with the execution time in the office computer, and displaying the highest-priority work and the executable work execution plan on the portable terminal system. 13. The schedule management method according to claim 10, wherein the schedule management method is performed. 14. The step of calculating a destination indicating a point to be moved based on the plan includes a step of searching for a job to be canceled among the schedules to be executed after the current time, and 14. The schedule management method according to claim 10, wherein a task to be performed is displayed on the portable terminal system. 15. The portable terminal system includes a display area for displaying the destination, a display area for displaying when to move to the destination, and a display area for displaying a reason for selecting the display content. 15. The schedule management method according to claim 10, wherein information generated in each step of the computer is displayed in a corresponding display area. 16. The method according to claim 16, further comprising the step of making an execution plan with a short travel time based on the contents of the alternative place knowledge storing information indicating a place where the work can be processed and an alternative place for each type of the work. The schedule management method according to any one of claims 10 to 15, wherein: 17. A step of monitoring the contents of a storage unit in which information of a predetermined type is stored and generating a new job when the stored contents change, and setting the generated new job to the schedule. 11. The office computer according to claim 10, further comprising a step of registering information in the office computer, wherein an action plan taking into account the work newly registered in the schedule information is created.
6. The schedule management method according to any one of 6. 18. The step of generating a new job includes the steps of recognizing a change in the situation at regular time intervals and correcting the job generated based on the previous recognition result to a job corresponding to the latest situation. 18. The schedule management method according to claim 17, wherein an action plan is created based on the latest situation including the corrected work. 19. A portable mobile terminal system,
An office computer communicating with the portable terminal system via a wireless network; and a schedule management control program for causing the office computer to manage schedule information of the owner of the portable terminal system. A recording medium on which the schedule management control program causes the portable terminal system to display the schedule information and input a request to the office computer, and to acquire current position information of the portable terminal system. The schedule management control program stores, in the office computer, terminal workable knowledge content that stores workable information indicating a processing device capable of processing the work for each type of work configuring the schedule information, and From the contents of the travel time knowledge accumulating the preset travel time between the points where the processing devices are arranged, the position information acquired from the portable terminal system, the schedule information, and the current time, each of the jobs is performed as scheduled. To determine whether or not it is feasible, to generate a plan of the work to be executed after the current time based on the determination result, and to calculate a destination indicating a point to be moved based on the plan, A storage medium storing a schedule management control program for generating a selection reason indicating a reason for moving to a specified destination. 20. The schedule management control program sends a destination calculated when a command for requesting advice of a next destination is input from the mobile terminal system to the office computer, and the generated selection reason. 20. A recording medium on which the schedule management control program according to claim 19 is displayed. 21. The schedule management control program, when causing the office computer to determine whether or not each of the tasks can be executed as scheduled, compares the current position of the portable terminal system and the contents of the travel time knowledge. 21. The method according to claim 19, further comprising: calculating a point at which the task is to be executed by using the mobile terminal system; and displaying the calculated point at which the task is to be executed on the portable terminal system.
A recording medium on which the above described schedule management control program is recorded. 22. The schedule management control program causes the office computer to calculate a highest-priority task to be executed with a particular priority after the current time, and to execute the current job without interrupting the execution of the highest-priority task. The execution schedule of the executable work is set up between the time and the execution time of the highest priority work, and the execution plan of the highest priority work and the executable work is displayed on the portable terminal system. A recording medium recording the schedule management control program according to any one of claims 19 to 21. 23. The schedule management control program, when causing the portable terminal system to calculate a destination indicating a point to be moved based on the plan, cancels the schedules to be executed after the current time. 23. The recording medium recording the schedule management control program according to claim 19, wherein a job to be searched is searched for, and the job to be canceled is displayed on the portable terminal system. 24. The schedule management control program causes the office computer to display a display area for displaying the destination of the portable terminal system, a display area for displaying when to move to the destination, and a reason for selecting the display content. 24. A recording medium storing the schedule management control program according to claim 19, wherein information corresponding to the information is displayed in a display area for displaying the schedule management control program. 25. The schedule management control program stores, in the office computer, the travel time of the travel time based on the content of alternative place knowledge that stores information indicating a place where the work can be processed and an alternative place for each type of work. 25. A recording medium recording the schedule management control program according to claim 19, wherein a small execution plan is set. 26. The schedule management control program causes the office computer to monitor the contents of a storage unit in which information of a predetermined type is stored, and to generate a new job when the stored contents change. The schedule according to any one of claims 19 to 25, wherein the registered new work is registered in the schedule information, and an action plan is set up in consideration of the newly registered work in the schedule information. A recording medium on which a management control program is recorded. 27. The schedule management control program, when causing the office computer to generate the new job, recognizes a change in the situation at regular time intervals and updates the generated job based on the previous recognition result. 27. The recording medium storing the schedule management control program according to claim 26, wherein the schedule management control program according to claim 26, wherein the schedule management control program is corrected based on the latest situation including the corrected job.