JP5838690B2 - Program, information processing apparatus and information processing method - Google Patents

Description

  The present invention relates to a program, an information processing apparatus, and an information processing method for performing information processing by a computer.

  A schedule management system for executing reservation of a conference room using an information processing apparatus has been developed (see, for example, Patent Document 1).

Japanese Patent Laid-Open No. 2003-114962

  However, when the capacity is less than the capacity, the use space corresponding to the surplus capacity is only registered as a virtual facility that can be reserved in the same manner as the physical space, and appropriate reservation for other physical spaces cannot be made.

  An object of one aspect of the present invention is to suppress the occurrence of a reservation pattern in which a reservation cannot be accepted due to a reservation of a part of a space.

The program disclosed in the present application acquires reservation setting information for each of a plurality of spaces to be set for reservation in a computer, and includes space reservation candidate information indicating a reservation set by a space or a combination of spaces included in the plurality of spaces. for the space reservation candidate information space excluding the space used by one of said plurality of spaces, the storage in association with a pattern information indicating a space selection pattern in the reservation content of the reservation setting available space reservation unit And reference to the reservation setting information , select a plurality of available space reservation candidate information, the first space reservation candidate information and the second space reservation candidate information included in the plurality of space reservation candidate information, the first pattern information associated with the first space reservation candidate information Space selection pattern shown, when including space selection pattern shown in the second pattern information associated with the second space reservation candidate information, at the time of display of the plurality of space reservation candidate information, the The display of the second space reservation candidate information is suppressed .

  According to one aspect of the present application, it is possible to suppress the occurrence of a reservation pattern in which a reservation cannot be accepted by reserving a part of a space.

It is explanatory drawing which shows the outline | summary of an information processing system. It is explanatory drawing which shows the hardware group of a server computer. It is explanatory drawing which shows the form of a meeting room. It is explanatory drawing which shows the record layout of a space file. It is explanatory drawing which shows the example of data of a combination file. It is explanatory drawing which shows the record layout of a reservation form file. It is explanatory drawing which shows a subset. It is explanatory drawing which shows the extracted candidate space. It is explanatory drawing which shows the record layout of a statistics file. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is explanatory drawing which shows the form of a seat. It is explanatory drawing which shows the record layout of a space file. It is explanatory drawing which shows the example of data of a combination file. It is explanatory drawing which shows a candidate space. It is explanatory drawing which shows the record layout of a reservation form file. It is explanatory drawing which shows a subset. It is explanatory drawing which shows the extracted candidate space. It is explanatory drawing which shows the form which cannot be reserved. It is explanatory drawing which shows the record layout of a statistics file. It is explanatory drawing which shows a ratio. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is a flowchart which shows the procedure of extraction processing of a candidate space. It is a flowchart which shows the procedure of an extraction process. It is a flowchart which shows the procedure of an extraction process. FIG. 10 is a block diagram illustrating a hardware group of a server computer according to a fifth embodiment. It is explanatory drawing which shows the record layout of a weight file. It is a flowchart which shows the procedure of an extraction process. It is a functional block diagram which shows operation | movement of the server computer of the form mentioned above. FIG. 20 is a block diagram illustrating a hardware group of a server computer according to a sixth embodiment.

Embodiment 1
Hereinafter, embodiments will be described with reference to the drawings. FIG. 1 is an explanatory diagram showing an outline of an information processing system. The information processing system includes an information processing device 1 and terminal devices 2, 2,. The information processing apparatus 1 is, for example, a server computer or a personal computer, and performs information processing on a space that can be reserved alone or in combination. In the present embodiment, the information processing apparatus 1 is described as being a server computer 1. The terminal device 2 is, for example, a personal computer, a mobile phone, a PDA (Personal Digital Assistant), a book reader, a game machine, or a control computer such as a machine tool. Below, the terminal device 2 is demonstrated as what is the personal computer 2. FIG.

  Spaces according to the present embodiment can be reserved alone or in combination. For example, in the case of a conference room, there are a form of making a reservation as a single meeting room and a form of making a reservation by combining a plurality of adjacent conference rooms by removing a partition. The space may be a seat in various vehicles including trains, airplanes, buses, ships and the like. A single seat can be reserved, and a total of two seats in two adjacent horizontal rows, or a total of four seats including the adjacent front row can be reserved in combination. Further, the space may be a banquet hall of a hotel, a hotel having a connecting door (so-called connecting room), or a room of an inn.

  In addition, there are a form of reserving one table in a restaurant and a form of reserving by combining a plurality of tables. In this embodiment, a conference room that can be reserved alone or in combination by using partitions will be described as an example. The server computer 1 and the personal computer 2 are connected via a communication network N such as the Internet or a mobile phone network. The personal computer 2 and the server computer 1 transmit and receive information using HTTP (HyperText Transfer Protocol) or the like.

  The user transmits a conference room reservation request from the personal computer 2 to the server computer 1. The server computer 1 performs processing to be described later, and transmits the reservation result to the personal computer 2. In the present embodiment, the server computer 1 performs processing based on the reservation request from the personal computer 2, but the present invention is not limited to this. The user may input reservation information directly from the keyboard of the information processing apparatus 1. In this case, the reservation result is displayed on the monitor of the server computer 1. Details will be described below.

  FIG. 2 is an explanatory diagram showing a hardware group of the server computer 1. The server computer 1 includes a CPU (Central Processing Unit) 11 as a control unit, a RAM (Random Access Memory) 12, an input unit 13, a display unit 14, a storage unit 15, a clock unit 18, a communication unit 16, and the like. The CPU 11 is connected to each part of the hardware via the bus 17. The CPU 11 controls each part of the hardware according to the control program 15P stored in the storage unit 15.

  The RAM 12 is, for example, SRAM (Static RAM), DRAM (Dynamic RAM), flash memory, or the like. The RAM 12 also functions as a storage unit, and temporarily stores various data generated when the CPU 11 executes various programs. The input unit 13 is an input device such as a mouse or a keyboard, and outputs received operation information to the CPU 11. The display unit 14 is a liquid crystal display, an organic EL (electroluminescence) display, or the like, and displays various information according to instructions from the CPU 11. The clock unit 18 outputs date and time information to the CPU 11.

  The communication unit 16 is a wired or wireless LAN (Local Area Network) card or the like, and transmits / receives information to / from the personal computer 2 through the communication network N. The storage unit 15 is, for example, a hard disk or a large-capacity flash memory, and stores a control program 15P. In addition, the storage unit 15 stores a space file 151, a combination file 152, a reservation form file 153, a statistics file 154, and the like.

  FIG. 3 is an explanatory diagram showing the form of the conference room. Conference rooms as spaces exist from 401 conference rooms to 405 conference rooms. The 401 meeting room, the 402 meeting room, the 403 meeting room, the 404 meeting room, and the 405 meeting room are continuously arranged in one direction along the longitudinal direction of the hallway. Each conference room can accommodate 10 people. Between the 401 conference room and the 402 conference room, as shown by a dotted line in FIG. 3, it can be used as two conference rooms by a partition, and the partition can be removed and used as a single conference room. When combined, the capacity is 20 people. Partitions are also provided between the 402 meeting room and the 403 meeting room, and can be used in combination. When the partition between the 401 conference room and the 402 conference room and the partition between the 402 conference room and the 403 conference room are removed, three conference rooms can be used as one conference room. When three meeting rooms are used as one meeting room, the capacity is 30 people.

  On the other hand, a wall indicated by a solid line is provided between the 403 conference room and the 404 conference room and cannot be combined. A partition between the 404 conference room and the 405 conference room is a partition and can be used in combination. Note that the example of the conference room described in this embodiment is merely an example, and the present invention is not limited to this.

  FIG. 4 is an explanatory diagram showing a record layout of the space file 151. The space file 151 includes a space field, a capacity field, a type field, a combination space field, and the like. In the space field, a space that can be reserved alone or in combination is stored. For example, “401 conference room” which is a single space is stored. Further, “401 conference room-402 conference room” indicating a combination of a plurality of spaces obtained by combining the 401 conference room and the 402 conference room is stored. Furthermore, “401 meeting room-403 meeting room” indicating a combination of three spaces, which is a combination of the 401 meeting room, the 402 meeting room, and the 403 meeting room, is stored. In the capacity field, the capacity is stored in association with each space. For example, a 401 conference room can accommodate 10 people, and a “401 conference room-403 conference room” that combines three conference rooms can accommodate 30 people.

  In the type field, a type is stored for each space. There are two types of space: primitive space and combination space. When the conference rooms are not combined, the primitive spaces are stored in association with each other, and when the conference rooms are combined, the combined spaces are stored. In the combination space field, the combination content of each space is stored in association with the space. For example, “401 meeting room-402 meeting room” stores information that is a combination of the 401 meeting room and the 402 meeting room. Further, “401 meeting room-403 meeting room” stores information indicating that it is a combination of the 401 meeting room, the 402 meeting room, and the 403 meeting room. If no conference room is combined, no data is stored in the combination space field. The content of the space file 151 may be appropriately input from the input unit 13 by the operator in advance. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the space file 151.

  FIG. 5 is an explanatory diagram showing a data example of the combination file 152. The combination file 152 stores all reservation modes that can be reserved for a single space and a plurality of combinations of spaces (hereinafter referred to as all reservation modes in some cases) in a situation where there is no reservation for the space. Has been. In FIG. 5, “10” indicates that a conference room with a capacity of 10 people can be reserved. That is, it is possible to make a reservation for any one of the 401 meeting room, the 402 meeting room, the 403 meeting room, the 404 meeting room, or the 405 meeting room, which is one space. “10-10” indicates that it is possible to reserve two meeting rooms with a capacity of 10 people. For example, it is possible to reserve the 403 conference room in addition to the 401 conference room or the 405 conference room in addition to the 402 conference room.

  “10-10-10” indicates that it is possible to reserve three conference rooms with a capacity of 10 people. For example, it is possible to reserve a 405 conference room in addition to a 401 conference room and a 403 conference room. “10-10-10-10” indicates that it is possible to reserve four conference rooms with a capacity of 10 people. For example, it is a case where 405 conference rooms can be reserved in addition to 401 conference room, 402 conference room, and 403 conference room. “20” indicates that one conference room with a capacity of 20 people can be reserved. For example, it is possible to make a reservation for “401 meeting room-402 meeting room” or “404 meeting room-405 meeting room”, which is a combination of spaces.

  “20-10” indicates that it is possible to reserve one conference room with a capacity of 20 people and a conference room with a capacity of 10 people. It should be noted that the order of reservation is not limited to "10-20", that is, it is possible to reserve one conference room with a capacity of 10 people first and later a conference room with a capacity of 20 people. Including. For example, it is possible to make a reservation for “401 meeting room-402 meeting room” and “404 meeting room”. “20-10-10” indicates that it is possible to reserve one conference room with a capacity of 20 people and two conference rooms with a capacity of 10 people. Regardless of the order of reservation, “10-20-10”, that is, one conference room with a capacity of 10 is reserved first, then a conference room with a capacity of 20 is reserved, and finally the capacity is It also includes being able to reserve a conference room for 10 people. For example, it is possible to make reservations for “401 meeting room-402 meeting room”, “404 meeting room”, and “405 meeting room”.

  “20-20” indicates that it is possible to reserve two conference rooms with a capacity of 20 people. For example, it is possible to make a reservation for “401 meeting room-402 meeting room” and “404 meeting room-405 meeting room”. “30” indicates that it is possible to reserve one conference room with a capacity of 30 people. For example, it is a case where reservation of “401 meeting room-403 meeting room” is possible. “30-10” indicates that it is possible to reserve one conference room with a capacity of 30 people and a conference room with a capacity of 10 people. It should be noted that the order of reservation is not limited to "10-30", that is, it is possible to reserve one conference room with a capacity of 10 people first and later a conference room with a capacity of 30 people. Including. For example, it is possible to make a reservation for “401 meeting room-403 meeting room” and “404 meeting room”. All the reservation forms described above may be appropriately input from the input unit 13 by the operator in advance. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the combination file 152.

  FIG. 6 is an explanatory diagram showing a record layout of the reservation form file 153. The reservation form file 153 includes a candidate space field and a reservation form field. The remarks field is shown for explanation. In the candidate space field, spaces that are candidates for reservation (hereinafter referred to as candidate spaces) are stored. The candidate space indicates a combination of spaces included in a plurality of reservation target spaces. Specifically, “401 conference room” and “402 conference room” which are independent spaces are stored. Further, a combination space “401 meeting room-402 meeting room”, “401 meeting room-403 meeting room”, and the like are stored. In FIG. 6, “conference room” is not shown.

  All reservation forms are stored in the reservation form field. The reservation form file 153 includes a plurality of reservation forms (pattern information) that can be reserved in a space group other than the candidate space when the candidate space is reserved in association with the candidate space (hereinafter, reservation is possible) Form) is stored. Among all reservation forms, the reservation possible form is indicated by a black circle. For example, when a 401 conference room is reserved as a candidate space, it is possible to make a reservation of the reservation form “10” corresponding to other “402 conference rooms”. In addition, the reservation form indicated by “20-10” can be reserved by “402 meeting room-403 meeting room” and “405 meeting room”, for example. In this way, the reservation form file 153 stores a reservable form that can be reserved by a combination of one space or a plurality of spaces other than the candidate space.

  On the other hand, when the 401 conference room is reserved, “401 conference room-403 conference room” indicated by “30” can no longer be reserved as indicated by the X mark in FIG. The reservation form in this case is hereinafter referred to as a reservation impossible form. In addition, “30-10” of all reservation forms is also an unreservable form.

  Next, a case where the combination space “401 conference room-403 conference room” is set as a candidate space will be described. The remaining spaces are “404 meeting room”, “405 meeting room”, and “404 meeting room-405 meeting room”. Therefore, the reservation possible forms are three, “10”, “10-10” and “20” as indicated by black circles. Other than these, the reservation is indicated by X. The reservation possible form or the reservation impossible form corresponding to the candidate space in the reservation form file 153 may be appropriately input by the operator from the input unit 13 in advance, or may be obtained by a round-robin expression as will be described later. Moreover, although the example which memorize | stores both the reservation possible form and the reservation impossible form was given in this embodiment, the form which memorize | stores any one may be sufficient. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the space file 151.

  Further, the CPU 11 may obtain a reservable form or a non-reservable form corresponding to the candidate space with reference to the stored contents of the space file 151 based on the control program 15P, with reference to the stored contents of the space file 151. After obtaining the reservation possible form and the reservation impossible form, the CPU 11 stores the reservation possible form and the reservation impossible form in the reservation form file 153 in association with the candidate space. For example, when the candidate space is “401 meeting room-403 meeting room”, the CPU 11 deletes records including the 401 meeting room, the 402 meeting room, and the 403 meeting room from the space file 151 from the candidate space field. The CPU 11 extracts the remaining spaces “404 conference room”, “405 conference room”, and “404 conference room-405 conference room”. The CPU 11 performs total combination processing on the extracted space, and determines a reservation possible form.

  Specifically, reservation possible form "10" (one of 404 meeting room or 405 meeting room), reservation possible form "10-10" (two reservations of 404 meeting room and 405 meeting room), reservation is possible Form “20” (“404 meeting room-405 meeting room”). The CPU 11 stores the determined reservation available form in the reservation form file 153 in association with the candidate space. Further, the CPU 11 reads all reservation forms from the combination file 152, and determines a form other than the determined reservable form as a reservation impossible form. The CPU 11 stores an unreservable form in association with the candidate space in the reservation form file 153.

  As shown in FIG. 6, each reservation possible form and reservation impossible form correspond one by one to each reservation form of all reservation forms. For example, in the candidate space “401 meeting room-403 meeting room”, the reservation possible forms correspond to the reservation forms “10”, “10-10”, and “20”. Similarly, the reservation impossible forms are the reservation forms “10-10-10”, “10-10-10-10”, “20-10”, “20-10-10”, “20-20”, “30”. , “30-10”.

  When the CPU 11 repeatedly performs the processing described above, the reservation possible form and the reservation impossible form for each candidate space are stored. In the following, for ease of explanation, an example will be described in which a reservation form and a reservation impossible form corresponding to the candidate space are stored in advance in the reservation form file 153 as shown in FIG. In the present embodiment, in order to simplify the description, an example in which various files are stored in the storage unit 15 has been described. However, the file may be stored in the RAM 12 as the storage unit, and the storage location and storage form are not limited. Furthermore, although the example which stores various files in the memory | storage part 15 was given, it is not restricted to this. For example, each file may be stored in a database (not shown). In this case, the CPU 11 may read or write information using SQL (Structured Query Language) or the like.

  As shown in the remarks field, the reservable form of the candidate space “401 meeting room” is the same as the reservable form of “403 meeting room”. Similarly, the non-reservable form of the candidate space “401 meeting room” and the non-reservable form of “403 meeting room” are the same. Further, the reservation possible form of the candidate space “404 meeting room” and the reservation possible form of “405 meeting room” are the same. In addition, the reservable form of the candidate space “401 meeting room-402 meeting room” and the reservable form of “402 meeting room-403 meeting room” are the same.

  FIG. 7 is an explanatory diagram showing a subset. The CPU 11 obtains a reservation possible form corresponding to each candidate space from the reservation form file 153. CPU11 contrasts the reservation possible form of each acquired candidate space. The CPU 11 stores all candidate spaces in the RAM 12. The CPU 11 performs a process of deleting, from the RAM 12, another candidate space (second candidate space) that is a subset of a reservationable form of one candidate space (first candidate space). For example, the CPU 11 compares the reservable form (first pattern information) of the candidate space “401 meeting room” with the reservable form (second pattern information) of the candidate space “402 meeting room”. In this case, since the “402 conference room” is a subset of “401 conference room”, the CPU 11 deletes the candidate space “402 conference room” from the RAM 12. In the present embodiment, when the set A is a subset of the set B, the set A is a part or all of the elements of the set B.

  The candidate space “403 conference room” is the same as the reservation possible form of the candidate space “401 conference room”, and therefore is a subset of the candidate space “401 conference room”. If the number of reservation available forms is the same, either one may be selected. The CPU 11 deletes the candidate space “403 meeting room” from the RAM 12. Since there is no other subset for the candidate space “401 meeting room”, the CPU 11 keeps the candidate space “401 meeting room” stored in the RAM 12. Next, the CPU 11 performs processing for deleting other subsets.

  The CPU 11 compares the candidate space “404 meeting room” with “405 meeting room”. The CPU 11 deletes “405 meeting room” from the RAM 12 because “405 meeting room” is a subset of “404 meeting room”. Similarly, the CPU 11 selects the candidate space “404 meeting room”, “401 meeting room−402 meeting room”, “402 meeting room−403 meeting room”, “401 meeting room−403 meeting room”, and “404 meeting room−405 meeting”. Contrast “room” with each other. The CPU 11 is “401 meeting room-402 meeting room”, “402 meeting room-403 meeting room”, “401 meeting room-403 meeting room”, and “404 meeting room-405 meeting room” are a subset of “404 meeting room”. Therefore, it is deleted from the RAM 12.

  FIG. 8 is an explanatory diagram showing the extracted candidate spaces. The candidate spaces remaining in the RAM 12 by the processing described above are the candidate spaces “401 conference room” and “404 conference room” shown in FIG. The CPU 11 extracts “401 meeting room” and “404 meeting room” as candidate spaces from the RAM 12 and outputs them to the display unit 14. In addition, the CPU 11 transmits the candidate spaces “401 meeting room” and “404 meeting room” extracted via the communication unit 16 to the personal computer 2. In this way, in addition to extracting and outputting a plurality of candidate spaces, any one candidate space may be further extracted as follows.

  FIG. 9 is an explanatory diagram showing a record layout of the statistical file 154. The statistics file 154 includes a reservation form field, a reservation number field, a ratio field, and the like. In the reservation form field, all reservation forms respectively corresponding to the reservable form indicated by black circles and the non-reservable form indicated by X in FIG. 6 are stored. In the number field, the number of reservations as a history is stored in association with the reservation form. In the ratio field, a reservation ratio is stored in association with the reservation form. The statistics file 154 stores a history of reservation forms by day, hour, or day of the week. The example of FIG. 9 shows a history for a reservation form on Monday morning. Note that the example of FIG. 9 is an example and is not limited thereto. For example, the time zone may be further subdivided, and the history may be stored in association with information such as a month and a holiday. Moreover, although both the number of cases and a ratio were shown as a log | history, either one may be sufficient.

  When accepting the reservation, the CPU 11 refers to the reservation form, the day of the reservation, and the reservation time, and increments the number of reservations corresponding to the day of the week, the time zone, and the reservation form. The CPU 11 calculates the ratio by dividing the number of reservations after the increment by the number of reservations of all reservation forms corresponding to the stored day of the week and time and multiplying by 100. The CPU 11 stores the calculated ratio in the statistics file 154. In the present embodiment, an example of storing the statistical file 154 corresponding to the date and time has been described, but the present invention is not limited to this. Regardless of the date and time, the number and ratio of all reservations for the reservation form may be stored.

  The CPU 11 receives the day of the week and the time zone at the time of reservation from the personal computer 2. The CPU 11 reads the candidate spaces “401 conference room” and “404 conference room” from the RAM 12 to determine the final candidate space. The CPU 11 refers to the reservation form file 153 and reads the reservation forms related to the reservation impossible forms (marked with X) of the candidate spaces “401 meeting room” and “404 meeting room”. Specifically, the CPU 11 reads the reservation forms “30” and “30-10” related to the reservation impossible form corresponding to the candidate space “401 conference room”. The CPU 11 reads the reservation form “20-20” related to the reservation impossible form corresponding to the candidate space “404 conference room”. The CPU 11 reads the ratio corresponding to the read reservation form and the received day of the week and time zone. When there are a plurality of ratios, the CPU 11 adds the ratios.

  The CPU 11 calculates the total ratio 7.7% by adding 2.9% and 2.9% for the reservation types “30” and “30-10” for the candidate space “401 conference room”. The percentage of the reservation form “20-20” for the candidate space “403 conference room” is 11.1%. The CPU 11 compares the ratios corresponding to the unreservable forms of the candidate spaces, and extracts the candidate space with the minimum ratio. In this case, the CPU 11 extracts the minimum candidate space “401 meeting room” with a ratio of 7.7%. The CPU 11 displays the extracted final candidate space on the display unit 14. The CPU 11 transmits the extracted candidate space to the personal computer 2 via the communication unit 16. Instead of the ratio, the number of cases may be compared to extract a candidate space with the smallest number of cases.

  The CPU 11 calculates the total number of cases by adding the number of reservation types “30” and “30-10” of the candidate space “401 conference room”. Since the number of reservation forms “20-20” for the candidate space “403 conference room” is one, the total number is not calculated. The CPU 11 compares the number of cases corresponding to the unreservable form of each candidate space, and extracts the candidate space with the smallest number of cases. Hereinafter, in order to facilitate the description, an example using a ratio will be described.

  Various software processes in the above hardware will be described with reference to flowcharts. 10 to 12 are flowcharts showing the procedure of candidate space extraction processing. The CPU 11 receives a reservation date, a reservation day of the week, a reservation time zone, and the number of accommodated persons from the personal computer 2 via the communication unit 16 (step S101). In this embodiment, an example in which the number of accommodated persons is received will be described. However, the number of conference rooms may be received. For example, one meeting room, one meeting room combining two meeting rooms, and two independent meeting rooms. For ease of explanation, it is assumed that the number of accommodated persons is 10, 20, 30, 10, 10 and 20, 10 and the like. The CPU 11 may accept only the reservation date and determine the day of the week with reference to the clock unit 18.

  The CPU 11 reads the space file 151 into the RAM 12 (Step S102). The CPU 11 reads the reservation status of each conference room in the reservation date and time, reservation day of the week, and reservation time zone already stored in the storage unit 15. The CPU 11 deletes the reserved space (meeting room) record from the space file 151 developed in the RAM 12 (step S103). The CPU 11 reads the reservation form from the combination file 152 (step S104). The CPU 11 determines one of the deleted spaces developed in the RAM 12 as a candidate space (step S105). The CPU 11 once deletes the record of the space determined as the candidate space from the space file 151 developed in the RAM 12 (step S106).

  The CPU 11 refers to the space file 151 developed in the RAM 12 for the candidate space, and determines whether or not reservation is possible for each reservation form read in step S104 (step S107). Specifically, the CPU 11 compares the reserved number of persons with the number of persons in the space file 151 developed in the RAM 12. The CPU 11 determines whether or not a space having a capacity that can accommodate the reserved capacity is stored in the space file 151 stored in the RAM 12. For example, when the capacity of the reservation form is “30”, the CPU 11 determines that reservation is impossible unless “401 meeting room-403 meeting room” with the capacity of “30” is stored in the RAM 12. On the other hand, if it is stored in the RAM 12, it is determined that a reservation is possible.

  Further, the CPU 11 determines that the reservation is not possible if the conference room relating to the combination of “20” and “10” is not stored in the RAM 12 when the reserved capacity is “20-10”. On the other hand, if it is stored in the RAM 12, it is determined that a reservation is possible. The CPU 11 determines whether it is determined that reservation is possible (step S108). If the CPU 11 determines that reservation is possible (YES in step S108), the process proceeds to step S109. The CPU 11 stores the reservation possible form in association with the candidate space in the reservation form file 153 (step S109).

  If the CPU 11 determines that reservation is not possible (NO in step S108), the process proceeds to step S111. The CPU 11 stores the reservation impossible form in the reservation form file 153 in association with the candidate space (step S111). The CPU 11 determines whether or not the processing has been completed for all candidate spaces (step S112). Specifically, when the process in step S108 ends, the CPU 11 sets a process completed flag in association with the candidate space. The CPU 11 may determine that the processing has been completed for all candidate spaces when the completed flag is set for all the spaces other than the space deleted as reserved in step S103.

  If the CPU 11 determines that the process has not been completed for all candidate spaces (NO in step S112), the process returns to step S105. In this case, the CPU 11 reads a new unprocessed space from the RAM 12 and determines it as a new candidate space. Further, the CPU 11 restores the record of the processed candidate space deleted in step S106. That is, the CPU 11 performs processing for canceling deletion of the processed candidate space. By repeating the above processing, the reservation possible form and the reservation impossible form for the candidate space of the reservation form file 153 are stored. As described above, the reservation form file 153 may be created in advance.

  If the CPU 11 determines that the process has been completed for each candidate space (YES in step S112), the process proceeds to step S113. The CPU 11 reads the reservationable form of each candidate space into the RAM 12 and compares it (step S113). The CPU 11 deletes other candidate spaces that are a subset of one candidate space from the RAM 12 (step S114). The CPU 11 extracts the remaining candidate space from the RAM 12 (step S115). The CPU 11 determines whether or not there are a plurality of extracted candidate spaces (step S116). If the CPU 11 determines that there are not more than one (NO in step S116), the process proceeds to step S117. The CPU 11 transmits the candidate space to the personal computer 2 via the communication unit 16 (step S117). The CPU 11 stores reservation information for the candidate space in the storage unit 15 in association with the reservation date, day of the week, and time zone.

  The CPU 11 refers to the statistics file 154 and increments the number of reservations corresponding to the reservation day of the week, the reservation time zone, and the reservation form (step S118). The CPU 11 calculates the ratio by dividing the number of reservations after increment by the total number of reservations on the same reservation day and the same reservation time period and multiplying by 100 (step S119). The CPU 11 stores the ratio in association with the reservation day of the week, the reservation time zone, and the reservation form (step S121).

  If the CPU 11 determines that there are a plurality of candidate spaces (YES in step S116), the process proceeds to step S122. The CPU 11 reads from the reservation form file 153 the reservation form corresponding to the reservation impossible form of each of the plurality of candidate spaces (step S122). The CPU 11 reads from the statistical file 154 the ratio of the reservation form of each candidate space corresponding to the reservation day of the week and the reservation time zone (step S123). The CPU 11 determines whether there are a plurality of read ratios (step S124). If the CPU 11 determines that the ratio is plural (YES in step S124), the CPU 11 calculates the total ratio (step S125). If the CPU 11 determines that the ratio is not plural (NO in step S124), the process proceeds to step S126. The CPU 11 extracts a candidate space having the minimum ratio (step S126).

  The CPU 11 transmits the candidate space to the personal computer 2 via the communication unit 16 (step S127). The CPU 11 stores reservation information for the candidate space in the storage unit 15 in association with the reservation date, day of the week, and time zone.

  The CPU 11 refers to the statistics file 154 and increments the number of reservations corresponding to the reservation day of the week, the reservation time zone, and the reservation form (step S128). The CPU 11 calculates the ratio by dividing the number of reservations after the increment by the total number of reservations for the same reservation day and the same reservation time period, and multiplying by 100 (step S129). The CPU 11 stores the ratio in association with the reservation day of the week, the reservation time zone, and the reservation form (step S1210). As a result, it becomes possible to increase the possibility of reserving other spaces after the reservation. In addition, by extracting candidate spaces that are unlikely to be reserved, it is possible to further increase the reservation possibility of other spaces.

Embodiment 2
The second embodiment relates to a form in which a seat of a train is used as a space. FIG. 13 is an explanatory view showing the form of a seat. The seats as spaces are the following two rows of seats for ease of explanation. The number of seats is one, and it can be reserved alone, or it can be reserved in combination, such as side by side. The seat is a train with an asymmetrical seating arrangement with 3 seats on one side and 2 seats on the other side across the passage. By rotating the direction from the 1A seat to the 1C seat, 6 seats from the 1A seat to the 1C seat and the 2A seat to the 2C seat can face each other, and a reservation by combination can be made. Similarly, by rotating the directions of the seat 1D and the seat 1E, it is possible to make a reservation in which four seats, the seat 1D and the seat 1E, the seat 2D, and the seat 2E face each other and are combined.

  FIG. 14 is an explanatory diagram showing a record layout of the space file 151. The space file 151 includes a space field, a user number field, a type field, a combination space field, and the like. In the space field, a space that can be reserved alone or in combination is stored. For example, “1A seat” which is a single space is stored. Further, “1A seat—1B seat” indicating a combination of a plurality of spaces in which the 1A seat and the 1B seat are combined is stored. In FIG. 14, the description of the seat is omitted. In addition, "1A seat-1C seat, 2A seat-2C seat" and the like indicating combinations of six spaces obtained by rotating the 1C seat from the 1A seat and combining these seats with the 2A seat to the 2C seat are stored. . The number of users field is stored in association with each space. For example, the 1A seat has one person. “1A seat—1C seat, 2A seat—2C seat” combining six seats can be used by six people.

  In the type field, a type is stored for each space. There are two types of space: primitive space and combination space. When the seats are not combined, the original space is stored in association with each other, and when the seats are combined, the combined space is stored. In the combination space field, the combination content of each space is stored in association with the space. For example, “1A seat-1B seat” stores information that is a combination of 1A seat 1B seat. Further, “1A seat-1C seat” stores information indicating that it is a combination of the 1A seat, the 1B seat, and the 1C seat. If no seats are combined, no data is stored in the combination space field. The content of the space file 151 may be appropriately input from the input unit 13 by the operator in advance. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the space file 151. In addition to the manual input by the operator, the CPU 11 may automatically create the stored contents according to a program created in advance and store it in the space file 151.

  FIG. 15 is an explanatory diagram showing an example of data in the combination file 152. The combination file 152 stores all reservation forms that can be reserved for a single space and a plurality of combinations of spaces in a situation where there is no reservation for the space. In FIG. 15, “2” indicates that a seat for two users can be reserved. That is, it is shown that a reservation or the like combining the 1A seat and the 1B seat is possible. For the sake of space, reservations with one person can be displayed as “1”, “1-1”, “2-1”, etc., but these descriptions are omitted. . In this case, reservation of three seats, such as one 1A seat, two 1A seats and two 1C seats, a combination of 1A seats and 1B seats, and 1D seats, is possible.

  “4” indicates that it is possible to reserve four seats for a combination of two and two users. For example, a case where a 1D seat and a 1E seat are rotated and a reservation is made in combination with a 2D seat and a 2E seat. All the reservation forms described above may be appropriately input from the input unit 13 by the operator in advance. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the combination file 152. In addition to the manual input by the operator, the CPU 11 may automatically create the stored contents according to a program created in advance and store it in the space file 151.

  FIG. 16 is an explanatory diagram showing candidate spaces. When making a reservation, candidate spaces 1A to 1E, 2A to 2E are listed as candidates. However, the combination of the candidate space 1A seat and the 1C seat is the same. In addition, the candidate space 1D seat and the 1E seat have the same combination. The candidate spaces 1A to 1E and the 2A to 2E seats at the target position have the same combination. Since there are a large number of candidate spaces that are candidates for reservation, in the present embodiment, in order to facilitate the explanation, duplication will be omitted, and the candidate spaces will be described by focusing on three of the 1A seat, 1B seat, and 1D seat.

  FIG. 17 is an explanatory diagram showing a record layout of the reservation form file 153. The reservation form file 153 includes a candidate space field and a reservation form field. A candidate space that is a candidate for reservation is stored in the candidate space field. Specifically, “1A seat”, “1B seat”, and “1D seat”, which are independent spaces, are stored. Note that the letters “seat” are omitted as in the other figures.

  All reservation forms are stored in the reservation form field. The reservation form file 153 stores a plurality of reservable forms that can be reserved in a space group other than the candidate space when the candidate space is reserved in association with the candidate space. Among all reservation forms, the reservation possible form is indicated by a black circle. For example, when a 1A seat is reserved as a candidate space, it is possible to make a reservation in the reservation form “2” (combination of 1B seat and 1C seat). On the other hand, when the reservation for the 1A seat is made, the combination of “1A seat to 1C seat and 2A seat to 2C seat” indicated by “3-3” can be reserved as indicated by the X mark in FIG. Can not. Hereinafter, this form is referred to as a reservation impossible form. In addition, “6-2” of all reservation forms is also a reservation impossible form.

  The reservable form or unreservable form corresponding to the candidate space in the reservation form file 153 may be appropriately input from the input unit 13 in advance by the operator. Moreover, although the example which memorize | stores both the reservation possible form and the reservation impossible form was given in this embodiment, the form which memorize | stores any one may be sufficient. In addition, information may be input via the communication unit 16 from another computer (not shown). The CPU 11 stores the information input from the input unit 13 in the space file 151.

  Further, the CPU 11 may obtain a reservable form or a non-reservable form corresponding to the candidate space with reference to the stored contents of the space file 151 based on the control program 15P, with reference to the stored contents of the space file 151. After obtaining the reservation possible form and the reservation impossible form, the CPU 11 stores the reservation possible form and the reservation impossible form in the reservation form file 153 in association with the candidate space. By repeating the process described above for each candidate space, the reservation possible form and the reservation impossible form for each candidate space are stored.

  FIG. 18 is an explanatory diagram showing a subset. The CPU 11 obtains a reservation possible form corresponding to each candidate space from the reservation form file 153. CPU11 contrasts the reservation possible form of each acquired candidate space. The CPU 11 stores all candidate spaces in the RAM 12. The CPU 11 performs a process of deleting from the RAM 12 other candidate spaces that are a subset of the reservationable form of one candidate space. For example, the CPU 11 compares the reservable form of the candidate space “1A seat” with the reservable form of the candidate space “1B seat”. In this case, since the “1B seat” is a subset of “1A seat”, the CPU 11 deletes the candidate space “1B seat” from the RAM 12.

  Since there is no subset of the candidate space “1D seat”, the candidate space “1D seat” is not deleted from the RAM 12. FIG. 19 is an explanatory diagram showing the extracted candidate spaces. The candidate spaces remaining in the RAM 12 by the processing described above are the candidate spaces “1A seat” and “1D seat” shown in FIG. The CPU 11 extracts “1A seat” and “1D seat” as candidate spaces from the RAM 12 and outputs them to the display unit 14. In addition, the CPU 11 transmits the candidate spaces “1A seat” and “1D seat” extracted via the communication unit 16 to the personal computer 2. In this way, in addition to extracting and outputting a plurality of candidate spaces, any one candidate space may be further extracted as follows.

  FIG. 20 is an explanatory diagram showing a reservation impossible form. As shown in FIG. 20, the reservation forms corresponding to the non-reservable form related to the candidate space “1A seat” are “3-3”, “3-3-2”, “6-2”, and “6”. On the other hand, the reservation forms corresponding to the non-reservable forms related to the candidate space “1D seat” are “2-2-2-2”, “3-2-2-2”, “4”, “4-2”, “4-2-2”, “4-3”, and “4-3-2”.

  FIG. 21 is an explanatory diagram showing a record layout of the statistics file 154. The statistics file 154 includes a reservation form field, a reservation number field, a ratio field, and the like. In the reservation form field, all reservation forms respectively corresponding to the reservation possible form indicated by the black circle and the reservation impossible form indicated by the X are stored. For ease of explanation, description of some reservation forms is omitted. In the reservation number field, the number of reservations as a history is stored in association with the reservation form. In the ratio field, a reservation ratio is stored in association with the reservation form. The statistics file 154 stores a history of reservation forms by day, train number, or day of the week. In the example of FIG. 21, the history for the reservation form of car No. 10 on Monday is shown. Note that the example of FIG. 21 is an example, and the present invention is not limited to this.

  When the CPU 11 accepts the reservation, the CPU 11 refers to the reservation form, the day of the reservation, and the number of issues, and increments the number of reservations corresponding to the day of the week, the number of issues, and the reservation form. The CPU 11 calculates the ratio by dividing the number of reservations after the increment by the number of reservations of all reservation forms corresponding to the stored day of the week and number of issues and multiplying by 100. The CPU 11 stores the calculated ratio in the statistics file 154.

  The CPU 11 receives the reservation date and time, day of the week, and number from the personal computer 2. The CPU 11 reads the candidate spaces “1A seat” and “1D seat” from the RAM 12 to determine the final candidate space. The CPU 11 refers to the reservation form file 153 and reads out the reservation forms relating to the candidate space “1A seat” and “1D seat” which cannot be reserved (marked with X). Specifically, the CPU 11 reads reservation forms “3-3”, “3-3-2”, “6-2”, and “6” according to the reservation impossible form corresponding to the candidate space “1A seat”. The CPU 11 reserves the reservation forms “2-2-2-2”, “3-2-2-2”, “4”, “4-2”, “4-2”, which are related to the candidate space “1D seat”. “4-2-2”, “4-3” and “4-3-2” are read out. CPU11 reads the ratio corresponding to the read reservation form and the received day of the week and number of issues. When there are a plurality of ratios, the CPU 11 adds the ratios.

  FIG. 22 is an explanatory diagram showing the ratio. CPU11 adds each ratio which concerns on the reservation form of candidate space "1A seat", and calculates | requires the total ratio "6.5%". CPU11 adds each ratio which concerns on the reservation form of candidate space "1D seat", and calculates | requires the total ratio "34.3%". The CPU 11 compares the ratios corresponding to the unreservable forms of the candidate spaces, and extracts the candidate space with the minimum ratio. In this case, the CPU 11 extracts the smallest candidate space “1A seat” with a ratio of 6.5%. The CPU 11 displays the extracted final candidate space on the display unit 14. The CPU 11 transmits the extracted candidate space to the personal computer 2 via the communication unit 16. Instead of the ratio, the number of cases may be compared to extract a candidate space with the smallest number of cases.

  FIG. 23 to FIG. 25 are flowcharts showing the procedure of candidate space extraction processing. The CPU 11 accepts the reservation date, reservation day, number of issues and number of users from the personal computer 2 via the communication unit 16 (step S231). In the present embodiment, it is assumed that the number of users is one for ease of explanation. In addition, it is not necessary to accept only the reservation date on the reception reservation day.

  The CPU 11 reads the space file 151 into the RAM 12 (step S232). The CPU 11 reads the reservation status of each seat in the reservation date and time, the reservation day of the week, and the number stored in the storage unit 15. The CPU 11 deletes the reserved space (seat) record from the space file 151 developed in the RAM 12 (step S233). The CPU 11 reads the reservation form from the combination file 152 (step S234). The CPU 11 determines one of the deleted spaces developed in the RAM 12 as a candidate space (step S235). The CPU 11 once deletes the record of the space determined as the candidate space from the space file 151 developed in the RAM 12 (step S236).

  The CPU 11 refers to the space file 151 developed in the RAM 12 for the candidate space, and determines whether or not reservation is possible for each reservation form read in step S234 (step S237). Specifically, the CPU 11 compares the number of users in the reservation form with the number of users in the space file 151 developed in the RAM 12. The CPU 11 determines whether or not a space having the number of users that can accommodate the number of users in the reservation form is stored in the space file 151 stored in the RAM 12. For example, when the number of users in the reservation form is “2”, the CPU 11 determines that the reservation is not possible unless “1A seat-1B seat” with a capacity of “2” is stored in the RAM 12. On the other hand, if it is stored in the RAM 12, it is determined that a reservation is possible.

  Further, when the number of users in the reservation form is “6”, the CPU 11 determines that the reservation is impossible unless the space “1A-1C, 2A-2C” with the number of users “6” is stored in the RAM 12. On the other hand, if it is stored in the RAM 12, it is determined that a reservation is possible. When the number of users in the reservation form is “3-3”, the record “1A seat-1C seat” related to the candidate pattern 1A has been deleted from the RAM 12, so that the reservation form becomes impossible. The CPU 11 determines whether it is determined that the reservation is possible (step S238). If the CPU 11 determines that reservation is possible (YES in step S238), the process proceeds to step S239. The CPU 11 stores the reservation possible form in the reservation form file 153 in association with the candidate space (step S239).

  If the CPU 11 determines that reservation is not possible (NO in step S238), the process proceeds to step S241. The CPU 11 stores the non-reservable form in association with the candidate space in the reservation form file 153 (step S241). The CPU 11 determines whether the processing has been completed for all candidate spaces (step S242). Specifically, the CPU 11 sets a processed flag when the process of step S238 is executed for the determined candidate space. The CPU 11 determines whether a processed flag is set for a space other than the space deleted as reserved in step S233. If the CPU 11 determines that the processed flag has been set for all the spaces, the CPU 11 determines that the processing has ended.

  If the CPU 11 determines that the process has not been completed for all candidate spaces (NO in step S242), the process returns to step S236. At that time, the CPU 11 reads a new space from the RAM 12 and determines it as a candidate space. Further, the CPU 11 restores the record of the processed candidate space once deleted in step S236 from the space file developed in the RAM 12. By repeating the above processing, the reservation possible form and the reservation impossible form for the candidate space of the reservation form file 153 are stored. As described above, the reservation form file 153 may be created in advance.

  If the CPU 11 determines that the process has been completed for each candidate space (YES in step S242), the process proceeds to step S243. The CPU 11 reads the reservationable form of each candidate space into the RAM 12 and compares it (step S243). The CPU 11 deletes other candidate spaces that are a subset of one candidate space from the RAM 12 (step S244). The CPU 11 extracts the remaining candidate space from the RAM 12 (step S245). The CPU 11 determines whether there are a plurality of extracted candidate spaces (step S246). If the CPU 11 determines that there are not more than one (NO in step S246), the process proceeds to step S247. The CPU 11 transmits the candidate space to the personal computer 2 via the communication unit 16 (step S247). The CPU 11 stores reservation information for the candidate space in the storage unit 15 in association with the reservation date, day of the week, and number.

  The CPU 11 refers to the statistics file 154 and increments the reservation day corresponding to the reservation day of the week, the number of issues, and the reservation form (step S248). The CPU 11 calculates the ratio by dividing the number of reservations after increment by the total number of reservations of the same reservation day and the same issue number, and multiplying by 100 (step S249). The CPU 11 stores the ratio in association with the reservation day of the week, the number of issues, and the reservation form (step S251).

  If the CPU 11 determines that there are a plurality of candidate spaces (YES in step S246), the process proceeds to step S252. The CPU 11 reads the reservation form corresponding to the reservation impossible form of each of the plurality of candidate spaces from the reservation form file 153 (step S252). The CPU 11 reads the reservation form ratio of each candidate space corresponding to the reservation day and number from the statistics file 154 (step S253). The CPU 11 determines whether there are a plurality of read ratios (step S254). When the CPU 11 determines that the ratio is plural (YES in step S254), the CPU 11 calculates the total ratio (step S255). If the CPU 11 determines that the ratio is not plural (NO in step S254), the process proceeds to step S256. The CPU 11 extracts a candidate space with the smallest ratio (step S256).

  The CPU 11 transmits the candidate space to the personal computer 2 via the communication unit 16 (step S257). The CPU 11 stores reservation information for the candidate space in the storage unit 15 in association with the reservation date, day of the week, and issue number.

  The CPU 11 refers to the statistics file 154 and increments the reservation day corresponding to the reservation day of the week, the number of issues, and the reservation form (step S258). The CPU 11 calculates the ratio by dividing the number of reservations after increment by the total number of reservations of the same reservation day and the same issue number and multiplying by 100 (step S259). The CPU 11 stores the ratio in association with the reservation day of the week, the number of issues, and the reservation form (step S2510). This makes it possible to efficiently make reservations for train seats.

  The second embodiment is as described above, and the other parts are the same as those of the first embodiment. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 3
Embodiment 3 relates to a form in which candidate spaces are extracted based on the number of forms that cannot be reserved. In the following embodiments, the example of the conference room described in the first embodiment will be described, but the present invention may be applied to other spaces such as a train seat described in the second embodiment. FIG. 26 is a flowchart showing the procedure of the extraction process. CPU11 performs the following processes, when it is judged by the process of step S116 that there are a plurality of candidate spaces. The CPU 11 reads out the unreservable form of each candidate space (step S261). The CPU 11 extracts a candidate space with the smallest number of non-reservable forms (step S262). The CPU 11 transmits the extracted candidate space to the personal computer 2 via the communication unit 16 (step S263).

  In the example of FIG. 8, the candidate space “404 conference room” having the smallest number of non-reservable forms of 1 is extracted. Thus, the CPU 11 can flexibly secure a large number of reservations by executing the processes after step S261 when the number of statistical data bases is equal to or less than the threshold stored in the storage unit 15.

  The third embodiment is as described above, and the others are the same as in the first and second embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 4
The fourth embodiment relates to a form in which candidate spaces are extracted based on the number of reservable forms. FIG. 27 is a flowchart showing the procedure of the extraction process. CPU11 performs the following processes, when it is judged by the process of step S116 that there are a plurality of candidate spaces. CPU11 reads the reservation possible form of each candidate space (step S271). The CPU 11 extracts a candidate space having the maximum number of reservable forms (step S272). The CPU 11 transmits the extracted candidate space to the personal computer 2 via the communication unit 16 (step S273).

  In the example of FIG. 8, the largest candidate space “404 conference room” having 9 reservationable forms is extracted. As a result, even when statistical data is not available, the possibility that more reservations can be secured can be improved.

  The fourth embodiment is as described above, and the others are the same as in the first to third embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 5
The fifth embodiment relates to an extraction process considering the weight of the candidate space. FIG. 28 is a block diagram illustrating a hardware group of the server computer 1 according to the fifth embodiment. A weight file 155 is stored in the storage unit 15. In the present embodiment, the statistical file 154 is not always necessary. FIG. 29 is an explanatory diagram showing a record layout of the weight file 155. The weight file 155 stores weights in association with reservation forms. In the present embodiment, the description will be made assuming that the greater the weight, the higher the reservation ratio. The magnitude of the weight is an example, and is not limited to this.

  FIG. 30 is a flowchart showing the procedure of the extraction process. CPU11 performs the following processes, when it is judged by the process of step S116 that there are a plurality of candidate spaces. The CPU 11 reads out the non-reservable form of each candidate space (step S301). For each candidate space, the CPU 11 reads the weight of the reservation form corresponding to the reservation impossible form from the weight file 155 (step S302). CPU11 calculates the total value of the read weight for every candidate space (step S303). The CPU 11 extracts a candidate space having the smallest total value (step S304). If the total value is the same, any candidate space selected arbitrarily is extracted. The CPU 11 transmits the extracted candidate space to the personal computer 2 via the communication unit 16 (step S305).

  In the example of the first embodiment, the reservation forms corresponding to the non-reservable form of the candidate space “401 conference room” are “30” and “30-10”. The respective weights are 3 and 1. The total value is 4. The reservation form corresponding to the non-reservable form of the candidate space “404 conference room” is “20-20”. The weight is 1. The total value is also 1. Therefore, a candidate space “404 conference room” having a total value with a small weight is extracted. In the present embodiment, the weight according to the reservation impossible form is used, but the present invention is not limited to this. On the contrary, the CPU 11 calculates the total weight of the reservation form corresponding to the reservation possible form. The CPU 11 may extract a candidate space having the largest weight value. In the third to fifth embodiments, the CPU 11 reads the total number of history cases in the statistical file 154. This total value may be, for example, the total value of the number of reservations corresponding to the day of the week and the time period when the reservation is made. The CPU 11 determines whether or not the total value is greater than or equal to the threshold value stored in the storage unit 15. When the CPU 11 determines that the value is not equal to or greater than the threshold value, the CPU 11 switches to the process of step S261, S271, or S301 after the process of YES in step S116. This makes it possible to achieve more reservations even in situations where there are few statistical data.

  The fifth embodiment is as described above, and the other parts are the same as those of the first to fourth embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 6
FIG. 31 is a functional block diagram showing the operation of the server computer 1 of the above-described form. When the CPU 11 executes the control program 15P and the like, the server computer 1 operates as follows. The server computer 1 includes a control unit 101, a storage unit 15, an acquisition unit 102, a deletion unit 103, an extraction unit 104, an output unit 105, and the like. According to the instruction from the control unit 101, the acquisition unit 102 stores a plurality of reservable forms that can be reserved for a space other than the space in association with a space that can be reserved alone or in combination. The storage unit 15 is referred to. The acquisition unit 102 acquires, for each candidate space, a plurality of reservable forms corresponding to candidate spaces that are candidates. In addition, the acquisition unit 102 indicates a candidate space indicating a space or a combination of spaces included in a plurality of reservation target spaces, and a pattern indicating a reservation content pattern that can be reserved in a space excluding the candidate space among the plurality of spaces. The first pattern information associated with the first candidate space and the second pattern information associated with the second candidate space are acquired by referring to the storage unit that stores the information in association with each other. The deletion unit 103 compares a plurality of reservation possible forms of each candidate space acquired by the acquisition unit 102, and deletes other candidate spaces that are a subset of one candidate space. The extraction unit 104 extracts a candidate space after the deletion unit 103 deletes another candidate space. The output unit 105 outputs information indicating the first candidate space when the pattern indicated by the first pattern information includes the pattern indicated by the second pattern information.

  FIG. 32 is a block diagram illustrating a hardware group of the server computer 1 according to the sixth embodiment. A program for operating the server computer 1 is stored in the storage unit 15 by causing the reading unit 10A such as a disk drive to read the portable recording medium 1A such as a CD-ROM, a DVD (Digital Versatile Disc) disk, or a USB memory. Also good. Further, a semiconductor memory 1B such as a flash memory storing the program may be mounted in the personal computer 2. Further, the program can be downloaded from another server computer (not shown) connected via a communication network N such as the Internet. The contents will be described below.

  The server computer 1 shown in FIG. 32 reads a program for executing the above-described various software processes from the portable recording medium 1A or the semiconductor memory 1B or from another server computer (not shown) via the communication network N. to download. The program is installed as the control program 15P, loaded into the RAM 12, and executed. Thereby, it functions as the server computer 1 described above.

  The sixth embodiment is as described above, and the other parts are the same as those of the first to fifth embodiments. Accordingly, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

  The following additional notes are further disclosed with respect to the embodiments including the first to fourth embodiments.

(Appendix 1)
In a program for information processing by a computer having a control unit,
On the computer,
In association with a space that can be reserved alone or in combination, with reference to a storage unit that stores a plurality of reservable forms that can be reserved for a space other than the space, reservation is made by the control unit A plurality of reservable forms corresponding to candidate spaces that are candidates for
Contrast the multiple possible reservation forms for each candidate space, delete other candidate spaces that are a subset of one candidate space,
The program which extracts the candidate space after the said other candidate space is deleted by the said control part.

(Appendix 2)
The storage unit stores a reservable form that can be reserved for a space other than the space in association with a space and a non-reservable form that cannot be reserved,
When there are a plurality of extracted candidate spaces, the control unit refers to the storage unit, and reads the non-reservable form corresponding to the candidate space for each candidate space,
The control unit refers to a storage unit that stores a reservation history for each reservation form corresponding to each reservationable form and non-reservable form, and records the history corresponding to the reservation impossible form of the read candidate space for each candidate space. Get into
The program according to appendix 1, wherein one candidate space is extracted based on the history corresponding to the acquired non-reservable form for each candidate space.

(Appendix 3)
The storage unit stores a history including the number of reservations or the ratio of reservations for each reservation form corresponding to each reservationable form and reservation impossible form,
The program according to appendix 2, wherein when extracting one candidate space, the number or ratio corresponding to the acquired non-reservable form of each candidate space is compared, and the candidate space with the smallest number or ratio is extracted.

(Appendix 4)
The storage unit stores a reservable form that can be reserved for a space other than the space in association with a space and a non-reservable form that cannot be reserved,
When there are a plurality of extracted candidate spaces, the control unit refers to the storage unit, and reads the non-reservable form corresponding to the candidate space for each candidate space,
The program according to claim 1, wherein the control unit extracts a candidate space having the smallest number of read-out non-reservable forms.

(Appendix 5)
The program according to appendix 1, wherein when there are a plurality of extracted candidate spaces, the control unit extracts the candidate space having the maximum number of reservable forms corresponding to the candidate space with reference to the storage unit.

(Appendix 6)
The storage unit stores a reservable form that can be reserved for a space other than the space in association with a space and a non-reservable form that cannot be reserved,
The storage unit stores a weight for each reservation form corresponding to each reservationable form and reservation impossible form,
When there are a plurality of extracted candidate spaces, the control unit refers to the storage unit, and reads the non-reservable form corresponding to the candidate space for each candidate space,
The control unit calculates a total value of weights corresponding to the read reservation impossible form with reference to the storage unit for each candidate space,
The program according to appendix 1, wherein a candidate space having a minimum calculated weight is extracted.

(Appendix 7)
Associating a candidate space indicating a space or a combination of spaces included in a plurality of reservation target spaces with pattern information indicating a reservation content pattern that can be reserved in a space excluding the candidate space among the plurality of spaces An acquisition unit that acquires the first pattern information associated with the first candidate space and the second pattern information associated with the second candidate space;
An information processing apparatus comprising: an output unit that outputs information indicating the first candidate space when the pattern indicated by the first pattern information includes the pattern indicated by the second pattern information.

(Appendix 8)
Associating a candidate space indicating a space or a combination of spaces included in a plurality of reservation target spaces with pattern information indicating a reservation content pattern that can be reserved in a space excluding the candidate space among the plurality of spaces And storing the first pattern information associated with the first candidate space and the second pattern information associated with the second candidate space,
An information processing method for outputting information indicating the first candidate space when a pattern indicated by the first pattern information includes a pattern indicated by the second pattern information.

(Appendix 9)
On the computer,
Associating a candidate space indicating a space or a combination of spaces included in a plurality of reservation target spaces with pattern information indicating a reservation content pattern that can be reserved in a space excluding the candidate space among the plurality of spaces And storing the first pattern information associated with the first candidate space and the second pattern information associated with the second candidate space,
When the pattern indicated by the first pattern information includes the pattern indicated by the second pattern information, information indicating the first candidate space is output.
A program characterized by causing execution.

(Appendix 10)
The storage unit stores pattern information that can be reserved for a space other than the candidate space in association with the candidate space and a non-reservable form that cannot be reserved,
When there are a plurality of acquired candidate spaces, the storage unit is referred to, and the reservation impossible form corresponding to the candidate space is read for each candidate space,
Refer to the storage unit that stores the history of reservation for each reservation type corresponding to each pattern information and reservation impossible form, and obtain the history corresponding to the reservation impossible form of the read candidate space for each candidate space,
The program according to appendix 9, wherein one candidate space is extracted based on the history corresponding to the acquired non-reservable form for each candidate space.

(Appendix 11)
The storage unit stores a history including the number of reservations or the ratio of reservations for each reservation type corresponding to each pattern information and reservation impossible type,
The program according to appendix 10, wherein when one candidate space is extracted, the number or ratio corresponding to the acquired non-reservable form of each candidate space is compared, and the candidate space having the smallest number or ratio is extracted.

(Appendix 12)
The storage unit stores pattern information that can be reserved for a space other than the candidate space in association with the candidate space and a non-reservable form that cannot be reserved,
When there are a plurality of acquired candidate spaces, the storage unit is referred to, and the reservation impossible form corresponding to the candidate space is read for each candidate space,
The program according to appendix 9, wherein a candidate space having the smallest number of unreservable forms read out is extracted.

(Appendix 13)
The program according to appendix 9, wherein when there are a plurality of acquired candidate spaces, the candidate space with the largest number of pattern information corresponding to the candidate space is extracted with reference to the storage unit.

(Appendix 14)
The storage unit stores pattern information that can be reserved for a space other than the candidate space in association with the candidate space and a non-reservable form that cannot be reserved,
The storage unit stores a weight for each pattern information and each reservation form corresponding to the reservation impossible form,
When there are a plurality of acquired candidate spaces, the storage unit is referred to, and the reservation impossible form corresponding to the candidate space is read for each candidate space,
Calculate the total value of the weights corresponding to the read reservation impossible form with reference to the storage unit for each candidate space,
The program according to appendix 9, wherein a candidate space having the smallest calculated weight sum is extracted.

DESCRIPTION OF SYMBOLS 1 Server computer 2 Personal computer 1A Portable recording medium 1B Semiconductor memory 10A Reading part 11 CPU
12 RAM
DESCRIPTION OF SYMBOLS 13 Input part 14 Display part 15 Memory | storage part 15P Control program 16 Communication part 18 Clock part 101 Control part 102 Acquisition part 103 Deletion part 104 Extraction part 105 Acquisition part 151 Space file 152 Combination file 153 Reservation form file 154 Statistics file 155 Weight file N Communication network

Claims (4)

On the computer,
Get reservation setting information for each of the multiple spaces to be reserved,
The included in the plurality of spaces, and space reservation candidate information indicating a set of reservation by the combination of the space or spaces, the space excluding the space used by the space reservation candidate information of the plurality of spaces, reservation setting Reference is made to a storage unit that associates and stores the pattern information indicating the space selection pattern in the reservation content of the possible space reservation and the reservation setting information, and a plurality of available space reservation candidate information is selected ,
About the first space reservation candidate information and the second space reservation candidate information included in the plurality of space reservation candidate information, the space selection pattern indicated in the first pattern information associated with the first space reservation candidate information Includes the space selection pattern indicated in the second pattern information associated with the second space reservation candidate information, the second space reservation is displayed when the plurality of space reservation candidate information is displayed. Suppress the display of candidate information ,
A program characterized by causing execution. The storage unit stores the reservation impossible forms that can not be pattern information and reservations that may be reserved for the space other than the space reservation candidate information in association with the space reservation candidate information,
If the acquired space reservation candidate information there are multiple, by referring to the storage unit, the reservation impossible forms corresponding to the space reservation candidate information, read every space reservation candidate information,
Refers to the storage unit that stores a history of the reservation for each reservation forms corresponding to the respective pattern information and reservations not form acquires the history for each space reservation candidate information corresponding to the reservation impossible form of read space reservation candidate information And
Based on the history corresponding to the reservation impossible form of each acquired space reservation candidate information, the program according to claim 1 for extracting one space reservation candidate information. An acquisition unit for acquiring reservation setting information of each of the plurality of spaces to be reserved;
The included in the plurality of spaces, and space reservation candidate information indicating a set of reservation by the combination of the space or spaces, the space excluding the space used by the space reservation candidate information of the plurality of spaces, reservation setting Pattern information indicating a space selection pattern in reservation contents of possible space reservations, a storage unit that associates and stores the information, and a selection unit that selects a plurality of available space reservation candidate information with reference to the reservation setting information ;
About the first space reservation candidate information and the second space reservation candidate information included in the plurality of space reservation candidate information, the space selection pattern indicated in the first pattern information associated with the first space reservation candidate information Includes the space selection pattern indicated in the second pattern information associated with the second space reservation candidate information, the second space reservation is displayed when the plurality of space reservation candidate information is displayed. An information processing apparatus comprising: a suppression unit that suppresses display of candidate information . Get reservation setting information for each of the multiple spaces to be reserved,
The included in the plurality of spaces, and space reservation candidate information indicating a set of reservation by the combination of the space or spaces, the space excluding the space used by the space reservation candidate information of the plurality of spaces, reservation setting Reference is made to a storage unit that associates and stores the pattern information indicating the space selection pattern in the reservation content of the possible space reservation and the reservation setting information, and a plurality of available space reservation candidate information is selected ,
About the first space reservation candidate information and the second space reservation candidate information included in the plurality of space reservation candidate information, the space selection pattern indicated in the first pattern information associated with the first space reservation candidate information Includes the space selection pattern indicated in the second pattern information associated with the second space reservation candidate information, the second space reservation is displayed when the plurality of space reservation candidate information is displayed. Suppress the display of candidate information ,
Information processing method.

Images