Method for supporting generation of meeting schedule including non-subscribers of appointment-making service, and system therefor

Abstract

The present invention relates to a method for generating a meeting schedule, and to a method for generating a meeting schedule, which includes at least some of friends stored in a phone book of a user terminal, the method comprising determining, on the basis of whether friends invited to a meeting have subscribed to an appointment-making service, the type of a meeting schedule generation request to be transmitted to the friends, and transmitting the determined type of the meeting schedule generation request to a terminal of each friend, and thus a meeting schedule can be conveniently generated even when generating a meeting schedule including friends that have subscribed to the appointment-making service and friends that have not subscribed to the appointment-making service.

Description

Method and system for supporting the creation of meeting schedules including non-subscribers to appointment-making services

[0001] A method and system for supporting the creation of a meeting schedule between multiple users are disclosed.

[0002] Recently, with the increasing number of students, job seekers, and working professionals preparing for certifications or language exams, study groups with multiple people are becoming more active. Beyond study groups, various forms of gatherings are also increasing, such as team project meetings, club gatherings, and year-end parties. Hosting these gatherings requires gathering the opinions of attendees to determine a meeting location and schedule. However, considering the schedules of multiple participants can be cumbersome and time-consuming.

[0003] There are several methods for making appointments for these meetings, such as the elimination method (eliminating unavailable dates on a first-come, first-served basis from the proposed period) and the crossover method (selecting each available date from the proposed period, crossing them, and deriving possible dates from the intersection), but they could not satisfy all participants, and a method that could maximize satisfaction was needed.

[0004] An example of a prior art related to an appointment-making service that facilitates the hosting of various types of gatherings is Korean Patent No. 10-1943854, "Method for Providing a Meeting Scheduling Service and System for Providing a Meeting Scheduling Service." This prior art technology automatically collects information about the schedules and departure points of members participating in an offline gathering, determines and recommends a reasonable meeting date and location for all members, thereby alleviating the burden of members' meeting schedules and location decisions.

[0005] However, in the case of these conventional technologies, the meeting schedule creation service is provided only to users who have registered with the service, so if a host who hosts a meeting wants to include a non-subscriber who has not registered with the service in the meeting, he or she must contact the non-subscriber separately and coordinate the schedule, which is cumbersome.

[0006] The purpose is to improve user convenience by supporting the easy and convenient creation of meeting schedules that include users who are not registered as members of the appointment-making service, while providing a method for creating meeting schedules that allows the service to be more easily expanded by informing users who are not registered as members of the appointment-making service in situations where the number of registered members of the appointment-making service is not sufficient.

[0007] Additionally, it provides a method to create a meeting schedule to identify the meeting schedule that can bring maximum satisfaction to the members and to set an appointment on that date.

[0008] In addition, the purpose is to provide a method for creating a meeting schedule that can support the rapid adaptation of new members to the organization through appointment-making algorithms, information sharing and internal intimacy among organization members, and appointment-making between mentors and mentees.

[0009] Additionally, the appointment-making algorithm is utilized as a new business model in the field of human resource management to provide a method for creating meeting schedules that can successfully achieve human resource onboarding in companies.

[0010] According to one aspect of the present invention, a method for creating a meeting schedule includes the steps of: receiving, from a terminal of a user who has registered as a member of an appointment-making service, a request for loading a friend list for creating a meeting hosted by the user; generating the friend list by classifying and sorting each friend stored in a phone book of the user's terminal into a first group or a second group, and providing the generated friend list to the user's terminal; receiving, from the user's terminal, a request for creating a meeting schedule including at least one friend sorted in the friend list; determining a type of a meeting schedule confirmation request to be transmitted to the terminal of each friend based on a group to which each friend included in the meeting schedule belongs, and transmitting the meeting schedule confirmation request to the terminal of each friend based on the determined type; and confirming the meeting schedule created by the user based on at least one of a confirmation response from the terminal of the user or the terminal of each friend.

[0011] The method may further include: receiving a membership registration request for the appointment-making service from the user's terminal; and, in response to the membership registration request, issuing a user ID for the user and storing the ID in a user ID table, wherein the user IDs issued to members of the appointment-making service and the phone numbers of each member may be matched and stored in the user ID table.

[0012] The step of generating the friend list by classifying and sorting each friend stored in the phone book of the user's terminal into a first group or a second group, and providing the generated friend list to the user's terminal may include the step of determining whether the user ID has been issued to each friend based on the phone number of each friend stored in the phone book of the user's terminal; and the step of generating the friend list by classifying and sorting friends to whom the user ID has been issued into the first group and friends to whom the user ID has not been issued into the second group.

[0013] The types of the above meeting schedule confirmation request include a first type in which a notification is sent as a pop-up through an application linked to the appointment-making service and a second type in which a notification is sent as an SMS text message, and the step of sending a meeting schedule confirmation request to each friend's terminal according to the determined type may include sending a meeting schedule confirmation request of the first type to a terminal of a friend belonging to the first group among friends included in the meeting schedule, and sending a meeting schedule confirmation request of the second type to a terminal of a friend belonging to the second group.

[0014] The step of confirming the meeting schedule created by the user based on at least one of the confirmation responses from the user's terminal or the terminals of each friend may include: when all friends included in the meeting schedule created by the user belong to the first group, confirming the meeting schedule based on receiving confirmation responses from the terminals of all the friends; when all friends included in the meeting schedule created by the user belong to the second group, confirming the meeting schedule based on receiving confirmation responses from the user's terminal; and when some of the friends included in the meeting schedule created by the user belong to the first group and the rest belong to the second group, confirming the meeting schedule based on receiving confirmation responses from the terminals of each friend belonging to the first group.

[0015] After issuing a user ID for the user, the method may further include issuing a relationship ID for a relationship between the user and each friend stored in the phone book of the user's terminal and storing the relationship ID in a relationship ID table, wherein the relationship ID is assigned to the relationship with each friend based on the user, and the relationship ID stored in the relationship ID table may be equal to the total number of friends stored in the phone book of the terminal of each member subscribed to the appointment-making service.

[0016] The above relationship ID table includes the relationship ID, the user ID of the user, and the user ID and phone number of each friend, and the step of issuing the relationship ID and storing it in the relationship ID table includes the step of determining whether a user ID has been issued for each friend based on the phone number of each friend; as a result of the determination, a friend to whom the user ID has been issued may store the user ID and phone number issued for the friend in the relationship ID table, and a friend to whom the user ID has not been issued may store the phone number of the friend in the relationship ID table.

[0017] After the above relationship ID table is created, when a friend classified into the second group registers as a new member, the relationship ID table can be updated by storing the user ID of the new member in correspondence with the relationship ID previously issued for the relationship between the user and the new member in the relationship ID table based on the new member's phone number.

[0018] According to another aspect of the present invention, a meeting schedule creation system comprises: an appointment creation server including a processor that receives a request for loading a friend list for creating a meeting hosted by a user from a terminal of a user who has registered as a member of an appointment creation service, classifies and sorts each friend stored in the phone book of the user's terminal into a first group or a second group to create the friend list, provides the created friend list to the user's terminal, receives a request for creating a meeting schedule including at least one friend sorted in the friend list from the user's terminal, determines a type of a meeting schedule confirmation request to be transmitted to each friend's terminal based on a group to which each friend included in the meeting schedule belongs, transmits the meeting schedule confirmation request to each friend's terminal based on the determined type, and confirms the meeting schedule created by the user based on at least one of a confirmation response from the user's terminal or each friend's terminal; and a plurality of terminals that transmit and receive data with the appointment creation server through a communication network.

[0019] In creating a meeting schedule that includes at least some of the friends stored in the phone book of the user's terminal, the type of meeting schedule creation request to be sent to the friend is determined based on whether the friend invited to the meeting is a friend who has signed up for the appointment-making service, and the meeting schedule creation request of the determined type is transmitted to each friend's terminal, thereby enabling the technical effect of conveniently creating a meeting schedule that includes friends who have already signed up for the appointment-making service and friends who have not yet signed up.

[0020] In addition, in situations where the number of members who have signed up for the appointment-making service is not sufficiently large, it has the effect of making it easier to spread the service by being able to inform users who have not signed up for the appointment-making service.

[0021] The present invention considers the schedules of all members attending a meeting, identifies a meeting schedule that maximizes their satisfaction, and sets an appointment on that date. Furthermore, the present invention facilitates information sharing and fosters internal intimacy among members of an organization through an appointment-making algorithm. Furthermore, by scheduling appointments between mentors and mentees, the present invention supports the rapid organizational adaptation of new members, who are often referred to as mentees.

[0022] In addition, the present invention utilizes the appointment-making algorithm as a new business model in the field of human resource management, enabling successful human resource onboarding for companies. This effect is not limited to the aforementioned, and other benefits may be derived from the following explanation.

[0023] Figure 1 is a configuration diagram of a meeting schedule creation system according to one embodiment of the present invention.

[0024] Figure 2 is a flowchart of a meeting schedule creation method according to one embodiment of the present invention.

[0025] FIG. 3 is a diagram illustrating a user ID table according to one embodiment of the present invention.

[0026] FIG. 4 is a diagram illustrating a relationship ID table according to one embodiment of the present invention.

[0027] FIG. 5 and FIG. 6 are diagrams illustrating a portion of a process for making an appointment using an application linked to an appointment making server according to one embodiment of the present invention.

[0028] FIG. 7 is a diagram illustrating a promise ID table according to one embodiment of the present invention.

[0029] FIG. 8 is a diagram illustrating a promise participant table according to one embodiment of the present invention.

[0030] FIG. 9 is a diagram illustrating a user ID table with a new member added according to one embodiment of the present invention.

[0031] FIG. 10 is a diagram illustrating an updated relationship ID table with a new member added according to one embodiment of the present invention.

[0032] FIG. 11 is a diagram showing an appointment setting process when there are two participants according to one embodiment of the present invention.

[0033] FIG. 12 is a diagram showing an appointment setting process when there are three participants according to one embodiment of the present invention.

[0034] FIG. 13 is a diagram showing an appointment setting process when there are four participants according to one embodiment of the present invention.

[0035] FIG. 14 is a diagram illustrating an appointment setting process when there are five or more participants according to one embodiment of the present invention.

[0036] FIG. 15 is a drawing showing a screen on an application linked with an appointment-making server according to one embodiment of the present invention.

[0037] FIG. 16 is a diagram illustrating a lightning appointment making process according to one embodiment of the present invention.

[0038] Figure 17 is a diagram showing a process of making an appointment between a mentor and a mentee according to one embodiment of the present invention.

[0039] The detailed description of the present invention, which follows, refers to the accompanying drawings, which illustrate specific embodiments in which the present invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the present invention. It should be understood that the various embodiments of the present invention, while different from each other, are not necessarily mutually exclusive. For example, specific shapes, structures, and characteristics described herein may be implemented in other embodiments without departing from the spirit and scope of the present invention.

[0040] Furthermore, it should be understood that the location or arrangement of individual components within each disclosed embodiment may be modified without departing from the spirit and scope of the present invention. Therefore, the following detailed description is not intended to be limiting, and the scope of the present invention, if properly described, is defined solely by the appended claims, along with the full scope equivalents thereof. Similar reference numerals in the drawings designate the same or similar functions throughout.

[0041] Hereinafter, in order to enable a person having ordinary skill in the art to easily practice the present invention, preferred embodiments of the present invention will be described in detail with reference to the attached drawings.

[0042] The embodiments of the present invention described below relate to a method and system for supporting the creation of a meeting schedule that includes non-subscribers to the service. Hereinafter, the method for supporting the creation of a meeting schedule that includes non-subscribers to the service may be briefly referred to as a "meeting schedule creation method," and the system for supporting the creation of a meeting schedule that includes non-subscribers to the service may be referred to as a "meeting schedule creation system." Meanwhile, in the embodiments of the present invention, the creation of a meeting schedule is accomplished by setting up an appointment between the participants of the meeting.

[0043] FIG. 1 is a diagram schematically illustrating the configuration of a meeting schedule creation system (1) according to one embodiment of the present invention. Referring to FIG. 1, the meeting schedule creation system (1) according to the embodiment of the present invention is comprised of an appointment scheduling server (100) and multiple user terminals (140).

[0044] The appointment-making server (100) includes a communication unit (110), a processor (120), and a database (130), and provides service users with an appointment-making service that allows them to conveniently create meeting schedules for multiple users. Each user can utilize the services provided by the appointment-making server (100) through an application linked to the appointment-making server (100).

[0045] The appointment-making server (100) can transmit and receive information to and from each of a plurality of user terminals (140) through a communication unit (110). The communication unit (110) of the appointment-making server (100) can be implemented with various communication technologies. That is, Wi-Fi, Wideband CDMA (WCDMA), High Speed ​​Downlink Packet Access (HSUPA), High Speed ​​Uplink Packet Access (HSPA), High Speed ​​Packet Access (HSPA), Mobile WiMAX, WiBro, Long Term Evolution (LTE), 5G, 6G, Bluetooth, Infrared Data Association (IrDA), Near Field Communication (NFC), Zigbee, wireless LAN technology, etc. can be applied. In addition, when providing a service while connected to the Internet, TCP / IP, which is a standard protocol for information transmission on the Internet, can be followed.

[0046] The database (130) stores various information necessary for providing an appointment-making service. For example, the database (130) stores not only the names and phone numbers of members who have subscribed to the appointment-making service, but also information on meeting schedules created through the appointment-making service provided by the appointment-making server (100), a user ID table, a relationship ID table, an appointment ID table, and an appointment participant table.

[0047] The process performed by the processor (120) of the appointment-making server (100) of this embodiment will be examined below with reference to FIG. 2.

[0048] Each user's terminal (140) can use the appointment-making service provided by the appointment-making server (100) by receiving information from the appointment-making server (100) or providing information to the appointment-making server (100). In this embodiment, each user's terminal (140) may be any digital device that has a memory means and a microprocessor mounted thereon and has computational capabilities while performing communication, such as a desktop computer, a laptop computer, a workstation, a PDA, a web pad, a mobile phone, a smart remote control, and various IOT main devices, and may correspond to a terminal according to the present invention. Hereinafter, each user's terminal may be referred to as a user terminal. For example, the user's terminal may be referred to as a user terminal. Although the name of each terminal is described as 'user's terminal' in FIG. 1, this does not mean multiple terminals owned by the same user, but rather means terminals owned by each subject (user and friend), as will be readily understood by those skilled in the art.

[0049] FIG. 2 is a flowchart illustrating a method for creating a meeting schedule according to one embodiment of the present invention. The method for creating a meeting schedule according to this embodiment relates to a method for creating a meeting schedule between multiple users. The meeting schedule includes participant information, including information about the host (user) hosting the meeting and at least one friend who has received a meeting participation request from the host.

[0050] Additionally, people stored in the user terminal's phone book are referred to as "friends" in the following. In this embodiment, "friend" refers to people stored in the user terminal's phone book, regardless of their relationship with the user, age, status, or social relationship.

[0051] In step S201, the processor (120) of the appointment-making server (100) issues a user ID to the user in response to the user registering as a member of the appointment-making service, and stores the issued user ID and user information in a user ID table.

[0052] In this embodiment, the user ID table is a table containing information on users who have subscribed to the appointment-making service, and the user ID table stores each user's name, phone number, and user ID issued by the processor (120) in a matching manner. The user ID table may be stored in the database (130) of the appointment-making server (100).

[0053] Referring to FIG. 3, the processor (120) issues user ID 1 to 'Hong Gil-dong' who has signed up for the appointment-making service, user ID 2 to 'Im Kkeok-jeong', and user ID 3 to 'Song Joong-ki', and matches the user IDs issued to each user with each user's name and phone number and stores them in the user ID table. In this way, the user ID table includes information on all users who have signed up for the appointment-making service.

[0054] In order to create such a user ID table and issue a user ID, the appointment scheduling server (100) must collect the user's phone number when registering as a member, and must obtain permission from the user to access the phone book stored in the user terminal for each step performed by the processor (120).

[0055] Although FIG. 3 shows that the user ID for each user is composed of numbers, this is only an example, and the user ID may also be composed of various letters, numbers, and symbols that can identify multiple different users.

[0056] In step S202, the processor (120) issues a relationship ID for the relationship between a user who registered as a member in step S201 and friends whose phone numbers are stored in the phone book of the user terminal, and stores the issued relationship ID in a relationship ID table.

[0057] In this embodiment, the relationship ID is identification information assigned to each relationship with each friend stored in the user terminal's phone book based on the user. When the user registers as a member of the appointment-making service, the processor (120) reads the user's phone book information and issues a relationship ID for each of the friends stored in the phone book and the user's relationship. In this embodiment, the processor (120) assigns a relationship ID to each relationship between the user and each friend stored in the user's phone book, regardless of whether or not the friend is registered as a member of the appointment-making service.

[0058] Referring to Figure 4, based on a user Hong Gil-dong who has been issued a user ID of 1, a relationship ID of 101 is issued for the relationship between Hong Gil-dong and his friend Im Kkeok-jeong who has been issued a user ID of 2, a relationship ID of 102 is issued for the relationship between Hong Gil-dong and his friend Song Joong-ki who has been issued a user ID of 3, and a relationship ID of 103 is issued for the relationship between Hong Gil-dong and his friend Jeong Ji-hoon who has not registered as a member of the appointment-making service.

[0059] In this embodiment, even if two people have the same relationship ID, if the reference users are different, different relationship IDs are issued. Although not illustrated in FIG. 4, a relationship ID of 101 is issued for the relationship between Hong Gil-dong and Im Kkeok-jeong based on Hong Gil-dong, whereas a relationship ID of 107 may be issued for the relationship between Im Kkeok-jeong and Hong Gil-dong based on Im Kkeok-jeong. Therefore, the number of relationship IDs issued by the processor (120) is greater than the number of users registered for the appointment-making service.

[0060] More specifically, the number of relationship IDs issued by the processor (120) is equal to the total number of friends stored in the phone book of each member's terminal registered for the appointment-making service. For example, if there are a total of 3 members registered for the appointment-making service, and User 1 has 3 friends stored in the terminal, User 2 has 10 friends stored in the terminal, and User 3 has 15 friends stored in the terminal, the number of relationship IDs issued by the processor (120) and stored in the relationship ID table is 28.

[0061] Meanwhile, the processor (120) stores information related to the relationship ID in the relationship ID table based on the phone numbers of friends stored in the phone book of the user terminal. In the present embodiment, the relationship ID table stores the user ID of the user, which serves as the basis for relationship calculation, and the relationship ID issued to at least one of the user IDs and phone numbers of each friend stored in the phone book of the user terminal, in a matched manner.

[0062] In one embodiment of the present invention, the processor (120) determines whether each friend is registered as a member of the appointment-making service using the phone numbers of each friend stored in the phone book of the user terminal. As a result of the determination for each friend, if the friend is registered as a member of the appointment-making service and has a user ID issued, the user ID and phone number of the friend are stored in the relationship ID table, as illustrated in FIG. 4. However, if the friend is not registered as a member of the appointment-making service, only the phone number of the friend is stored in the relationship ID table, as illustrated in FIG. 4.

[0063] In step S203, the processor (120) receives a friend list loading request from the user terminal. In an embodiment of the present invention, the user may request the loading of the friend list to select users to invite to a meeting to be hosted. The user may request the appointment scheduling server (100) to load the friend list for creating a meeting schedule through the appointment scheduling interface provided to the user terminal by the appointment scheduling server (100).

[0064] FIG. 5 illustrates a screen displayed on a user's terminal through an application linked with an appointment-making server (100) during the process of creating a meeting schedule according to an embodiment of the present invention. FIG. 5 illustrates, as an example, a screen from a situation where a user starts creating a meeting schedule to a situation where a request for confirmation of a meeting schedule is sent to a friend. FIG. 5a illustrates an appointment-making interface provided to a user's terminal by the appointment-making server (100) according to an embodiment of the present invention. Referring to FIG. 5a, the appointment-making interface provided to the user's terminal may include a menu (with whom) for selecting participants to attend the meeting and a menu (when) for selecting the date and time of the meeting. By selecting the menu (with whom) for selecting participants to attend the meeting in the appointment-making interface, the user may request the appointment-making server (100) to load a friend list.

[0065] In step S204, the processor (120) responds to the friend list loading request received from the user terminal in step S203, and provides the user terminal with a friend list sorted into first and second groups, in which the friends stored in the phone book of the user terminal are classified. In the present embodiment, the processor (120) can classify each friend into the first group or the second group by determining whether each friend is registered as a member of the appointment-making service based on the phone number of each friend stored in the phone book of the user terminal.

[0066] In this embodiment, the processor (120) can classify friends who are registered as members of the appointment-making service into a first group, and friends who are not registered as members of the appointment-making service into a second group, and can create a friend list, and transmit the created friend list to the user terminal.

[0067] FIG. 5B is a diagram illustrating a friends list generated by the processor (120) and provided to a user terminal according to one embodiment of the present invention. This friends list can be provided to the user terminal through an application linked to the appointment-making server (100). Referring to FIG. 5B, among the three friends (Im Kkeok-jeong, Song Joong-ki, and Jung Ji-hoon) stored in the phone book of the user terminal, it can be confirmed that Im Kkeok-jeong and Song Joong-ki, who were confirmed to have subscribed to the appointment-making service by the processor (120), were classified into the first group (who-it-friends group), and Jung Ji-hoon, who was confirmed not to have subscribed to the appointment-making service, were classified into the second group (phone number friends group), and thus a friends list was generated.

[0068] The friends list provided by the processor (120) may include checkboxes that allow the user to select friends to invite to a meeting. As illustrated in FIG. 5b, the user can select people to invite to a meeting by checking checkboxes corresponding to the names of each friend in the friends list.

[0069] In step S205, the processor (120) receives a request from the user to create a meeting schedule including at least one friend selected from the friend list. The user can select friends to invite to the meeting using the checkboxes provided in the friend list received in step SS204, and then request the appointment scheduling server (100) to create a meeting schedule including the selected friends by selecting the 'Complete Selection' button provided at the top.

[0070] At this time, the processor (120) can prevent the user from accidentally creating an incorrect meeting schedule by floating the friends and the selected date and time again through the appointment-making interface on the terminal of the user who pressed the 'selection completion' button, as shown in FIG. 5c.

[0071] In step S206, the processor (120) determines the type of meeting schedule confirmation request to be transmitted to each friend's terminal based on the group in which each friend is classified in the meeting schedule creation request received from the user terminal, and transmits the meeting schedule confirmation request of the determined type to each friend's terminal.

[0072] In the present embodiment, the processor (120) transmits a first type of confirmation request to each friend included in the meeting schedule creation request if the friend belongs to the first group, and transmits a second type of confirmation request to the friend if the friend belongs to the second group. In the present embodiment, the first type of confirmation request is a meeting schedule notification including the date selected by the user that is sent as a pop-up through the appointment-making application, and the second type of confirmation request is a meeting schedule notification including the date selected by the user that is sent as an SMS text message to the friend's terminal. At this time, as illustrated in FIG. 5d, the processor (120) can induce friends who have not yet subscribed to the appointment-making service to subscribe to the appointment-making service by including a link for signing up for the appointment-making service in the SMS text message sent to the friends belonging to the second group.

[0073] In step S207, the processor (120) may confirm the meeting schedule based on at least one of the responses from the user terminal or each friend's terminal. In an embodiment of the present invention, if all friends invited to the meeting by the user belong to the second group, the processor (120) may determine that the meeting schedule requested by the user is confirmed upon receiving a confirmation response for the meeting schedule from the user terminal. This is because, if all friends invited to the meeting belong to the second group, i.e., if not all friends are registered members of the appointment-making service, a confirmation response for the meeting schedule via the appointment-making application is not possible. Therefore, the meeting schedule created by the user may be confirmed by the user directly confirming the meeting schedule after receiving confirmation of the meeting schedule from each friend via SNS, phone call, etc. The user's confirmation of the meeting schedule may be performed through the meeting schedule confirmation interface provided by the appointment-making server (100), as illustrated in FIG. 6 . The user may confirm the created meeting schedule by selecting the "Confirm Appointment" button provided on the meeting schedule confirmation interface.

[0074] Meanwhile, if all friends invited to the meeting by the user belong to the first group, the processor (120) may determine that the meeting schedule created by the user is confirmed upon receiving a meeting schedule confirmation response from all friends' terminals. This is because, since the meeting is hosted by the user, a confirmation response from the user is unnecessary, and all invited friends can send a meeting schedule confirmation response through the appointment-making application.

[0075] In addition, if the processor (120) receives a meeting schedule confirmation response from the terminals of all friends belonging to the first group and the user's terminal when some of the friends invited to the meeting by the user belong to the first group and the rest belong to the second group, the processor determines that the meeting schedule is confirmed. This is to indicate the intentions of the friends belonging to the second group through the user, considering that the intentions of the friends belonging to the second group regarding the meeting schedule will be directly conveyed to the user who hosted the meeting through SNS, phone, etc.

[0076] In step S208, when the meeting schedule is confirmed in step S207, the processor (120) issues an appointment ID for the confirmed meeting and stores it in the appointment ID table. Each appointment ID is issued each time a meeting is created by a user using the appointment-making service and the created meeting is confirmed. Therefore, the number of appointment IDs issued by the processor (120) is equal to the number of appointments confirmed using the appointment-making service. In an embodiment of the present invention, the appointment ID table may store each appointment ID and the time and location of the meeting corresponding to each appointment ID, as illustrated in FIG. 7.

[0077] In step S209, the processor (120) generates an appointment participant table based on a friend list group of friends included in the meeting schedule corresponding to the appointment ID issued in step S208. In this embodiment, the appointment participant table is a table that includes participant information for each meeting (i.e., information on the user who hosted the meeting and information on friends invited to the meeting by the user), and stores the appointment ID issued in step S208, the user type, and the user ID or relationship ID of the participant, as illustrated in FIG. 8.

[0078] In Figure 8, user types are categorized into "Host," "Hit," and "Phone Number." "Host" is a classification indicating the user who organized the meeting schedule corresponding to the corresponding appointment ID. "Hit" is a classification indicating friends who attended the meeting and are registered with the appointment-making service. "Phone Number" is a classification indicating friends who attended the meeting and are not registered with the appointment-making service. However, the classifications illustrated in Figure 8 are merely examples and are not limiting.

[0079] In this embodiment, the processor (120) records the user ID of each friend included in the meeting schedule corresponding to the issued appointment ID in the appointment participant table if the friend belongs to the first group in the friend list, and records the relationship ID of each friend in the appointment participant table if the friend belongs to the second group in the friend list. At this time, the relationship ID of the friend belonging to the second group is recorded as the relationship ID issued between the user (host) who hosted the meeting and the friend.

[0080] Meanwhile, among the friends stored in the user's phonebook, there may be friends who were not registered as members of the appointment-making service until the meeting schedule created by the user was confirmed and the appointment participant table was created. However, some friends may register as members after the appointment participant table was created. For these new members, information about meetings they attended prior to registering as members can be linked and managed, thereby ensuring continuity in the meeting schedule creation activities between the new member and other friends stored in the new member's phonebook.

[0081] To this end, when the processor (120) receives a membership registration request from a new user, it issues a user ID for the new user and stores it in the user ID table, as in step S201 of FIG. 2, and also issues a relationship ID based on the phone numbers of friends stored in the phone book of the new user's terminal, as in step S202, and stores it in the relationship ID table. At this time, the user ID issued to the new user through membership registration is stored in the user ID (friend) area for the new user, which was previously blank in the relationship ID table, to update the relationship ID table.

[0082] Referring to FIGS. 9 and 10, for example, a friend named 'Jung Ji-hoon', who had not previously subscribed to the appointment-making service, newly subscribed to the appointment-making service and was issued a user ID of 4, and a relationship ID for the relationship with other users stored in the phone book of Jung Ji-hoon's terminal based on Jung Ji-hoon was also issued and stored. At this time, in the relationship ID table, it can be confirmed that not only the newly issued relationship ID information based on Jung Ji-hoon, but also the newly issued user ID of Jung Ji-hoon, i.e. 4, was stored in the user ID (friend) corresponding to the relationship ID generated for the relationship with Jung Ji-hoon based on the user previously.

[0083] In this way, since information entered prior to a new user's registration is updated after the new user's registration, information about relationships formed through meetings with other users prior to registration can be continuously used even after registration.

[0084] The method for creating a meeting schedule according to the present embodiment has the technical effect of allowing convenient creation of a meeting schedule even when creating a meeting schedule that includes friends who have already signed up for the appointment-making service and friends who have not yet signed up by determining the type of meeting schedule creation request to be sent to a friend based on whether the friend invited to the meeting is a friend who has signed up for the appointment-making service, and sending the meeting schedule creation request of the determined type to each friend's terminal when creating a meeting schedule that includes at least some of the friends stored in the phone book of the user's terminal. In addition, in a situation where the number of members signed up for the appointment-making service is not sufficient, the appointment-making service can be made known to users who have not signed up for the appointment-making service, thereby allowing for easier service expansion.

[0085] In one embodiment of the present invention, the appointment setting between a user and other friends for creating a meeting schedule may be performed as follows. The following example may be an example of the meeting schedule creation request in step S205 of FIG. 2, the meeting schedule confirmation request transmission in step S206, and the meeting schedule confirmation operation in step S207.

[0086] FIG. 11 is a diagram showing an appointment setting process when there are two participants according to one embodiment of the present invention.

[0087] The plurality of users may include at least a first user and a second user, and the first user's terminal (140) and the second user's terminal (140) may be linked to the processor (120) of the appointment-making server (100). The plurality of users may include not only the first and second users, but also other users, and in some cases, may include three or more users.

[0088] In this state, the processor (120) of the appointment-making server (100) can receive a first candidate schedule for a meeting that can be attended from the terminal of the first user (A in the drawing) (S1101). Here, the first candidate schedule may include at least one date (e.g., November 1, November 2, November 3, November 4, November 5) as a meeting holding schedule desired by the first user. That is, the first user can use his / her terminal to set a desired meeting date through an app or webpage linked to the appointment-making server (100) and transmit a message requesting the creation of a meeting to the appointment-making server (100).

[0089] Additionally, the processor (120) may receive information from the first user's terminal about whether the meeting time is lunch time (or dinner time), information about the number of participants in the meeting, etc. Here, the information about the number of participants may include the number of participants and identification information for each participant (e.g., name, phone number).

[0090] Additionally, the processor (120) can set different meeting appointments between multiple users based on the number of participants attending the meeting. First, let's examine the process of using the elimination method when the number of participants is two, as illustrated in FIG. 11.

[0091] The above processor (120) can determine whether there are two participants (S1102), and if there are not two participants (no), it can perform the process (S1201) of determining whether there are three participants as shown in FIG. 12, which will be described later. FIG. 11 illustrates the appointment-making process when there are two participants (yes).

[0092] The processor (120) of the appointment-making server (100) can transmit the first candidate schedule (11 / 1 - 11 / 5) to the terminal of the second user (B in the drawing), and can allow the second user to select a date (11 / 4, 11 / 5) from among the first candidate schedules on which the second user can attend the meeting (S1103). For convenience of explanation, a schedule selected by the second user as being available for attendance from among the first candidate schedules (11 / 1 - 11 / 5) can be set as the second candidate schedule.

[0093] Separately from the selection of the second candidate schedule, the processor (120) can allow the second user to select whether to accept or reject attendance at the meeting (S1104), and if a rejection input is received from the second user's terminal, the meeting appointment can be cancelled (appointment cancelled) (S1105).

[0094] Conversely, after receiving an acceptance input from the terminal of the second user, if the second candidate schedule selected by the second user obtained from the terminal of the second user is not a single day, the processor (120) may cause the first user to select one day (1 date) (11 / 5) from among multiple dates (11 / 4, 11 / 5) included in the second candidate schedule (S1107).

[0095] If the second candidate schedule (e.g., 11 / 5) is a single day (yes answer in S1106) or if the first user selects a single day (selecting a single day in S1107), the processor (120) can confirm the appointment for the selected day (S1108). That is, a meeting appointment between multiple users (the first and second users) can be set for the lunch (or dinner) time of the selected final date (e.g., 11 / 5).

[0096]

[0097] FIG. 12 is a diagram showing an appointment setting process when there are three participants according to one embodiment of the present invention.

[0098] If the number of meeting participants received from the first user's terminal is determined to be 3 (S1201), the processor (120) can perform a process (see FIG. 12) of setting a meeting appointment based on the elimination method and the intersection method based on the 3 people (the first user, the second user, and the third user).

[0099] Conversely, if it is determined that the number of people in the meeting is not 3 (no), the processor (120) may perform process S1301 of FIG. 13, which will be described later.

[0100] Additionally, when there are three participants, the processor (120) can set up a meeting appointment based on a hybrid method in which the elimination method and the intersection method are applied.

[0101] Specifically, the elimination method can be used, but when intersection is impossible (i.e., when the dates selected by users do not overlap), the intersection method can be used to derive available meeting dates. While the elimination method is the fastest and most convenient way to schedule an appointment, the hybrid method described above can be used to determine the likelihood of future meetings and gatherings, the expected number of attendees, and other factors. It is primarily applicable to gatherings of two to four people.

[0102] For the sake of explanation, let's assume that there are three people in the group, including the first user, the second user, and the third user, and describe them below.

[0103] First, before the process begins, each of the plurality of users (users 1, 2, and 3) can store the pre-designated dates on which they can attend the meeting in advance in an app (such as a calendar app), and the processor (120) can receive the pre-designated dates and store them in a database (130). Here, the pre-designated dates are unrelated to the candidate schedule corresponding to the meeting appointment, and may correspond to dates pre-designated before the meeting appointment is set.

[0104] Referring to FIG. 15(b) described below, the processor (120) may enable the user to pre-designate dates on which the user can attend meetings (e.g., 11 / 8-11 / 10, 11 / 13-11 / 19, 11 / 30-12 / 1), and may also enable the user to designate dates on which the user can attend meetings during lunch and dinner hours, respectively. The pre-designated dates are merely for reference in setting up meeting appointments, and meeting appointments will not be automatically set up on the pre-designated dates.

[0105] The processor (120) of the appointment-making server (100) can transmit the first candidate schedule (11 / 1 - 11 / 5) to the terminal of the second user, so that the second user can select a second candidate schedule (11 / 4, 11 / 5) from among the first candidate schedules, which the second user can attend (S1202).

[0106] Next, the processor (120) can determine whether there is a day that the third user (C in the drawing) can attend among the second candidate schedules (11 / 4, 11 / 5) selected by the second user (S1203).

[0107] According to one embodiment of the present invention, the processor (120) can compare the second candidate schedule with the third user's previously designated dates obtained from the database (130). As a result of the comparison, it is possible to determine whether there are dates on the second candidate schedules on which the third user can attend the meeting, and obtain the corresponding confirmation result.

[0108] In addition, according to another embodiment of the present invention, regardless of the aforementioned preset date, the processor (120) may transmit the second candidate schedule to the terminal of the third user, cause the third user to check whether there is a date among the second candidate schedules on which attendance to the meeting is possible, and obtain the result of the check (S1203).

[0109] Based on the verification result, if there is a date among the second candidate schedules (11 / 4, 11 / 5) on which the third user can attend the meeting, the processor (120) may cause the third user to select the 3-1 candidate schedule (11 / 4 or 11 / 5) corresponding to a date on which the third user can attend the meeting (which may be different from the preset date) among the second candidate schedules (S1204). The processor (120) may receive the 3-1 candidate schedule corresponding to a date on which the third user can attend the meeting from the terminal of the third user.

[0110] In addition, the terminal of the third user can input acceptance or rejection regarding attendance at the meeting (S1205), and if a rejection input is received, the processor (120) can act as if the meeting appointment never occurred (S1206). Conversely, if an acceptance input is received, the processor (120) can determine whether the 3-1 candidate schedule selected by the third user is set to one day (1 day) (S1207).

[0111] If the above 3-1 candidate schedule (11 / 4 - 11 / 5) is not a single day, the processor (120) can transmit the 3-1 candidate schedule to the first user's terminal and allow the first user to decide whether to set up a meeting appointment based on the 3-1 candidate schedule through the first user's terminal (S1208). Specifically, the processor (120) can allow the first user to select any day from the 3-1 candidate schedule (11 / 4 - 11 / 5).

[0112] If the 3rd-1 candidate schedule (e.g., 11 / 4) is a single day (yes answer in S1207) or if the first user selects a single day (e.g., 11 / 4) (selecting a single day in S1208), the processor (120) can confirm the appointment for the selected day (S1209). That is, a meeting appointment can be set between multiple users (users 1, 2, and 3) during the lunch hour (or dinner hour) of the selected final date (e.g., 11 / 4).

[0113] As described above, the aforementioned processes (S1201 to S1209) were setting up meeting appointments between multiple users based on the elimination method, and the processes (S1210 to S1212) described below were setting up meeting appointments between multiple users based on the intersection method.

[0114] According to one embodiment of the present invention, if there is no date among the second candidate schedules (11 / 4, 11 / 5) on which the third user can attend the meeting, the processor (120) may cause the third user to select the 3-2 candidate schedule (11 / 1 - 11 / 2) corresponding to a date on which the third user can attend the meeting among the first candidate schedules (11 / 1 - 11 / 5) (S1210). The processor (120) may receive the 3-2 candidate schedule corresponding to a date on which the third user can attend the meeting from the terminal of the third user.

[0115] Next, the processor (120) can cause the first user to select a second user based on the second candidate schedule (11 / 4 - 11 / 5), a third user based on the third-second candidate schedule (11 / 1 - 11 / 2), or a non-meeting appointment (pato) through the first user's terminal (S1211). In other words, the user selects whether to make a meeting appointment with the second user, make a meeting appointment with the third user, or make the meeting appointment non-existent.

[0116] Finally, based on the input of the first user (e.g., when selecting a day between 11 / 4 and 11 / 5 (selected by the second user), when selecting a day between 11 / 1 and 11 / 2 (selected by the third user), when selecting a meeting appointment break), it is possible to determine whether the appointments of multiple users (users 1, 2, and 3) are confirmed or decided as not having occurred (break-even) (S1212). The processor (120) can enable the first user to decide whether to set a meeting appointment based on the second candidate schedule or the third-second candidate schedule through the first user's terminal.

[0117] When the first user selects the second user, the processor (120) can determine which day among the second candidate schedules (11 / 4, 11 / 5) is set as the appointment, and when the first user selects the third user, the processor (120) can determine which day among the 3-2 candidate schedules (ex. 11 / 1, 11 / 2) is set as the appointment.

[0118] Additionally, if the first user selects that there was no meeting appointment (patu), the processor (120) can determine that the meeting appointment is a patu (S1212).

[0119]

[0120] FIG. 13 is a diagram showing an appointment setting process when there are four participants according to one embodiment of the present invention.

[0121] If the number of meeting participants received from the first user's terminal is determined to be 4 (S1301), the processor (120) can perform a process (see FIG. 13) of setting a meeting appointment based on the 4 people (the first user (A), the second user (B), the third user (C), and the fourth user (D)) by the elimination method and the intersection method.

[0122] Conversely, if the number of participants in the meeting is determined to be not 4 (no), the processor (120) may perform process S1401 of FIG. 14, which will be described later. In addition, if there are 4 participants, the processor (120) may set a meeting appointment based on a hybrid method in which the elimination method and the intersection method are applied.

[0123] First, before the process begins, each of the plurality of users (users 1, 2, 3, and 4) can store the pre-designated dates on which they can attend the meeting in advance in an app (such as a calendar app), and the processor (120) can receive the pre-designated dates and store them in a database (130). Here, the pre-designated dates are unrelated to the candidate schedule corresponding to the meeting appointment, and may correspond to dates pre-designated before the meeting appointment is set.

[0124] In addition, the processor (120) of the appointment-making server (100) can transmit the first candidate schedule (11 / 1 - 11 / 5) to the terminal of the second user, so that the second user can select a second candidate schedule (11 / 3 - 11 / 5) from among the first candidate schedules, which the second user can attend (S1302).

[0125] Next, the processor (120) can determine whether there is a day among the second candidate schedules (11 / 3 - 11 / 5) selected by the second user that both the third user and the fourth user can attend (S1303).

[0126] According to one embodiment of the present invention, the processor (120) can compare the second candidate schedule with the previously acquired dates of the third and fourth users from the database (130). As a result of the comparison, it is possible to determine whether there are dates among the second candidate schedules on which both the third and fourth users can attend the meeting, and obtain the corresponding confirmation results.

[0127] In addition, according to another embodiment of the present invention, regardless of the aforementioned preset date, the processor (120) may transmit the second candidate schedule to each of the third user's terminal and the fourth user's terminal, and cause the third user and the fourth user to check whether there is a date among the second candidate schedules on which they can attend the meeting, and obtain the corresponding check result (S1303).

[0128] Based on the verification result, if there is a date among the second candidate schedules (11 / 3 - 11 / 5) on which the third user can attend the meeting, the processor (120) can cause the third user to select the third-third candidate schedule (11 / 3 - 11 / 4) corresponding to a date (which may be different from the designated date) on which the third user can attend the meeting among the second candidate schedules (S1304).

[0129] Additionally, the processor (120) can transmit the 3-3 candidate schedule (11 / 3 - 11 / 4) to the terminal of the fourth user, and enable the fourth user to determine whether there is a date among the 3-3 candidate schedules on which the fourth user can attend the meeting (S1305). Of course, the processor (120) can also determine whether there is a date on which the fourth user can attend the meeting by comparing the 3-3 candidate schedule with a preset date set by the fourth user.

[0130] Based on the above verification result, if there is a date on which the 4th user can attend the meeting among the 3-3 candidate schedules (11 / 3 - 11 / 4), the processor (120) can cause the 4th user to select the 4-1 candidate schedule (11 / 4) corresponding to a date on which the 4th user can attend the meeting (which may be different from the designated date) among the 3-3 candidate schedules (S1306).

[0131] In addition, the terminal of the fourth user can input acceptance or rejection regarding attendance at the meeting (S1307), and if a rejection input is received, the processor (120) can either assume that the meeting appointment did not occur (pass-through) or confirm the meeting settings excluding only the fourth user (S1308). Conversely, if an acceptance input is received, the processor (120) can determine whether the 4-1 candidate schedule selected by the fourth user is set to one day (1 day) (S1309).

[0132] If the above 4-1 candidate schedule (11 / 3 - 11 / 4) is not a single day, the processor (120) can transmit the 4-1 candidate schedule to the first user's terminal and allow the first user to decide whether to set up a meeting appointment based on the 4-1 candidate schedule through the first user's terminal (S1310). Specifically, the processor (120) can allow the first user to select any day from the 4-1 candidate schedule (11 / 3 - 11 / 4).

[0133] If the 4-1 candidate schedule (e.g., 11 / 4) is a single day (yes answer in S1309) or if the first user selects a single day (selecting a single day in S1310), the processor (120) can confirm the appointment for the selected day (S1311). That is, a meeting appointment can be set between multiple users (users 1, 2, 3, and 4) during the lunch hour (or dinner hour) of the selected final date (e.g., 11 / 4).

[0134] As described above, the aforementioned processes (S1301 to S1311) were setting up meeting appointments between multiple users based on the elimination method, and the processes (S1321 to S1324, S1331 to S1334) described below were setting up meeting appointments between multiple users based on the intersection method.

[0135] According to one embodiment of the present invention, if there is no date on which the fourth user can attend the meeting among the 3-3 candidate schedules (11 / 3 - 11 / 4) in response to S1305, the processor (120) may cause the fourth user to select the 4-2 candidate schedule (11 / 5) corresponding to a date on which the fourth user can attend the meeting among the 1st candidate schedules (11 / 1 - 11 / 5) (S1321).

[0136] In addition, the processor (120) may allow the third user to re-select the third-fourth candidate schedule (11 / 1 - 11 / 4) corresponding to a date on which attendance at the meeting is possible among the first candidate schedule (11 / 1 - 11 / 5) (S1322).

[0137] Next, the processor (120) can cause the first user to select a second user based on the second candidate schedule (11 / 3 - 11 / 5), a third user based on the third-fourth candidate schedule (11 / 1 - 11 / 4), a fourth user based on the fourth-second candidate schedule (11 / 5), or a non-meeting appointment (pato) through the first user's terminal (S1323). In other words, the user selects whether to make a meeting appointment with the second user, a meeting appointment with the third user, a meeting appointment with the fourth user, or to make the meeting appointment non-existent.

[0138] Finally, based on the input of the first user (e.g., when selecting a day from 11 / 3 to 11 / 5 (selected by the second user), when selecting a day from 11 / 1 to 11 / 4 (selected by the third user), when selecting 11 / 5 (selected by the fourth user), when selecting a meeting appointment break), it is possible to determine whether the appointments of multiple users (users 1, 2, 3, and 4) are confirmed or decided as non-existent (break-even) (S1324). The processor (120) can enable the first user to decide whether to set a meeting appointment based on the second candidate schedule, the third-fourth candidate schedule, and the fourth-second candidate schedule through the first user's terminal.

[0139] If the first user selects 11 / 4, the processor (120) may determine that meeting appointments for the remaining first, second, and third users, excluding the fourth user, have been set (11 / 4). In addition, if the first user selects 11 / 5, the processor (120) may determine that meeting appointments for the first and fourth users have been set (11 / 5) (S1324).

[0140] According to one embodiment of the present invention, if there is no date among the second candidate schedules (11 / 3 - 11 / 5) on which both the third user and the fourth user can attend the meeting in response to S1303, the processor (120) may cause the third user to select the third-fifth candidate schedule (11 / 1 - 11 / 2) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1331).

[0141] Additionally, the processor (120) can enable the fourth user to select the 4th-3rd candidate schedule (11 / 5) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1332).

[0142] Next, the processor (120) can cause the first user to select a second user based on the second candidate schedule (11 / 3 - 11 / 5), a third user based on the third-fifth candidate schedule (11 / 1 - 11 / 2), a fourth user based on the fourth-fifth candidate schedule (11 / 5), or a non-meeting appointment (pato) through the first user's terminal (S1333). In other words, the user selects whether to make a meeting appointment with the second user, a meeting appointment with the third user, a meeting appointment with the fourth user, or to make the meeting appointment non-existent.

[0143] Finally, based on the input of the first user (e.g., when selecting a day between 11 / 3 and 11 / 5 (selected by the second user), when selecting a day between 11 / 1 and 11 / 2 (selected by the third user), when selecting 11 / 5 (selected by the fourth user), when selecting a meeting appointment break), it is possible to determine whether the appointments of multiple users (users 1, 2, 3, and 4) are confirmed or decided as non-existent (break-even) (S1334). The processor (120) can enable the first user to decide whether to set a meeting appointment based on the second candidate schedule, the third-fifth candidate schedule, and the fourth-third candidate schedule through the first user's terminal.

[0144] If the first user selects 11 / 5, the processor (120) may determine that meeting appointments for the remaining first, second, and fourth users, excluding the third user, have been set (11 / 5). In addition, if the first user selects 11 / 1, the processor (120) may determine that meeting appointments for the first, third, and fourth users, excluding the second user, have been set (11 / 1) (S1334).

[0145]

[0146] FIG. 14 is a diagram showing an appointment setting process when there are five participants according to one embodiment of the present invention.

[0147] If it is determined that the number of meeting participants received from the first user's terminal is 5 or more, the processor (120) can perform a process (see FIG. 14) of setting a meeting appointment by the intersection method based on 5 people (the first user (A), the second user (B), the third user (C), the fourth user (D), and the fifth user (E)).

[0148] First, the processor (120) can allow the second user to select a second-second candidate schedule (11 / 3 - 11 / 5) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1401).

[0149] Additionally, the processor (120) can enable the third user to select the 3rd-6th candidate schedule (11 / 1 - 11 / 2) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1402).

[0150] Additionally, the processor (120) can enable the fourth user to select the 4th-4th candidate schedule (11 / 5) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1403).

[0151] Additionally, the processor (120) can enable the fifth user to select a fifth candidate schedule (11 / 5) corresponding to a date on which attendance at the meeting is possible among the first candidate schedules (11 / 1 - 11 / 5) (S1404).

[0152] Next, the processor (120) may allow the first user to select a specific date (between November 1 and November 5) via the first user's terminal, or to select a date (pato) on which there was no meeting appointment (S1405). In other words, the user may select whether to make a meeting appointment with the second user, a meeting appointment with the third user, a meeting appointment with the fourth user, a meeting appointment with the fifth user, or to make the meeting appointment void.

[0153] The above processor (120) can confirm a meeting appointment with users who have a date available when the first user selects a specific date, and can confirm the meeting appointment as not having occurred when the first user does not select a specific date (S1406).

[0154] FIG. 15 is a drawing showing a screen on an application linked with an appointment-making server according to one embodiment of the present invention.

[0155] FIG. 16 is a diagram illustrating a lightning appointment making process according to one embodiment of the present invention.

[0156] According to one embodiment of the present invention, the processor (120) of the appointment-making server (100) can provide, through an application, not only a meeting appointment setting function, but also a messenger function, a birthday reminder function, and the like. Furthermore, as shown in FIG. 15(a), user information (square box, 1510) registered as a Lightning Friend can be displayed.

[0157] Specifically, the processor (120) allows each of the multiple users to register users (friends) that they frequently see or want to see frequently as lightning friends. Here, lightning friends represent users who are matched according to predetermined criteria on a specific date (e.g., today) and are available for lightning meetings.

[0158] For the sake of explanation, it can be assumed that there are multiple users who have set up a Lightning Buddy, and among these multiple users, there is a specific user who has chosen to declare a Lightning Buddy. Here, a Lightning Buddy Declaration is an input by a user who has been set up as a Lightning Buddy that he or she intends to hold a Lightning Buddy Meeting today. A specific user can declare a Lightning Buddy Meeting today (S1601).

[0159] At this time, the processor (120) of the appointment-making server (100) can determine whether any of the lightning friends registered by the specific user has declared a lightning date today (S1602). If no other user has declared a lightning date, the processor (120) can set the status of the specific user to a lightning date waiting state (S1603).

[0160] If there is another user who has made a lightning declaration today, the processor (120) can determine whether there are two or more other users (S1604), and if there is only one user (the answer is no), the processor (120) can match the specific user with another user (S1606).

[0161] Additionally, if there are two or more other users who have declared a lightning strike today, the processor (120) can select one user based on a preset priority, group the specific user with the selected user, and transmit a message notifying that a lightning strike match has been made to the terminal of the specific user and the terminal of the selected user, respectively (S1605). Ultimately, two users are selected from among the predetermined users who have declared a lightning strike based on the preset priority.

[0162] Here, the preset priority can be determined by various criteria, such as the most recent appointment date, intimacy, and name. For example, in a situation where two or more other users are present, the processor (120) can select the user who has had a past lightning match the closest time (the most recent appointment date) as the target user for lightning matching.

[0163] Additionally, the processor (120) may select a user among two or more other users who have exchanged the most messages with a specific user as a user to be matched with. In other words, the selection may be based on intimacy.

[0164] The criteria for the aforementioned preset priorities can vary. While the aforementioned lightning matchmaking only considered one-on-one matches, multiple-player lightning matches are not excluded. Furthermore, while today (today) was used as the standard for lightning declarations, in some cases, lightning declarations and lightning matches may also be possible on specific dates (e.g., May 30th).

[0165] The above lightning matching process is intended to allow you to register friends you frequently see as lightning friends, just like in real-life lightning meetings, and to quickly make appointments with them.

[0166]

[0167] Meanwhile, the organizational management department is making significant efforts to help members adapt to the organization and improve the organizational culture. At this time, one-sided company-led programs can provoke resistance from members, so fostering natural intimacy among members may be necessary.

[0168] To this end, the processor (120) of the appointment-making server (100) of the present invention provides a process that guides the HR manager to schedule a meal appointment between existing organization members and new employees, and facilitates natural information sharing and knowledge transfer. This will be discussed below with reference to Figure 17.

[0169] Figure 17 is a diagram showing a process of making an appointment between a mentor and a mentee according to one embodiment of the present invention.

[0170] First, the processor (120) can provide a list of users who are permitted to schedule appointments with mentors and mentees to the user's application corresponding to the human resources manager (square box (1520) of FIG. 15(a)). In other words, the human resources manager can check the list of users (company members) permitted to schedule appointments at the organizational level and schedule appointments with mentors and mentees based on these users.

[0171] First, the user corresponding to the HR manager can pre-configure the first user (A) corresponding to the mentee, the second user (B, C, etc.) corresponding to the mentor, and the mentor-mentee matching period through the app (S1701). In other words, the first and second users are included in a single group (mentor-mentee group), and a meeting appointment can be set as a mentor-mentee match.

[0172] As can be seen in Fig. 17, the processor (120) can transmit a program subscription request for making an appointment with a mentor or mentee to each terminal of a user corresponding to a mentee (first user) and a mentor (second user).

[0173] In addition, the processor (120) can allow the first user to select a first candidate schedule (ex. excluding Mondays, Wednesdays, and Fridays from November to December 23) that allows attendance at meetings during the mentor-mentee matching period, and can receive this from the first user's terminal.

[0174] If there is no second user corresponding to the mentor in the user list (users who allow mentor and mentee appointments) provided to the aforementioned HR manager, the processor (120) can set the status of the first user to a standby state.

[0175] Conversely, if there is a second user corresponding to a mentor in the user list, the processor (120) can transmit the first candidate schedule selected by the first user to the terminal of the second user, and can allow the second user to select a second candidate schedule (date - ex. 2023.11.8) from among the first candidate schedules on which the second user can attend a meeting (mentor-mentee matching) (S1704).

[0176] After receiving the second candidate schedule from the terminal of the second user, the processor (120) can set up a meeting appointment between multiple users (the first and second users) based on the second candidate schedule. Specifically, if the second user selects a specific date (the second candidate schedule) for meeting attendance (mentor-mentee matching), the processor (120) can confirm the appointment for the specific date (S1705) and transmit this as a message to the terminal of the user corresponding to the human resources manager and the terminal of the first user (mentee). Conversely, if the second user does not select the second candidate schedule and declines to attend the meeting, the meeting may be automatically terminated (S1706).

[0177]

[0178] The embodiments of the present invention described above may be implemented in the form of program commands that can be executed through various computer components and recorded on a computer-readable recording medium. The computer-readable recording medium may include program commands, data files, data structures, etc., either singly or in combination. The program commands recorded on the computer-readable recording medium may be those specially designed and configured for the present invention or may be known and usable by those skilled in the art of computer software. Examples of the computer-readable recording medium include hardware devices specially configured to store and execute program commands, such as a hard disk, ROM, RAM, flash memory, etc. Examples of program commands include not only machine language codes generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter, etc. The hardware devices may be configured to operate as one or more software modules to perform processing according to the present invention, and vice versa.

[0179] Although the present invention has been described above with specific details such as specific components and limited examples and drawings, these are provided only to help a more general understanding of the present invention, and the present invention is not limited to the above examples, and those with ordinary knowledge in the technical field to which the present invention pertains can make various modifications and variations from this description.

[0180] Therefore, the idea of ​​the present invention should not be limited to the embodiments described above, and all things that are modified equally or equivalently to the following claims as well as the claims are considered to fall within the scope of the idea of ​​the present invention.

Claims

1. A step of receiving a request for loading a friends list for creating a meeting hosted by a user from a terminal of a user registered as a member of an appointment-making service; A step of generating a friends list by classifying and sorting each friend stored in the phone book of the user's terminal into a first group or a second group, and providing the generated friends list to the user's terminal; A step of receiving a request for creating a meeting schedule including at least one friend sorted in the friend list from the terminal of the user; A step of determining the type of meeting schedule confirmation request to be sent to each friend's terminal based on the group to which each friend included in the above meeting schedule belongs, and transmitting the meeting schedule confirmation request to each friend's terminal according to the determined type; and A meeting schedule creation method, characterized by including a step of confirming a meeting schedule created by the user based on at least one of a confirmation response from the user's terminal or the terminal of each friend.

2. In paragraph 1, A step of receiving a membership registration request for the appointment-making service from the terminal of the user; and In response to the above membership registration request, the step of issuing a user ID for the user and storing it in a user ID table is further included. A meeting schedule creation method characterized in that the user ID issued to members of the appointment-making service and the phone numbers of each member are matched and stored in the above user ID table.

3. In paragraph 2, The step of generating the friend list by classifying and arranging each friend stored in the phone book of the user's terminal into a first group or a second group, and providing the generated friend list to the user's terminal A step of determining whether a user ID has been issued for each friend based on the phone number of each friend stored in the phone book of the user's terminal; and A method for creating a meeting schedule, characterized in that it includes a step of creating a friend list by classifying and sorting friends to whom the user ID has been issued into the first group and friends to whom the user ID has not been issued into the second group.

4. In paragraph 3, The types of the above meeting schedule confirmation request include the first type in which a notification is sent as a pop-up through an application linked to the above appointment-making service, and the second type in which a notification is sent as an SMS text message. A meeting schedule creation method, characterized in that the step of transmitting a meeting schedule confirmation request to each friend's terminal according to the determined type comprises transmitting a meeting schedule confirmation request of the first type to the terminal of a friend belonging to the first group among the friends included in the meeting schedule, and transmitting a meeting schedule confirmation request of the second type to the terminal of a friend belonging to the second group.

5. In paragraph 4, A step of confirming a meeting schedule created by the user based on at least one of the confirmation responses from the user's terminal or each friend's terminal If all friends included in the meeting schedule created by the above user belong to the above first group, the meeting schedule is confirmed based on receiving a confirmation response from the terminals of all the friends, If all friends included in the meeting schedule created by the user belong to the second group, the meeting schedule is confirmed based on a confirmation response received from the user's terminal. A meeting schedule creation method characterized in that, when some of the friends included in the meeting schedule created by the user belong to the first group and the rest belong to the second group, the meeting schedule is confirmed based on receiving a confirmation response from the terminal of each friend belonging to the first group.

6. In paragraph 5, After issuing a user ID for the user, the method further includes issuing a relationship ID for a relationship between the user and each friend stored in the phone book of the user's terminal and storing the ID in a relationship ID table. A method for creating a meeting schedule, wherein the above relationship ID is assigned to the relationship with each friend based on the above user, and the relationship ID stored in the relationship ID table is equal to the total number of friends stored in the phone book of the terminal of each member subscribed to the appointment-making service.

7. In paragraph 6, The above relationship ID table includes the above relationship ID, the user ID of the user, and the user ID and phone number of each friend. The step of issuing the above relationship ID and storing it in the relationship ID table is A step of determining whether a user ID has been issued for each friend based on the phone number of each friend; A method for creating a meeting schedule, characterized in that, as a result of a decision, a friend to whom the user ID is issued stores the user ID and phone number issued for the friend in the relationship ID table, and a friend to whom the user ID is not issued stores the phone number of the friend in the relationship ID table.

8. In paragraph 7, After the above relationship ID table is created, if a friend classified into the second group joins as a new member, A meeting schedule creation method characterized in that the relationship ID table is updated by storing the user ID of the new member in correspondence with the relationship ID already issued for the relationship between the user and the new member in the relationship ID table based on the phone number of the new member.

9. An appointment-making server including a processor that receives a request for loading a friend list for creating a meeting hosted by a user from a terminal of a user who has registered as a member of an appointment-making service, classifies and sorts each friend stored in the phone book of the user's terminal into a first group or a second group to create the friend list, provides the created friend list to the user's terminal, receives a request for creating a meeting schedule including at least one friend sorted in the friend list from the user's terminal, determines a type of a meeting schedule confirmation request to be transmitted to the terminal of each friend based on a group to which each friend included in the meeting schedule belongs, transmits a meeting schedule confirmation request to the terminal of each friend based on the determined type, and confirms the meeting schedule created by the user based on at least one of a confirmation response from the terminal of the user or the terminal of each friend; and A meeting schedule creation system including a plurality of terminals that transmit and receive data through the above-mentioned appointment-making server and a communication network.

Images