JPH0336721B2 - - Google Patents

Info

Publication number
JPH0336721B2
JPH0336721B2 JP2167685A JP2167685A JPH0336721B2 JP H0336721 B2 JPH0336721 B2 JP H0336721B2 JP 2167685 A JP2167685 A JP 2167685A JP 2167685 A JP2167685 A JP 2167685A JP H0336721 B2 JPH0336721 B2 JP H0336721B2
Authority
JP
Japan
Prior art keywords
work
time
station
transport vehicle
order
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
JP2167685A
Other languages
Japanese (ja)
Other versions
JPS61183003A (en
Inventor
Noriaki Hamaguchi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP60021676A priority Critical patent/JPS61183003A/en
Publication of JPS61183003A publication Critical patent/JPS61183003A/en
Publication of JPH0336721B2 publication Critical patent/JPH0336721B2/ja
Granted legal-status Critical Current

Links

Landscapes

  • Warehouses Or Storage Devices (AREA)

Description

【発明の詳細な説明】 〔発明の利用分野〕 本発明は、自動倉庫システムにのける作業優先
順決定法に関するものである。
DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to a work priority determining method in an automated warehouse system.

〔発明の背景〕[Background of the invention]

自動倉庫において、入庫口から各棚への荷物の
入庫および各棚から出庫口への荷物の出庫にはス
タツカクレーンが利用されている。このスタツカ
クレーンにおける入庫あるいは出庫作業を効率的
に行なう技術は、例えば特開昭55−7142号、特開
昭55−11482号、特開昭56−43110号に開示されて
いる。
In automated warehouses, stacker cranes are used for loading cargo into each shelf from the storage entrance and for unloading luggage from each shelf to the exit exit. Techniques for efficient loading and unloading operations using stacker cranes are disclosed in, for example, Japanese Patent Application Laid-open Nos. 7142-1982, 11482-1982, and 43110-1982.

ところで、自動倉庫の入出庫口と各ステーシヨ
ン間での荷物の搬送は、従来コンベヤ等が用いら
れてきた。しかし、ステーシヨンの増設、変更の
毎にコンベヤラインの増設、変更を必要とし、自
由度に欠ける面があつた。そこで、最近、この入
出庫口と各ステーシヨン間の荷物の搬送を搬送台
車で行なうことが考えられてきている。このよう
な場合、この搬送台車の作業をどのような優先順
で決定するかが課題として残されている。
By the way, conveyors and the like have conventionally been used to transport cargo between the entrance and exit of an automated warehouse and each station. However, each time a station is added or changed, it is necessary to add or change a conveyor line, resulting in a lack of flexibility. Therefore, recently, it has been considered to use a transport vehicle to transport cargo between the storage entrance and each station. In such a case, the problem remains as to what priority order should be used to perform the work on this transport vehicle.

〔発明の目的〕[Purpose of the invention]

本発明の目的は、入出庫口と各ステーシヨンと
の間の搬送台車による搬送作業(入庫作業と出庫
作業)の効率を向上せしめる自動倉庫システムに
おける作業優先順決定法を提供することである。
An object of the present invention is to provide a work priority determination method in an automated warehouse system that improves the efficiency of transport work (warehousing work and unloading work) by means of a transport vehicle between a warehouse entrance and each station.

〔発明の概要〕[Summary of the invention]

本発明は、作業要求を出してからの待時間とそ
の作業を行なう場合の搬送に要する時間とをパラ
メータとし、これの和の値の最大値のものに対応
する作業を行なうように作業優先順を決定するこ
とを特徴とする。
The present invention takes as parameters the waiting time after issuing a work request and the time required for transportation when performing the work, and prioritizes the work so that the work corresponding to the maximum value of the sum of these is performed. It is characterized by determining.

〔発明の実施例〕[Embodiments of the invention]

以下、本発明を具体的実施例に基づき詳細に説
明する。
Hereinafter, the present invention will be explained in detail based on specific examples.

まず、第2図により自動倉庫システムの概略構
成例を説明する。第2図において、10は台車の
走行ラインを示し、この例ではL1〜L7のライ
ンを有する。20は入出庫コンベヤである。30
は搬送台車であり、各ステーシヨン(図中○印)
の入出庫コンベヤ間の荷物の搬送を行なう。搬送
台車30への作業指令は、入出庫コンベヤ20の
付近に設けた送受信装置40により行なわれる。
つまり、台車30は、この位置で図示しない計算
機より作業指令を受取り、指定されたライン(L
1〜L7のいずれか)の指定されたステーシヨン
に荷物を搬送したり、指定ラインの指定ステーシ
ヨンにある荷物を入出庫コンベヤ20に搬送す
る。入庫要求信号は、第3図に示すように、該当
ステーシヨンに入庫すべき荷物が台車30に渡せ
る状態で存在するときオン(ON)となり、該当
ステーシヨンの荷物を台車に取込んだときオフ
(OFF)となる。出庫要求信号を同様である。
First, a schematic configuration example of an automated warehouse system will be explained with reference to FIG. In FIG. 2, reference numeral 10 indicates running lines of the truck, and in this example, there are lines L1 to L7. Reference numeral 20 denotes a loading/unloading conveyor. 30
is a transport vehicle, and each station (marked with ○ in the figure)
Transports cargo between the incoming and outgoing conveyors. Work commands to the transport vehicle 30 are issued by a transmitting/receiving device 40 provided near the loading/unloading conveyor 20.
In other words, the trolley 30 receives a work command from a computer (not shown) at this position, and moves to the designated line (L
1 to L7), or transports the cargo at a designated station on a designated line to the loading/unloading conveyor 20. As shown in FIG. 3, the warehousing request signal is turned on (ON) when the cargo to be stored at the corresponding station exists in a state that can be delivered to the trolley 30, and is turned OFF (OFF) when the cargo at the corresponding station is taken into the trolley. ). The same applies to the delivery request signal.

本発明の実施例に係る作業順位決定の処理は、
入庫要求信号(あるいは出庫要求信号)が発生す
る毎に行なわれる。入庫あるいは出庫要求信号
は、各ステーシヨンからランダムに発生され、し
たがつて通常複数の要求信号が発生している。
The process of determining the work order according to the embodiment of the present invention is as follows:
This is performed every time a warehousing request signal (or a warehousing request signal) is generated. The incoming or outgoing request signal is randomly generated from each station, so usually a plurality of request signals are generated.

この複数発生した作業のうち、どの作業を行な
うかを全体の効率をアツプするという観点から処
理し、優先順位を決定する。この処理フローは、
第1図に示される。まず、第1図におけるステツ
プAでは、計算機が自動更新しているOS(オペレ
ーシヨンシステム)内の時刻を取り込む。次に、
入出力装置を介して要求信号がどのラインのどの
ステーシヨンから発生されているかのナンバー
(No.)を判定する。そして、該当ケースデータが
有る場合、その要求発生時刻と現在時刻との差を
時間テーブルにセツトする。これらは全ケースに
ついて行なわれる。ここまでの処理がB5〜B20
のステツプである。続いて、時間テーブルの該当
ケースデータが有る場合(ステツプB25)、時間
テーブルと距離ケーブルとの加算結果を優先順テ
ーブルにセツトする(ステツプB30)。これらの
処理は、全ケースにつき行なう(ステツプB35)。
なお、距離テーブルは、予め、各ステーシヨンの
入出庫コンベヤ間の搬送に要する時間を測定し、
これらをテーブルとして各ステーシヨン単位にテ
ーブル化したものである。一般に、要求信号の発
生した時刻を覚えておき、作業決定を行なおうと
している現在時刻との差を求め(時間テーブル)、
これをTnとすると、このTnが大きい該当ステー
シヨンを優先することにより、要求発生から長時
間待たされることはなくなる。しかし、搬送距離
の関係があり、Tnが大きい順に作業順印を決定
し作業を行なわせることが、必ずしも全体の作業
効率を良くすることにはならない。そこで、Tn
が最も大(待時間最大)のものと、2番目に大き
いものとの差があまりない場合には、搬送距離に
対応した搬送に要する時間Htを選択の要因とし
て考えた。つまり、ΣT=Tn+Htを求め、ΣTの
最も大きい順に作業順位を選択する。このため
ΣTの作成処理がステツプB25〜B35である。全
ケースについての処理が終了(ステツプB35)す
ると、優先テーブルを利用して作業順を決定す
る。この決定処理は、ΣTの値の大きい順とする。
ΣTの最大値をみつけ出し、その最大値に該当す
るステーシヨンを判定するのが、C05〜C40およ
びDのステツプである。ステツプFは、台車に与
える作業がなかつた場合の処理であり、一定時間
後に一連の処理を再起動するためのタイマをセツ
トする。ステツプEは、決定された作業を台車に
指示出力する。
Among these multiple tasks, which task should be performed is processed from the viewpoint of increasing overall efficiency, and the order of priority is determined. This processing flow is
It is shown in FIG. First, in step A in FIG. 1, the time in the OS (operating system), which is automatically updated by the computer, is imported. next,
The number (No.) indicating which line and station the request signal is generated from is determined via the input/output device. If there is corresponding case data, the difference between the request generation time and the current time is set in the time table. These are performed for all cases. The processing up to this point is B5~B20
This is the step. Subsequently, if there is corresponding case data for the time table (step B25), the result of addition of the time table and distance cable is set in the priority order table (step B30). These processes are performed for all cases (step B35).
Note that the distance table is created by measuring the time required for transportation between the incoming and outgoing conveyors at each station in advance.
These are made into a table for each station. Generally, the time at which the request signal was generated is memorized, and the difference between it and the current time at which the work decision is to be made is calculated (time table).
If this is Tn, priority is given to the corresponding station with a larger Tn, thereby eliminating the need to wait for a long time after a request is generated. However, because of the transport distance, determining the work order mark and having the work performed in descending order of Tn does not necessarily improve the overall work efficiency. Therefore, Tn
When there is not much difference between the one with the largest (maximum waiting time) and the second largest, the time Ht required for transportation corresponding to the transportation distance was considered as a selection factor. That is, ΣT=Tn+Ht is calculated, and the work order is selected in order of the largest ΣT. Therefore, the process of creating ΣT is performed in steps B25 to B35. When processing for all cases is completed (step B35), the priority table is used to determine the order of work. This determination process is performed in order of increasing ΣT value.
Steps C05 to C40 and D are to find the maximum value of ΣT and determine the station corresponding to the maximum value. Step F is a process performed when there is no work to be done to the cart, and a timer is set to restart the series of processes after a certain period of time. Step E instructs the cart to perform the determined work.

〔発明の効果〕〔Effect of the invention〕

以上説明したように本発明によれば、待時間と
各作業の搬送に要する時間との和として得られる
優先テーブルの最大値順に作業を決定するので、
全体としての効率の向上に寄与する。
As explained above, according to the present invention, the tasks are determined in order of the maximum value of the priority table obtained as the sum of the waiting time and the time required for transportation of each task.
Contributes to improving overall efficiency.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の一実施例にかかる作業優先順
決定処理フロー図、第2図は自動倉庫システムの
レイアウト図、第3図は入庫要求信号を示す図で
ある。 10……走行ライン、20……入出庫コンベ
ヤ、30……搬送台車、40……送受信装置。
FIG. 1 is a flowchart of a work priority determination process according to an embodiment of the present invention, FIG. 2 is a layout diagram of an automated warehouse system, and FIG. 3 is a diagram showing a warehousing request signal. DESCRIPTION OF SYMBOLS 10...Traveling line, 20...Input/output conveyor, 30...Transportation truck, 40...Transmission/reception device.

Claims (1)

【特許請求の範囲】[Claims] 1 搬送台車により自動倉庫の入庫口あるい出庫
口と各ステーシヨンとの間の荷物の搬送を行なう
自動倉庫システムにおける搬送角車の作業優先順
を決定する方法において、各作業に対応して搬送
に要する時間を記憶するステツプと、ステーシヨ
ンから作業要求が発せられた時刻と現在時刻との
差を演算して待時間を求めるステツプと、該待時
間と該搬送に要する時間との和を演算するステツ
プと、該和の値が最大となるステーシヨンからの
作業要求を決定するステツプとを含むことを特徴
とする自動倉庫システムの作業優先順決定法。
1. In a method for determining the work priority order of a square transport vehicle in an automated warehouse system in which a transport vehicle transports cargo between the entrance or exit of an automated warehouse and each station, A step of storing the required time, a step of calculating the difference between the time when the work request was issued from the station and the current time to obtain the waiting time, and a step of calculating the sum of the waiting time and the time required for the transport. and a step of determining the work request from the station that maximizes the value of the sum.
JP60021676A 1985-02-08 1985-02-08 Method for determining priority order in automatic storing warehouse system Granted JPS61183003A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP60021676A JPS61183003A (en) 1985-02-08 1985-02-08 Method for determining priority order in automatic storing warehouse system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP60021676A JPS61183003A (en) 1985-02-08 1985-02-08 Method for determining priority order in automatic storing warehouse system

Publications (2)

Publication Number Publication Date
JPS61183003A JPS61183003A (en) 1986-08-15
JPH0336721B2 true JPH0336721B2 (en) 1991-06-03

Family

ID=12061658

Family Applications (1)

Application Number Title Priority Date Filing Date
JP60021676A Granted JPS61183003A (en) 1985-02-08 1985-02-08 Method for determining priority order in automatic storing warehouse system

Country Status (1)

Country Link
JP (1) JPS61183003A (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0198505A (en) * 1987-10-05 1989-04-17 Saika Gijutsu Kenkyusho Delivering device for stored goods
JPH03156383A (en) * 1989-11-14 1991-07-04 Fujitsu Ltd Self-propelling vehicle feed apparatus

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5997999A (en) * 1982-11-24 1984-06-06 株式会社東芝 Article conveyor

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5997999A (en) * 1982-11-24 1984-06-06 株式会社東芝 Article conveyor

Also Published As

Publication number Publication date
JPS61183003A (en) 1986-08-15

Similar Documents

Publication Publication Date Title
CN110533353B (en) Method and device for handling shelves
CN114415610B (en) Scheduling method and device for robot, electronic equipment and storage medium
CN111860919A (en) Method, device, medium and electronic equipment for determining storage strategy of library shelf
CN111724015A (en) Method, device and equipment for switching carrying tasks and storage medium
CN110789898A (en) Stereoscopic warehouse and method and device for getting articles out of warehouse
CN112232541A (en) Transportation path determining method, device, equipment and storage medium
CN112551015B (en) Method and device for rotating goods shelf in carrying process
CN111738492A (en) Container positioning method, device, equipment and storage medium
CN110422526B (en) Warehousing system and logistics control method
JPH0336721B2 (en)
JP3794063B2 (en) Transport system
JP2005206272A (en) Article carrying method and article carrying system
CN112529237B (en) Scheduling system setting method and device, scheduling method and device, medium and equipment
JP3139885B2 (en) Control system for multiple automatic warehouses
CN115231187B (en) Method and device for loading containers, electronic equipment and computer readable medium
JP2002087547A (en) Carrying-in and carrying-out control device and automated storage and retrieval warehouse having this carrying-in and carrying-out control device
CN113848929B (en) AGV carrier scheduling method and device
JPS63300099A (en) Conveyance controller
JPH05139507A (en) Delivery operation device for automated warehouse
JP2000003219A (en) Method for instructing work of automated guided vehicle and device therefor
JP3677830B2 (en) Work instruction device in transport system
CN116639416A (en) Handling method and device, warehouse system and electronic equipment
CN113673918A (en) Control method and device for transport device and storage medium
JPH03156614A (en) Operation controller for unmanned carrier
JPH04236609A (en) Operation controller for unattended carriage