CN113998357B - Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium - Google Patents
Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium Download PDFInfo
- Publication number
- CN113998357B CN113998357B CN202111232772.4A CN202111232772A CN113998357B CN 113998357 B CN113998357 B CN 113998357B CN 202111232772 A CN202111232772 A CN 202111232772A CN 113998357 B CN113998357 B CN 113998357B
- Authority
- CN
- China
- Prior art keywords
- time
- stacker
- task
- space
- queue
- 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.)
- Active
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
- B65G1/00—Storing articles, individually or in orderly arrangement, in warehouses or magazines
- B65G1/02—Storage devices
- B65G1/04—Storage devices mechanical
- B65G1/0407—Storage devices mechanical using stacker cranes
- B65G1/0421—Storage devices mechanical using stacker cranes with control for stacker crane operations
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
The invention discloses a method for scheduling a double stacker of a filter rod warehouse system of a cigarette factory and a storage medium, wherein the method comprises the following steps: determining the latest starting time step, the priority dividing step, the sorting step, the idle running distance determining step, the space-time model constructing step and the task issuing step; the space-time model is built through the data of the machine production plan, the machine consumption speed, the service condition of the stacker, the existing task information pool, the equipment running state and the like, the running of the stacker is controlled based on the model, the three-dimensional running space of two stackers in the same track is fully considered, a certain stacker is reasonably arranged according to the space-time model to execute tasks, the two stacker tasks in the same time are not crossed in the space, the average moving distance, the idle running distance and the task time of the stacker tasks are effectively reduced, the flexible and flexible operation efficiency of the stacker is improved, the use energy consumption is reduced, and the intelligent degree is improved.
Description
Technical Field
The invention relates to the technical field of cigarette factory filter rod warehouse storage, in particular to a method for scheduling double stackers of a cigarette factory filter rod warehouse storage system and a storage medium.
Background
The traditional three-dimensional warehouse system generally consists of an information system managed by a computer and a stacker control system managed by a PLC. The stacker tasks are typically performed in a sequence that follows the tasks that were issued by the computer system. When a storage system is used in a filter rod library of a cigarette factory, two stackers on the same track respectively execute tasks in respective areas, the scheduling of the stackers is to consider data such as materials required by production, such as a bag coiling machine table, a transmitter table and the like in the production process, the production beats, the time requirement of material shortage, the time requirement of material blocking and the like, the data are usually transmitted by a computer system through an interface, the stacker control system cannot effectively adjust the task execution sequence, and the situation that the machine is broken due to the fact that a certain unit task is not executed for a long time is easy to occur; in addition, if the production task is greatly increased, the redundancy of the original design capability cannot meet the requirement, and the situation of material breakage is often caused, so that the production rhythm is affected. Therefore, it is highly desirable to find a reasonable method for scheduling the stacker to improve the composite operation efficiency of the stacker.
Disclosure of Invention
In order to solve the defects in the prior art, the invention aims to provide the method for scheduling the filter rod library one-rail double-stacker for realizing goods handling in a reasonable operation time and a three-dimensional space for material handling walking by fully considering multi-source and multi-target compound operation according to the task quantity in a handling task pool, reasonably optimizing the task sequence and effectively improving the operation efficiency of the filter rod library one-rail double-stacker.
According to a first aspect, the invention provides a method for scheduling a double stacker of a filter rod warehouse system of a cigarette factory, which comprises the following steps:
determining the latest starting time: determining the latest starting time of each task according to the machine station blanking time and the stacker motion parameters;
a step of prioritizing: dividing task priority according to the latest starting time;
sequencing: sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue;
determining the idle running distance: determining the blank distance of the stacker for all sequencing conditions of the whole queue;
and (3) constructing a space-time model: arranging all sequencing conditions of the whole queue according to the blank distance of the stacker, constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and selecting the space-time model if the constructed space-time model meets the selection requirement; if not, selecting the next arrangement to construct a space-time model; if all the space-time models are not satisfied, selecting the space-time model with the shortest space-running distance;
the task issuing step comprises the following steps: based on the selected space-time model, tasks in the space-time model are sequentially issued to the stacker.
Further, the step of determining the latest start time includes:
determining the material breaking time of a machine; the machine station material breaking time comprises a forming machine material breaking time or a transmitter material breaking time;
determining the time required by the stacker to complete the task;
and the latest starting time of each task is not less than the sum of the machine station blanking time, the time required by the stacker to complete the task and the time required by the task to be generated.
Further, the molding machine has a breaking time tc=ch/CN;
the transmitter outage time tf=fh/FN;
wherein: CH is the number of cache filter rod lattices after the forming machine applies for the disc; CN is the production capacity of brands of worksheets corresponding to the forming machine; FH is the number of cache filter rod lattices after the transmitter applies for disc removal; FN is the sum of the production capacities of the cigarette making machine corresponding to all pipelines of the transmitter.
Further, the method comprises the steps of,
wherein X is i Is the number of the pipelines which are used by the cigarette making machine of the number i, x i For the number of pipelines connected from the K pipeline of the transmitter in the pipeline in use of the i-number cigarette making machine, N i The ability to consume filter sticks for a cigarette machine number i.
Further, the time t=t required for the stacker to complete the task 1 +t；
Wherein: t (T) 1 The movement time of the stacker is; and t is the time of stretching and receiving the fork of the stacker.
Further, when the task movement distance J is greater than or equal to the shortest distance BJ at which the stacker accelerates from rest to maximum speed and then reduces to rest, the stacker movement time T 1 Is that
S is the maximum running speed of the stacker;
when the task moving distance J is smaller than the shortest distance BJ of the stacker from the standstill to the maximum speed and then to the standstill, the stacker moving time T 1 Is that
Wherein a is acceleration of the stacker during uniform acceleration movement; b is the acceleration of the stacker during uniform deceleration movement.
Further, the prioritizing step includes:
dividing tasks into an artificial task and a system task; dividing the manual task into a manual queue, wherein the priority is two-level;
judging whether the current moment exceeds the latest starting time of the current system task, if so, dividing the system task into an emergency queue, wherein the priority is one level; if the priority is not exceeded, the common queue is marked, and the priority is three-level;
the step of ordering includes:
sequencing tasks in the manual queue, the emergency queue and the common queue respectively, and listing all sequencing conditions;
and sequencing the manual queue, the emergency queue and the common queue according to the order of the priority level one-second-third to obtain an integral queue, and listing all sequencing conditions of the integral queue.
Further, the task assigning step includes:
sequentially issuing tasks in the space-time model to a stacker, and if the tasks have pairing tasks, issuing the tasks and the pairing tasks to the stacker together;
and after all tasks issued to the stacker start to be executed, issuing a new task to the stacker.
Further, after the space-time model is selected, if a new task is detected to be added, returning to the step of determining the latest starting time, and if the new task is not detected to be added, executing the task issuing step.
According to a second aspect, the present invention also provides a computer readable storage medium having stored thereon a computer program executable by a processor to implement the steps of the method as described above.
Introduction of working principle:
the goods shelf area is divided into three areas, in principle, two stackers on the same track are in charge of an area 1, the other is in charge of an area 2, and the area 3 is cooperatively in charge of the two stackers, so that collision of the two stackers is avoided, and the time for parking is reduced (the problem that the two stackers need to consider parking when both are at the edge of the middle area, and at the moment, a subsystem of one stacker performs parking according to the existing parking mode). When the stacker executes tasks in the respective areas, the stacking machines are sequentially carried out according to the sequence from short distance to long distance, so that the stacking machines are free from conflict, and the working efficiency is greatly improved.
Compared with the prior art, the invention has the beneficial effects that:
(1) According to the scheduling method for the double-stacker of the filter rod warehouse system of the cigarette factory, provided by the invention, the space-time model is built by simulating the space and time data of the stackers, and the task sequencing queue with the shortest idle running time is found, so that two stacker tasks in the same time are not crossed in the space, the task allocation balance degree of the two stackers is basically consistent, the composite operation efficiency of the stackers is improved, and the filter rod workshops are ensured to be free from blocking and shortage of materials.
(2) The average moving distance, the idle running distance and the task time of the stacker task are effectively reduced, the overall running time is shortened, the material interruption condition in the production process can be reduced, and the power consumption is reduced.
Drawings
FIG. 1 is a schematic illustration of a filter rod library partition;
FIG. 2 is a flow chart of a method for scheduling a double stacker of a filter rod warehouse system of a cigarette factory;
FIG. 3 is a flow chart of a method for scheduling a dual stacker for a filter rod magazine stocker system in a cigarette factory in example 1;
FIG. 4 is a flowchart showing the steps of constructing the space-time model in example 1;
FIG. 5 is a flow chart of the task assigning step in embodiment 1.
Detailed Description
The invention will be described in further detail below with reference to the drawings by means of specific embodiments.
And (3) a forming machine: when the number of the buffered empty discs is smaller than a set value, the forming machine sends out an empty disc delivery request to the computer system, the computer system generates an empty disc delivery task, and the stacker delivers the empty discs to an upper layer platform of the forming machine. And the forming machine is used for placing the produced filter sticks into empty trays and conveying the empty trays to a lower layer platform, when the number of the full trays reaches the set number, the forming machine sends a full tray warehouse-in application to a computer system, the computer system generates a full tray warehouse-in task, and the stacker takes the full trays filled with the filter sticks out from the lower layer and puts the full trays into a warehouse.
A transmitter: when the number of the buffered full discs is less than a set value, the transmitter transmits a full disc warehouse-out application to the computer system, the computer system generates a full disc warehouse-out task, the stacker transmits the full discs to an upper layer platform of the transmitter, the transmitter transmits the filter sticks to the rolling machine and conveys the empty discs to a lower layer platform, when the number of the empty discs reaches the set number, the transmitter transmits an empty disc warehouse-in application to the computer system, the computer system generates an empty disc warehouse-in task, and the stacker takes the empty discs out of the lower layer and warehouses.
Breaking time: the amount of buffering set when the former or transmitter requests out of and into storage may support the time for reproduction.
Distance of idle running: distance between the current position of the stacker and the start point of the task to be executed.
Pairing tasks: the task to be completed together is accompanied by a warehouse-in application of the same machine station every time according to the production business of the filter rod warehouse, and the warehouse-out end point row and the warehouse-in start point row are the same row.
Example 1
As shown in fig. 1, the shelf area is divided into three areas of 1 area, 2 area and 3 area, in principle, two stackers on the same track, one is in charge of the 1 area, the other is in charge of the 2 area, and the 3 area is cooperatively in charge of the two stackers. The invention provides a method for scheduling two stackers of a filter rod warehouse storage system of a cigarette factory according to two stackers on the same track. Specifically, the scheduling method comprises the following steps:
determining the latest starting time: and determining the latest starting time of each task according to the machine station blanking time and the stacker motion parameters.
Specifically, firstly, determining the machine blanking time:
the machine station blanking time comprises: the forming machine breaking time and the emitter breaking time. The forming machine breaking time TC=CH/CN; the transmitter has a blanking time tf=fh/FN.
Wherein TC is the broken material time of the forming machine; CH is the number of cache filter rod lattices after the forming machine applies for the disc; CN is the production capacity of brands of worksheets corresponding to the forming machine; TF is the time to break the material of the transmitter; FH is the number of cache filter rod lattices after the transmitter applies for disc removal; FN is the sum of the production capacities of the cigarette making machine corresponding to all pipelines of the transmitter.
The sum FN of the production capacities of the cigarette making machine corresponding to all pipelines of the transmitter is as follows:
wherein the method comprises the steps of，X i Is the number of the pipelines which are used by the cigarette making machine of the number i, x i For the number of pipelines connected from the K pipeline of the transmitter in the pipeline in use of the i-number cigarette making machine, N i The ability to consume filter sticks for a cigarette machine number i.
Then determining the time T required by the stacker to complete the task:
T＝T 1 +t
wherein T is 1 The movement time of the stacker is; and t is the time of stretching and receiving the fork of the stacker.
When the task moving distance J is greater than or equal to the shortest distance BJ from the standstill acceleration to the maximum speed and then to the standstill, the stacker moving time T 1 Is that
S is the maximum running speed of the stacker;
a is acceleration of the stacker during uniform acceleration movement; b is acceleration when the stacker makes uniform deceleration movement, J= (|A-B|x d); a is a task starting point row, B is a task ending point row, and d is a cargo grid width.
When the task moving distance J is smaller than the shortest distance BJ of the stacker from the standstill to the maximum speed and then to the standstill, the stacker moving time T 1 Is that
Finally, the latest starting time TZ is obtained through the blanking time TC or TF, the time T required by the stacker to complete the task and the time TS generated by the task:
tz=tc+ts+t+tt or tz=tf+ts+t+tt
Wherein TT is suitably advanced for a short time to ensure safe operation of the system.
A step of prioritizing: task priorities are divided according to the latest start time TZ. Namely:
dividing tasks into artificial tasks and system tasks; and dividing the manual tasks into a manual queue, wherein the priority is two-level. Then judging whether the current moment exceeds the latest starting time of the current system task, if so, dividing the system task into an emergency queue, wherein the priority is one level; if the priority is not exceeded, the common queue is marked, and the priority is three-level.
Sequencing: and sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue. Namely:
sequencing tasks in the manual queue, the emergency queue and the common queue respectively, and listing all sequencing conditions; and then sequencing the manual queue, the emergency queue and the common queue according to the order of the priority level one-second-third to obtain an integral queue, and listing all sequencing conditions of the integral queue.
Determining the idle running distance: determining the blank distance of the stacker for all sequencing conditions of the whole queue;
and (3) constructing a space-time model: arranging all sequencing conditions of the whole queue according to the blank distance of the stacker, constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and selecting the space-time model if the constructed space-time model meets the selection requirement; if not, selecting the next arrangement to construct a space-time model; and if all the space-time models are not satisfied, selecting the space-time model with the shortest space-running distance.
After the space-time model is selected, if a new task is detected to be added, returning to the step of determining the latest starting time, and if the new task is not detected to be added, executing the task issuing step.
The task issuing step comprises the following steps: and sequentially issuing tasks in the space-time model to the stacker, if the tasks have paired tasks, issuing the tasks and the paired tasks to the stacker together, and issuing new tasks to the stacker after all the tasks issued to the stacker start to be executed, so that the time for issuing task interfaces is reduced, and the efficiency is improved.
By adopting the method for scheduling the double stackers of the filter rod warehouse system of the cigarette factory in the respective areas of the two stackers on the same track, collision is avoided, vehicles and idle running are reduced as much as possible, and the working efficiency is greatly improved.
The operation data before and after the dual stacker scheduling method for the filter rod library warehouse system of the cigarette factory provided by the embodiment 1 are compared, and the following table is shown. The method for scheduling the double-stacker for the filter rod warehouse system of the cigarette factory effectively reduces the average moving distance and the task time of the stacker task, so that the material interruption condition in the production process can be reduced, meanwhile, the idle running distance is reduced, the power consumption can be reduced, and meanwhile, the whole running time is shortened.
The foregoing description of the invention has been presented for purposes of illustration and description, and is not intended to be limiting. Several simple deductions, modifications or substitutions may also be made by a person skilled in the art to which the invention pertains, based on the idea of the invention.
Claims (6)
1. A method for scheduling double stackers of a filter rod warehouse system of a cigarette factory is characterized by comprising the following steps:
determining the latest starting time: determining the latest starting time of each task according to the machine station blanking time and the stacker motion parameters;
a step of prioritizing: dividing task priority according to the latest starting time;
sequencing: sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue;
determining the idle running distance: determining the blank distance of the stacker for all sequencing conditions of the whole queue;
and (3) constructing a space-time model: arranging all sequencing conditions of the whole queue according to the blank distance of the stacker, constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and selecting the space-time model if the constructed space-time model meets the selection requirement; if not, selecting the next arrangement to construct a space-time model; if all the space-time models are not satisfied, selecting the space-time model with the shortest space-running distance;
the task issuing step comprises the following steps: based on the selected space-time model, sequentially issuing tasks in the space-time model to a stacker;
the step of determining the latest start time includes:
determining the material breaking time of a machine; the machine station material breaking time comprises a forming machine material breaking time or a transmitter material breaking time;
determining the time required by the stacker to complete the task;
the latest starting time of each task is not less than the sum of the machine station blanking time, the time required by the stacker to complete the task and the time required by the task to be generated;
the material breaking time TC=CH/CN of the forming machine;
the transmitter outage time tf=fh/FN;
wherein: CH is the number of cache filter rod lattices after the forming machine applies for the disc; CN is the production capacity of brands of worksheets corresponding to the forming machine; FH is the number of cache filter rod lattices after the transmitter applies for disc removal; FN is the sum of the production capacities of the cigarette making machine corresponding to all pipelines of the transmitter;
time t=t required for the stacker to complete a task 1 +t；
Wherein: t (T) 1 The movement time of the stacker is; t is the time of stretching and receiving the fork of the stacker;
when the task moving distance J is greater than or equal to the shortest distance BJ from the standstill acceleration to the maximum speed and then to the standstill, the stacker moving time T 1 Is that
S is the maximum running speed of the stacker;
when the task moving distance J is smaller than the shortest distance BJ of the stacker from the standstill to the maximum speed and then to the standstill, the stacker moving time T 1 Is that
Wherein a is acceleration of the stacker during uniform acceleration movement; b is the acceleration of the stacker during uniform deceleration movement.
2. The method of claim 1, wherein,
wherein X is i Is the number of the pipelines which are used by the cigarette making machine of the number i, x i For the number of pipelines connected from the K pipeline of the transmitter in the pipeline in use of the i-number cigarette making machine, N i The ability to consume filter sticks for a cigarette machine number i.
3. The method according to any of claims 1-2, wherein the prioritizing step comprises:
dividing tasks into an artificial task and a system task; dividing the manual task into a manual queue, wherein the priority is two-level;
judging whether the current moment exceeds the latest starting time of the current system task, if so, dividing the system task into an emergency queue, wherein the priority is one level; if the priority is not exceeded, the common queue is marked, and the priority is three-level;
the step of ordering includes:
sequencing tasks in the manual queue, the emergency queue and the common queue respectively, and listing all sequencing conditions;
and sequencing the manual queue, the emergency queue and the common queue according to the order of the priority level one-second-third to obtain an integral queue, and listing all sequencing conditions of the integral queue.
4. The method according to any one of claims 1-2, wherein the task assigning step comprises:
sequentially issuing tasks in the space-time model to a stacker, and if the tasks have pairing tasks, issuing the tasks and the pairing tasks to the stacker together;
and after all tasks issued to the stacker start to be executed, issuing a new task to the stacker.
5. A method according to any of claims 1-2, characterized in that after the space-time model selection, if a new task addition is detected, the step of determining the latest start time is returned, and if no new task addition is detected, the task issuing step is performed.
6. A computer readable storage medium having stored thereon a computer program, wherein the program is executable by a processor to perform the steps of the method according to any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111232772.4A CN113998357B (en) | 2021-10-22 | 2021-10-22 | Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111232772.4A CN113998357B (en) | 2021-10-22 | 2021-10-22 | Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113998357A CN113998357A (en) | 2022-02-01 |
| CN113998357B true CN113998357B (en) | 2023-04-25 |
Family
ID=79923791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111232772.4A Active CN113998357B (en) | 2021-10-22 | 2021-10-22 | Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113998357B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110428188A (en) * | 2019-08-13 | 2019-11-08 | 厦门烟草工业有限责任公司 | Tobacco flow dispatching method, warehousing system and storage medium |
| CN112070412A (en) * | 2020-09-15 | 2020-12-11 | 吉林大学 | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7664561B1 (en) * | 2002-04-25 | 2010-02-16 | Taiwan Semiconductor Manufacturing Company, Ltd. | Task queuing methodology for reducing traffic jam and to control transmission priority in an automatic material handling system |
| JP2005206272A (en) * | 2004-01-20 | 2005-08-04 | Toyota Industries Corp | Article carrying method and article carrying system |
| CN102143899B (en) * | 2008-09-05 | 2013-12-04 | 株式会社大福 | Article storage facility and method of operating the same |
| JP2012076891A (en) * | 2010-10-04 | 2012-04-19 | Toppan Printing Co Ltd | Cassette conveyance priority allocating method and cassette conveyance control system |
| JP6597551B2 (en) * | 2016-10-21 | 2019-10-30 | 株式会社ダイフク | Goods transport equipment |
| CN106406264A (en) * | 2016-11-28 | 2017-02-15 | 龙岩烟草工业有限责任公司 | Piler scheduling method and device |
| CN107161586B (en) * | 2017-06-02 | 2019-04-05 | 浙江中烟工业有限责任公司 | A kind of automation filter stick library piler scheduling system |
| CN107235275B (en) * | 2017-06-02 | 2019-04-05 | 浙江中烟工业有限责任公司 | A kind of automation filter stick library filter stick storage system |
| CN107480922B (en) * | 2017-07-07 | 2021-03-16 | 西安建筑科技大学 | Method for establishing goods position distribution scheduling model under two-end type same-rail double-vehicle running mode |
| CN111846726B (en) * | 2020-07-30 | 2022-04-19 | 重庆惠科金渝光电科技有限公司 | Transportation equipment and carrying method thereof |
| CN112801565B (en) * | 2021-04-14 | 2021-07-06 | 浙江明度智控科技有限公司 | Goods allocation dispatching method, system and storage medium for intelligent storage |
-
2021
- 2021-10-22 CN CN202111232772.4A patent/CN113998357B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110428188A (en) * | 2019-08-13 | 2019-11-08 | 厦门烟草工业有限责任公司 | Tobacco flow dispatching method, warehousing system and storage medium |
| CN112070412A (en) * | 2020-09-15 | 2020-12-11 | 吉林大学 | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113998357A (en) | 2022-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10717599B2 (en) | Control system for storage and retrieval systems | |
| CN104408589B (en) | AGV Optimization Schedulings based on Hybrid Particle Swarm | |
| CN103559396B (en) | Based on the automatic dispensary stock's allocation optimization method improving chaos particle cluster algorithm | |
| Van Den Berg et al. | Simulation study of an automated storage/retrieval system | |
| JP2021062979A (en) | Method, system and device for controlling movement of carrier device | |
| CN108750685A (en) | A kind of mixing palletizing method and system offline | |
| CN113222293A (en) | Intelligent stereoscopic warehouse optimal scheduling method | |
| WO2022222797A1 (en) | Robot dispatching method and apparatus, system, storage medium, and program product | |
| CN112070412A (en) | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse | |
| KR20220031088A (en) | Container storage systems, warehouse management systems and robots | |
| CN112875112A (en) | Digital twin-based high-density stereoscopic warehouse storage position allocation and scheduling method | |
| CN113998357B (en) | Method for scheduling double stackers of filter rod warehouse system of cigarette factory and storage medium | |
| Chen et al. | Simulation-based time-efficient and energy-efficient performance analysis of an overhead robotic compact storage and retrieval system | |
| CN114611767A (en) | Global optimal intelligent warehousing scheduling optimization algorithm | |
| CN106406264A (en) | Piler scheduling method and device | |
| CN110466927A (en) | Storing object, the shelf processing method in a kind of warehouse and warehouse | |
| CN111178802A (en) | Intelligent warehouse entry system for warehouse | |
| CN107235275A (en) | One kind automation filter stick storehouse filter stick storage system | |
| JP2023524443A (en) | Optimizing the operating capacity of container handling vehicles assigned to interact with the same ports for transferring storage containers to and from automated storage and retrieval systems. good use | |
| CN111709565A (en) | Energy efficiency optimization method and system based on multi-layer shuttle system | |
| Zhou et al. | Design and simulation of storage location optimization module in AS/RS based on FLEXSIM | |
| CN111861112A (en) | Method and device for estimating transport buffer capacity of multi-layer shuttle system | |
| Zhou et al. | Optimization and simulation of storage location assignment in AS/RS based on FLEXSIM | |
| Chen et al. | Research on Multilevel Coordinational Flexible Scheduling Strategy of One-Track Dual-Stacker System Oriented Towards Response Time on Demand Side | |
| CN113420951A (en) | Performance evaluation system of double-depth multi-layer intelligent warehouse |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |