KR100339498B1 - Method for scheduling of scheduler interlocking with radio communication system - Google Patents

Abstract

In the scheduling method of the scheduler interworking with the wireless communication device according to the present invention, the CGI program unit stores the schedule input by the user in a database server, changes the contents in the database server to new contents, and changes the input or changed contents in the user. Output to the screen so that it knows; The database server stores data input by the user through the CGI program unit, that is, data such as user's schedule, account, password, telephone number, etc .; The daemon program unit is always ready in the system, checks the schedule stored in the database server, reads the contents of the current date and the current time, and then transmits the same schedule as the current time to a predetermined user.

Therefore, the present invention can be applied to all wireless communication devices, input is convenient by inputting a schedule using a web page, and all processing is performed inside the computer, thereby reducing the overhead in the mobile phone, In addition to complex schedules, it is possible to collectively transmit schedules to wireless communication devices of multiple users who are related to a particular schedule, so that all users can handle their tasks efficiently and quickly.

Description

Scheduling method of scheduler interworking with wireless communication device {METHOD FOR SCHEDULING OF SCHEDULER INTERLOCKING WITH RADIO COMMUNICATION SYSTEM}

The present invention relates to a scheduling method of a scheduler for managing a schedule. In particular, when a schedule is input through the Internet, a scheduler for interworking with a wireless communication device which transmits the contents of the schedule to a wireless communication device of a corresponding user and informs the user of the schedule at a predetermined time It is about a method.

Conventionally, as a technology for managing a schedule, there is a method having a schedule management function in a mobile phone, that is, a method of inputting and confirming a schedule on a mobile phone, or a method of using a program inside the computer, that is, a method of inputting and confirming a schedule through a computer. There is this.

However, in the former method as described above, since the schedule contents and time of the user are stored in the permanent memory in the mobile phone, the amount of schedule that the user can input into the mobile phone is limited, so that a large amount of schedules are stored in the mobile phone. In order to save, additional memory is inevitable. In addition, by periodically calculating the time and the current time of the stored schedule, unnecessary overhead of the mobile phone, that is, waste of battery or additional work that should be checked every time without schedule. Moreover, inputting a schedule using a limited button of a mobile phone inconveniences the user. If the schedule is a lot of people, such inconvenience is more serious.

In the latter case, the user must turn on the computer, execute a program of the schedule, or use a web browser in order to check the schedule. That is, since the contents of the schedule must be checked by a computer, it is difficult to know the schedule at a desired time and the inconvenience of having to keep in mind the time and contents of the schedule at all times.

Therefore, in the case of the above-described conventional method, since additional memory must be added in order to implement a mobile phone having a large storage function and a device having a more convenient function, the weight and size of the device become larger and more complicated. It is costly and causes a lot of inconvenience for the user in managing the schedule.

SUMMARY OF THE INVENTION The present invention has been made in view of the above, and in order for a user to appropriately recognize many and various schedules occurring in social life, a user inputs a schedule through a computer and uses a wireless communication device (eg, a mobile phone, a pager, etc.) By checking the content, scheduling of Internet-based schedulers that work with wireless communication devices that can inform individuals at irregular times, such as irregular schedules such as appointments, regular schedules such as work or classes, and schedules that apply to everyone. The purpose is to provide a method.

1 is a block diagram showing the overall relationship between a scheduler and a wireless communication device according to the present invention;

2 is a flowchart illustrating an algorithm for inputting and storing data by a user through a web according to the present invention;

FIG. 2A illustrates an algorithm continuously following the algorithm of FIG. 2, and a flowchart illustrating an algorithm for processing addition, deletion, and modification of a personal schedule. FIG.

FIG. 2B is a flowchart continuously showing the algorithm following the algorithm of FIG. 2, and is a flowchart illustrating an algorithm for processing group schedule addition, deletion, and modification.

3 is a flowchart illustrating an algorithm for transmitting contents stored in a database server according to the present invention at a predetermined time;

4 is a flowchart illustrating an individual iteration table update algorithm according to the present invention;

5 is a flowchart illustrating a group iteration table update algorithm according to the present invention.

<Explanation of symbols for main parts of drawing>

1 --- web browser, 2 --- web server,

3 --- CGI program section, 4 --- database server,

5 --- daemon program section, 6 --- host server (host server of each carrier),

7 --- Wireless communication devices (mobile phones, pages, etc.).

In the scheduling method of the scheduler inputting a schedule via the Internet according to the first aspect of the present invention for solving the above problems, and transmitting the contents of the schedule to the wireless communication device to inform the wireless communication device, CGI program unit ( 3) saves the schedule entered by the user in the database server, changes the contents in the database server to the new contents, and outputs the input or changed contents to the screen so that the user can know; The database server 4 stores data input by the user through the CGI program unit 3, that is, data such as a user's schedule, account, password, telephone number, etc .; The daemon program unit 5 is always ready in the system, checks the schedule stored in the database server, reads the contents of the current date and the current time, and then transmits the same schedule as the current time to a predetermined user. do.

The data processing in the database server according to the second aspect of the present invention, if a user is subscribed, receives an ID and password and compares the input ID and password with the contents of the personal details table and the group details table. , If it is a personal ID, add, delete / modify a personal schedule; if it is a group ID, add, delete / modify a group schedule; if not, check whether it is a person or a group; Data is entered in the table, and in the case of a group, data is entered and processed in the group detail table.Personal schedules and group schedules are divided into regular schedules and irregular schedules, and are divided into regular schedules and recurring schedules. / Correction is made.

An algorithm for transmitting contents stored in a database according to a third aspect of the present invention at a predetermined time is connected to a database server (step # 1) and selects the corresponding database (step # 1) to read the contents stored in the database. 2) Obtain the current time and date (step # 3-1). If the current time and the repetition time are the same, update the personal repetition table and the group repetition table. If the current time and the repetition time are not the same, perform step # 3-3. (Step # 3-2). At this time, the repetition time prevents a decrease in system efficiency by using a dawn time. Subsequently, the schedule information corresponding to the current date is fetched from the entire table in chronological order (ascending order) (step # 3-3), and one of them is selected in chronological order (step # 3-4), and in step # 3-4 If no selection is made, it means that there is no schedule to be sent that day, the program is paused to maintain system performance, and then back to step # 3-1 (step # 3-5), fetch if any selections are made. Obtain one transfer time (step # 3-6) If the current time is equal to the time to send the schedule, or if the current time is later than the time to send, or if the time before the previous transfer time and the time to send the schedule are the same Start from # 3-8, otherwise, start again from step # 3-1 (step # 3-7), and if the next time passes and the previous time and the time to send the schedule are different, Perform # 3-9, otherwise perform steps # 3-12 (step # 3-8), and select the next schedule of the next fetched schedule (step # 3-9), if no selections are made Perform the process again from # 3-1 (step # 3-10), and if there is a selection, obtain the schedule transfer time (step # 3-11) and perform the process again from step # 3-7 (step # 3-10). In 3-8, if the current time> transmission time and the previous transmission time ≠ transmission time, the transmission time of the selected schedule is saved as the previous transmission time (step # 3-12), and the schedule is transmitted (step # 3-13). Write to a file in a specific directory or store it separately in the database (step # 3-14), delete the record of the transferred schedule from the entire table (step # 3-15), and add the next new record of the next fetched schedule Select (step # 3-16), if there is a selection, perform steps # 3-12, otherwise The process is performed again from step # 3-1 (step # 3-17), and is obtained again from step # 3-7 (step # 3-18).

The personal iterative table updating algorithm according to the fourth aspect of the present invention fetches all kinds of the iterative schedules (step # 1) and selects one of them (step # 2) when the appropriate date arrives, and selects the selected personal iteration table. If there is no type, then it is assumed that there is no more work to be done, and if there is no type selected, the operation continues from step # 4 (step # 3), followed by information about the personal repeating table, that is, Store the name of the personal repetition table, the time to start sending the schedule, the user ID, the recurring cycle date, etc. (step # 4), fetch all of the user's information from the personal details table (step # 5), and select one of them. (Step # 6), then store information about the individual user, ie user name, phone number, etc. (step # 7), and use the fetched repeating table name to Fetch schedule information (step # 8), select one of them (step # 9), perform step # 11 if any have been selected, otherwise perform step # 12 (step # 10), and then repeat the transfer After saving the schedule to the full table, perform step # 9 (step # 11), obtain the new date from the start date of sending the recurring schedule (step # 12) to modify the information for that individual repeating table. In step 2, the personal repetition table is updated with new updated contents (step # 13).

In the group repetition table update algorithm according to the fifth aspect of the present invention, when the date to start transmitting the repetition schedule for a group is reached, all the types of the group repetition table are fetched (step # 1-1), and one of them is selected. (Step # 1-2), if there is no group repeat table type selected, it is assumed that there is nothing to work on, and if there is no selected type, the operation is finished from step # 1-4 (step # 1-3) Next, store information about the group repeating table, that is, the name of the group repeating table, the time at which the schedule starts to be transmitted, the group ID, the repeating cycle date, etc. (step # 1-4), and the personal details. Fetch all the information of the users in the group from the table (steps # 1-5), select one of them (steps # 1-6), perform steps # 1-8 if any are selected, and step # Follow steps 1-13 (step # 1 -7) Next, store information about the user to whom the group schedule is to be sent, namely user name, telephone number, etc. (step # 1-8), and fetch all group repeat schedules to be sent to the user from the group repeat table (step # 1-9) Select one of them (step # 1-10), perform steps # 1-6 if there are no selections in the group repeat table, that is, if there are no repeat schedules to send, otherwise step # 1-12 (Step # 1-11), then store the group repeat schedule to be sent to the entire table, then perform step # 1-10 (step # 1-12), and then the date to start sending the group repeat schedule. To obtain a new date, that is, a date to be transmitted next (step # 1-13), and then perform step # 1-2 (step # 1-14) after modifying the corresponding group repetition table with updated new contents. It is done.

The scheduling method of the scheduler according to the present invention having the above characteristics enables the user to input, delete, and modify a schedule and time of the user through a web page of the Internet, and classify the data according to the type of schedule (data) to the database server. Store and transmit the stored schedule to the wireless communication device of each user at a predetermined date and time.

Therefore, the scheduling method of the scheduler according to the present invention can be applied to all communication devices (for example, mobile phone, beep, etc.), and by inputting a schedule using a web page, it is convenient to input a schedule, and all processing is performed. By being done inside the computer, the overhead in the mobile phone can be reduced.

In addition, by not only complex schedules of individuals, but also collectively transmits schedules to wireless communication devices of various users related to a specific schedule, when used in a society or a company can be used as a more convenient contact network for everyone involved.

For example, a scheduler may be installed on a server (workstation) of a specific company to form a large group of companies as well as individual work management. In addition, related groups such as departments and position units within the company can be formed in another group, so that the company's annual or daily schedules can be sent to all the company's people (even those outside the company) for more efficient management. Furthermore, each department can enter a schedule within that department to more efficiently and quickly handle the tasks that department must perform. In addition, by forming a group for each position, by transmitting a work schedule corresponding to each position, it is possible to organize the company employees.

(Example)

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

1 illustrates a general relationship between a scheduler and a wireless communication device. A web browser (1 (usually, Netscape or Explorer)), which is a tool for a user to enter and change a schedule by accessing a specific homepage using the Internet, A web server (2) serving to enable the user to use the Internet, a CGI program unit (3) for inputting schedule information by the user, a database server (4) for storing information input by the user, and the database server And a daemon program unit 5, a host server 6 (host server of each telecommunication company), and a wireless communication device 7, which transmits the schedule stored in (4) at a predetermined date and time.

The CGI program unit 3, the database server 4, and the daemon program unit 5, which are the main components of the present invention configured as described above, will be described in more detail.

First, the CGI program unit 3 stores the schedule input by the user in the database server 4, changes the contents in the database server 4 to new contents, and displays the input or changed contents so that the user can know the contents. Output to

In general, a homepage without CGI functions has a static function of simply displaying a document in a web browser, whereas adding a function such as CGI or Java to the user can request a desired operation on the homepage. You have a dynamic function that can output the results. Therefore, the CGI program unit is required for the user to input his schedule through the homepage.

Next, the database server 4 stores data input by the user through the CGI program unit 3, that is, data such as a user's schedule, user account (ID), password (PASSWORD), and telephone number.

Next, the daemon program unit, which is always running when the workstation is running and always ready in the system (workstation) because the user cannot know when to request a job, is a schedule stored in the database server 4. It checks the current date, reads the current time, and sends the same schedule to the appropriate user. Therefore, since the schedule time input by the user varies, the daemon program unit is always in the ready state in order to check every hour of the system and read the same schedule.

As described above, when the schedule is transmitted to the appropriate user, it is not directly transmitted to the wireless communication device 7, but is transmitted to each host server 6 once, and then transmitted to the wireless communication device 7 there again. The problem in this case is that if there is a lot of call or a lot of work in the system, the contents of the schedule sent to the user may be delayed.

In order to solve the above problems, the schedule can be sent from 30 minutes up to 50 minutes (or more) by adding a function that can be transmitted before the scheduled time, so that the transmission is delayed by 30 minutes statistically. To prevent delays.

Alternatively, the transfer of schedules within a workstation is performed in the same way as the transfer of e-mail. If a schedule is not sent, it is usually set to resend every 30 minutes. In addition, if the retransmission time is set to 10 minutes (the setting time can be changed), the transmission delay of the schedule can be reduced.

Therefore, if the system setting is changed as described above, the delay of the schedule transfer time is hardly a problem.

That is, the user inputs and modifies his schedule using the web browser 1 and the input schedule is stored and modified in the database server 4 by the CGI program unit 3. Next, the contents stored in the database server 4 are always checked and a schedule is transmitted to the corresponding user when a predetermined time is reached.

Hereinafter, an embodiment of the present invention will be described in more detail by dividing the data input into the database by the user and storing the data in the database at a suitable time.

First, the part which a user inputs data through the web and stores it in the database server 4 is described.

In general, since a schedule of several persons is input using the Internet, the user's input is processed using the CGI program unit as described above.

In general, a user's input should be sent equally to the details of an individual user or group, such as the user's telephone number, ID, password, irregular schedules such as appointments, regular schedules such as work or classes, and multiple people. Group schedules to do. Such previously input contents may be modified and input as new contents.

The CGI program unit divides data by type of user input on the web and stores them in different tables (units that group the data) in the database.

If the schedule is divided into two categories according to the input contents, the schedule is transmitted only to the user who inputs the schedule, the schedule is protected from the addition and modification of the schedule, and the personal schedule that other people cannot involve, The same content schedule is sent to several people with the same schedule at the same time, and the addition and modification of the schedule can be done by all the users in the group or by the person who manages the group schedule. Can be divided into group schedules.

The above-described personal schedule and group schedule are divided into regular schedules and irregular schedules as shown in Table 1.

Table 1

Personal schedule Group schedule A regular sketch For example, a schedule that occurs repeatedly for a specific person on a specific date, such as a class. A group of schedules that occur repeatedly over a specific date for a specific group Irregular Schedule For example, an unscheduled schedule that occurs at an unscheduled time, such as an appointment. A schedule that affects all individuals in a group and does not repeat

In addition, the database consists of several tables, and the data input by the user is classified into various types and stored in different tables. Therefore, necessary tables are generated according to the type of data input by the user, and the data in each table has a common feature, which is efficiently performed when modifying or deleting existing stored data. Table 2 below describes the types of tables in the database and the characteristics of each table.

[Table 2]

individual group Detail Table Stores details of an individual, such as the person's phone number, personal ID, and password Stores the details of the group, such as group ID and password, users in the group, and administrators Repeat Table Only schedules that are repeatedly sent according to individual users and dates are saved under separate names.Therefore, multiple repeating tables exist according to users or dates. Only schedules that are repeatedly sent according to group and date are saved under separate names.Therefore, multiple repeating tables exist according to group or date. Full table The contents of the detail table are used to store the schedule time and contents to be sent to users included in an individual or group. In this case, the recurring schedule is first stored in the recurring table and then copied to the entire table for transmission to the user.

2 illustrates an algorithm in which a user inputs data through a web and stores the data in a database.

As shown in Fig. 2, when a user is subscribed, an ID and password are inputted, and the inputted ID and password are compared with the contents of the personal details table and the group details table. The process proceeds to step A (indicated by A), and the process of group schedule (indicated by B) in the case of a group ID.

If it is not subscribed, check whether it is an individual or a group, and if it is an individual, enter data into the personal details table. If it is a group, enter data into the group details and then perform the steps as described above.

FIG. 2A illustrates an algorithm continuously following the algorithm of FIG. 2, and illustrates an algorithm for processing addition, deletion, and modification of a personal schedule in an algorithm in which a user inputs data through a web and stores the data in a database.

Similarly, FIG. 2B shows an algorithm that is continuously following the algorithm of FIG. 2, and shows an algorithm for processing group addition, deletion, and modification in an algorithm in which a user inputs data through a web and stores it in a database.

2A and 2B, both a personal schedule and a group schedule are divided into a general schedule and a recurring schedule to add, delete, or modify a schedule.

Next, a description will be given of a part of transmitting the contents stored in the database at an appropriate time.

As described above, the schedule stored in the database is always transmitted to the user's wireless communication device when the appropriate time is compared with the current time. In this regard, the present embodiment will be described in more detail with reference to Figure 3 because the processing of the algorithm is stored in the database server, and the time the schedule is transmitted is also very diverse.

First, an algorithm (algorithm of a program that is always executed while the system is running) will be described.

As shown in Fig. 3, a database server is connected to read contents stored in the database (step # 1), and the database is selected from this database server (step # 2).

Next, the current time and date are obtained (step # 3-1). At this time, the time in the system is generated with the hour, minute and second values, where all of the seconds are set to zero. Subsequently, if the current time obtained in step # 3-1 is equal to the repetition time, the personal repetition table and the group repetition table are updated. If the current time and repetition time are not the same, the next step (step # 3-3) is performed. (Step # 3-2).

The repetition time described above means a time for updating the repetition table, and the individual repetition table update algorithm and the group repetition table update algorithm will be described below.

The following steps are repeated indefinitely until the system shuts down.

Fetch all schedule information corresponding to the current date from the entire table (step # 3-3). At this time, all schedules of the corresponding date are fetched by time order and stored in memory, and then selected one by one. Thereafter, one of the fetched records is selected (step # 3-4).

If there is no content selected, it means that there is no schedule to be transmitted on that day, the system is temporarily stopped, and the process returns to step # 3-1 again (step # 3-5).

Next, obtain the transmission time of the fetched schedule (step # 3-6), and if 'current time ≥ transmission time' or 'previous transmission time = transmission time', i.e. the current time and the time to send the schedule are the same or present If the time is later than the time to send, or if the time to send the schedule and the time to send the schedule are the same, the next step (step # 3-8) is performed. Otherwise, the operation is repeated from step # 3-1. (Step # 3-7).

In step # 3-7, it is possible to solve the case where there are many schedules to be transmitted by comparing the previous transmission time with the schedule transmission time. For example, assuming that there are many schedules to be transmitted at 4:30, if we compare only the current time without comparing the previous transmission time with the scheduled transmission time, all schedules to be transmitted at 4:30 must be processed before 4:31. do. However, in comparison, even after 4:30, all schedules having the same starting time can be transmitted.

Next, if 'current time> transmission time and previous transmission time ≠ transmission time', i.e., if the transmission time has passed and the previous transmission time and the time to transfer the schedule are different, perform the next step # 3-9; Perform 3-12 (step # 3-8). Here, the part of the 'and previous transmission time ≠ transmission time' must be entered. This is because the schedule transmission must continue if the transmission time is the same as the previous transmission time even if the transmission time is later than the current time.

Next, select the next new record (another schedule that needs to be transferred) of the fetched schedules (steps # 3-9), perform steps # 3-11 if you have selected, otherwise step # 3- Perform again from 1 (step # 3-10).

If there is a selected content, the schedule transfer time is obtained (step # 3-11), and the process is performed again from step # 3-7 (step # 3-10).

In step # 3-8, if the current time> transmission time and the previous transmission time ≠ transmission time, the transmission time of the selected schedule is stored as the previous transmission time (step # 3-12) and the schedule is transmitted (step # 3-13) Write to a file in a specific directory or keep it in a database (step # 3-14). The record of the transferred schedule is deleted from the whole table (step # 3-15).

Next, select the next new record from the fetched schedule (step # 3-16), and if there is a selection, perform steps # 3-12; otherwise, start again from step # 3-1 (step # 3-17).

Obtain the transmission time of the schedule selected in the next step (step # 3-18), and perform again from step # 3-7.

Next, when an appropriate date (date to be repeated) is reached, a personal iteration table update algorithm for storing the contents of the iterative table in the entire table and updating the iterative table with new contents will be described with reference to FIG.

First, as shown in FIG. 4, when the appropriate date (the date when the recurring schedule starts to be transmitted) is fetched, all the types of the recurring schedule are fetched (step # 1), and one of them is selected (step # 2).

If there is no type of personal repeating table selected, it is assumed that there is no content to work any more, and if there is no selected type, work is continued from the next step (step # 4) (step # 3). ).

Subsequently, the information about the repetition table, that is, the name of the repetition table, the date when the schedule starts to be transmitted, the user ID, the repetition period date, and the like are stored (step # 4), and the user's information is fetched from the personal details table ( Step # 5) Select one of them (step # 6).

Next, store information about the individual user, that is, user name, telephone number, etc. (step # 7), and fetch all the schedule information from the iteration table using the fetched repeating table name (step # 8), one of them (Step # 9; select the schedules in the individual repeating tables one by one and store them in the entire table).

If there is selected content, the next step (step # 11) is performed; otherwise, step # 12 is performed (step # 10).

Subsequently, in step # 11, the recurring schedule to be transmitted is stored in the entire table, and then step # 9 is performed.

In step # 12, obtain the new date, i.e., the next date to start sending the recurring schedule to modify the information for the individual repeating table, and in step # 13, update the individual repeating table with the updated contents. After correcting, perform step # 2.

Next, the group iteration table update algorithm will be described with reference to FIG.

The group iterative table update algorithm is very similar to the individual iterative table update algorithm, but the algorithm is slightly different because of the large number of users compared to the individual and the use of a different table than the personal iteration schedule.

First, as shown in FIG. 5, when the date to start transmitting the repetition schedule for the group is reached, all types of group repetition tables are fetched (step # 1-1) and one of them is selected (step # 1-2). .

If there is no selected group repeating table type, it is assumed that there is no content to work any more, and the operation is terminated. Otherwise, if the selected type exists, the operation is performed from the next step (step # 1-4) (step # 1). -3).

Next, information about the group repeating table, that is, the name of the group repeating table, the time at which the schedule starts to be transmitted, the group ID, the repeating cycle date, and the like are stored (step # 1-4), and the user belonging to the group in the personal details table. All of the information is fetched (step # 1-5), and one of them is selected (step # 1-6: group members are selected one by one and stored in the entire table until all are selected).

If there is a selected content, the next step (step # 1-8) is performed; otherwise, step # 1-13 is performed (step # 1-7).

Next, store information about the user to whom the group schedule is to be sent, namely user name, telephone number, etc. (step # 1-8), and fetch all group recurring schedules to be sent to the user from the group repetition table (step # 1- 9) Select one of them (Step # 1-10: Select the schedules in the group repeat table one by one and store them in the whole table).

If there is no content selected in the group repetition table, that is, if there is no repetition schedule to be transmitted, step # 1-6 is performed, otherwise the next step (step # 1-12) is performed (step # 1-11).

Subsequently, in step # 1-12, the group repetition schedule to be transmitted is stored in the entire table, and then step # 1-10 is performed.

Next, obtain the new date, that is, the date you want to send the group recurrence schedule next (step # 1-13), modify the group repetition table with the updated new contents, and then step # 1-2. Perform (step # 1-14).

As described above, the scheduling method of the scheduler according to the present invention is applicable to all wireless communication devices (for example, a mobile phone, a beeper, etc.), the input is convenient by inputting a schedule using a web page, and all processing is performed. This can be done inside the computer, reducing the overhead in the phone.

In addition, not only a complicated schedule of an individual but also a schedule can be collectively transmitted to a wireless communication device of several users who are related to a specific schedule, so that all users can handle their tasks more efficiently and quickly.

Claims (5)

In the scheduling method of the scheduler which inputs a schedule via the internet, transmits the schedule content to the wireless communication device 7 at the predetermined time, and informs. The CGI program unit 3 stores the schedule entered by the user in the database server 4, changes the contents of the database server 4 to new contents, and outputs the input or changed contents to the screen so that the user can know the contents. and, The database server 4 stores data input by the user through the CGI program unit 3, that is, data such as a user's schedule, account, password, telephone number, etc. The daemon program unit 5 is always ready in the system, checks the schedule stored in the database server, reads the contents of the current date and the current time, and then transmits the same schedule as the current time to a predetermined user. Scheduling method of the scheduler. The data processing in the database server (4) according to claim 1, wherein the data processing in the database server (4), if a user is subscribed, receives an ID and password and converts the input ID and password into contents of a personal details table and a group details table. In comparison, the personal ID handles the addition, deletion / modification of the personal schedule, and the group ID handles the addition, deletion / modification of the group schedule, If not, it checks whether it is an individual or a group, if it is an individual, enters data into the personal details table, if it is a group, enters data into the group details table and processes it. The personal schedule and the group schedule is divided into a regular schedule and an irregular schedule, divided into a general schedule and a recurring schedule, the schedule of the scheduler, characterized in that the addition, deletion / modification of the schedule is made. The algorithm according to claim 1 or 2, wherein the algorithm for transmitting the contents stored in the database server 4 at a predetermined time is: In order to read the contents stored in the database, the database server 4 is connected (step # 1) to select the database (step # 2), Obtain the current time and date (step # 3-1). If the current time and the repetition time are the same, update the personal repetition table and the group repetition table. If the current time and the repetition time are not the same, perform step # 3-3 (step # 3). 3-2), Fetch all the schedule information corresponding to the current date from the entire table in chronological order (ascending order) (step # 3-3), and select one of them in chronological order (step # 3-4), If there is no content selected in step # 3-4, it means that there is no schedule to be transmitted on that day, the system is temporarily stopped, and the process returns to step # 3-1 again (step # 3-5), If there is content selected in step # 3-4, obtain the fetched transmission time (step # 3-6), and if the current time and the schedule transmission time are the same or the current time is later than the transmission time, or before the previous transmission time If the schedule transmission time and the schedule transmission time are the same, the operation is performed from step # 3-8, otherwise, the operation is performed again from step # 3-1 (step # 3-7), If the time to send is past and the time to send the schedule is different than the previous time, perform step # 3-9, otherwise perform step # 3-12 (step # 3-8), Next, select the next schedule among the fetched schedules (step # 3-9). If there is no selection, perform step # 3-1 again (step # 3-10). (Step # 3-11) again from step # 3-7 (step # 3-10), In step # 3-8, if the current time> transmission time and the previous transmission time ≠ transmission time, the transmission time of the selected schedule is stored as the previous transmission time (step # 3-12), and the schedule is transmitted (step # 3). -13) write to a file in a specific directory or keep it in a database (step # 3-14), delete the record of the transferred schedule from the entire table (step # 3-15), Next, select the next new record in the fetched schedule (step # 3-16), if there is a selection, perform step # 3-12; otherwise, start again from step # 3-1 (step # 3). 3-17), Obtaining time to transmit the selected schedule and performing again from step # 3-7 (step # 3-18). The algorithm of claim 1 or 2, wherein the personal iteration table update algorithm comprises: When the appropriate date is reached, fetch all of the repeating schedule types (step # 1) and select one of them (step # 2), If there is no type of personal repeating table selected, it is assumed that there is nothing to work on, and if it is not selected, the operation is terminated. Subsequently, the information about the personal repetition table, that is, the name of the personal repetition table, the time at which the schedule starts to be transmitted, the user ID, the repetition period date, etc. are stored (step # 4), and all the user information is fetched from the personal details table. (Step # 5) to select one of them (step # 6), Next, store information about the individual user, that is, user name, telephone number, etc. (step # 7), and fetch all the schedule information from the iteration table using the fetched repeating table name (step # 8), one of them Select (step # 9), If there is something selected, perform step # 11, otherwise perform step # 12 (step # 10), Subsequently, the recurring schedule to be transmitted is stored in the entire table and step # 9 is performed (step # 11). To modify the information for the individual repeating table, obtain the new date, that is, the date to send the next one (step # 12), and then modify the individual repeating table with the updated contents. Performing the step # 2 (step # 13). The method according to claim 1 or 2, wherein the group repetition table update algorithm, When it is time to start sending recurring schedules for a group, fetch all types of group repetition tables (step # 1-1) and select one of them (step # 1-2), If no group repeat table type is selected, it is assumed that there is nothing to work on, and the operation is terminated. Otherwise, the operation starts from step # 1-4 (step # 1-3), Next, store information about the group repetition table, that is, the name of the group repetition table, the time when the schedule starts to be transmitted, the group ID, the repetition period date, etc. (step # 1-4), and belong to the group in the personal details table. Fetch all of the user's information (step # 1-5) and select one of them (step # 1-6), If there is a selection, perform steps # 1-8; otherwise, start from step # 1-13 (step # 1-7), Next, store information about the user to whom the group schedule is to be sent, namely user name, telephone number, etc. (step # 1-8), and fetch all group recurring schedules to be sent to the user from the group repetition table (step # 1- 9) select one of them (step # 1-10), If there is no content selected in the group repeat table, that is, if there is no repeat schedule to send, perform steps # 1-6, otherwise perform steps # 1-12 (step # 1-11), Next, save the group recurring schedule to be sent to the entire table and perform step # 1-10 (step # 1-12), Next, obtain the new date, that is, the date to be sent next (Step # 1-13), and then modify the corresponding Group Iteration Table with the updated new contents, then Step # 1-2. (Step # 1-14) performing the scheduling method of the scheduler.