JPS60106770A - Device for preengaging operation of elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

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]

Conventionally, when an elevator car installed in a building was dispatched to the main floor when dispatched, or to an executive floor when necessary, an employee in the control room gave the dispatch command using a switch. . However, in this case, the attendant must operate the switch at the scheduled time, and there are other switches such as a switch for dispatching a vehicle to the meeting room, a switch for disconnecting 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, as shown in Japanese Patent Application Laid-Open No. 52-141944, for example, a clock is used to generate a calendar date signal, and this is used to automatically perform driving at work, etc., which is constant every day. A device has been proposed that eliminates the need for operations by an attendant.

However, it is often necessary to change the scheduled time set on the clock, and this does not solve the problem. Not only that, but in recent years there have been many special requests for transportation, such as the delivery of large-scale cars to banquet halls and the delivery of cars to exhibition halls. Further, after a building is in operation, the main floor is often renovated or the executive floors are moved, so there is a need for more flexible elevator operation.

Recently, we have started using the currently popular personal computers (hereinafter referred to as "PCs") as input devices to arbitrarily determine the number of cars to be dispatched and the number of waiting floors for the dispatch of cars to executive floors and floors that are expected to be congested. It has been proposed to set or cancel the , time, etc.

However, if the staff could arbitrarily designate waiting cars, the number of waiting cars would increase, and there is a risk that general elevator service would become extremely poor. 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 for multiple cars to be on standby on a crowded floor, if a large number of cars are made to be on standby without considering the traffic situation, there is a risk that service on other floors will be extremely degraded.

[Summary of the invention]

This invention improves the above-mentioned problems, and uses an input device that is manually operated to reserve and dispatch a car at event@t5, and to regulate the number of cars to be dispatched according to the waiting time at each floor. The purpose of the present invention is to provide an elevator operation reservation device that eliminates the trouble of an attendant operating a switch at each particular time and prevents service on other floors from being extremely degraded. shall be.

[Example of length of 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, (1) is an input capobutton having a large number of buttons arranged, the output of which is input to the reservation dispatch signal input means Jfff21, which issues a reservation dispatch signal for the car. (3) is configured using a clock and outputs outputs corresponding to the month, day, and time of one year, and the day is updated every time the zero hour and zero minute pass, and the day of the week is updated every seven days. Kaeshihigashi, automatic calendar that is fr, reservation dispatch signal input means (2)
Based on the output from the automatic calendar (3), the reservation/dispatch control signal generating means (4) selects the reservation information to be executed at present, and converts the selected reservation information into a reservation/dispatch control f signal. This control signal is taken into the reservation standby control means (5), which issues a reservation standby command to the elevator (61) based on information from the elevator (hall button, drive control equipment, etc.) (6).
Have the car wait on the designated floor. On the other hand, the information on the elevator (6) is input to the maximum waiting time calculation means (7), and the longest waiting time among the waiting times at each floor landing is detected. This 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 standby control means (9), where the number of cars on standby is determined according to the number of cars on standby at the service level, and restrictions are applied to the cars selected by the reservation standby control means (5).

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

In the figure, (10!) is a car control device (only one unit is shown) composed of a microcomputer (hereinafter referred to as a microcomputer); Device (hereinafter referred to as CPU) (IOA)
, read-only memory (hereinafter referred to as RO, M) that stores programs and fixed value data, and read/write memory' (hereinafter referred to as RAM) that temporarily stores data such as calculation results.
A storage device (10B) consisting of 1. Transmission device (1'Oc) and drive control equipment (6B) that sends and receives data
A conversion unit (I) is connected to
OD). (11) is also composed of a microcomputer, and has a CPU (IIA), a storage device (IIB),
Transmission device (110), (IID) and landing button (6
A) is a group management device having a conversion device (IIK) connected to (121), which is also composed of a microcomputer;
! A statistical device having a PU (12A), a storage device @ (12B), a transmission device (12C), (12D) and an automatic calendar (3), 1131 is an input device also composed of a personal computer, and a similar & knee CPU (13A). ), recorded Jt-so r!
t, (13B), a converter (13D) having a transmission device (130) and connected to the input/button tl+, a converter (13E) connected to the display (13G) and usually called a floppy disk. The conversion device N (13F) is connected to a storage device (13H) which is composed of a magnetic disk and stores programs. In addition, the transmission device (
100), (lie), (LID), (120)
is responsible for parallel transmission and transmits 8 bits of information at a time [
7. Transmission device M Cl2D), (x3 is responsible for serial transmission and transmits one bit of information at a time.Y
T is a reservation table stored in the storage device (13H), which has reservation details corresponding to reservation numbers 001 to 999 as shown in FIG. 3(a), and the details of each reservation are shown in FIG. 3(b). It is divided as shown. Each section consists of one or more columns, and each column has a 1-byte storage area reserved for storing ASCII characters or numbers. 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 ○○...hour ○○...minute 12-13 Floor ○○...floor base 14 Number of cars O... - Number of cars: 15 Designated car ○... corner number Next, the operation of this embodiment will be explained.

First, an overview of the operation will be explained.

The staff operates the entry capotan fil and inputs the details of the reservation according to the format. Necessary information is displayed on the display (13G) in accordance with this input. On the other hand, the input device (13)
transfers the program from the storage device (13H) to the storage device 11
(13B=) and operates according to this program. The input reservation information is sent to the transmission station (130),
(12D) to the statistical device (12) and stored in the storage # (12B). Statistical bag [(12) is
Although it has recently become well-known as part 7 of an elevator control device, it is not directly related to this embodiment. Statistics bag y yen (
In the first batch, the CPU (12A) operates according to the program stored in the storage device (12B), reads the 1st day of the month or the day of the week and time of the current day from the automatic calendar (3), and reads the reservation table YT that has been imported. scan. Scanning the reservation table YT associates the date 1 time set in the reservation table YT with the input date 9 time and extracts only the reservation information to be executed. The reservation contents of these reservation tables YT are converted into reservation operation control signals. The reservation operation control signal is transmitted by a transmission device (120), (II
The data is imported into the group management device (Ill) via the group management device (D) and stored in the storage device Fit (11B).

The h management device (11) selects and assigns the hall call number from the normal hall button (6A) to the most suitable car from a plurality of cars, and is well known.

Group management device (Kawa immediately executes the operation given by the above reservation operation control signal. Executable operations include car allocation, selection of accompanying pattern, change of main floor, specific floor (executive technique @) There are a wide variety of possibilities, such as changing or specifying a car, specifying a service floor, etc., but in this embodiment, the allocation of an arbitrary number of cars to an arbitrary type of car is described.Therefore, the above-mentioned reservation operation control signal is a reservation dispatch control signal. The group management system fi(+1) selects the number of cars (or designation) specified for the floor specified by the reservation dispatch control signal in accordance with the elevator situation.For selection, A service command is given to the floor, and a command is also given as to whether to wait with the door closed or open the door in response 2). These commands are transmitted by the transmission device (11
0), (100) to the car control device @(10+).The car control device [101 operates the drive control device (6B) according to the received service command for the specified floor, and controls the car. Service will be provided on the designated floor.

On the other hand, the maximum waiting time at that time...1 is set, the number of waiting machines at the service level is set according to the maximum waiting time, and when the number of reserved waiting machines reaches the number of waiting machines at the service level G:, from now on, you can select whether to reserve or wait. Regulations will be made to prevent this from happening.

Next, the input operation of the reservation table YT will be explained using the flow chart of the operation of the program (stored in the storage device (13H)) shown in FIGS. 4 and 5.

The reservation table YT allows 999 reservations with reservation numbers 001 to 999 to be made. For each reservation column, add a subscript j to the reservation table YT, and enter YTj (j=001~99).
9). For example, YTj (j=oo1)
c7) Contents 0110080009000120
If J is included in the ASCII code, it indicates that ``January 1st, 1iJj from 8:00 a.m. to 9:00 a.m., basket 2B will always be on standby with the door closed on the first floor''. Furthermore, if the date contents 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, it is also possible to easily change the date to the day of the week, but this explanation will be omitted.

Now, when the input device operates, the display (1
3G) displays "YOYAKU?J (reservation?).

In step 4, enter capotan fl+ to rDY8J (&show)
If you enter the characters , proceed to step (g). rDYs
If the completion is not input, proceed to step (4) and
If you enter the characters sJ (meaning to make a reservation), you will proceed to step @.

If any other characters are entered, return to step Qυ.

When the ryoyAxty NUMBERJ (reservation number) is displayed in step (c) and the reservation number (3-digit number) is entered in step (c), the number entered in reservation number 4jK in step (4) will be displayed. Set. Hereinafter, steps e7) to 翰 are executed, and the VC is returned again, but the step @ is a detailed program for inputting the date and time, and step (e)
is the floor input details program, the procedure - is the reservation basket (first
4 and 15) are shown in FIG. 5, respectively.

Proceeding from step (2) to the example procedure, ryoyAxu NU
MBKRJ (reservation number) is displayed, and when the reservation signal (3 digits) is input in step c3η, the hand Ill 6
In step 4, the number entered as the reservation number j is set. hand 11
The reservation details YTj of the reservation number entered in m (to) are displayed on the display (13G'), and in step ■, l"cncr,
When J (KX cancellation) is input, all reservation contents are canceled in step - and the process returns to step C2]J. Also, the procedure (
If roKJ (cancellation not required) is entered in step 7), the procedure screen υ
Return to , and end with [YOYAKUJ] displayed. "OK"
If neither l'-CNOLJ nor l'-CNOLJ is input, the process returns to step HK.

A0 Date and time input detailed program submission procedure (27a
) display (13G) vc rH engineering zuxx'J
(date) is displayed. When the four-digit number (date) is entered in step (2'i't+), enter W in the reservation column YTj of the reservation table YT in step (27C).
Jo - The number input in the sth column is stored. Similarly, the start time is stored in steps (2'7dl to (2'/f)), and the end time is stored in steps (2'7g) to (2'71).

B5 Floor and Direction Input Details Program (2) Similarly to the above, each floor is stored in steps (28a) to (28c).

C. Reservation Cart Input Details Program ``Similar 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), respectively.

Next, based on the date and time read from the reservation table YT and the automatic calendar (3) transmitted from the input device (13), the reservation dispatch braking program executes an operation to create a number (storage device (12B) ) K storage) will be explained using the production flowchart. Note that this program is repeatedly processed once for 1 minute Vc. Further, it is assumed that the date and time have already been read by another program.

Procedure (I4υ clears each reservation dispatch control signal of the number of cars with closed doors and the designated car number with closed doors created up to the previous time (see Figure 7 for details). In step (6), the scanning reservation number j+j is cleared. The period υJ is set to 0, and the scan reservation number j is updated to 1 in step (G).
Determine whether Tj is not "0", and if it is not "0" (if there is a reservation), determine whether the reservation 4dyTj date specifications are all "0" in step), and all are "0". If so, jump to step 171 as something to be done every day. Steps) and check out the tJ column YTj daily! It is determined whether it matches today's date DA read from the ItIJ calendar (3), and if it is, in step 171 it is determined whether the start time and end time of the reservation 411YTj are the same time and the reservation operation is performed. See if you want to select it only once. If the reservation production is more than one time, check whether the current time J read from the automatic calendar (3) in step (Foundation) is between the specified start time and end time, starting time ≤ J less end time. (If zero time is not included between the eyelid opening time and the end time), or whether the start time > end time and the start time < J or the end time > J (if the start time and end time are one river) including midnight)). If the current time J is between the start time and the end time, the contents of the 12th to 15th columns of the reservation field YTj are converted to the reservation dispatch number 18 in step (step) (see FIG. 8 for details).

If it is determined in step @η that the reserved operation is to be performed only once, step ■
Determine whether the reserved time matches the current time J, and if so, proceed to step 2. , it is expected that the operation will be performed many times, but the operation will not normally be completed in one minute, so this will not cause any problems). In this way, proceeding to step (50a), it is determined whether all reservations have been scanned, and if not, then step IIIlt (
Return to (movement) and repeat steps 1jllll i~Φ.

A. Reservation dispatch control signal clear program Q1 procedure (4
In step 1a), scanning floor m is initialized to zero, and in step (txb), scanning floor m is updated to one. In step (41c), the designated number YCDm of the door-closed standby corner on floor m is set to zero.

In step (41d), the designated car number YC for waiting with the door closed on the m floor! Km
Let be zero. In step (41θ), it is determined whether all floors have been scanned, and if not, steps (a, 1b) return to VC, and steps (41b) to (41d) are repeated.

B. Reservation/dispatch j [tlj control (signal creation program @Oante III (49a) sets the floor base to the scanning floor m.

In step (49b), the designated number of vehicles on the m floor with the door closed and waiting] Dm
K Set the value of the 14th column. In step (49c), it is determined whether there is a designated car number YI, and if there is a designated car number, in step (49(1)), the designated car number YI
:! KmK Set the value in the 15th column. If there is no designated car number, step (49d) is not executed.

Next, the program shown in Figure 9 (in the storage device (11B)
This will be explained using the flowchart of the previous work (OMK storage).

When the number of waiting cars with closed doors 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, the number of waiting cars with closed doors is specified according to the allocation program. This is to issue an additional allocation signal.

Hand 111ti t511 Initialize the scanning floor m to zero with @, and update the scanning floor m with IK in step @. Procedure-m
Determine whether the specified number YODm of cars waiting to close the door to the floor is not zero, and if it is not zero (if the number is specified), step 15
In step 41, it is determined whether the number of vehicles KAcm for which the door-closed standby 4a is commanded on the m floor is greater than or equal to the designated number YODm, that is, whether the designated number is satisfied. This command number AKOm is obtained by scanning the door closing service command DCmn (n is the car number) for the m floor over all the cars and calculating the number of cars that are "Y", but the program is omitted. do. If the conditions of procedure 1 are not satisfied, the additional door closing assignment signal ATCm to floor m is set to "1" at the end of the procedure. 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 (to) are satisfied, step l! At 1η, the door closing additional assignment number ATCm to the m floor is reset. Procedure (All floors are scanned in (1) and t is determined. If t has not been scanned, return to step 15, procedure) ” ~) 571 can be repeated.

Next, the program of FIGS. 10 and 11 (RO of storage device (IIB)
This will be explained using a flowchart of Wt (stored in M).

This is to set the number of waiting cars according to the maximum waiting time at the hall.

In step 6υ, 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 Figure 11). It is determined whether the maximum waiting time TKMAX is greater than or equal to the maximum waiting time TKMAX, and if it is, the maximum waiting time WTMX is set as the maximum waiting time TKMAX for a certain time in the past in step 1. If it is less than the maximum waiting time TKMAX, jump to procedure (I).

In step +641, the program'OX calculation cycle (for example, 0.1 seconds) is subtracted from the time T set in the constant time 1...calculation timer. As a result, it is determined whether the time Tl is less than zero in step -, and if the time Tl is also large, the following steps are taken:
Layer is not executed. If it is less than zero, proceed to step +1i61. In step ((to), set the predetermined time K to the fixed time calculation timer.
1 (for example, 150 seconds). In this way, when the predetermined time elapses in C, the maximum waiting time TKMAX for the past fixed time is set to 2 (for example, 80 seconds)
If it is above (the service status is bad), then the number of waiting machines at the service level is 5TCD.
is 18 or less. If there are more than 1, use the take procedure +6 (g) to reduce the service level standby number 5TCD by 1, so that services on other floors will be interrupted. In step 16η, if the maximum gate opening waiting time TKMAX for a certain period of time in the past is less than the predetermined value by 2, proceed to the procedure side and calculate the maximum waiting time TKM for a certain period of time in the past.
Determine whether AX is less than 3 (for example, 40 seconds) in a predetermined time, and if it is less than 3 (for example, 40 seconds), proceed to step (7).
Proceed to step 11. In step (71), the number of waiting machines for service level is 5TC.
It is determined whether or not D is less than (the number of installed machines 5vxcD-1), and only when it is below, the service level standby number 5TOD is increased by 1 by hand +1lQ1721 to make it easier to make a reservation standby. Step 1671 calculates the maximum waiting time TKMA at a certain time in the past.
If X is determined to be less than 2 in the predetermined time and step (7I) determines that
Fly to Ken. That is, if the cabinet maximum waiting time TKMAX at a certain time in the past is within this time range, the service level waiting number BTOD will not change. Procedure (7al is the post-processing after updating the service level standby number, and clears the cabinet maximum waiting time TKMAX at a certain time in the past to zero.

FIG. 11 is a detailed program of the procedure (6υ) in FIG. 10, which calculates the maximum waiting time when a hall call is serviced and released as car KL.

In step (61a), the maximum waiting time WTMX is cleared to zero. Initialize the scanning floor m to zero in step (6xb), and then perform step (6xb).
61C), the scanning floor m is updated by m+lK. Procedure (61d
), it is determined whether the m-floor up call registration signal HUm is "1", and if it is rlJ, the m-floor up call waiting time (duration time) HTUm is added to the elapsed time SEC in step (61e). Count. When m floor up call registration No. 1i HUm is roJ in step (61d), that is, the call is released, it is determined in step (61f) whether waiting time HTUm is above the maximum waiting time WTMX Pi, and if it is above, step ( 6
1g), the waiting time for going up m floors is HTUm fI: the maximum waiting time WTMX. Then, in step (6xh), the waiting time HT
Clear Um to zero. Waiting time HTU in step (61f)
If it is determined that m is less than the maximum waiting time WTMX, step (6)
Proceed to xh). The steps (611) to (61m) are similar,
The maximum waiting time WTMX is calculated for the waiting time HTDmK of the m-floor down call registration IN @HDm. Hand Ill (
61n) to determine whether all floors have been scanned, and if not, return to step (61c) VC, and step (61c) to (6
1m) repeatedly.

Next, the door closed standby assignment operation is performed using the programs shown in FIGS. 12 and 13 (ROM VC stored in the storage device t (IIB)).
This will be explained using a flowchart of the operation.

FIG. 12 is a standby assignment program with the door closed, which includes an additional assignment process for specifying the number of machines in the standby with the door closed and an assignment process for the specified number.

In step 1811, td2), the scanning floor is initialized and updated. In this step, it is determined whether a hall call has been registered on the m floor, that is, whether the up call l1fJjl'HUm or the down call signal HDm of the m floor is rlJ. If it is not registered, a detailed program 5NASK for counting the number of units for which additional allocation is prohibited is executed in step 841.

Although illustration of this detailed program 5NASK is omitted, the car number NAsKn for which additional allocation is prohibited is checked for all cars with car nK, and the number of cars for which it is "1" is set as the number NABK of cars for which additional allocation is prohibited. If the number of vehicles waiting for service is determined to be less than the number of vehicles waiting for service, then the procedure (locking the door to the m floor in the brain) is performed. Standby designated cage No. 4 YCK
Determine whether m is not zero, and if it is not zero (if there is a specified car number), turn the above corner with hand 111gtt'tiη.
When CKm is set to car number n, it is determined whether the door opening service command Dcmn for car n on the m floor is Ill, that is, whether the command has been given (assigned) to the designated car. If no command has been given, please use the hand l1111881 to select the designated basket blue number YOKm.
Let the selected car numbers be KAG and O (the command for the designated car is processed before the command for the car).

In step 189), set the selected car number KA (40) to the car number n, and set the assignment command AKUmn for the m-floor upbound machine, the downbound assignment 1=order AKDnin, and the door closing service command DCun n to "1", respectively. Set rC.Additional allocation prohibition signal N A FEK to selected basket for procedure.
n is set to ``1'', and allocation to this car is prohibited from now on, as in waiting with the door closed on the designated floor. In addition, it is determined that the designated car number Y (Km is zero (designation is not completed)) with the door closed on the m floor due to the haze, or the procedure (8
If it is determined that the door closing service command DCmn is rlJ at 0 (the command has already been given), the procedure; UD determines whether the door closing additional assignment No. 11 ATOm to the m floor is "1". If the result is "l", proceed to step (931). If the selected car number KA()O is not zero,
Proceed to step (89).

If an up call or down call is registered on the m floor in step (c), a door closing service command D (to the m floor is issued in step 941).
41, DOmQ, , , are all reset. This is so that when a hall call for floor m is registered, it can be immediately assigned and serviced. Incidentally, the additional assignment option for the car whose door closing service command DOmn of all floors becomes rOJ is canceled after the process shown in FIG. 12 is performed. In step -, decide whether to scan all machines.

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

In step (92a), the selected car number KAGO is first set to zero. In step (92b), when the arrival is expected, 1...TY is set to the maximum value. Procedure (92c), (92+i
) is used to initialize and update the scanning number. Procedure (92
θ), it is determined whether the additional allocation prohibition signal NASKn of the nth car is "1", and if it is not "1", it is determined in step (92f) whether the door closing service command DOmn is "1", that is, n Determine whether the unit is receiving the m15i Vc door closing service command. If the door closing service command has not been received, use procedure (92g) to determine whether the expected upstream arrival time TYUmH is longer than the expected downstream arrival time TYDmn, and if the upstream is longer, the upstream arrival time is determined in step (92h). Estimated time T
It is determined whether YUmn is less than or equal to the estimated arrival time TY. If the expected arrival time is less than TY, select car number n in step (9'21) and set it to car number KA()O.
Set the expected arrival time TY to the expected upstream arrival time TYUmn (shortest value) VC. Furthermore, if it is determined in step (92g) that the expected downlink arrival time TYDmn is less than or equal to the expected upstream arrival time TYUmn, it is determined in step (92k) whether the expected downlink arrival time TYDmn is less than or equal to the previous expected arrival time TY. Then, similarly, in step (9zt), the nth car is selected and the F expected arrival time TYDmn of the nth car is set to the shortest value. In step (92i), it is determined whether to scan all machines.

Next, the allocation command release operation is performed using the program shown in Figure 14 (
This will be explained using the flowchart of the previous work of the storage device d (stored in the ROM of the IIB). (The door closing service command is canceled as shown in FIG. 12.) In steps (101) and (102), the vJ period of the scanning corner is set and updated. In step (103), the car position of scanning car n is set to scanning floor +nK. In step (1o4), it is determined whether the door closing service command for unit n on the m floor is "1", and it is determined that it is "0" (the m floor is a floor that does not receive the door closing service command). Then, in step (105), it is determined whether the nth machine is in the uplink service. If the uplink service is in progress, determine whether the nth unit has started closing the door in step (106), and if the door has started closing, reset the m floor uplink assignment command AKUmn to roJvc in step (lo'f). . If it is determined that the downlink service is in progress in step (105), the same process is performed in steps (10B) and (109).
104), the door closing service command for the machine on the m floor is "Y".
If it is determined that the car is stopped, it is determined in step (no) whether the car has stopped and the car is in a non-direction I/i' state (in which all calls are answered), and in step (in), it is determined whether the car has stopped and the car has been moved up and down m floors. The assignment commands AKUmn and AKDmn are reset to rOJ. In step (112), it is determined whether to scan all machines.

Next, the main points of creating door opening/closing commands are shown in Fig. 15 (70 grams) (
This will be explained using the flowchart of the previous work of the device (IOBI ROM K storage).

In step (121), the car position floor is set to scan floor mK.

In step (122), it is determined whether the car is in the door-openable zone eζ, and if it is in the zone, it is determined in step (123) whether the door is closed. When it is determined that the door is closed,
In step (124), it is determined whether the door opening button has been pressed, and if it has not been pressed, it is determined whether the car call has been answered by hand 11111 (125). If the car call is not answered, in step (126), the upstream assignment command AKUm or the downstream assignment command AKDm for the mth floor is determined to be a force 1 that is "1J,"
If it is not "1" (, !41 is not the floor), the procedure (
128), the door open command is set to "1" and the door close command is set to rnJ. In other words, the door stops closing. Hand +1114 (12
If it is determined that floor m is the assigned floor in step 6), step (1) is performed.
In step 2'7), it is determined whether the door closing service command for the m floor is "l". If it is rlJ, the door closes and stops in step (12B).If it is "0", the door open command krHJ is set in step (129), and the door close command is set as rLJ. In other words, the door stops opening. If it is determined in step (123) that the door is open, in steps (1st crime) to (134) it is determined that the door is not opening, the door opening button is pressed, and the door safety device is not operating. If the door close button is also pressed and the door opening time has not expired, the door will stop opening by hand (129). Descriptions of other procedures will be omitted.

In the embodiment, explanation will be limited to standby with the door closed, but it can be similarly implemented in the case of standby with the door open.

In addition, in the calculation of the service degree standby standby aSTCD in FIG. 10, 2. When the number is outside the range of K3, the number of service level waiting machines EITOD is calculated by increasing or decreasing the number, but when the cabinet maximum waiting time TKMAX is from how many seconds to how many seconds at a certain time in the past, how many service level waiting machines 5TCD is? Set up the table and display the maximum waiting time T in the cabinet at a certain time in the past! KM
Scan with AX and determine the number of machines waiting for service level STC! It may also be D.

Furthermore, instead of the maximum waiting time, it is also possible to easily calculate the number of waiting machines based on the average 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 departure]

As described above, in the present invention, an elevator reservation dispatch signal is generated by an input port button that is manually operated,
A reserved vehicle dispatch control signal is generated in accordance with the date and time from this reserved vehicle dispatch signal, and in accordance with this signal, the car is dispatched to the designated floor, and the number of waiting cars at the service level is set from the waiting time of each floor landing, and the number of waiting cars at the service level is set. The number of reserved and dispatched cars is regulated.

This saves the staff the trouble of operating each time! l'
In addition to being able to reserve and dispatch the Ko1 Noveta on 7i'j*,
It is possible to prevent services on other floors from being extremely degraded.

[Brief explanation of the drawing]

FIG. 1 is an overall configuration diagram showing one embodiment of an elevator operation reservation device according to the present invention, FIG. 2 is a block circuit diagram thereof, and FIG. 3 is a diagram showing the contents of the storage device of the input device in FIG. 2. Figures 4 and M5 are flowcharts of the operation by the input device in Figure 2, Figures 6 to 8 are flowcharts of the operation by the statistical device in Figure 2, and Figures 9 to 14 are flowcharts of the operation by the statistical device in Figure 2. FIG. 15 is a flowchart of the operation by the car control device of FIG. 2. FIG. fi+...Input capotan, (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 calculation means, (8)...Service degree waiting number setting means, (9)...
...Reservation standby regulation means % +10+...Koko control device, (11)...Group control device, (121...Statistical device, (13)...Input device Note that the same reference numerals in the drawings indicate the same parts. 1514 Procedural amendment (Spontaneous) Day. Eye Seri 9 J, 1 25 1. Indication of the case Patent application 1982-214 FO 7 @ 2 Title of the invention Elevator operation reservation device 3, person making the amendment 5 Subject of amendment (1) Details Column for Detailed Explanation of the Invention in the Book (2) Contents of the Amendment to Figure 12 6 of the Drawings (1) The word “(arrogance)” in the 4th line of the 14th shell of the specification was changed to “O
Q,” he corrected. (2) In the 6th ladle of the 15th member, "(50a) J" should be changed to "(50A) J." (3) On page 16, line 18 of the same, "KACm J" should be changed to "(50A) J." (4) In the 18th shell, lines 11 and 12, the phrase ``hour 1 ha 1 maximum J'' is corrected to ``maximum within time.'' (5) In the same book, page 23, line 20 of the same book, the word "long time" is corrected to "long waiting time."
"All floors scan" is corrected. (7) On page 24, line 19, [(92i) J is corrected to r (92j) J. (8) 9 corrections are made to Figure 12 in the drawings as shown in the attached appendix7.
One or more drawings showing Figure 12 after the revised list of attached documents

Claims (1)

[Claims] +11 An input capotan that is artificially operated and issues 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 capotan, and a date and time from the output of this reservation dispatch signal input means. Reservation dispatch control signal generating means for issuing a reserved vehicle dispatch control signal for the above-mentioned car; reservation waiting control means for issuing a reservation standby command to dispatch the above-mentioned car to the specified floor and wait there based on the output of the reservation vehicle dispatch control signal generating means; Waiting time calculation 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 as a reference for the number of waiting cars at each corner from the output of the waiting time calculating means; and the 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.