KR101596414B1 - System and method for management stand-by list using series - Google Patents

Abstract

A waiting list management system and method are disclosed. The waiting list management system receives selection information for each of a plurality of time slots constituting a waiting list of services from the queues, allocates the priority of the waiters, and for each of the time slots using the sequence, The token issuer to whom the token is to be issued, which is the reservation authority, can be determined.

Description

TECHNICAL FIELD [0001] The present invention relates to a standby list management system and method,

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an idle list management system and method, and more particularly, to an idle list management system and a method for issuing a reservation authority tokens to a subordinate using a sequence.

The reservation system for using the service has various numbers of cases. Specifically, it is assumed that the waiters who want only one of the plurality of choices have priority. For example, it is assumed that the first person desires one of A and B, the second person desires one of A and C, and the third person desires C. In this case, when both the first, second, and third positions are satisfied, the first person desires B, the second person A, and the third person C are desired.

However, when the first-ranked person selects A and the second-ranked person selects C, the third-ranked person may not be able to select the desired reservation item. Then, the person who operates the reservation system can not make reservations to more ranking persons, and eventually the sales will decrease. Therefore, it is necessary to provide a way to improve the sales of the reservation system operator by giving more waiting people an opportunity to make a reservation.

The present invention provides a system and method for applying a sequence to a priority of a waiter for a plurality of time slots to determine a token issuer, thereby giving a chance of issuing a token to a subordinate waiter while considering the priority of the priority waiter.

The present invention provides a system and method for allocating waiters evenly to a token issuer by determining a token issuer from a time slot with the smallest sum of priorities applied to the sequence for each time slot.

 The waiting list management system according to an embodiment of the present invention includes a selection information receiving unit for receiving selection information for each of a plurality of time slots constituting a waiting list of services from the queues, and a token issuer determining unit for determining a token issuer to be issued a token to be reserved for the time slots for each of the time slots using the sequence, .

The token issuer determining unit according to an embodiment of the present invention may include a priority conversion unit for converting the priority of the waiters into the ninth order for the plurality of time slots, And a token issuer assigning unit for assigning the token issuer from the time slot having the smallest sum of the priorities.

A waiting list management method according to an exemplary embodiment of the present invention includes receiving selection information for each of a plurality of time slots constituting a waiting list of services from the queues, Allocating the priority of the waiters to each of the time slots and determining a token issuer to be issued a token which is reserved among the waiters for each of the time slots using the sequence.

The step of determining the token issuer according to an embodiment of the present invention includes the steps of converting the priority of the waiters to the ninth number for the plurality of time slots, Calculating a sum of priorities, and allocating a token issuer from a time slot with the lowest total of the priorities.

According to an embodiment of the present invention, a token issuer may be determined by applying a sequence to a priority of a waiter for a plurality of time slots, and a token issuance opportunity may be granted to a subordinate waiter while considering the priority of the priority waiter.

According to one embodiment of the present invention, the waiters can be determined to be evenly token issuers for the time slot by determining the token issuer from the time slot with the smallest sum of priority applied sequence for each time slot.

1 is a diagram for explaining the operation of the waiting list management system in an embodiment of the present invention.
2 is a block diagram illustrating a detailed configuration of an idle list management system in an embodiment of the present invention.
FIG. 3 is a diagram illustrating a process of determining a token issuer through the waiting list according to an exemplary embodiment of the present invention.
4 illustrates a token issuer by time slot in an embodiment of the present invention.
5 is a flowchart illustrating an entire process of the waiting list management method in an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram for explaining the operation of the waiting list management system in an embodiment of the present invention.

1, the waiting list management system 100 can receive selection information for each of a plurality of time slots constituting a waiting list of services from N queues 101-1 to 101-N. The waiting list management system 100 can then assign waiters priorities for each of the time slots. The waiting list management system 100 may then use the sequence to determine the token issuer 102 to be issued a token that is reserved among the waiters for each of the time slots. The token issuer 102 for each of the time slots may then send a request to the service 103

The plurality of time slots means that the time information in which the service 103 is provided is divided into a certain period. For example, if an advertisement is provided daily for one day, two days, etc., each date is set as a time slot. If these wait slots 101-1 to 101-N to provide the service 103 are larger than the time slots while waiting slots 101-1 to 101-N capable of finally providing the service, N) is the enemy. In particular, this may be a problem when waiters wishing to have only one of a plurality of time slots have priority of the FIFO. Above all, when a senior waiter selects a plurality of time slots, it may happen that a subordinate waiter fails to select time slots due to the senior waiter.

Therefore, the waiting list management system 100 according to an embodiment of the present invention can provide a service through a time slot to a subordinate waiter while prioritizing the order of the priority waiters using the sequence.

2 is a block diagram illustrating a detailed configuration of an idle list management system in an embodiment of the present invention.

The waiting list management system 100 may include a selection information receiving unit 201, a priority assigning unit 202, and a token issuer determining unit 203. The token issuer determining unit 203 may include a priority converting unit 204, a total calculating unit 205, and a token issuer assigning unit 206.

The selection information receiving unit 201 may receive selection information for each of a plurality of time slots constituting a waiting list of services from the waiters. For example, the waiter may receive at least one selection information for a plurality of time slots associated with service provisioning. At this time, a time slot may expire a plurality of tokens at the same time, and a deadline for a subordinate waiter may arrive.

For example, the selection information receiving unit 201 may receive selection information for one of the at least one time slots from the prioritized waiters.

The priority assigning unit 202 may assign the priority of the waiters to each of the time slots. The waiters are the subjects who have applied for tokens, which are reservations for each of the time slots. For each of the time slots one or more waiters may apply for a token. Then, the priority for the waiters for the entire time slot can be set. That is, a particular waiter may be assigned the same priority for the entire time slot. For example, the waiter A may be assigned the same priority for the time slot associated with the selection information selected by the latter.

The token issuer determining unit 203 can determine a token issuer to be issued a token which is a reservation authority among the waiters for each of the time slots using the sequence.

The priority conversion unit 204 may convert the priority of the waiters into n-ary numbers for a plurality of time slots. For example, the priority conversion unit 204 may convert the priority set for each waiter from the first rank to the ninth rank sequentially. For example, the priority conversion unit 204 may convert the priority of the waiters from the first place waiters to the last place waiters to nineconds for each of the time slots. If the nodal number is binary, the priority of the first order waiter is assigned to 1, which is the first number of the binary number, followed by the priority of the second order waiter, which can be assigned as the second number of binary numbers 2. Through this process, if the final rank is m, the priority of the last rank waiter can be assigned to 2m-1, which is the (m-1) th binary number. Depending on the configuration of the system, the nodal number may be changed.

The total calculation unit 205 may calculate the sum of the priorities converted into the ninth numbers for each of the time slots. Priority values of waiters may be summed for each of the time slots.

The token issuer assigning unit 206 may allocate the token issuer from the time slot having the smallest sum of the priorities. For example, the token issuer assigning unit 206 can sequentially determine a token issuer from a waiting queue ranging from a time slot having the lowest priority sum to a time slot having the highest priority sum. That is, the token issuer assigning unit 206 may allocate the token issuer in reverse order from the slot having the smallest value obtained by adding the priority of the waiters converted into the ninth numbers for each of the time slots. Then, only the token issuer assigned for each time slot may be authorized to reserve for the service associated with that time slot.

FIG. 3 is a diagram illustrating a process of determining a token issuer through the waiting list according to an exemplary embodiment of the present invention.

Referring to FIG. 3, waiter selection information is set for a plurality of time slots in the waiting list 301. At this time, it is assumed that the token expires at the same time for the 1, 2, 4, 8, 10, and 11 day time slots and the date arrives at the subordinate waiters.

At this time, it can be seen that the waiting party A has selected the time slot of 7 days, 8 days, and 9 days as the first waiting queue. Then, it can be seen that the waiting party B selects the time slot of the first day, the second day, the fourth day, and the last day as the second waiting queue. As can be seen from the waiting list 301, it can be seen that the remaining waiters have also set selection information for a plurality of time slots.

As can be seen in the waiting list 302, it can be seen that the priority of the waiters for each time slot has been converted to binary. For example, in the case of the waiter A being the first waiter, it can be seen that the priority is converted to 1, which is the first number of the binary numbers, for the 7th, 8th and 9th time slots of the wait list 302. [ In the case of the waiting queue B which is the second waiting queue, it can be seen that the priority is converted to 2, which is the second number of the binary, with respect to the time slots of the first day, second day, fourth day, and last day of the waiting list 302. By repeating this process, the priority order of the waiters in the waiting list 302 can be converted into binary numbers.

The waiting list management system can then calculate the sum of the priorities converted to binary for each time slot. For the 1-day time slot, priority 2 of the queue B is converted to binary, priority 4 of the queue C is converted to binary 4, and priority 16 of the queue E is converted to binary, Can be determined. Through this process, the summation of the priority converted into the binary number with respect to the time slot can be calculated. However, the sum of priorities may not be calculated for every time slot, and at the same time the token may expire and be calculated for a time slot in which a date arrives to a subordinate waiter. Referring to the waiting list 301, the time slot at which the token expires and the date arrives at the subordinate waiting list means 1 day, 2 days, 4 days, 8 days, 10 days and 11 days.

The waiting list management system may then determine the waiters to issue the token from the time slot at which the token expires and the sum of the priorities of the arriving dates to the subordinate waiter is the smallest. Referring to the waiting list 302, a token issuer can be determined from a 10-day time slot since the 10-day time slot has the lowest sum of priorities. At this time, for the 10-day time slot, the highest priority queue B can be assigned as the token issuer. Secondly, the highest priority waiter A may be assigned to the token issuer for a time slot of 8 days with a small sum of priorities. Thirdly, since the waiter B having the highest priority is already assigned to the token issuer, the waiter C, which is the next order waiter, can be assigned to the token issuer. Through this process, a token issuer can be assigned to each of the time slots for which the token expires and the date arrives to the subordinate waiters at the same time.

4 illustrates a token issuer by time slot in an embodiment of the present invention.

Referring to FIG. 4, there is shown a token issuer assigned for each time slot of the waiting list 401. As described above, the token issuer may be allocated for a time slot for which the token expires at the same time and the date arrives to the subordinate waiter. The queues allocated per time slot are assigned to the token issuer and are authorized to reserve the service 402.

5 is a flowchart illustrating an entire process of the waiting list management method in an embodiment of the present invention.

In step S501, the waiting list management system 100 may receive selection information for each of a plurality of time slots constituting a waiting list of services from the queues. A time slot may expire a plurality of tokens at the same time, thereby expiring a subordinate waiter. In one example, the waiting list management system 100 may receive selection information for one of the at least one time slots from the ranked waiters.

In step S502, the waiting list management system 100 may assign the priority of the waiters for each of the time slots.

In step S503, the waiting list management system 100 can use the sequence to determine a token issuer to be issued a token, which is one of the waiters, for each of the time slots.

And, in step S504, the waiting list management system 100 may convert the priority of the waiters to a nineteenth number for a plurality of time slots. At this time, the waiting list management system 100 can convert the priority set for each waiter from the first rank to the ninth rank sequentially. At this time, the nodal number may be a binary number.

In step S505, the waiting list management system 100 may calculate the sum of the priorities converted to ninety for each of the time slots.

In step S506, the waiting list management system 100 may allocate the token issuer from the time slot with the smallest sum of priorities. At this time, the waiting list management system 100 can sequentially determine the token issuer from the waiting queue of the first rank from the time slot having the lowest total of the priorities to the time slot having the highest total of the priorities.

In addition, the waiting list management method according to an embodiment of the present invention includes a computer-readable medium including program instructions for performing various computer-implemented operations. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The media may be program instructions that are specially designed and constructed for the present invention or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, but, on the contrary, Modification is possible. Accordingly, the spirit of the present invention should be understood only in accordance with the following claims, and all equivalents or equivalent variations thereof are included in the scope of the present invention.

100: waiting list management system
101-1 to 101-N: waiting list
102: Token issuer
103: Service

Claims (15)

A selection information receiver for receiving selection information for each of a plurality of time slots constituting a waiting list of services from the waiters;
A priority assigning unit for assigning the priority of the waiters to each of the time slots; And
A token issuer determining unit for determining a token issuer to be issued a token as a reservation authority among the waiters for each of the time slots using the sequence,
Lt; / RTI >
The token issuer determining unit,
A priority conversion unit for converting a priority of a waiter to a decimal number for the plurality of time slots;
A summation unit for calculating a summation of the priorities converted into the n-ary number for each of the time slots; And
The token issuer assigning unit allocates the token issuer from the time slot having the smallest sum of the priorities,
Wherein the waiting list management system comprises: The method according to claim 1,
The time slot includes:
Wherein a plurality of tokens expire at the same time, and a deadline for a subordinate waiter arrives. delete The method according to claim 1,
Wherein the priority-
Wherein the waiting list management unit converts priority orders set for the waiters from the first order to the ninth order sequentially. 5. The method of claim 4,
Wherein the priority-
And converts the priority of the waiter into a binary number. The method according to claim 1,
The token issuer assigning unit,
Wherein the token issuer is determined to be a token issuer sequentially from a waiting queue in a time slot having a lowest sum of the priority orders to a time slot having a highest sum of the priority orders. The method according to claim 1,
Wherein the selection information receiver comprises:
And receives selection information for one of the at least one time slots from the prioritized waiters. A waiting list management method performed by an waiting list management system including a selection information receiving unit, a priority assigning unit, and a token issuer determining unit,
Receiving selection information for each of a plurality of time slots constituting a waiting list of a service from the waiters in the selection information receiver;
Allocating priority of the waiters to each of the time slots in the priority assigning unit; And
Determining, by the token issuer determining unit, a token issuer to be issued a token as a reservation authority among the waiters for each of the time slots using the sequence;
Lt; / RTI >
Wherein determining the token issuer comprises:
Converting the priority of the waiters to the ninth number for the plurality of time slots;
Calculating a summation of the priorities converted to the ninth number for each of the time slots; And
Allocating a token issuer from a time slot having a smallest sum of the priorities
/ RTI > 9. The method of claim 8,
The time slot includes:
Wherein a plurality of tokens expire at the same time to expire the subordinate waiters. delete 9. The method of claim 8,
Wherein the step of converting the priority of the waiter to the ninth number comprises:
Wherein the priority order set for each waiter is sequentially converted from the first rank to the ninth rank. 12. The method of claim 11,
Wherein the step of converting the priority of the waiter to the ninth number comprises:
And converting the priority of the waiter to a binary number. 9. The method of claim 8,
Wherein the assigning of the token issuer comprises:
Wherein the token issuer is determined to be a token issuer sequentially from a first waiting queue in a time slot having a lowest total of the priorities and a time slot having a highest total of the priorities. 9. The method of claim 8,
Wherein receiving the selection information for each of the plurality of time slots comprises:
And receives selection information for one of the at least one time slots from the prioritized waiters. A computer-readable recording medium on which a program for executing the method of any one of claims 8 to 9 and 11 to 14 is recorded.

Images