CN113998357A - Double-stacker scheduling method and storage medium for cigarette factory filter stick warehouse storage system - Google Patents
Double-stacker scheduling method and storage medium for cigarette factory filter stick warehouse storage system Download PDFInfo
- Publication number
- CN113998357A CN113998357A CN202111232772.4A CN202111232772A CN113998357A CN 113998357 A CN113998357 A CN 113998357A CN 202111232772 A CN202111232772 A CN 202111232772A CN 113998357 A CN113998357 A CN 113998357A
- Authority
- CN
- China
- Prior art keywords
- time
- stacker
- task
- tasks
- space
- 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.)
- Granted
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 double stacker scheduling method and a storage medium for a cigarette factory filter stick warehouse storage system, wherein the method comprises the following steps: determining the latest starting time, prioritizing, sequencing, determining the empty running distance, constructing a space-time model and assigning a task; a space-time model is established through data such as a machine production plan, a machine consumption speed, the use condition of the pilers, the existing task information pool, the equipment running state and the like, the pilers are controlled to run based on the model, the three-dimensional running space of the two pilers in the same track is fully considered, a certain piler is reasonably arranged to execute tasks according to the space-time model, the two piler tasks are not crossed in the space at the same time, the average moving distance, the idle running distance and the task time of the piler tasks are effectively reduced, the flexible and flexible improvement of the operation efficiency of the pilers is realized, the use energy consumption is reduced, and the intelligent degree is improved.
Description
Technical Field
The invention relates to the technical field of filter stick warehouse storage in a cigarette factory, in particular to a double-stacker dispatching method and a storage medium of a filter stick warehouse storage system in a cigarette factory.
Background
The traditional three-dimensional warehousing system generally comprises an information system managed by a computer and a stacker control system managed by a PLC. Typically, the order in which the stacker tasks are executed is in accordance with the order in which the tasks are issued by the computer system. When a warehousing system is applied to a filter rod warehouse in a cigarette factory, two stackers on the same track respectively execute tasks in respective areas, the dispatching of the stackers needs to consider the data of materials required by production of a wrapping machine table, a launching machine table and the like, production beat, time requirement of material requirement, time requirement of material shortage, time requirement of material blockage and the like in the production process, the data are generally transmitted by a computer system through an interface, a control system of the stackers cannot effectively adjust the execution sequence of the tasks, and the condition that the machine table is broken due to the fact that a certain set of tasks are not executed for a long time is easy to occur; in addition, if the production task is greatly increased, the original design capability redundancy cannot meet the requirement, the material breaking condition is often caused, and the production rhythm is influenced. Therefore, it is urgently needed to find a reasonable method for scheduling the stacker so as 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 a filter rod warehouse one-rail double-stacker dispatching method for realizing goods transportation in a reasonable operation time and a material transportation and traveling three-dimensional space for a filter rod warehouse one-rail double-stacker in a cigarette factory.
According to a first aspect, the invention provides a dual stacker scheduling method for a filter rod storage system in a cigarette factory, comprising the following steps:
determining the latest starting time step: determining the latest starting time of each task according to the machine station material breaking time and the stacker movement parameters;
a priority classification step: dividing task priorities according to the latest starting time;
a sorting step: sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue;
determining an empty running distance: determining empty running distances of the pilers under 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 empty running distance of the stacker, wherein the shorter the empty running distance is, the farther the empty running distance is, then constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and if the constructed space-time model meets the selection requirement, selecting the space-time model; 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 idle running distance;
a task assigning step: and based on the selected space-time model, sequentially assigning tasks in the space-time model to a stacker.
Further, the determining the latest start time step includes:
determining the material breaking time of a machine table; the machine station material breaking time comprises a forming machine material breaking time or an emitter 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 material-breaking time, the time required by the stacker to complete the task and the time generated by the task.
Further, the material breaking time TC of the forming machine is CH/CN;
the transmitter material-breaking time TF is FH/FN;
wherein: CH is the number of the filter stick lattices cached after the forming machine applies for tray discharge; CN is the production capacity of the forming machine corresponding to the brand of the work order; FH is the number of the filter stick lattices cached after the transmitter applies for the tray discharge; FN is the sum of the production capacity of cigarette making machines corresponding to all pipelines of the transmitter.
Further, the air conditioner is provided with a fan,
wherein, XiNumber of tubes in use, x, for No. i cigarette-making machinesiThe number of pipelines which are connected from a No. K pipeline of a transmitter in the pipeline in use of the No. i cigarette making machine, NiThe ability of the filter rod to be consumed by a cigarette machine number i.
Further, the time T (T) required by the stacker to complete the task is T1+t；
Wherein: t is1The movement time of the stacker; t is the time of stretching and retracting the fork of the stacker.
Further, when the task moving distance J is larger than or equal to the shortest distance BJ that the stacker accelerates from a standstill to the maximum speed and then reduces to the standstill, the moving time T of the stacker1Is composed of
Wherein s is the maximum running speed of the stacker;
when the task moving distance J is less than the shortest distance BJ between the stacker and the stationary stacker after accelerating from the stationary state to the maximum speed and then reducing to the stationary state, the moving time T of the stacker1Is composed of
Wherein a is the acceleration of the stacker during uniform acceleration motion; and b is the acceleration of the stacker during uniform deceleration movement.
Further, the prioritizing step comprises:
dividing tasks into manual tasks and system tasks; the manual tasks are classified into a manual queue, and the priority is second level;
judging whether the current time exceeds the latest starting time of the current system task, if so, classifying the system task into an emergency queue with the priority level as one level; if not, the queue is classified into a common queue, and the priority is three levels;
the sorting step includes:
respectively sequencing the tasks in the manual queue, the emergency queue and the common queue, and enumerating all sequencing conditions;
and sequencing the manual queue, the emergency queue and the common queue according to the sequence of the first-second-third priority levels to obtain an overall queue, and listing all sequencing conditions of the overall queue.
Further, the task assigning step includes:
sequentially issuing the tasks in the space-time model to a stacker, and if the tasks have matched tasks, issuing the tasks and the matched tasks to the stacker together;
and after all tasks assigned to the stacker begin to be executed, assigning new tasks to the stacker.
Further, after the spatio-temporal model is selected, if new task adding is detected, the step of determining the latest starting time is returned, and if no new task adding is detected, the step of assigning the task is executed.
According to a second aspect, the invention also provides a computer-readable storage medium having stored thereon a computer program executable by a processor for carrying out the steps of the method as described above.
Introduction of the working principle:
the goods shelf area is divided into three areas, in principle, two stackers on the same track are respectively responsible for 1 area and 2 areas, and the 3 areas are cooperatively responsible for the two stackers, so that the two stackers are prevented from colliding, and the car-giving time is reduced (when the two stackers are positioned at the edge of the middle area, the car-giving problem needs to be considered, and at the moment, a subsystem of one of the stackers gives the car according to the existing car-giving mode). When the pilers execute tasks in respective areas, the tasks are sequentially executed according to the sequence of the idle running distance from short to long, so that conflict is avoided, and the working efficiency is greatly improved.
Compared with the prior art, the invention has the beneficial effects that:
(1) according to the double-stacker scheduling method for the filter stick warehouse storage system in the cigarette factory, the space-time model is built through simulating the space and time data of the stackers, the task sequencing queue with the reasonable shortest idle running time is found, the two stacker tasks are not crossed in the space at the same time, the task distribution balance degrees of the two stackers are basically consistent, the composite operation efficiency of the stackers is improved, and the filter stick workshop is ensured not to be blocked and lack.
(2) The average moving distance, the idle running distance and the task time of the stacker task are effectively reduced, the overall operation time is shortened, the material breakage condition in the production process can be reduced, and meanwhile, the reduction of power consumption is facilitated.
Drawings
FIG. 1 is a sectional view of a filter rod bank;
FIG. 2 is a flow chart of a dual stacker scheduling method of a filter rod warehouse storage system in a cigarette factory according to the present invention;
FIG. 3 is a flowchart of a dual stacker scheduling method of a cigarette factory filter rod store system in embodiment 1;
FIG. 4 is a flowchart of spatio-temporal model construction steps in example 1;
fig. 5 is a flowchart of the task assigning step in embodiment 1.
Detailed Description
The present invention will be described in further detail with reference to the following detailed description and accompanying drawings.
A forming machine: when the number of the buffered empty discs is less than a set value, the forming machine sends an empty disc ex-warehouse application to the computer system, the computer system generates an empty disc ex-warehouse task, and the stacker ex-warehouse the empty discs to an upper-layer platform of the forming machine. The forming machine puts the produced filter sticks into an empty tray and conveys the filter sticks to a lower layer platform, when the number of full trays reaches a set number, the forming machine sends full tray warehousing applications to the computer system, the computer system generates full tray warehousing tasks, and the stacker takes the full trays filled with the filter sticks away from the lower layer and warehouses the full trays.
A transmitter: when the number of the cached full discs is less than a set value, the transmitter sends a full disc ex-warehouse application to the computer system, the computer system generates a full disc ex-warehouse task, the stacker ex-warehouse the full discs to an upper platform of the transmitter, the transmitter transmits the filter rods to the cigarette making machine and conveys the empty discs to a lower platform, when the number of the empty discs reaches the set number, the transmitter sends an empty disc in-warehouse application to the computer system, the computer system generates an empty disc in-warehouse task, and the stacker takes the empty discs away from the lower platform for warehousing.
Material breaking time: the amount of buffering set when the forming machine or transmitter requests out-of-bank can support the reproduction time.
The empty running distance: the distance between the current position of the stacker and the start of the task to be executed.
Pairing tasks: the tasks which need to be completed together are that the warehousing application of the same machine is accompanied every time of the ex-warehouse application of the production business of the filter rod warehouse, and the end point column of ex-warehouse and the starting point column of warehousing are listed as the same column.
Example 1
As shown in fig. 1, the shelf area is divided into three areas, namely, 1 area, 2 areas and 3 areas, in principle, two stackers on the same track are responsible for the 1 area, one stacker is responsible for the 2 area, and the 3 areas are cooperatively responsible for the two stackers. The two stackers on the same rail are respectively dispatched according to the double-stacker dispatching method of the filter stick warehouse storage system of the cigarette factory. Specifically, the scheduling method comprises the following steps:
determining the latest starting time step: and determining the latest starting time of each task according to the machine station material breaking time and the stacker movement parameters.
Specifically, firstly, determining the machine material breakage time:
the machine station material breaking time comprises the following steps: material breaking time of a forming machine and material breaking time of an emitter. The material breaking time TC of the forming machine is CH/CN; and the material breaking time TF of the transmitter is FH/FN.
Wherein TC is the material breaking time of the forming machine; CH is the number of the filter stick lattices cached after the forming machine applies for tray discharge; CN is the production capacity of the forming machine corresponding to the brand of the work order; TF is the material-breaking time of the emitter; FH is the number of the filter stick lattices cached after the transmitter applies for the tray discharge; FN is the sum of the production capacity of cigarette making machines corresponding to all pipelines of the transmitter.
The sum FN of the production capacities of the cigarette making machines corresponding to all pipelines of the transmitter is:
wherein, XiNumber of tubes in use, x, for No. i cigarette-making machinesiThe number of pipelines which are connected from a No. K pipeline of a transmitter in the pipeline in use of the No. i cigarette making machine, NiThe ability of the filter rod to be consumed by a cigarette machine number i.
Then determining the time T required by the stacker to complete the task:
T＝T1+t
wherein, T1The movement time of the stacker; t is the time of stretching and retracting the fork of the stacker.
When the task moving distance J is greater than or equal to the shortest distance BJ between the stacker and the stationary stacker after accelerating from the stationary state to the maximum speed and then reducing to the stationary state, the moving time T of the stacker1Is composed of
Wherein s is the maximum running speed of the stacker;
a is the acceleration of the stacker during uniform acceleration movement; b is the stacker making uniform decelerationAcceleration in exercise, J ═ a-B | × d; a is a task starting point column, B is a task ending point column, and d is a cargo space width.
When the task moving distance J is less than the shortest distance BJ between the stacker and the stationary stacker after accelerating from the stationary state to the maximum speed and then reducing to the stationary state, the moving time T of the stacker1Is composed of
And finally, obtaining the latest starting time TZ through the material breaking time TC or TF, the time T required by the stacker to finish the task and the time TS generated by the task:
TZ is TC + TS + T + TT or TZ is TF + TS + T + TT
TT is a short time which is properly advanced to ensure the safe operation of the system.
A priority classification step: and dividing the task priority according to the latest starting time TZ. Namely:
dividing tasks into manual tasks and system tasks; and (4) dividing the manual tasks into manual queues with the priority of two levels. Then judging whether the current time exceeds the latest starting time of the current system task, if so, classifying the system task into an emergency queue with the priority level as one level; if not, the queue is classified into a common queue, and the priority is three levels.
A sorting step: and sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue. Namely:
respectively sequencing the tasks in the manual queue, the emergency queue and the common queue, and enumerating all sequencing conditions; then the manual queue, the emergency queue and the common queue are sequenced according to the sequence of the first level, the second level and the third level of the priority, an integral queue is obtained, and all sequencing conditions of the integral queue are listed in parallel.
Determining an empty running distance: determining empty running distances of the pilers under 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 empty running distance of the stacker, wherein the shorter the empty running distance is, the farther the empty running distance is, then constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and if the constructed space-time model meets the selection requirement, selecting the space-time model; 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 idle running distance.
And after the spatio-temporal model is selected, if new task addition is detected, returning to the step of determining the latest starting time, and if no new task addition is detected, executing the step of task assignment.
A task assigning step: the tasks in the space-time model are assigned to the stacker in sequence, if the tasks are matched, the tasks and the matched tasks are assigned to the stacker together, and after all the tasks to be assigned to the stacker start to be executed, new tasks are assigned to the stacker so as to reduce the time for assigning task interfaces and improve the efficiency.
By adopting the double-stacker dispatching method of the filter stick warehouse storage system of the cigarette factory in the respective areas of the two stackers on the same rail, the purposes of no conflict, less vehicle yield and less idle running are achieved as far as possible, and the working efficiency is greatly improved.
The operational data before and after the application of the dual stacker scheduling method of the filter rod warehouse storage system of the cigarette factory provided in example 1 are compared as shown in the following table. The application provides a double-stacker dispatching method for a cigarette factory filter stick warehouse storage system, which effectively reduces the average moving distance and the task time of the stacker task, thereby reducing the condition of material breakage in the production process, simultaneously reducing the idle running distance, helping to reduce the power consumption and simultaneously shortening the whole operation time.
The present invention has been described in terms of specific examples, which are provided to aid understanding of the invention and are not intended to be limiting. For a person skilled in the art to which the invention pertains, several simple deductions, modifications or substitutions may be made according to the idea of the invention.
Claims (10)
1. A double stacker scheduling method for a filter stick storage system in a cigarette factory is characterized by comprising the following steps:
determining the latest starting time step: determining the latest starting time of each task according to the machine station material breaking time and the stacker movement parameters;
a priority classification step: dividing task priorities according to the latest starting time;
a sorting step: sequencing the tasks according to the task priority to obtain an overall queue, and listing all sequencing conditions of the overall queue;
determining an empty running distance: determining empty running distances of the pilers under 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 empty running distance of the stacker, wherein the shorter the empty running distance is, the farther the empty running distance is, then constructing a space-time model according to the arranged sequence, judging whether the constructed space-time model meets the selection requirement, and if the constructed space-time model meets the selection requirement, selecting the space-time model; 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 idle running distance;
a task assigning step: and based on the selected space-time model, sequentially assigning tasks in the space-time model to a stacker.
2. The method of claim 1, wherein the determining the latest start time step comprises:
determining the material breaking time of a machine table; the machine station material breaking time comprises a forming machine material breaking time or an emitter 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 material-breaking time, the time required by the stacker to complete the task and the time generated by the task.
3. The method of claim 2,
the material breaking time TC of the forming machine is CH/CN;
the transmitter material-breaking time TF is FH/FN;
wherein: CH is the number of the filter stick lattices cached after the forming machine applies for tray discharge; CN is the production capacity of the forming machine corresponding to the brand of the work order; FH is the number of the filter stick lattices cached after the transmitter applies for the tray discharge; FN is the sum of the production capacity of cigarette making machines corresponding to all pipelines of the transmitter.
4. The method of claim 3,
wherein, XiNumber of tubes in use, x, for No. i cigarette-making machinesiThe number of pipelines which are connected from a No. K pipeline of a transmitter in the pipeline in use of the No. i cigarette making machine, NiThe ability of the filter rod to be consumed by a cigarette machine number i.
5. The method of claim 2,
the time T which is required by the stacker to finish the task is T1+t；
Wherein: t is1The movement time of the stacker; t is the time of stretching and retracting the fork of the stacker.
6. The method of claim 5,
when the task moving distance J is greater than or equal to the shortest distance BJ between the stacker and the stationary stacker after accelerating from the stationary state to the maximum speed and then reducing to the stationary state, the moving time T of the stacker1Is composed of
Wherein s is the maximum running speed of the stacker;
when the task moving distance J is less than the shortest distance BJ between the stacker and the stationary stacker after accelerating from the stationary state to the maximum speed and then reducing to the stationary state, the moving time T of the stacker1Is composed of
Wherein a is the acceleration of the stacker during uniform acceleration motion; and b is the acceleration of the stacker during uniform deceleration movement.
7. The method of any of claims 1-6, wherein the prioritizing step comprises:
dividing tasks into manual tasks and system tasks; the manual tasks are classified into a manual queue, and the priority is second level;
judging whether the current time exceeds the latest starting time of the current system task, if so, classifying the system task into an emergency queue with the priority level as one level; if not, the queue is classified into a common queue, and the priority is three levels;
the sorting step includes:
respectively sequencing the tasks in the manual queue, the emergency queue and the common queue, and enumerating all sequencing conditions;
and sequencing the manual queue, the emergency queue and the common queue according to the sequence of the first-second-third priority levels to obtain an overall queue, and listing all sequencing conditions of the overall queue.
8. The method of any of claims 1-6, wherein the task assigning step comprises:
sequentially issuing the tasks in the space-time model to a stacker, and if the tasks have matched tasks, issuing the tasks and the matched tasks to the stacker together;
and after all tasks assigned to the stacker begin to be executed, assigning new tasks to the stacker.
9. The method of any of claims 1-6, wherein after the spatio-temporal model is selected, returning to the step of determining the latest start time if a new task addition is detected, and performing the task assigning step if no new task addition is detected.
10. A computer-readable storage medium, on which a computer program is stored, characterized in that the program is executable by a processor to implement the steps of the method according to any of claims 1-9.
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 true CN113998357A (en) | 2022-02-01 |
| CN113998357B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114529243A (en) * | 2022-02-24 | 2022-05-24 | 龙岩烟草工业有限责任公司 | Article transportation method, apparatus, computer device and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005206272A (en) * | 2004-01-20 | 2005-08-04 | Toyota Industries Corp | Article carrying method and article carrying system |
| 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 |
| US20110276175A1 (en) * | 2008-09-05 | 2011-11-10 | Daifuku Co., Ltd. | Article Storage Facility and Method of Operation Therefor |
| JP2012076891A (en) * | 2010-10-04 | 2012-04-19 | Toppan Printing Co Ltd | Cassette conveyance priority allocating method and cassette conveyance control system |
| CN106406264A (en) * | 2016-11-28 | 2017-02-15 | 龙岩烟草工业有限责任公司 | Piler scheduling method and device |
| CN107161586A (en) * | 2017-06-02 | 2017-09-15 | 浙江中烟工业有限责任公司 | One kind automation filter stick storehouse piler scheduling system |
| CN107235275A (en) * | 2017-06-02 | 2017-10-10 | 浙江中烟工业有限责任公司 | One kind automation filter stick storehouse filter stick storage system |
| CN107480922A (en) * | 2017-07-07 | 2017-12-15 | 西安建筑科技大学 | Both ends formula is unloaded goods bit allocation scheduling model method for building up with the double car operational modes of rail |
| US20180111757A1 (en) * | 2016-10-21 | 2018-04-26 | Daifuku Co., Ltd. | Article Transport Facility |
| CN110428188A (en) * | 2019-08-13 | 2019-11-08 | 厦门烟草工业有限责任公司 | Tobacco flow dispatching method, warehousing system and storage medium |
| CN111846726A (en) * | 2020-07-30 | 2020-10-30 | 重庆惠科金渝光电科技有限公司 | Transportation equipment and carrying method thereof |
| CN112070412A (en) * | 2020-09-15 | 2020-12-11 | 吉林大学 | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse |
| CN112801565A (en) * | 2021-04-14 | 2021-05-14 | 浙江明度智控科技有限公司 | 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 (13)
| 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 |
| US20110276175A1 (en) * | 2008-09-05 | 2011-11-10 | Daifuku Co., Ltd. | Article Storage Facility and Method of Operation Therefor |
| JP2012076891A (en) * | 2010-10-04 | 2012-04-19 | Toppan Printing Co Ltd | Cassette conveyance priority allocating method and cassette conveyance control system |
| US20180111757A1 (en) * | 2016-10-21 | 2018-04-26 | Daifuku Co., Ltd. | Article Transport Facility |
| CN106406264A (en) * | 2016-11-28 | 2017-02-15 | 龙岩烟草工业有限责任公司 | Piler scheduling method and device |
| CN107235275A (en) * | 2017-06-02 | 2017-10-10 | 浙江中烟工业有限责任公司 | One kind automation filter stick storehouse filter stick storage system |
| CN107161586A (en) * | 2017-06-02 | 2017-09-15 | 浙江中烟工业有限责任公司 | One kind automation filter stick storehouse piler scheduling system |
| CN107480922A (en) * | 2017-07-07 | 2017-12-15 | 西安建筑科技大学 | Both ends formula is unloaded goods bit allocation scheduling model method for building up with the double car operational modes of rail |
| CN110428188A (en) * | 2019-08-13 | 2019-11-08 | 厦门烟草工业有限责任公司 | Tobacco flow dispatching method, warehousing system and storage medium |
| CN111846726A (en) * | 2020-07-30 | 2020-10-30 | 重庆惠科金渝光电科技有限公司 | Transportation equipment and carrying method thereof |
| CN112070412A (en) * | 2020-09-15 | 2020-12-11 | 吉林大学 | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse |
| CN112801565A (en) * | 2021-04-14 | 2021-05-14 | 浙江明度智控科技有限公司 | Goods allocation dispatching method, system and storage medium for intelligent storage |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114529243A (en) * | 2022-02-24 | 2022-05-24 | 龙岩烟草工业有限责任公司 | Article transportation method, apparatus, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113998357B (en) | 2023-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113011644B (en) | Smart city dynamic cold-chain logistics scheduling method based on ant colony optimization algorithm | |
| CN105836356B (en) | A kind of intensive warehousing system hybrid optimization dispatching method | |
| CN113222293B (en) | Intelligent stereoscopic warehouse optimal scheduling method | |
| KR102398985B1 (en) | Automated storage and retrieval system and control system thereof | |
| Van Den Berg et al. | Simulation study of an automated storage/retrieval system | |
| CN107480922B (en) | Method for establishing goods position distribution scheduling model under two-end type same-rail double-vehicle running mode | |
| CN109597304B (en) | Intelligent partitioned storage method for mold library based on artificial bee colony algorithm | |
| CN110245890A (en) | Kinds of goods method for sorting and kinds of goods sorting system | |
| Vasili et al. | Automated storage and retrieval systems: a review on travel time models and control policies | |
| CN112875112B (en) | Digital twin-based high-density stereoscopic warehouse storage position allocation and scheduling method | |
| CN110716452A (en) | Dispatching simulation method based on intelligent stereoscopic warehouse of multilayer shuttle | |
| CN103955818A (en) | Task scheduling method of multilayer shuttle vehicle automatic warehousing system | |
| CN103246969B (en) | A kind of implementation method of logistics deployment and device | |
| CN104346658B (en) | System dynamic dispatching method is accessed based on the automatic vehicle for improving banker's algorithm | |
| CN112070412A (en) | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse | |
| CN113998357A (en) | Double-stacker scheduling method and storage medium for cigarette factory filter stick warehouse storage system | |
| CN115557144A (en) | Scheduling method, scheduling system and computer program product for transfer robot | |
| CN112396369A (en) | Method, apparatus, electronic device and computer readable medium for merging containers | |
| CN114611767A (en) | Global optimal intelligent warehousing scheduling optimization algorithm | |
| Boysen et al. | 50 years of warehousing research—An operations research perspective | |
| CN107161586A (en) | One kind automation filter stick storehouse piler scheduling system | |
| CN110134985A (en) | The modeling of Multilayer shuttle car system conveyer buffer storage length and optimization method | |
| CN107235275A (en) | One kind automation filter stick storehouse filter stick storage system | |
| CN111160698A (en) | Multi-layer shuttle system performance evaluation method and device | |
| 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 |
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 |