JPH0147379B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] This invention relates to an improvement in a device for reserving elevator service.

[Prior art]

Previously, when an elevator car installed in a building was to be dispatched to the main floor when going to work, or to an executive floor when necessary, an employee in the control room would issue a dispatch command using a switch. . However, in this case, the attendant must operate the switch at the scheduled time, and there are also switches to dispatch the vehicle to the meeting room, a switch to disconnect the service, etc., and many switches must be operated at the scheduled time. It is necessary to remember to perform the operations, which places a mental burden on the user. Therefore, for example,
As shown in Publication No. 141944, it is proposed that a clock be used to generate a calendar date signal, which will automatically perform tasks such as driving to work that are constant every day, eliminating the need for staff operations. has been done.

However, it is often necessary to change the scheduled time set by the clock, and the problem has not yet been solved. In addition, in recent years, many special operation requests have emerged, such as the dispatch of baskets to banquet halls and exhibition halls. Further, after a building is in operation, the main floor is often changed or executive floors are moved, and more flexible elevator operation is required.

Therefore, recently, in order to allocate cars to executive floors and floors that are expected to be crowded, personal computers (hereinafter referred to as PCs), which are currently in widespread use, are used as input devices to arbitrarily determine the number of cars to be allocated, the waiting floor, etc. It has been proposed to set or cancel the time, etc.

However, once staff members were able to arbitrarily designate waiting cars, the number of waiting cars increased.
There is a risk that general elevator service will deteriorate significantly. Therefore, the staff takes advantage of setting the number of waiting machines to a small number in consideration of general service, which is inconvenient. Furthermore, when making a reservation to have a plurality of cars on standby on a crowded floor, if a large number of cars are made to be on standby without considering traffic conditions, there is a risk that service on other floors will be extremely degraded.

[Summary of the invention]

This invention improves the above-mentioned problems by reserving and dispatching cars in advance using an input device that is manually operated, and regulating the number of cars to be dispatched according to the waiting time for each floor. To provide an elevator operation reservation device which can eliminate the trouble of an attendant operating a switch at each time, and can prevent service on other floors from being extremely degraded.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to FIGS. 1 to 15.

FIG. 1 is an overall configuration diagram of one embodiment, which is constructed as described below. That is, numeral 1 is an input button formed by arranging a large number of buttons, and the output of this button is input to the reservation/dispatch signal input means 2, which issues a reservation/dispatch signal for the car. 3 is constructed using a clock and 1
It is an automatic calendar that outputs output corresponding to the month, day, and time of the year, and the day is updated every time midnight passes, and the day of the week is updated repeatedly every 7 days, and the reservation dispatch signal is used. From the output of the input means 2 and the output of the automatic calendar 3, the reservation/dispatch control signal generating means 4 selects the reservation information to be executed currently, and converts the selected reservation information into a reservation/dispatch control signal. This control signal is taken into the reservation standby control means 5, which issues a reservation standby command to the elevator 6 based on information from the elevator (hall button, drive control device, etc.) 6 to make the car wait at the designated floor. On the other hand, the information of the elevator 6 is taken into the maximum waiting time calculation means 7, and the maximum waiting time of each floor landing is detected. The maximum waiting time is detected by the service level standby number setting means 8, and the service level standby number is set. The information is sent to the reservation waiting regulation means 9, which determines the number of waiting cars according to the number of waiting cars at the service level,
Regulations are applied to the car selected by the reservation standby control means 5.

FIGS. 2 and 3 show a specific example of one embodiment.

In the figure, reference numeral 10 denotes a car control device (only one unit is shown) which is composed of a microcomputer (hereinafter referred to as a microcomputer), as shown in, for example, Japanese Patent Application Laid-Open No. 51-53354, and a central processing unit (hereinafter referred to as a CPU). ) 10A, read-only memory (hereinafter referred to as ROM) in which programs and fixed value data are stored.
, a storage device 10B consisting of a read/write memory (hereinafter referred to as RAM) that temporarily stores data such as calculation results, a transmission device 10C that sends and receives data, and a conversion device that is connected to the drive control device 6B and converts input and output signal levels. It has 10D. 11
is also composed of a microcomputer, and similarly has 11 CPUs.
A, a group management device having a storage device 11B, transmission devices 11C, 11D, and a conversion device 11E connected to the hall button 6A; 12 is also composed of a microcomputer; A statistical device 13 has an automatic calendar 3, and 13 is an input device also composed of a personal computer, which also has a CPU 13A, a storage device 13B, and a transmission device 13C, and a conversion device 13D and a display 13G connected to the input button 1. and a converter 13F connected to a storage device 13H which is usually called a floppy disk and is made up of a magnetic disk and stores programs. In addition, the transmission devices 10C, 11C, 1
The transmission devices 1D and 12C are responsible for parallel transmission and transmit 8 bits of information at a time, and the transmission devices 12D and 13C are responsible for serial transmission and transmit 1 bit of information at a time. YT is a reservation table stored in the storage device 13H, and the reservation number is as shown in Figure 3a.
It has reservation contents corresponding to 001 to 999, and each reservation contents are classified as shown in FIG. 3b. Each section consists of one or more columns, each column containing one or more ASCII letters or numbers.
Byte storage area is reserved. Each column and its contents are shown below.

Column Category Contents 0-3 Date ○○…Month ○○…Day 4～7 Start time ○○…hour ○○…minute 8～11 End time ○○…hours ○○…minutes 12～13 Floor ○○…Floor name 14 Number of units ○…Number of units 15 Designated basket ○…Cart number Next, the operation of this embodiment will be explained.

First, an overview of the operation will be explained.

The staff operates the input button 1 and inputs the contents of the reservation according to the format. Necessary information is displayed on the display 13G according to this input. On the other hand, the input device 13 imports a program from the storage device 13H into the storage device 13B and operates according to this program. The input reservation information is transmitted to transmission device 1.
The data is taken into the statistical device 12 via 3C and 12D, and stored in the storage device 12B. Statistical device 12
has recently become well known as part of an elevator control device, but it has no direct relation to this embodiment. In the statistical device 12, a CPU 12A operates according to a program stored in a storage device 12B,
Read the month, day or day of the week and time from the automatic calendar 3 and scan the imported reservation table YT. The reservation table YT is scanned based on the date set in the reservation table YT,
The time corresponds to the input date and time, and only the reservation information to be executed is extracted. These reservation tables
YT reservation details are converted into reservation operation control signals. The reservation operation control signal is transmitted by transmission devices 12C and 11D.
The data is taken into the group management device 11 via the storage device 11B and stored in the storage device 11B. The group management device 11 selects and assigns the hall call signal from the normal hall button 6A to the most suitable car from a plurality of cars, and is well known. The group management device 11 immediately executes the operation given by the reserved operation control signal. Possible actions include dispatching a car,
There are a wide variety of options, such as selecting a service pattern, changing the main floor, changing or specifying a specific floor (such as an executive floor), and specifying a service floor. There is. Therefore, the reservation operation control signal becomes a reservation dispatch control signal. The group management device 11 selects the number of cars (or designated cars) designated for the floor designated by the reservation dispatch control signal in accordance with the situation of the elevator. For the selected car, a service command to the floor and whether to wait with the door closed or open the door in response are also given. These commands are transmitted to the transmission device 11
C, 10C to the car control device 10. The car control device 10 operates the drive control device 6B based on the received service command for the specified floor, and causes the car to be serviced on the specified floor. On the other hand, the maximum waiting time at that time is calculated, and the number of service level waiting cars is set based on the maximum waiting time, and when the number of reserved waiting cars reaches the number of service level waiting cars, the selection of the reserved waiting car is restricted from now on.

Next, the input operation of the reservation table YT is shown in Figures 4 and 5.
The operation of the program shown in the figure (stored in the storage device 13H) will be explained using a flowchart.

The reservation table YT allows you to make 999 reservations with reservation numbers 001 to 999. For each reservation field, add a subscript j to the reservation table YT, and write YTj (j = 001
~999). For example, YTj (j=
001) contains the ASCII code "0110080009000120", it indicates that "two baskets will always be kept on standby on the first floor with the door closed between 8:00 a.m. and 9:00 a.m. on January 10th". show. Note that if the contents of the date are all "0", it means that it will be executed every day at the specified time, and if the end time and start time are the same, the specified contents will be executed only once. Furthermore, if all the reservation details are "0", it means that there is no reservation, and there is no ranking etc. in the reservation number. Furthermore, the date and day of the week can also be easily used, but the explanation will be omitted.

Now, when the input device 13 operates, step (21)
``YOYAKU?'' (reservation?) is displayed on the display 13G. In step (22), input the characters "DYS" (meaning display) using input button 1, and proceed to step (30). If "DYS" is not entered, proceed to step (23), and if the characters "YES" (meaning to make a reservation) are entered, proceed to step (24). If you enter any other characters, return to step (21). In step (24), enter "YOYAKU NUMBER" (reservation number)
is displayed, and when the reservation number (3-digit number) is entered in step (25), the number entered in reservation number j is set in step (26). Below are steps (27)
~(29) is executed and returns to step (21) again, but step (27) is a date and time input details program, step (28) is a floor input details program,
Step (29) is a detailed input program for the reservation cart (columns 14 and 15), each shown in FIG.
Proceeding from step (22) to step (30),
"YOYAKU NUMBER" (reservation number) is displayed, and when the reservation number (3-digit number) is entered in step (31), the number entered in reservation number j is set in step (32). The reservation details YTj of the reservation number entered in step (33) are displayed on the display 13G, and if "CNCL" (cancellation) is input in step (34), all the reservation details are canceled in step (35). and return to step (21). Also, if "OK" (no cancellation required) is entered in step (36), step (21)
The screen returns to ``YOYAKU'' and ends with only the message ``YOYAKU'' displayed. "OK"
If neither "CNCL" is input, the process returns to step (33).

A Date and time input details program (27) In step (27a), “HIZUKE” is displayed on display 13G.
(date) is displayed. When the 4-digit number (date) is entered using input button 1 in step (27b), the reservation column YTj of the reservation table YT is entered in step (27c).
The numbers input in the 0th to 3rd columns are stored. Follow the same steps (27d) to (27f)
The start time is stored in steps (27g) to (27i), and the end time is stored in steps (27g) to (27i).

B. Input details program for floors and directions (28) Similarly to the above, floors are stored in steps (28a) to (28c).

C Reservation Cart Input Details Program (29) Similarly to the above, the number of cars is input in steps (29a) to (29c), and the designated car number is input in steps (29d) to (29f).

Next, from the reservation table YT transmitted from the input device 13 and the date and time read from the automatic calendar 3, the operation of the program shown in FIG. This will be explained using a flowchart. Note that this program is repeatedly processed only once per minute. Further, it is assumed that the date and time have already been read by another program.

In step (41), the reservation dispatch control signals for the designated number of waiting cars with doors closed and the designated car number with closed doors created up to the previous time are cleared (see FIG. 7 for details). In step (42), scan reservation number j is initialized to zero, and in step (43), scan reservation number j is updated to one. In step (44), it is determined whether the j-th reservation field YTj is not "0", and if it is not "0" (if there is a reservation, in step (45) all date specifications in the reservation field YTj are "0"). , and if they are all “0”,
Skip to step (47) as something to be done every day. In step (46), determine whether the date in the reservation column YTj matches today's date DA read from automatic calendar 3,
If they match, it is determined in step (47) whether the start time and end time of the reservation field YTj are the same time, and it is checked whether the reservation operation is selected only once. If there is more than one scheduled operation, check whether the current time J read from automatic calendar 3 in step (48) is between the specified start time and end time, and whether start time ≦ J < end time. (If zero o'clock is not included between the start time and end time), or whether start time > end time and start time ≦ J or end time > J (if zero o'clock is not included between the start time and end time) (if included). If the current time J is between the start time and the end time, in step (49) the contents of the 12th to 15th columns of the reservation column YTj are converted into a reservation dispatch signal (see FIG. 8 for details). If the reserved operation is determined only once in step (47), it is determined in step (50) whether the reserved time matches the current time J, and if so, the procedure is executed in step (49).
Proceed to step (Although we have assumed that the operation is selected only once, it is expected that the control signal will continue to be output for one minute and the operation will be performed many times, but normally the operation will not be completed in one minute.) Therefore, there should be no problem).
In this way, the process proceeds to step (50A), and it is determined whether all reservations have been scanned. If not, the process returns to step (43) and steps (43) to (50) are repeated.

A Reservation dispatch control signal clear program (41) Initialize the scanning floor m to zero in step (41a),
The scanning floor m is updated to 1 in step (41b). In step (41c), set the designated number of waiting cars YCD _n for the door closed on floor m to zero. In step (41d), set the m-floor door closed standby designated car number YCK _n to zero. In step (41e), it is determined whether all floors have been scanned, and if not, the process returns to step (41b) and steps (41b) to (41d) are repeated.

B. Reservation dispatch control signal creation program (49) In step (49a), a floor name is set for scanning floor m. In step (49b), set the value in the 14th column to the designated number of waiting cars on floor m, YCD _n . Determine whether there is a designated car number in step (49c),
If it is a designated car number, set the value in the 15th column to the designated car number YCK _n for m floor door close standby in step (49d). If there is no specified car number, proceed (49d)
is not executed.

Next, the operation of detecting a floor requiring door-closed standby and creating a door-closed additional assignment signal will be explained using the flowchart of the operation of the program (stored in the ROM of the storage device 11B) shown in FIG.

This is when the number of waiting cars with the door closed is specified.
It is checked whether the number of allocated cars satisfies the specified number for the specified floor, and if the number is not satisfied, an additional allocation signal to close the door is issued to the allocation program.

The scanning floor m is initialized to zero in steps (51) and (52), and the scanning floor m is updated to 1 in step (52). In step (53), specify the number of waiting cars with closed doors to m floor YCD _n
If it is not zero (if the number of vehicles is specified), then in step (54), the number of vehicles AKC _n to command floor m to stand by with the door closed is greater than or equal to the specified number YCD _n , that is, the specified number Determine whether the number of units is satisfied. This specified number of cars AKC _n is obtained by scanning the door closing service command DC _no (n is the car number) for the m floor across all cars and finding the number of cars that are ``1''. That program will be omitted. If the conditions in step (54) are not satisfied, step (55)
The additional door closing assignment signal ATC _n to floor m is set to "1". If there is no designation for the number of cars waiting to close the door to the m floor, or if the conditions of step (54) are satisfied,
In step (57), the additional door closing assignment signal ATC _n for floor m is reset to "0". In step (56), it is determined whether all floors have been scanned. If not, the process returns to step (52) and steps (52) to (57) are repeated.

Next, the setting operation for the number of waiting machines for service level is performed in the 10th step.
The program shown in the figure and FIG. 11 (in the storage device 11B
(stored in ROM) will be explained using a flowchart of the operation.

This is to set the number of waiting cars in accordance with the maximum waiting time at the landing.

In step (61), a program is executed to calculate the maximum waiting time WTMX among the hall calls that have just been serviced by the car (details are shown in FIG. 11).
In step (62), determine whether the maximum waiting time WTMX is greater than or equal to the maximum waiting time TKMAX within a certain period of time in the past,
If this is the case, the maximum waiting time WTMX can be set in step (63).
Let TKMAX be the maximum waiting time within a certain period of time in the past.
If it is less than that, jump to step (64). From the time T1 set in the fixed time calculation timer in step (64),
Subtract the program operation period (for example, 0.1 seconds). As a result, in step (65) it is determined whether time T1 is less than or equal to zero, and if it is greater than zero, the following steps (66) ~
(73) is not executed. If it is less than zero, step (66)
Proceed to. In step (66), a predetermined time K1 (for example, 150 seconds) is set in the timer for calculating a certain time. When the predetermined time K1 has elapsed in this way, in step (67) the maximum waiting time TKMAX within the past fixed time is set to the predetermined time.
It is determined whether the time is K2 (for example, 80 seconds) or more, and if it is K2 (e.g., 80 seconds) or more (the service status is poor), it is determined in step (68) whether the service level standby number STCD is 1 or less. Only when there are more than 1 car, use step (69) to reduce the service level standby number STCD by 1 to improve the service on other floors. If in step (67) the maximum waiting time TKMAX within a certain period of time in the past is less than the predetermined value K2, proceed to step (70) and check whether the maximum waiting time TKMAX within a certain period of time in the past is less than or equal to a predetermined time K3 (for example, 40 seconds). and below (service condition is good)
If so, proceed to step (71). In step (71), the number of service level standby units STCD is (number of installed units SVKCD - 1)
It is determined whether the number of waiting machines STCD is less than that, and only when it is less than that, the service level standby number STCD is increased by one in step (72) to facilitate reservation waiting. In step (67), it is determined that the maximum waiting time TKMAX within a certain period of time in the past is less than the predetermined time K2, and in step (70) it is determined that it is less than the predetermined time.
If it is determined that it is longer than K3, jump to step (73). That is, when the maximum waiting time TKMAX within a certain past period of time is within this time range, the service level standby number STCD will not change. Step (73) is the post-processing after updating the number of waiting machines for service level.
Clear the maximum waiting time TKMAX within a certain period of time to zero.

FIG. 11 is a detailed program of step (61) in FIG. 10, which extracts the maximum waiting time when a hall call is serviced and released by a car.

Clear the maximum waiting time WTMX to zero in step (61a). In step (61b), scanning floor m is initialized to zero, and in procedure (61c), scanning floor m is updated to m+1.
In step (61d), it is determined whether the m-floor up call registration signal HU _n is "1", and if it is "1", the m-floor up call waiting time (duration time) is determined in step (60e).
HTU _n is counted by adding the elapsed time SEC. When the m-floor up call registration signal HU _n is "0" in step (61d), that is, the call is released,
In step (61f), the waiting time HTU _n is the maximum waiting time.
Determine whether it is greater than or equal to WTMX, and if it is greater than or equal to WTMX, use step (61g) to set m floor waiting time HTU _n to the maximum waiting time.
Let it be WTMX. Then, in step (61h) the waiting time is
Clear HTU _n to zero. Waiting time in step (61f)
If HTU _n is determined to be less than the maximum waiting time WTMX, proceed to step (61h). Steps (61i) to (61m)
Similarly, the waiting time of m downstairs call registration signal HD _n
The maximum waiting time WTMX is calculated for HTD _n . It is determined in step (61h) whether all floors have been scanned, and if they have not been scanned, return to step (61c) and repeat steps (61c) to (61m).

Next, the door closed standby assignment operation is shown in Figures 12 and 13.
The operation of the program shown in the figure (stored in the ROM of the storage device 11B) will be explained using a flowchart.

FIG. 12 is a waiting-with-door allocation program, which includes additional allocation processing by specifying the number of waiting cars with doors closed and allocation processing for a designated car number.

The scanning floors are initialized and updated in steps (81) and (82). Whether or not the hall call was registered on the m floor in step (83), that is, the up call signal for the m floor
It is determined whether HU _n or downlink signal HD _n is "1". If it is not registered, the detailed program SNASK for counting the number of cars for which additional allocation is prohibited is executed in step (84). This detailed program
Although illustration of SNASC is omitted, the additional allocation prohibited car signal NASK _o is checked for all cars for car n, and the number of cars for which it is "1" is set as the additional allocation prohibited car number NASK. In step (85), the number of cars prohibited from additional allocation NASK is changed to the number of waiting cars at service level STCD
If it is determined that the service level is less than the number of waiting cars, it is determined in step (86) whether the designated car number YCK _n for waiting with the door closed to the m floor is not zero; If there is a car number), steps (87)
When the above car number YCK _n is set to car number n, is the door closing service command DC _no of machine n on floor m set to "1", that is, the command (assignment) to the specified car?
Determine whether it has been completed. If not specified, select designated car number YCK _n in step (88)
KAGO (the command for the specified car is processed before the command for the number of cars). In step (89), set the selected car number KAGO to car number n, and
Unit number assignment command AKU _no , same downlink assignment command
Set AKD _no and door closing service command DC _no to "1" respectively. In step (90), the additional allocation prohibition signal NASK _o for the selected car is set to "1", and henceforth allocation to this car is prohibited so that the car can wait with the door closed on the designated floor. In addition, in step (86), it is determined that the car number YCK _n designated for door closing standby on floor m is zero (there is no designated car), or in step (87), the door closing service command DC _no is determined to be "1". If it is determined that there is a command (the command has been sent to the command car), an additional door closing assignment signal to the m floor is sent in step (91).
Determine whether ATC _n is "1", and if it is "1", proceed to step (92). In step (92), select the door closing service command car selection program SAUD for floor m.
(Details are shown in FIG. 13) is executed. If the selected car number KAGO is not zero in step (93), proceed to step (89). If an up call or a down call is registered on the m floor in step (83), all door closing service commands DC _n1 , DC _{n2 .} . . for the m floor are reset in step (94). This is so that when a hall call for floor m is registered, it can be immediately assigned and serviced. Note that the prohibition of additional allocation of cars for which the door closing service command DC _no of all floors has become "0" is canceled after the process shown in FIG. 12 is performed. In step (95), determine whether to scan all floors.

FIG. 13 is a detailed program for selecting a car to which the door closing service command shown in FIG. 12 is given.
This process selects the car that is expected to be able to wait with the door closed on the mth floor as soon as possible, and compares the longest expected arrival time for each car, the one with the longest expected arrival time for up and down, and selects the one with the shortest time. It is something to do. Note that the selection means is not limited to this.

In step (92a), first set the selected car number KAGO to zero. Estimated arrival time of the selected cart in step (92b)
Set TY to maximum value. Scanning machine initialization and updating are performed in steps (92c) and (92d). In step (92e), it is determined whether the additional allocation prohibition signal NASK _o of machine n is "1", and if it is not "1", in step (92f) it is determined whether the door closing service command DC _no is "1" or not. In other words, it is determined whether the nth car has received a door closing service command on the m floor. If the door closing service command has not been received, use step (92g) to determine whether the expected upstream arrival time TYU _no is longer than the expected downstream arrival time TYD _no , and if the upstream is longer, proceed to step (92h).
Determine whether the upstream expected arrival time TYU _no is less than or equal to the previous expected arrival time TY. If it is less than or equal to the expected arrival time TY so far, in step (92i) car number n is selected as the selected car number KAGO, and the expected arrival time TY is set to the expected upstream arrival time TYU _no (shortest value).
In addition, if it is determined in step (92g) that the expected downlink arrival time TYD _no is less than the expected upstream arrival time TYU _no , in step (92k), the expected downlink arrival time TYD _no is less than or equal to the expected arrival time TY. Determine if there is one, select machine n in the same manner (92l), and
Set the expected downlink arrival time TYD _no of the n-th car to the shortest value. In step (92j), determine whether to scan all machines.

Next, the operation of releasing the allocation command will be explained using the flowchart of the operation of the program (stored in the ROM of the storage device 11B) in FIG. 14. (The door closing service command is canceled as shown in FIG. 12.) Initial settings and updates of the scanning car are performed in steps (101) and (102). In step (103), the car position of scanning car n is set to scanning floor m. m in step (104)
It is determined whether the door closing service command of unit n on the floor is "1", and if it is determined that it is "0" (floor m is a floor that does not receive the door closing service command), step 105 ), it is determined whether the nth machine is in the uplink service. If the uplink service is in progress, it is determined in step (106) whether the n unit has started closing the door, and if the door has started closing, the m floor up assignment command is issued in step (107).
Reset AKU _no to "0". If it is determined in step (105) that the downlink service is in progress, step (108)
(109) is processed in the same way. If it is determined in step (104) that the door closing service command for car n on floor m is "1", the car stops in step (110) and becomes directionless (responsive to all calls). Then, in step (111), the ascending and descending assignment commands AKU _no and AKD _no for the mth floor are reset to "0". In step (112), determine whether to scan all machines.

Next, the main points of the door opening/closing command operation will be explained using the flowchart of the operation of the program (stored in the ROM of the storage device 10B) shown in FIG. 15.

In step (121), the car position floor is set to scanning floor m. In step (122), it is determined whether the car is in the zone where the door can be opened, and if the car is in the zone, it is determined in step (123) whether the door is closed. If it is determined that the door is closed, it is determined in step (124) whether the door open button has been pressed, and if it has not been pressed, it is determined in step (125) whether the car call has been answered. If the car call is not answered, in step (126), it is determined whether the upstream assignment command AKU _n or the downstream assignment command AKD _n for floor m is "1", and if it is not "1" (it must be the assigned floor). b) In step (128), set the door open command to “L”
and the door close command is set to "H". In other words, the door stops closing. If it is determined in step (126) that floor m is to be allocated, it is determined in step (127) whether the door closing service command for floor m is "1". If it is "1", the door will stop closing in step (128). If it is "0", the door open command is set to "H" and the door close command is set to "L" in step (129). In other words, the door stops opening. If step (123) determines that the door is open, steps (130) to (134) determine that the door is not opening, the door open button is not pressed, and the door safety device is not operating. If no one is present, the door close button is not pressed, and the door opening time has not expired, the door will stop opening in step (129). Descriptions of other procedures will be omitted.

In the embodiment, the explanation has been limited to the case of waiting with the door closed, but the same can be applied to the case of waiting with the door open.

In addition, in calculating the number of service level waiting machines STCD in Figure 10, the number of service level waiting machines STCD was calculated by increasing or decreasing the number when the predetermined time K2 and K3 were outside the range. From how many seconds to how many seconds, service degree standby number STCD
It is also possible to set up a table showing the number of machines, scan the table with the maximum waiting time TKMAX within a certain period of time in the past, and use the number of machines found at that time as the number of waiting machines STCD at the service level.

Furthermore, the number of waiting machines for service level can be easily calculated based on the average waiting time instead of the maximum waiting time.

Furthermore, the number of waiting machines for service level may be set using a relational expression that associates the maximum waiting time or average waiting time with the number of waiting machines for service level.

〔Effect of the invention〕

As described above, in this invention, an elevator reservation dispatch signal is generated by an input button that is manually operated, and from this reservation dispatch signal, a reservation dispatch control signal is generated corresponding to the date and time, and the car is operated according to this signal. In addition to allocating vehicles to designated floors, the number of waiting cars at a service level is set based on the waiting time at each floor landing, and the number of cars reserved and dispatched is regulated by this number of waiting cars at a service level.

This saves the staff the trouble of operating the elevator each time, makes it easy to reserve an elevator, and prevents service on other floors from being extremely degraded.

[Brief explanation of drawings]

FIG. 1 is an overall configuration diagram showing an embodiment of an elevator service reservation device according to the present invention, FIG. 2 is a block circuit diagram of the same, and FIG. 3 is a diagram showing the contents of the storage device of the input device of FIG. 2. 4 and 5 are flowcharts of operations performed by the input device in FIG. 2, FIGS. 6 to 8 are flowcharts of operations performed by the statistical device in FIG. FIG. 15 is a flowchart of the operation of the group management device. FIG. 15 is a flowchart of the operation of the car control device of FIG. DESCRIPTION OF SYMBOLS 1...Input button, 2...Reservation dispatch signal input means, 3...Automatic calendar, 4...Reservation dispatch control signal generation means, 5...Reservation standby control means, 6...Elevator, 7...Maximum waiting time Calculating means, 8...Service level standby number setting means, 9...Reservation waiting regulation means,
10... Car control device, 11... Group management device, 1
2...Statistics device, 13...Input device. Note that the same reference numerals in the figures indicate the same parts.

Claims (1)

[Claims] 1. An input button that is artificially operated to emit a signal to reserve and allocate a car to a designated floor, a reservation dispatch signal input means that issues a reservation dispatch signal corresponding to the output of this input button, and a date and time from the output of this reservation dispatch signal input means. Reservation/dispatch control signal generating means for issuing a reservation/dispatch control signal for the car; reservation/standby control means for issuing a reservation/standby command to allocate the car to the specified floor and wait there based on the output of the reservation/dispatch control signal generating means; Waiting time calculating means for calculating the landing waiting time for each floor; service level waiting number setting means for setting the number of waiting cars at a service level, which is a reference for the number of waiting cars for the above-mentioned cars, from the output of the waiting time calculating means; and the above-mentioned reservation waiting control means. An elevator operation reservation device comprising a reservation waiting regulation means for regulating the number of cars selected by the above according to the output of the service degree waiting number setting means.