CN111126857B - Intensive storage task management method and device and electronic equipment - Google Patents

Intensive storage task management method and device and electronic equipment Download PDF

Info

Publication number
CN111126857B
CN111126857B CN201911363236.0A CN201911363236A CN111126857B CN 111126857 B CN111126857 B CN 111126857B CN 201911363236 A CN201911363236 A CN 201911363236A CN 111126857 B CN111126857 B CN 111126857B
Authority
CN
China
Prior art keywords
task
target
supply unit
information
inventory information
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
Application number
CN201911363236.0A
Other languages
Chinese (zh)
Other versions
CN111126857A (en
Inventor
郭瑞
李佳骏
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.)
Beijing Kuangshi Robot Technology Co Ltd
Original Assignee
Beijing Kuangshi Robot Technology Co 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 Beijing Kuangshi Robot Technology Co Ltd filed Critical Beijing Kuangshi Robot Technology Co Ltd
Priority to CN201911363236.0A priority Critical patent/CN111126857B/en
Publication of CN111126857A publication Critical patent/CN111126857A/en
Application granted granted Critical
Publication of CN111126857B publication Critical patent/CN111126857B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G06Q10/0875Itemisation or classification of parts, supplies or services, e.g. bill of materials
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Data Mining & Analysis (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a task management method and device for intensive warehousing and electronic equipment, and relates to the technical field of logistics warehousing, wherein the method comprises the following steps: acquiring orders to be distributed from an order pool of the dense storage; determining new inventory information according to current inventory information of a preset storage area and an executing task in current task information; determining a target distribution relation corresponding to the order according to the order information and the new stock information of the order; and obtaining new task information according to the target distribution relation, the position distribution of the goods supply unit in the new inventory information and the unexecuted task in the current task information. The invention can effectively relieve the task coordination problem in the intensive warehousing operation, thereby improving the operation efficiency.

Description

Intensive storage task management method and device and electronic equipment
Technical Field
The invention relates to the technical field of logistics storage, in particular to a task management method and device for intensive storage and electronic equipment.
Background
As the industries are more and more concerned about the reasonable utilization of land resources, the intensive storage technology is increasingly receiving wide attention. On one hand, each industry requires to improve the space utilization rate and generate greater efficiency in a limited space; on the other hand, various industries are also required to improve the automation rate and meet the requirements with low cost and high efficiency.
The dense storage generally refers to a storage system which realizes the continuous storage of goods on the depth of a shelf by using a special storage and taking mode or a shelf structure and achieves the maximum storage density. In order to save space, dense warehousing often has the inherent characteristic of few operation channels, so that tasks are easy to conflict with each other, and the operation efficiency is low.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a method and an apparatus for task management in dense warehousing, and an electronic device, so as to alleviate the problem of task cooperation in the dense warehousing operation and improve the operation efficiency.
In order to achieve the above purpose, the embodiment of the present invention adopts the following technical solutions:
in a first aspect, an embodiment of the present invention provides a task management method for intensive warehousing, including:
acquiring orders to be distributed from an order pool of the dense storage; the order information of the order comprises a goods identification of the goods and the quantity of the goods;
determining new inventory information according to current inventory information of a preset storage area and an executing task in current task information; wherein, the task with dependency relationship in the current task information is configured with a dependent task identifier; the new inventory information is inventory information obtained by updating on the basis of the current inventory information when the execution of the task is predicted to be finished; the new inventory information comprises position distribution and goods information of the goods supply unit;
determining a target distribution relation corresponding to the order according to the order information and the new stock information; the target distribution relationship is the distribution relationship between the order and a goods supply unit in the preset storage area, and the goods supply unit is used for storing goods;
obtaining new task information according to the target distribution relation, the position distribution of a goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target task comprises an identifier, an initial position and a destination position of a supply unit.
Further, the step of determining new inventory information according to the current inventory information in the preset storage area and the executing task in the current task information includes:
and updating the position distribution of the supply unit and the supply unit in the current inventory information of the preset storage area according to the executing task to obtain new inventory information.
Further, the step of determining the target allocation relationship corresponding to the order according to the order information and the new inventory information includes:
calculating the number of blocking boxes of each supply unit in the preset storage area according to the position distribution of the supply units in the new inventory information; the number of the blocking boxes of the supply unit is the minimum number of the blocking supply units corresponding to the condition that the supply unit is moved out of the preset storage area;
and matching the supply units to the order according to the order information, the number of the blocking boxes of each supply unit and the goods information of each supply unit in the new inventory information to obtain a target distribution relation corresponding to the order.
Further, the step of obtaining new task information according to the target distribution relationship, the location distribution of the supply unit in the new inventory information, and the unexecuted task in the current task information includes:
acquiring an initial target dependency relationship, wherein the initial target dependency relationship comprises a first relationship between a supply unit and a task and a second relationship between a storage position in the preset storage area and the task;
determining each target task to be generated according to the target distribution relation and the unexecuted tasks;
determining the processing sequence of each target task according to a preset rule; the preset rule is related to the dependency relationship among the target tasks;
and obtaining the new task information according to the initial target dependency relationship, each target task, the processing sequence and the position distribution of the supply unit in the new inventory information.
Further, the step of obtaining the new task information according to the initial target dependency relationship, the target tasks, the processing order, and the location distribution of the supply unit in the new inventory information includes:
and sequentially carrying out the following processing on each target task according to the processing sequence:
judging whether the number of unprocessed target tasks is greater than 0;
if yes, the following steps are executed:
according to the ith target task, updating the position distribution of a goods supply unit in first inventory information before the ith target task is executed to obtain second inventory information when the ith target task is expected to be executed;
generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and a target dependent relationship corresponding to the ith target task;
updating a target dependency relationship corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain a target dependency relationship corresponding to the (i + 1) th target task;
adding 1 to the value of i, and updating the number of unprocessed target tasks;
continuing to execute the step of judging whether the number of the unprocessed target tasks is greater than 0; the dependency task identifier corresponding to the ith target task is a task identifier related to the ith target task and contained in the target dependency relationship corresponding to the ith target task, i is an integer greater than or equal to 1, the target dependency relationship corresponding to the 1 st target task is the initial target dependency relationship, and first inventory information before the 1 st target task is executed is the new inventory information;
and if not, determining each obtained target task and the corresponding dependent task identifier thereof as the new task information.
Furthermore, the ith target task corresponds to a target supply unit;
the step of generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and the target dependent relationship corresponding to the ith target task includes:
according to the first inventory information and the second inventory information, calculating to obtain a first dependent supply unit corresponding to the ith target task; the first dependent supply unit is a supply unit which is not influenced by movement in a first storage area where the target supply unit is located in the preset storage area before the target supply unit is placed in the target position of the target supply unit, but is influenced by movement in the first storage area after the target supply unit is placed in the target position of the target supply unit;
searching the target supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a first task identifier corresponding to the target supply unit;
searching the first dependent supply unit in a first relation in the target dependency relations corresponding to the ith target task to obtain a second task identifier corresponding to the first dependent supply unit;
searching a target position of the target supply unit in a second relation in the target dependency relation corresponding to the ith target task to obtain a third task identifier corresponding to the target position of the target supply unit;
and determining the first task identifier, the second task identifier and the third task identifier as dependent task identifiers corresponding to the ith target task.
Further, the step of obtaining a first dependent supply unit corresponding to the ith target task by calculation according to the first inventory information and the second inventory information includes:
judging whether the target position of the target supply unit is located in the preset storage area;
if so, acquiring a first supply unit of a first-layer placeholder layer in the first storage area according to the position distribution of the supply unit in the first inventory information; the first layer of occupying layer comprises a position which is provided with a supply unit, and the number of blocking boxes of the supply unit is 0;
acquiring a second supply unit of a second layer of occupying layer positioned in the first storage area according to the position distribution of the supply unit in the second inventory information; the second-layer occupying layer comprises positions which are provided with supply units, and the number of blocking boxes of the supply units is 1;
obtaining a first intersection of the first supply unit and the second supply unit;
and determining a sourcing unit in the first collection as a first dependent sourcing unit corresponding to the ith target task.
Furthermore, the ith target task corresponds to a target supply unit;
the step of updating the target dependency corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain a target dependency corresponding to the (i + 1) th target task includes:
calculating to obtain a second dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information; the second dependent supply unit is a supply unit which is not influenced by movement in a second storage area where the initial position of the target supply unit is located in the preset storage area before the target supply unit is moved out of the initial position of the target supply unit, but is not influenced by movement after the target supply unit is moved out of the initial position of the target supply unit;
adding the dependency relationship between the target supply unit and the ith target task and the dependency relationship between the second dependency supply unit and the ith target task in a first relationship in the target dependency relationship corresponding to the ith target task to obtain an updated first relationship;
adding the dependency relationship between the initial position of the target supply unit and the ith target task in a second relationship in the target dependency relationship corresponding to the ith target task to obtain an updated second relationship;
and determining the updated first relation and second relation as a target dependency relation corresponding to the (i + 1) th target task.
Further, the step of calculating a second dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information includes:
judging whether the initial position of the target supply unit is located in the preset storage area or not;
if so, acquiring a third supply unit of a second-layer placeholder layer in the second storage area according to the position distribution of the supply unit in the first inventory information;
acquiring a fourth supply unit of the first layer of the occupying layer in the second storage area according to the position distribution of the supply unit in the second inventory information;
obtaining a second intersection of the third supply unit and the fourth supply unit;
and determining the supply unit in the second collection as a second dependent supply unit corresponding to the ith target task.
In a second aspect, an embodiment of the present invention further provides a task management device for dense warehousing, including:
the order acquisition module is used for acquiring orders to be distributed from the order pool of the dense storage; the order information of the order comprises a goods identification of the goods and the quantity of the goods;
the inventory determining module is used for determining new inventory information according to the current inventory information of the preset storage area and the executing task in the current task information; wherein, the task with dependency relationship in the current task information is configured with a dependent task identifier; the new inventory information is inventory information obtained by updating on the basis of the current inventory information when the task in execution is predicted to be executed; the new inventory information comprises position distribution and goods information of the goods supply unit;
the distribution determining module is used for determining a target distribution relation corresponding to the order according to the order information and the new stock information; the target distribution relationship is a distribution relationship between the orders and a goods supply unit in the preset storage area, and the goods supply unit is used for warehousing goods;
the task updating module is used for obtaining new task information according to the target distribution relation, the position distribution of the goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target task comprises an identifier, an initial position and a destination position of a supply unit.
In a third aspect, an embodiment of the present invention provides an electronic device, including: a processor and a storage device; the storage device has stored thereon a computer program which, when executed by the processor, performs the method of any one of the preceding aspects.
In a fourth aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, performs the steps of the method according to any one of the above-mentioned first aspect.
After an order to be distributed is obtained from an order pool of the intensive storage, determining new inventory information according to current inventory information of a preset storage area and an executing task in the current task information, wherein a dependent task identifier is configured for a task with a dependent relationship in the current task information; when the new inventory information is predicted to finish the task in execution, the inventory information is updated on the basis of the current inventory information; the new inventory information comprises the position distribution and the goods information of the goods supply unit; then according to the order information and the new stock information of the order, determining a target distribution relation corresponding to the order; the target distribution relation is the distribution relation between the order and a goods supply unit in a preset storage area, and the goods supply unit is used for storing goods; further, new task information is obtained according to the target distribution relation, the position distribution of the goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target tasks comprise identifiers of the supply units, initial positions and target positions. When the task information is updated by acquiring a new order, the method takes the dependency relationship among the tasks into consideration, so that the task cooperation problem in intensive warehousing operation can be effectively relieved, and the operation efficiency is improved.
Additional features and advantages of embodiments of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of embodiments of the invention as set forth above.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic diagram of a dense warehousing system according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for task management of dense warehousing according to an embodiment of the present invention;
FIG. 4 is a schematic diagram illustrating a hierarchical computation process provided by an embodiment of the present invention;
FIG. 5 is a diagram illustrating an update process of a target dependency provided by an embodiment of the present invention;
FIG. 6 is a flow chart of another method for task management of dense warehousing provided by an embodiment of the present invention;
fig. 7 is a block diagram illustrating a structure of a task management device for dense warehousing according to an embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the present invention will be described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some, not all embodiments of the present invention.
The drive-in type dense warehouse is a goods shelf in which a forklift or an AGV (Automated Guided Vehicle) enters the goods shelf to perform goods storage and taking operation, and a running channel of the forklift or the AGV is a storage space of goods. The drive-in type dense storage is the most widely used dense storage shelf at present, has low cost, simple structure and low maintenance cost, and can realize high storage rate.
Referring to fig. 1, a schematic diagram of a dense warehouse system is shown, as shown in fig. 1, the dense warehouse system includes: the system comprises a site and a preset storage area, wherein the preset storage area comprises a plurality of positions for placing supply units. The station is generally a picking station, and the picking station is a place where a worker or a robot takes goods from a supply unit according to the requirement of an order, wherein the order is a request form for requiring the worker or the robot to take and package a plurality of goods from the inventory of the supply unit corresponding to the station. The supply units in the predetermined storage area are generally shelves or boxes for storing goods, and one station corresponds to the supply units at a plurality of positions. All there is tunnel (operation passageway) between presetting the storage area and presetting storage area and website, and the tunnel is the passageway that is used for transporting the haulage equipment (like fork truck or AGV) of supplying a material unit and passes, and wherein haulage equipment can dig into the unit below of supplying a material, lifts the unit of supplying a material off the ground, then the unit removal of supplying a material of transport.
For the above-mentioned dense warehousing system, the process of maintaining the task pool of the dense warehousing system in the prior art is generally as follows: when a new order enters the order pool of the dense warehousing system, firstly, a new order-supply unit distribution relation is determined, then a new task and task information corresponding to the new task are generated according to the new order-supply unit distribution relation, and the new task and the task information are added into the task pool. The inventor finds that in the mode, no dependency exists between tasks, namely the execution result of the previous task does not influence the execution of the next task. Because the dense warehousing system has the inherent characteristic of few operation channels, the mode easily causes conflict and disorder among tasks, and further causes lower operation efficiency.
In view of the problems of task coordination and operation efficiency of intensive warehousing in the prior art, embodiments of the present invention provide a method, an apparatus, and an electronic device for task management of intensive warehousing, where the technology may be applied to drive-in intensive warehousing, and may also be applied to other types of intensive warehousing where conflicts and disorders between tasks easily occur. It should be noted that the supply units in the preset storage area in fig. 1 are arranged in the form of 5 × 5, but the scope of the present invention is not limited thereto, and the supply units may also be arranged in the form of 4 × 4, 5 × 4, or 6 × 6. The following describes embodiments of the present invention in detail.
The first embodiment is as follows:
first, an example electronic device 100 for implementing a method and an apparatus for task management of dense warehousing according to an embodiment of the present invention is described with reference to fig. 2.
As shown in fig. 2, an electronic device 100 includes one or more processors 102, one or more memory devices 104, an input device 106, an output device 108, and an image capture device 110, which are interconnected via a bus system 112 and/or other type of connection mechanism (not shown). It should be noted that the components and structure of the electronic device 100 shown in fig. 2 are only exemplary and not limiting, and the electronic device may have some of the components shown in fig. 2 and may have other components and structures not shown in fig. 2 as needed.
The processor 102 may be implemented in at least one hardware form of a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), the processor 102 may be one or a combination of several of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), or other forms of processing units having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device 100 to perform desired functions.
The storage 104 may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, Random Access Memory (RAM), cache memory (cache), and/or the like. The non-volatile memory may include, for example, Read Only Memory (ROM), hard disk, flash memory, etc. On which one or more computer program instructions may be stored that may be executed by processor 102 to implement client-side functionality (implemented by the processor) and/or other desired functionality in embodiments of the invention described below. Various applications and various data, such as various data used and/or generated by the applications, may also be stored in the computer-readable storage medium.
The input device 106 may be a device used by a user to input instructions and may include one or more of a keyboard, a mouse, a microphone, a touch screen, and the like.
The output device 108 may output various information (e.g., text, images, or sounds) to the outside (e.g., a user), and may include one or more of a display, a speaker, and the like.
The image capture device 110 may capture images (e.g., photographs, videos, etc.) desired by the user and store the captured images in the storage device 104 for use by other components.
Exemplarily, an exemplary electronic device for implementing the task management method for dense warehousing according to an embodiment of the present invention may be implemented as an intelligent terminal such as a smartphone, a tablet computer, a computer, or the like.
The second embodiment:
referring to the flowchart of a task management method for intensive warehousing shown in fig. 3, the method mainly includes the following steps S302 to S308:
step S302, orders to be distributed are obtained from the order pool of the intensive warehouse.
The order to be distributed can be one or a plurality of orders; the order information of the order may include a goods identification of the goods and a quantity of the goods, the goods identification indicating a kind of the goods. The goods identification may be a uniform number of goods, for example, the goods identification is a SKU (Stock Keeping Unit) number. For a kind of goods, when any one of the attributes such as brand, model, configuration, grade, flower color, packaging capacity, unit, production date, quality guarantee period, usage, price, production place and the like is different from other goods, the goods can be called as a single goods; each individual product corresponds to a unique SKU number.
An order may include different types and quantities of goods, such as: an order may include 2 boxes of 500ml cups of brand a, 2 boxes of 1000ml cups of brand a, and 3 boxes of 1000ml cups of brand B, the order being 3 in type and 2+2+3 in number of 7.
Step S304, determining new inventory information according to the current inventory information of the preset storage area and the executing task in the current task information; tasks with dependency relationships in the current task information are configured with dependency task identifiers; the new inventory information is the inventory information obtained by updating on the basis of the current inventory information when the task in execution is expected to be executed; the new inventory information includes location distribution of the supply units and cargo information.
The preset storage area may be one or multiple. The inventory information of the preset storage area may include position distribution and cargo information of the supply unit in the preset storage area, and may also include a distance from the supply unit to a corresponding site, and the like, wherein the cargo information of the supply unit includes cargo identifiers and a quantity corresponding to the cargo identifiers. One supply unit can stock one kind of goods, and also can stock multiple kinds of goods, that is, the goods information of one supply unit can include one or more goods identifications.
Each task within the current task information is stored in a task pool, and the current task information may be stored in the form of a list. The current task information includes a task in execution and a task not in execution, each task (task in execution or task not in execution) in the current task information includes an identifier (such as shelf ID (identity) of a supply unit, an initial position and a destination position, and the current task information may further include a task identifier (such as task ID) corresponding to each task, an execution state (the execution state of the task not in execution is not started, the execution state of the task in execution is in execution), an execution time and an update time (the task not updated, the update time of which is empty), and the like; in addition, for the task with the dependency relationship, the current task information also includes a dependent task identifier corresponding to the task. The dependency relationship means that the execution of two tasks has mutual influence, for example, if the task a can be executed smoothly only after the task B starts to be executed, or in order not to influence the smooth execution of the task C, the task a needs to be executed after the task C starts to be executed, and then the dependency relationship exists between the task a and the task B, and between the task a and the task C.
Step S306, determining a target distribution relation corresponding to the order according to the order information and the new stock information of the order; the target distribution relation is the distribution relation between the order and the supply unit in the preset storage area.
The order information of one order can include a plurality of goods identifications, the quantity corresponding to each goods identification can be more than one, the goods information of each goods supply unit in the preset storage area can also include a plurality of goods identifications, and the quantity corresponding to each goods identification can also be more than one, so that the order and the goods supply unit need to be matched, and the matched goods supply unit can meet all goods requirements in the order. It should be noted that one order may be matched to one or more supply units, and that multiple orders may be matched to the same supply unit.
Step S308, new task information is obtained according to the target distribution relation, the position distribution of the goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target tasks comprise identifiers of the supply units, initial positions and target positions.
The new task information can be obtained by updating the task in the current task information and the dependent task identifier and other related information (such as the task identifier, the execution state, the execution time and the like) corresponding to the task according to the target distribution relationship, the position distribution of the supply unit in the new inventory information and the unexecuted task in the current task information, and the new task information can be stored in a list form. Specifically, both a supply unit related to the target allocation relationship and a supply unit related to the unexecuted task can be used as task targets, and one task target corresponds to one target task in the new task information; and for the supply unit related in the target allocation relationship, when the task in the current task information is updated, a corresponding target task is newly generated, namely, a target task corresponding to the order is newly generated. For example, if three sourcing units are involved in the target allocation relationship, three target tasks corresponding to the three sourcing units one by one are newly generated.
When the dependent task identifiers corresponding to the tasks are updated, overall calculation is carried out on all the target tasks, and the dependency relationship among all the target tasks based on the new stock information is considered during the overall calculation. For a target task with a dependency relationship, a dependency task identifier is corresponding to the target task; and for the target task without the dependency relationship, the corresponding dependency task identifier is null. The dependency task identification can be divided into two types, namely an origin-dependent task ID and a destination-dependent task ID, wherein the origin-dependent task ID aims at a source dependency task for placing a supply unit in a preset storage area, the destination-dependent task ID aims at a target dependency task for removing the supply unit from the preset storage area, and the destination-dependent task ID is at least one; if a task is to move a supplier unit from one preset storage area to another preset storage area, the task includes both an origin-dependent task ID and a destination-dependent task ID. The source dependent task described above can be understood as: when the supply unit of the target task starts from the initial position, the source-dependent task starts to be executed, so that the source-dependent task can be ensured not to block the smooth execution of the target task, for example, the supply unit of the source-dependent task can not block the passage of the supply unit of the target task; the target dependent task can be understood as: before the supply unit of the target task reaches the destination position, the target dependent task has already completed the stage task at the destination position, for example, the carrying device carrying out the target dependent task has carried the corresponding supply unit from the destination position, so as to ensure that the target task does not obstruct the smooth execution of the target dependent task, that is, the supply unit of the target task does not block the passage of the supply unit of the target dependent task when reaching the destination position.
After the new task information is obtained, all the unexecuted tasks in the task pool can be deleted, the target tasks in the new task information are added into the task pool, and then the orders are moved out of the order pool.
Additionally, it should be noted that an order may correspond to one or more target tasks, as an order may be matched to one or more sourcing units.
According to the task management method for intensive warehousing, when a new order is obtained and task information is updated, new inventory information is determined based on an executing task in current task information, then a target distribution relation corresponding to the order is determined based on the new inventory information, and finally new task information is obtained based on the target distribution relation, position distribution of a supply unit in the new inventory information and an unexecuted task.
For ease of understanding, the present embodiment provides an implementation manner of the step S304, which is as follows: and updating the position distribution of the supply unit and the supply unit in the current inventory information of the preset storage area according to the task in execution to obtain new inventory information.
The task in execution comprises the identification, the initial position and the destination position of the supply unit. And adding the target position of the supply unit corresponding to the task in execution of the preset storage area into the new inventory information of the preset storage area, and determining the target position as the position of the supply unit in the new inventory information. In addition, the supply unit corresponding to the task in the execution of which the initial position is positioned in the preset storage area is deleted from the current inventory information of the preset storage area. This enables the updating of inventory information.
For ease of understanding, the present embodiment provides an implementation manner of the step S306, which is specifically shown as the following step 2.1 and step 2.2:
and 2.1, calculating the number of the blocking boxes of each supply unit in the preset storage area according to the position distribution of the supply units in the new inventory information.
The number of the blocking boxes of the supply unit is the minimum number of the corresponding supply blocking units when the supply unit is moved out of the preset storage area.
In one possible implementation, the number of hamper boxes of the supplier unit can be calculated by the following process: determining the number of layers of an occupying layer to which each supply unit belongs in a preset storage area according to the position distribution of the supply units in the new inventory information; and determining the difference obtained by subtracting 1 from the layer number of the occupying layer to which each supply unit belongs as the number of the blocking boxes of the supply unit. The preset storage area can be regarded as comprising a plurality of vacant layers and a plurality of occupied layers, the first occupied layer is composed of occupied positions adjacent to the vacant positions of the first vacant layers or adjacent to a roadway, the first vacant layer is composed of vacant positions adjacent to the roadway and vacant positions communicated with the vacant positions, the roadway is a channel around the preset storage area for conveying equipment for conveying a supply unit to pass through, the vacant positions are positions where the supply unit is not placed, and the occupied positions are positions where the supply unit is placed; the Nth layer of occupation layer is composed of occupation positions adjacent to the Nth layer of vacant layer, the Nth layer of vacant layer is composed of vacant positions adjacent to the (N-1) th layer of occupation layer and vacant positions communicated with the vacant positions, and N is a natural number larger than 1. The first layer of occupying layer represents that the number of layers of occupying layer is 1, the Nth layer of occupying layer represents that the number of layers of occupying layer is N, the first layer of vacant layer represents that the number of layers of vacant layer is 1, and the Nth layer of vacant layer represents that the number of layers of vacant layer is N.
Optionally, when the number of layers of the placeholder layer to which each supply unit belongs in the preset storage area is determined, the positions in the preset storage area may be hierarchically calculated according to the position distribution of the supply units in the new inventory information and from outside to inside, so as to obtain a plurality of vacant layers and a plurality of placeholder layers, and then the number of layers of the placeholder layer to which each supply unit belongs is found from the plurality of placeholder layers.
The following describes in detail the process of performing hierarchical computation on each position in the preset storage area according to the sequence from outside to inside to obtain a plurality of free layers and a plurality of placeholder layers:
obtaining all positions of a first layer of vacant layer by obtaining vacant positions adjacent to the roadway and vacant positions communicated with the vacant positions;
acquiring all positions of the first layer of occupied layer by acquiring occupied positions adjacent to the vacant positions of the first layer of vacant layer or adjacent to the roadway;
obtaining all positions of the N-1 th layer of vacant layer by obtaining vacant positions adjacent to the positions of the N-1 th layer of occupied layer and vacant positions communicated with the vacant positions;
all positions of the N-th layer of occupied layer are obtained by obtaining occupied positions adjacent to the N-th layer of empty layer.
It should be noted that the preset storage area described in this embodiment includes a plurality of free layers and a plurality of placeholders, which are only logical concepts and do not represent actual occupation of each location in the preset storage area. The number of free positions in the free layer and the number of occupied positions in the occupied layer can represent the actual occupation situation of the positions in the preset storage area. Specifically, when the number of the vacant positions included in a certain layer of the vacant layer is 0, it indicates that the layer of the vacant layer does not actually exist in the preset storage area, and when the number of the occupied positions included in a certain layer of the occupied layer is 0, it indicates that the occupied layer does not actually exist in the preset storage area.
That is, the number of the vacant positions included in each of the vacant layers in the preset storage area may be at least one, and may also be 0 (that is, the vacant positions included are vacant). When the number of the vacant positions included in a certain layer of the vacant layer is 0, it indicates that the layer of the vacant layer does not exist in the preset storage area in fact. For example, when the preset storage area is fully occupied (all positions of the preset storage area are occupied positions), the number of the vacant positions included in each layer is 0, that is, there is no vacant layer in the preset storage area.
The number of the placeholder locations included in each placeholder layer in the preset storage area may be at least one, and may also be 0. For example, when a supply unit is not yet placed in the preset storage, all locations of the preset storage area are vacant locations, the preset storage area only has a first layer vacant layer and a first layer occupied layer, the vacant locations included in the first layer vacant layer are all locations of the preset storage area, the number of occupied locations included in the first layer occupied layer is 0, and that is, there is no occupied layer in the storage area.
In this embodiment, the preset storage areas are not layered in the vertical height, which can be understood as only one layer in the vertical height; layering here refers to layering in the horizontal plane according to whether a sourcing unit is obstructed by other sourcing units and the number of obstructing sourcing units. Optionally, this embodiment further provides an implementation process on a computer program of the hierarchical computation, as follows:
first, initialization parameters are set: the number of the remaining positions is the total number of the positions of the preset storage area, and the number of layers of all the positions in the preset storage area is a preset value. Wherein the preset value is an integer value smaller than 1, for example, the preset value is-1. The position where the number of layers is a preset value indicates a position where the layering calculation is not performed, that is, a remaining position.
Then, the following processing is carried out on each position in the preset storage area according to the sequence from outside to inside:
judging whether the number of the remaining positions is greater than 0;
if the number of remaining positions is greater than 0, performing the steps of:
s1, setting the layer mark of the nth layer as a vacant layer mark, determining the initial position of the nth layer according to each position of the (n-1) th layer, obtaining all positions of the nth layer vacant layer by obtaining vacant positions communicated with the initial position of the nth layer, and updating the number of the residual positions, wherein the initial position of the nth layer is a vacant position (when n is larger than 1) adjacent to each position of the (n-1) th layer or a vacant position (when n is equal to 1) adjacent to a roadway, and n is an integer larger than or equal to 1; obtaining an nth layer of spare layer;
s2, replacing the layer mark of the nth layer with the placeholder layer mark; all positions of the nth layer of occupied layer are obtained by obtaining occupied positions adjacent to the vacant positions of the nth layer of vacant layer or adjacent to the roadway, and the number of the rest positions is updated; at the moment, an nth layer of occupying layer is obtained;
s3, if the number of the updated remaining positions is larger than 0, adding 1 to the value of n, and continuing to execute S1 and S2;
until the number of the remaining positions which do not participate in the hierarchical calculation in the preset storage area is 0;
and if the number of the residual positions is equal to 0, outputting the currently calculated vacant layers and occupied layers.
Optionally, a breadth-first search method may be adopted when the above-mentioned obtaining of the free position communicated with the initial position of the current layer is performed.
For convenience of understanding, the present embodiment provides a schematic process diagram of hierarchical computation as shown in fig. 4, where the shaded position represents an empty position, the other positions represent occupancy positions, the position labeled 1 represents belonging to a first-layer occupancy layer (the number of layers of the position is 1), and the position labeled 2 represents belonging to a second-layer occupancy layer (the number of layers of the position is 2). As shown in fig. 4, first, a first layer of free layer is calculated, and a free position (a position indicated by a dotted arrow in fig. 4) with row and column coordinates (4, 5) is obtained; then, calculating a first layer of space occupying layer to obtain each position marked as 1; then, calculating a second layer of vacant layer to obtain a vacant position (the position indicated by the dotted arrow in fig. 4) with row and column coordinates (3, 4); and finally, calculating a second layer of occupation layer to obtain each position marked as 2, and finishing the layered calculation.
And 2.2, matching the supply units according to the order information, the number of the blocked boxes of each supply unit and the goods information of each supply unit in the new inventory information to obtain a target distribution relation corresponding to the order.
Optionally, as shown in fig. 1, the dense warehousing system applied by the method includes sites, and each site corresponds to a supply unit at a plurality of positions in a preset storage area. When the step 2.2 is executed, a target site can be selected according to the order information and the supply unit information corresponding to each site, wherein the supply unit information corresponding to the site comprises the identification, the number of the blocking boxes, the cargo information and the distance from each supply unit to the site; and then selecting a target supply unit matched with the order from the supply units corresponding to the target site.
The target station should satisfy the order information of the order (that is, the target station can satisfy all goods requirements of the order), and the target station with smaller number of the blocking boxes and shorter distance is better; typically one order corresponds to one destination site. When matching the target supply unit for the order, the matching degree of the goods information of the supply unit and the order information of the order, the number of the blocking boxes of the supply unit and the distance from the supply unit to the station can be considered, and obviously, a supply unit with a higher matching degree, a smaller number of the blocking boxes and a shorter distance is preferred.
For ease of understanding, the present embodiment provides an implementation manner of the step S308, specifically as shown in the following step 3.1 to step 3.4:
and 3.1, initializing a target dependency relationship, wherein the target dependency relationship comprises a first relationship between a supply unit and a task and a second relationship between a storage position in a preset storage area and the task.
The initial target dependency is a target dependency obtained by updating when the execution of the task is expected to be completed, and the specific updating process may refer to the following related contents. Both the first relationship and the second relationship may be stored in a table form.
And 3.2, determining each target task to be generated according to the target distribution relation and the unexecuted tasks.
The target task corresponds to a supply unit to be moved, and comprises an identifier, an initial position and a target position of the supply unit. The target distribution relationship is the distribution relationship between the order and the supply units, the supply units involved in the target distribution relationship are all supply units to be moved, each supply unit to be moved corresponds to one target task, the initial position of the supply unit in the target task is usually the current position of the supply unit, and the target position of the supply unit is usually the site corresponding to the supply unit. The supply units involved in the task not to be executed are all supply units to be moved, and each supply unit to be moved also corresponds to one target task. And merging the target tasks corresponding to the target distribution relation and the target tasks corresponding to the execution tasks to obtain all target tasks to be generated.
Step 3.3, determining the processing sequence of each target task according to a preset rule; the preset rules are related to the dependency relationship between the target tasks.
For the box-transporting task of transporting the target supply units in the preset storage area to the site or the non-storage area, because there are many target supply units in the preset storage area, there may be a dependency relationship between the target supply units, that is, there may be a dependency relationship between the box-transporting tasks, and therefore a reasonable processing sequence needs to be arranged for the corresponding box-transporting tasks. For example, the supply unit a is located on the conveying path of the supply unit B, and the supply unit a needs to be moved first to move the supply unit B, that is, there is a dependency relationship between the box conveying task a corresponding to the supply unit a and the box conveying task B corresponding to the supply unit B, and it is necessary to execute the box conveying task a first and then execute the box conveying task B. Similarly, for the box returning task of transporting the target supply unit of the site or the non-storage area to the preset storage area, because there may be a dependency relationship between the destination positions of the target supply units in the preset storage area, that is, there may be a dependency relationship between the box returning tasks, it is also necessary to arrange a reasonable processing sequence for the corresponding box returning task.
And 3.4, obtaining new task information according to the initial target dependency relationship, each target task, the processing sequence and the position distribution of the goods supply unit in the new inventory information.
Alternatively, the step 3.4 can be realized by the following process:
and sequentially carrying out the following processing on each target task according to the processing sequence:
setting the number of unprocessed target tasks as the total number of each target task;
judging whether the number of unprocessed target tasks is larger than 0 or not;
if yes, the following steps are executed:
updating the position distribution of a goods supply unit in the first stock information before the ith target task is executed according to the ith target task to obtain second stock information when the ith target task is expected to be executed;
generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and the target dependent relationship corresponding to the ith target task;
updating a target dependency relationship corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain a target dependency relationship corresponding to the (i + 1) th target task;
adding 1 to the value of i, and updating the number of unprocessed target tasks;
continuously executing the step of judging whether the number of the unprocessed target tasks is greater than 0; wherein, the dependency task identifier corresponding to the ith target task is a task identifier related to the ith target task and contained in the target dependency relationship corresponding to the ith target task, i is an integer greater than or equal to 1, the target dependency relationship corresponding to the 1 st target task is the initial target dependency relationship, and the first inventory information before the 1 st target task is executed is the new inventory information;
and if not, determining each obtained target task and the corresponding dependent task identifier as new task information.
The preset storage areas can be one or more, the target tasks can be divided into three types according to the initial position and the target position in the target tasks, in the first type of target tasks, the initial position is located in the preset storage area, but the target position is not located in the preset storage area, namely the target tasks are to transport the supply units in the preset storage area to a non-storage area or a station; in the second type of target task, the initial position is not in the preset storage area, but the target position is in the preset storage area, that is, the target task is to transport a supply unit of a non-storage area or a station to the preset storage area; in the third type of target task, the initial position and the destination position are both located in a preset storage area, for example, the preset storage area includes a storage area 1 and a storage area 2, and the target task is to transport a supply unit in the storage area 1 to the storage area 2. The following respectively introduces the process of generating the dependent task identifier corresponding to the target task for these three types of target tasks.
For the first type of target tasks, because the initial position is located in the preset storage area, but the destination position is not located in the preset storage area, the dependent task identifier corresponding to the target task only includes the task ID dependent on the departure place, and the task ID dependent on the destination is empty. Based on this, according to the first inventory information, the second inventory information, the ith target task and the target dependency corresponding to the ith target task, a process of generating a dependent task identifier corresponding to the ith target task may be as follows, where for convenience of description, the target supply unit corresponding to the ith target task is noted: searching a target supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a first task identifier corresponding to the target supply unit; determining the first task identifier as a dependent task identifier corresponding to the ith target task; wherein the first task identification is a task ID of the origin dependency.
For the second type of target task, because the initial position is not in the preset storage area, but the target position is in the preset storage area, the dependent task identifier corresponding to the target task only includes the task ID dependent on the destination, and the task ID dependent on the origin is empty. Based on this, according to the first inventory information, the second inventory information, the ith target task and the target dependency relationship corresponding to the ith target task, a process of generating a dependent task identifier corresponding to the ith target task may be as follows, where for convenience of description, the ith target task is recorded as a target supply unit corresponding to the target supply unit, and a destination position of the target supply unit is located in a first storage area of the preset storage area: firstly, calculating to obtain a first dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information; the first dependent supply unit is a supply unit which is not influenced by movement in the first storage area before the target supply unit is placed in the target position of the target supply unit, but is influenced by movement in the first storage area after the target supply unit is placed in the target position of the target supply unit; then, searching a first dependent supply unit in a first relation in the target dependency relations corresponding to the ith target task to obtain a second task identifier corresponding to the first dependent supply unit; searching the target position of the target supply unit in a second relation in the target dependency relation corresponding to the ith target task to obtain a third task identifier corresponding to the target position of the target supply unit; finally, determining the second task identifier and the third task identifier as dependent task identifiers (task ID groups depended by destinations) corresponding to the ith target task; and the second task identifier and the third task identifier are both task IDs depended on by destinations.
For the third type of target task, because the initial position and the destination position are both located in the preset storage area, the dependent task identifier corresponding to the target task includes a task ID dependent on the departure place and a task ID dependent on the destination. Based on this, according to the first inventory information, the second inventory information, the ith target task, and the target dependency relationship corresponding to the ith target task, a process of generating a dependent task identifier corresponding to the ith target task may be as follows, where for convenience of description, the target goods supply unit corresponding to the ith target task is described as follows: firstly, calculating to obtain a first dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information; then, searching a target supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a first task identifier (task ID of origin dependency) corresponding to the target supply unit; then, searching a first dependent supply unit in a first relation in target dependency relations corresponding to the ith target task to obtain a second task identifier (task ID of destination dependence) corresponding to the first dependent supply unit; searching a target position of the target supply unit in a second relation in the target dependency relation corresponding to the ith target task to obtain a third task identifier (task ID depended by the destination) corresponding to the target position of the target supply unit; and finally, determining the first task identifier, the second task identifier and the third task identifier as the dependent task identifier corresponding to the ith target task.
It should be noted that, in this embodiment, when the destination location is not in the preset storage area, the steps of calculating the first dependent supply unit, finding the first dependent supply unit in the first relationship, finding the destination location in the second relationship, and the like are not executed, but the scope of the present invention is not limited thereto.
In a possible implementation manner, the process of calculating the first dependent sourcing unit may be as follows, where the ith target task corresponds to the target sourcing unit:
a1. judging whether the target position of the target supply unit is located in a preset storage area;
a2. if so, acquiring a first supply unit of a first-layer placeholder layer in the first storage area according to the position distribution of the supply unit in the first inventory information; the first layer of occupying layer comprises positions which are provided with a supply unit, and the number of blocking boxes of the supply unit is 0; the first storage area is a storage area where the destination position of the target supply unit in the preset storage area is located;
a3. acquiring a second supply unit of a second layer of occupation layer positioned in the first storage area according to the position distribution of the supply unit in the second inventory information; the second layer of occupying layer comprises positions which are provided with supply units, and the number of blocking boxes of the supply units is 1;
a4. obtaining a first intersection of the first supply unit and the second supply unit;
a5. and determining the supply unit in the first intersection as a first dependent supply unit corresponding to the ith target task.
And if the destination position of the target supply unit is not in the preset storage area, directly determining that the first dependent supply unit is empty. The manner in which the first dependent sourcing unit is calculated utilizes the following principle: in the first storage area, the supply unit located at the outermost layer (the first-layer occupying layer) before the ith target task is executed is located at the second outermost layer (the second-layer occupying layer) when the ith target task is expected to be executed, so that the supply unit is changed from a state of not being influenced by movement to a state of being influenced by movement by the execution of the ith target task, that is, the supply unit belongs to the first supply-dependent unit. After the first relying supply unit is determined in this way, the subsequent acquisition of the second task identifier is facilitated.
For the sake of understanding, the following describes the update process of the target dependency relationship in detail for the above three types of target tasks, respectively.
For the first type of target task and the third type of target task, because the initial position is located in the preset storage area, the second relationship in the target dependency relationship corresponding to the ith target task needs to be updated. Based on this, according to the first inventory information, the second inventory information and the ith target task, the target dependency corresponding to the ith target task is updated, and a process of obtaining the target dependency corresponding to the (i + 1) th target task may be as follows, wherein, for convenience of description, the ith target task is recorded to correspond to the target supply unit, and the initial position of the target supply unit is located in the second storage area in the preset storage area: firstly, calculating to obtain a second dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information; the second dependent supply unit is a supply unit which is influenced by movement in the second storage area before the target supply unit is moved out of the initial position of the target supply unit, and is not influenced by movement in the second storage area after the target supply unit is moved out of the initial position of the target supply unit; then, adding the dependency relationship between the target supply unit and the ith target task and the dependency relationship between the second dependent supply unit and the ith target task in the first relationship in the target dependency relationship corresponding to the ith target task to obtain an updated first relationship; adding the dependency relationship between the initial position of the target supply unit and the ith target task in a second relationship in the target dependency relationship corresponding to the ith target task to obtain an updated second relationship; and finally, determining the updated first relation and the second relation as a target dependency relation corresponding to the (i + 1) th target task.
It should be noted that, the first relationship and the second relationship are not updated sequentially, and in other embodiments, the second relationship may be updated first, and then the first relationship is updated.
For the second type of target task, because the initial position is not in the preset storage area, the second relation in the target dependency relation corresponding to the ith target task does not need to be updated. Based on this, according to the first inventory information, the second inventory information, and the ith target task, the target dependency corresponding to the ith target task is updated, and a process of obtaining the target dependency corresponding to the (i + 1) th target task may be as follows, where, for convenience of description, the target supply unit corresponding to the ith target task is recorded: adding a dependency relationship between a target supply unit and the ith target task in a first relationship in a target dependency relationship corresponding to the ith target task to obtain an updated first relationship; and determining the updated first relation and the non-updated second relation (namely the second relation in the target dependency relations corresponding to the ith target task) as the target dependency relation corresponding to the (i + 1) th target task.
In a possible implementation manner, the process of calculating the second dependent sourcing unit may be as follows, where the ith target task corresponds to the target sourcing unit:
b1. judging whether the initial position of the target supply unit is located in a preset storage area or not;
b2. if yes, acquiring a third supply unit of a second-layer occupying layer positioned in a second storage area according to the position distribution of the supply units in the first inventory information; the second storage area is a storage area where the initial position of the target supply unit in the preset storage area is located;
b3. acquiring a fourth supply unit of the first layer of the placeholder layer in the second storage area according to the position distribution of the supply unit in the second inventory information;
b4. obtaining a second intersection of the third supply unit and the fourth supply unit;
b5. and determining the supply unit in the second intersection as a second dependent supply unit corresponding to the ith target task.
And if the initial position of the target supply unit is not in the preset storage area, directly determining that the second dependent supply unit is empty. The above-described manner of calculating the second dependent supply unit utilizes the following principle: in the second storage area, the supply unit located in the second outer layer (the second-layer occupying layer) before the execution of the ith target task is predicted to be located in the outermost layer (the first-layer occupying layer) when the execution of the ith target task is predicted to be completed, so that the supply unit is changed from the state of being influenced by movement to the state of not being influenced by movement due to the execution of the ith target task, namely the supply unit belongs to the second dependent supply unit. After the second dependent supply unit is determined in this way, subsequent updating of the target dependency relationship is facilitated.
For ease of understanding, the above-mentioned process of acquiring the dependent task identifier and the process of updating the target dependency relationship are exemplarily described below with reference to fig. 5. In FIG. 5, the initial target dependency is null, i.e., as shown by the target dependency (r) in FIG. 5, both the first relationship (frame-job) of the sourcing unit and the task and the second relationship (pos-job) of the storage location and the task are null; according to the target distribution relation and the unexecuted tasks corresponding to the orders to be distributed, the determined target tasks are task 1 and task 2 respectively, wherein the task 1 is to move the supply unit A from the initial position with row-column coordinates (3,5) to the target position with row-column coordinates (4, 3) (namely J1: A → (4, 3) in FIG. 5); task 2 is to move the supply unit B from the initial position with row and column coordinates (3, 4) to the destination position with row and column coordinates (5, 3) (i.e. J2: B → (5, 3) in FIG. 5); according to the dependency relationship between the tasks 1 and 2, it can be known that the movement of the supply unit B in the task 2 is obstructed by the supply unit a in the task 1, while the movement of the supply unit a in the task 1 is not obstructed by other supply units, so that the determined processing sequence is the task 1 and the task 2 in sequence; the left diagram in fig. 5 shows the location distribution of sourcing units in the memory area before task 1 is performed, the middle diagram shows the location distribution of sourcing units in the memory area when task 1 is expected to be performed, and the right diagram shows the location distribution of sourcing units in the memory area when task 2 is expected to be performed. Here, the processing in the processing order means that before the target task (task 1 and task 2) is executed, the dependent task flag corresponding to the target task is generated and the target dependency relationship is updated. That is, under the processing sequence, the target dependency corresponding to the task 1 is an initial target dependency, a dependent task identifier corresponding to the task 1 is generated based on the initial target dependency, then the initial target dependency is updated to obtain a target dependency corresponding to the task 2, a dependent task identifier corresponding to the task 2 is generated based on the target dependency, and finally the target dependency is updated to obtain the target dependency.
As shown in fig. 5, when acquiring the dependent task identifier corresponding to task 1, first, it is determined that the first dependent supply unit corresponding to task 1 (i.e. before supply unit a is placed in destination location (4, 3), the storage area is not affected by movement, but after supply unit a is placed in destination location (4, 3), the supply unit affected by movement in the storage area may also be referred to as destination dependent supply unit): before the supply unit a is placed in the destination position (4, 3), the removal of the supply unit X, Y, Z from the storage area is not impeded as can be seen from the distribution of the supply unit positions in the left figure; after placing the sourcing unit a in the destination location (4, 3), the movement of the sourcing unit X, Y, Z out of the storage area is hindered by the sourcing unit a as seen from the location distribution of the sourcing units in the intermediate diagram, so the first dependent sourcing unit corresponding to task 1 is sourcing unit X, Y, Z. Then, searching a supply unit A in the frame-job of the initial target dependency relationship (I), wherein the result is null, namely the first task identifier is null; finding the supply unit X, Y, Z in the frame-jobof the initial target dependency relationship (r), and the result is null, that is, the second task identifier is null; searching (4, 3) in pos-jobs of the initial target dependency relationship (i), wherein the result is null, namely the third task identifier is null; finally, it is determined that the dependent task identifier corresponding to task 1 is empty, that is, the task ID (first task identifier) dependent on the origin of task 1 is empty, and the task ID (including the second task identifier and the third task identifier) dependent on the destination of task 1 is also empty.
As shown in fig. 5, when the initial target dependency relationship (i) is updated to obtain the target dependency relationship (ii) corresponding to task 2, first, the second dependent supply unit corresponding to task 1 is determined (i.e. before the supply unit a is moved from the initial position (3,5), the supply unit in the storage area is influenced by movement, but after the supply unit a is moved from the initial position (3,5), the supply unit in the storage area that is not influenced by movement is also referred to as a departure-location dependent supply unit): before the supply unit a is moved out of the initial position (3,5), it can be seen from the position distribution of the supply unit in the left figure that the movement of the supply unit B out of the storage area is hindered by the supply unit a; after the sourcing unit a has been moved out of the initial position (3,5), it can be seen from the position distribution of the sourcing units in the intermediate diagram that the movement of the sourcing unit B out of the storage area is not impeded, so the second dependent sourcing unit corresponding to task 1 is sourcing unit B. Then, the dependency relationship (a → J1) between the supplier unit a and the task 1 and the dependency relationship (B → J1) between the supplier unit B and the task 1 are added to the frame-job of the initial target dependency relationship (i), and the dependency relationship (3,5) (the initial position of the supplier unit a) and the task 1 ((3,5) → J1) is added to the pos-job of the initial target dependency relationship (i), so that the updated target dependency relationship (ii) is obtained.
As shown in fig. 5, when acquiring the dependent task identifier corresponding to task 2, first, a first dependent providing unit (destination dependent providing unit) corresponding to task 2 is determined: before the supply unit B is placed in the destination position (5, 3), it can be seen from the position distribution of the supply unit in the intermediate diagram that the removal of the supply unit a from the storage area is not hindered; after the supply unit B is placed in the destination location (5, 3), it can be seen from the location distribution of the supply unit in the right figure that the removal of the supply unit a from the storage area is hindered by the supply unit B, so the first dependent supply unit corresponding to task 2 is the supply unit a. Then, finding a supply unit B in the frame-jobof the target dependency relationship II, wherein the result is J1, namely the first task identifier is J1; finding a supply unit A in the frame-job of the target dependency relationship II, wherein the result is also J1, namely the second task is identified as J1; searching (5, 3) in pos-jobs of the target dependency relationship II, and obtaining a null result, namely, the third task identifier is null; finally, the dependent task identifier corresponding to the task 2 is determined to comprise J1 of the origin dependency and J1 of the destination dependency, namely the task ID of the origin dependency in the task 2 is J1, and the task ID of the destination dependency in the task 2 is also J1.
As shown in fig. 5, when the target dependency relationship (c) is updated to obtain the target dependency relationship (c), first, the second dependent supply unit (origin dependent supply unit) corresponding to task 2 is determined: prior to removal of unit B from its initial position (3, 4), removal of unit W, Y, Z from the storage area is impeded by unit B as seen in the positional distribution of the units in the intermediate figures; after the supplier unit B is moved from the initial position (3, 4), the movement of the supplier unit W, Y, Z out of the storage area is not hindered, as can be seen from the positional distribution of the supplier units in the right figure, so the second dependent supplier unit corresponding to task 2 is the supplier unit W, Y, Z. Then, B → J2, W → J2, Y → J2 and Z → J2 are added to the frame-job of the target dependency (ii), and (3, 4) → J2 is added to the pos-job of the target dependency (ii), resulting in an updated target dependency (iii).
In summary, the task management method for intensive warehousing provided by the embodiment of the invention considers the dependency relationship among tasks, can effectively alleviate the task cooperation problem in intensive warehousing operation, and avoids the conflict and disorder of the intensive warehousing operation to a certain extent, thereby improving the operation efficiency.
Example three:
on the basis of the foregoing embodiments, the present embodiment provides a specific example of a task management method applying the foregoing intensive warehousing, in which the supply unit is referred to as a box. Referring to fig. 6, a flowchart of another method for managing tasks in intensive warehousing is shown, which mainly includes the following steps S602 to S628:
step S602, obtaining the current order to be allocated from the order pool.
Step S604, checking the inventory to obtain the current inventory information.
In addition, the SKU heat for each cargo may also be obtained when checking inventory. The SKU heat is also the heat of the goods, and is used for representing the required degree of the corresponding goods, and the higher the SKU heat is, the higher the required degree of the corresponding goods is.
Step S606, determine whether the check is successful. If yes, go to step S608; if not, returning the result of failure of checking.
If a program operation exception occurs while step S604 is executed, the exception may be checked by executing step S606, so as to avoid the subsequent generation of erroneous new task information. It should be noted that step S606 is an optional step, and in other embodiments, step S608 may be directly executed after step S604 is executed.
Step S608, all current tasks are obtained from the task pool.
The current task information corresponding to all tasks in the task pool can be stored in a task information list. All tasks include tasks in execution and tasks not in execution.
Step S610 generates new inventory information.
Step S612, determine whether the generation is successful. If yes, go to step S614; if not, returning a result of failed generation.
Whether an abnormal condition exists in the execution of step S610 can be checked through step S612, so as to avoid the subsequent generation of wrong new task information. It should be noted that step S612 is an optional step, and in other embodiments, step S614 may be directly executed after step S610 is executed.
And step S614, calculating the number of the blocked boxes of each box according to the new stock information.
And step S616, matching to obtain an order-box distribution relation. The order-box distribution relationship is also the target distribution relationship corresponding to the order.
And step 618, obtaining all target boxes to be moved and the target positions thereof according to the order-box distribution relation and the unexecuted tasks. The target box is also the target supply unit.
In addition, after all the target boxes to be moved and the target positions of the target boxes are obtained, the SKU heat degree of each cargo can be updated.
Step S620, new task information is generated.
In step S622, it is determined whether the generation is successful. If yes, go to step S624; if not, returning a result of failed generation.
Whether an abnormal situation exists in the execution of step S620 can be checked through step S622, so that a situation that the generation of new task information fails can be timely found. It should be noted that step S622 is an optional step, and in other embodiments, step S624 may be directly executed after step S620 is executed.
In step S624, all unexecuted tasks in the task pool are deleted.
And step S626, adding the target task in the new task information into the task pool.
In step S628, the order is moved out of the order pool. And finally returning a successful result.
The order here means that the order to be allocated currently is obtained in step S602.
The task management method for intensive warehousing provided by the embodiment can effectively relieve the task cooperation problem in intensive warehousing operation, and avoid conflict and disorder of the intensive warehousing operation to a certain extent, so that the operation efficiency is improved.
Example four:
as to the task management method for intensive warehousing provided in the second embodiment, an embodiment of the present invention provides a task management device for intensive warehousing, and referring to a structural block diagram of the task management device for intensive warehousing shown in fig. 7, the device includes the following modules:
an order obtaining module 72, configured to obtain an order to be allocated from an order pool of the dense warehouse; the order information of the order comprises a goods identification and the quantity of the goods;
an inventory determination module 74, configured to determine new inventory information according to the current inventory information in the preset storage area and the task in execution in the current task information; tasks with dependency relationships in the current task information are configured with dependency task identifiers; when the new inventory information is predicted to finish the task in execution, the inventory information is updated on the basis of the current inventory information; the new inventory information comprises the position distribution and the goods information of the goods supply unit;
the distribution determining module 76 is configured to determine a target distribution relationship corresponding to the order according to the order information and the new inventory information; the target distribution relation is the distribution relation between the order and a goods supply unit in a preset storage area, and the goods supply unit is used for storing goods;
the task updating module 78 is configured to obtain new task information according to the target distribution relationship, the location distribution of the supply unit in the new inventory information, and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target tasks comprise identifiers of supply units, initial positions and target positions.
According to the task management device for intensive warehousing provided by the embodiment, when the task information is updated by acquiring a new order, the dependency relationship among tasks is considered, so that the task cooperation problem in intensive warehousing operation can be effectively relieved, and the operation efficiency is improved.
In one embodiment, the inventory determination module 74 is specifically configured to: and updating the position distribution of the supply unit and the supply unit in the current inventory information of the preset storage area according to the task in execution to obtain new inventory information.
In an embodiment, the allocation determining module 76 is specifically configured to: calculating the number of blocking boxes of each supply unit in a preset storage area according to the position distribution of the supply units in the new inventory information; the number of the blocking boxes of the supply unit is the minimum number of the blocking supply units corresponding to the condition that the supply unit is moved out of the preset storage area; and matching the supply units for the order according to the order information, the number of the blocked boxes of each supply unit and the goods information of each supply unit in the new inventory information to obtain a target distribution relation corresponding to the order.
In an embodiment, the task update module 78 is specifically configured to: acquiring an initial target dependency relationship, wherein the initial target dependency relationship comprises a first relationship between a supply unit and a task and a second relationship between a storage position in a preset storage area and the task; determining each target task to be generated according to the target distribution relation and the unexecuted tasks; determining the processing sequence of each target task according to a preset rule; the preset rule is related to the dependency relationship among the target tasks; and obtaining new task information according to the initial target dependency relationship, each target task, the processing sequence and the position distribution of the supply unit in the new inventory information.
Further, the task update module 78 is further configured to: and sequentially carrying out the following processing on each target task according to the processing sequence:
judging whether the number of unprocessed target tasks is greater than 0;
if yes, the following steps are executed:
updating the position distribution of a goods supply unit in the first stock information before the ith target task is executed according to the ith target task to obtain second stock information when the ith target task is expected to be executed;
generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and the target dependent relationship corresponding to the ith target task;
updating a target dependency relationship corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain a target dependency relationship corresponding to the (i + 1) th target task;
adding 1 to the value of i, and updating the number of unprocessed target tasks;
continuously executing the step of judging whether the number of the unprocessed target tasks is greater than 0; the dependency task identifier corresponding to the ith target task is a task identifier related to the ith target task and contained in a target dependency relationship corresponding to the ith target task, i is an integer greater than or equal to 1, the target dependency relationship corresponding to the 1 st target task is an initial target dependency relationship, and first inventory information before the 1 st target task is executed is new inventory information;
and if not, determining each obtained target task and the corresponding dependent task identifier as new task information.
Further, the ith target task corresponds to a target supply unit; the task update module 78 is further configured to: according to the first inventory information and the second inventory information, calculating to obtain a first dependent supply unit corresponding to the ith target task; the first dependent supply unit is a supply unit which is not influenced by movement in a first storage area where the target supply unit is located in the preset storage area before the target supply unit is placed in the target position of the target supply unit, but is influenced by movement in the first storage area after the target supply unit is placed in the target position of the target supply unit; searching a target supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a first task identifier corresponding to the target supply unit; searching a first dependent supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a second task identifier corresponding to the first dependent supply unit; searching the target position of the target supply unit in a second relation in the target dependency relation corresponding to the ith target task to obtain a third task identifier corresponding to the target position of the target supply unit; and determining the first task identifier, the second task identifier and the third task identifier as dependent task identifiers corresponding to the ith target task.
Further, the task update module 78 is further configured to: judging whether the target position of the target goods supply unit is located in a preset storage area or not; if yes, acquiring a first supply unit of a first layer of occupying layer in the first storage area according to the position distribution of the supply unit in the first inventory information; the first layer of occupying layer comprises positions which are provided with a supply unit, and the number of blocking boxes of the supply unit is 0; acquiring a second supply unit of a second layer of occupying layer positioned in the first storage area according to the position distribution of the supply unit in the second inventory information; the second layer of occupying layer comprises positions which are provided with supply units, and the number of blocking boxes of the supply units is 1; obtaining a first intersection of the first supply unit and the second supply unit; and determining the supply unit in the first collection as a first dependent supply unit corresponding to the ith target task.
Further, the ith target task corresponds to a target supply unit; the task update module 78 is further configured to: according to the first inventory information and the second inventory information, calculating to obtain a second dependent supply unit corresponding to the ith target task; the second dependent supply unit is a supply unit which is not influenced by movement in a second storage area where the initial position of the target supply unit in the preset storage area is located before the target supply unit is moved out of the initial position of the target supply unit, but is not influenced by movement after the target supply unit is moved out of the initial position of the target supply unit; adding the dependency relationship between the target supply unit and the ith target task and the dependency relationship between the second dependent supply unit and the ith target task in the first relationship in the target dependency relationship corresponding to the ith target task to obtain an updated first relationship; adding the dependency relationship between the initial position of the target supply unit and the ith target task in a second relationship in the target dependency relationship corresponding to the ith target task to obtain an updated second relationship; and determining the updated first relation and second relation as a target dependency relation corresponding to the (i + 1) th target task.
Further, the task update module 78 is further configured to: judging whether the initial position of the target goods supply unit is located in a preset storage area or not; if yes, acquiring a third supply unit of a second-layer occupying layer positioned in a second storage area according to the position distribution of the supply units in the first inventory information; acquiring a fourth supply unit of the first layer of the occupying layer in the second storage area according to the position distribution of the supply units in the second inventory information; obtaining a second intersection of the third supply unit and the fourth supply unit; and determining the supply unit in the second collection as a second dependent supply unit corresponding to the ith target task.
The device provided by the embodiment has the same implementation principle and technical effect as the foregoing embodiment, and for the sake of brief description, reference may be made to the corresponding contents in the foregoing method embodiment for the portion of the embodiment of the device that is not mentioned.
In addition, the present embodiment further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs the steps of the method provided in the second embodiment.
The method and the device for task management of intensive warehousing and the computer program product of the electronic device provided by the embodiments of the present invention include a computer-readable storage medium storing program codes, instructions included in the program codes may be used to execute the method described in the foregoing method embodiments, and specific implementation may refer to the method embodiments, and will not be described herein again.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of description and simplicity of description, but do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
Finally, it should be noted that: the above-mentioned embodiments are only specific embodiments of the present invention, which are used for illustrating the technical solutions of the present invention and not for limiting the same, and the protection scope of the present invention is not limited thereto, although the present invention is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the embodiments of the present invention, and they should be construed as being included therein. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims (12)

1. A task management method for intensive warehousing is characterized by comprising the following steps:
acquiring orders to be distributed from an order pool of the dense storage; the order information of the order comprises a goods identification of the goods and the quantity of the goods;
determining new inventory information according to current inventory information of a preset storage area and an executing task in current task information; wherein, the task with dependency relationship in the current task information is configured with a dependent task identifier; the new inventory information is inventory information obtained by updating on the basis of the current inventory information when the execution of the task is predicted to be finished; the new inventory information comprises position distribution and goods information of the goods supply unit;
determining a target distribution relation corresponding to the order according to the order information and the new stock information; the target distribution relationship is a distribution relationship between the orders and a goods supply unit in the preset storage area, and the goods supply unit is used for warehousing goods;
obtaining new task information according to the target distribution relation, the position distribution of a goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target tasks comprise identifiers of supply units, initial positions and target positions.
2. The method according to claim 1, wherein the step of determining new inventory information based on the current inventory information in the preset storage area and the executing task in the current task information comprises:
and updating the position distribution of the supply unit and the supply unit in the current inventory information of the preset storage area according to the executing task to obtain new inventory information.
3. The method according to claim 1, wherein the step of determining the target allocation relationship corresponding to the order according to the order information and the new inventory information comprises:
calculating the number of blocking boxes of each supply unit in the preset storage area according to the position distribution of the supply units in the new inventory information; the number of the blocking boxes of the supply unit is the minimum number of the blocking supply units corresponding to the supply unit moved out of the preset storage area;
and matching the supply units for the order according to the order information, the number of the blocked boxes of each supply unit and the goods information of each supply unit in the new inventory information to obtain a target distribution relation corresponding to the order.
4. The method of claim 1, wherein the step of obtaining new task information based on the target distribution relationship, the location distribution of the sourcing units in the new inventory information, and the unexecuted tasks in the current task information comprises:
acquiring an initial target dependency relationship, wherein the initial target dependency relationship comprises a first relationship between a supply unit and a task and a second relationship between a storage position in the preset storage area and the task;
determining each target task to be generated according to the target distribution relation and the unexecuted task;
determining the processing sequence of each target task according to a preset rule; the preset rule is related to the dependency relationship among the target tasks;
and obtaining the new task information according to the initial target dependency relationship, each target task, the processing sequence and the position distribution of the goods supply unit in the new inventory information.
5. The method of claim 4, wherein the step of obtaining the new task information based on the initial target dependency relationships, the target tasks, the processing order, and the location distribution of the sourcing units in the new inventory information comprises:
and sequentially carrying out the following processing on each target task according to the processing sequence:
judging whether the number of unprocessed target tasks is greater than 0;
if yes, the following steps are executed:
according to the ith target task, updating the position distribution of a goods supply unit in first inventory information before the ith target task is executed to obtain second inventory information when the ith target task is expected to be executed;
generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and a target dependent relationship corresponding to the ith target task;
updating a target dependency relationship corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain a target dependency relationship corresponding to the (i + 1) th target task;
adding 1 to the value of i, and updating the number of unprocessed target tasks;
continuing to execute the step of judging whether the number of the unprocessed target tasks is greater than 0; the dependency task identifier corresponding to the ith target task is a task identifier related to the ith target task and contained in the target dependency relationship corresponding to the ith target task, i is an integer greater than or equal to 1, the target dependency relationship corresponding to the 1 st target task is the initial target dependency relationship, and first inventory information before the 1 st target task is executed is the new inventory information;
and if not, determining each obtained target task and the corresponding dependent task identifier as the new task information.
6. The method of claim 5, wherein the ith target task corresponds to a target sourcing unit;
the step of generating a dependent task identifier corresponding to the ith target task according to the first inventory information, the second inventory information, the ith target task and the target dependency corresponding to the ith target task includes:
according to the first inventory information and the second inventory information, a first dependent supply unit corresponding to the ith target task is obtained through calculation; the first dependent supply unit is a supply unit which is not influenced by movement in a first storage area where the target supply unit is located in the preset storage area before the target supply unit is placed in the target position of the target supply unit, but is influenced by movement in the first storage area after the target supply unit is placed in the target position of the target supply unit;
searching the target supply unit in a first relation in a target dependency relation corresponding to the ith target task to obtain a first task identifier corresponding to the target supply unit;
searching the first dependent supply unit in a first relation in the target dependency relations corresponding to the ith target task to obtain a second task identifier corresponding to the first dependent supply unit;
searching a target position of the target supply unit in a second relation in the target dependency relation corresponding to the ith target task to obtain a third task identifier corresponding to the target position of the target supply unit;
and determining the first task identifier, the second task identifier and the third task identifier as dependent task identifiers corresponding to the ith target task.
7. The method according to claim 6, wherein the step of calculating a first dependent supplier unit corresponding to the ith target task according to the first inventory information and the second inventory information comprises:
judging whether the target position of the target supply unit is located in the preset storage area or not;
if so, acquiring a first supply unit of a first-layer placeholder layer in the first storage area according to the position distribution of the supply unit in the first inventory information; the first layer of occupying layer comprises a position which is provided with a supply unit, and the number of blocking boxes of the supply unit is 0;
acquiring a second supply unit of a second layer of placeholder layer in the first storage area according to the position distribution of the supply unit in the second inventory information; the second layer of occupying layer comprises positions which are provided with a supply unit, and the number of blocking boxes of the supply unit is 1;
obtaining a first intersection of the first supply unit and the second supply unit;
and determining the supply unit in the first collection as a first dependent supply unit corresponding to the ith target task.
8. The method of claim 5, wherein the ith target task corresponds to a target sourcing unit;
the step of updating the target dependency corresponding to the ith target task according to the first inventory information, the second inventory information and the ith target task to obtain the target dependency corresponding to the (i + 1) th target task includes:
calculating to obtain a second dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information; the second dependent supply unit is a supply unit which is not influenced by movement in a second storage area where the initial position of the target supply unit is located in the preset storage area before the target supply unit is moved out of the initial position of the target supply unit, but is not influenced by movement after the target supply unit is moved out of the initial position of the target supply unit;
adding the dependency relationship between the target supply unit and the ith target task and the dependency relationship between the second dependency supply unit and the ith target task in a first relationship in the target dependency relationship corresponding to the ith target task to obtain an updated first relationship;
adding the dependency relationship between the initial position of the target supply unit and the ith target task in a second relationship in the target dependency relationship corresponding to the ith target task to obtain an updated second relationship;
and determining the updated first relation and second relation as a target dependency relation corresponding to the (i + 1) th target task.
9. The method according to claim 8, wherein the step of calculating a second dependent supply unit corresponding to the ith target task according to the first inventory information and the second inventory information comprises:
judging whether the initial position of the target supply unit is located in the preset storage area or not;
if so, acquiring a third supply unit of a second-layer placeholder layer in the second storage area according to the position distribution of the supply unit in the first inventory information;
acquiring a fourth supply unit of the first-layer placeholder layer in the second storage area according to the position distribution of the supply units in the second inventory information;
obtaining a second intersection of the third supply unit and the fourth supply unit;
and determining the supply unit in the second collection as a second dependent supply unit corresponding to the ith target task.
10. A task management device for intensive warehousing, comprising:
the order acquisition module is used for acquiring orders to be distributed from the order pool of the dense storage; the order information of the order comprises a goods identification of the goods and the quantity of the goods;
the inventory determining module is used for determining new inventory information according to the current inventory information of the preset storage area and the executing task in the current task information; wherein, the task with dependency relationship in the current task information is configured with a dependent task identifier; the new inventory information is inventory information obtained by updating on the basis of the current inventory information when the execution of the task is predicted to be finished; the new inventory information comprises position distribution and goods information of the goods supply unit;
the distribution determining module is used for determining a target distribution relation corresponding to the order according to the order information and the new stock information; the target distribution relationship is the distribution relationship between the order and a goods supply unit in the preset storage area, and the goods supply unit is used for storing goods;
the task updating module is used for obtaining new task information according to the target distribution relation, the position distribution of the goods supply unit in the new inventory information and the unexecuted task in the current task information; the new task information comprises at least one target task and a dependent task identifier corresponding to each target task, and the target task comprises an identifier, an initial position and a destination position of a supply unit.
11. An electronic device, comprising: a processor and a storage device;
the storage device has stored thereon a computer program which, when executed by the processor, performs the method of any of claims 1 to 9.
12. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of the preceding claims 1 to 9.
CN201911363236.0A 2019-12-25 2019-12-25 Intensive storage task management method and device and electronic equipment Active CN111126857B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911363236.0A CN111126857B (en) 2019-12-25 2019-12-25 Intensive storage task management method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911363236.0A CN111126857B (en) 2019-12-25 2019-12-25 Intensive storage task management method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN111126857A CN111126857A (en) 2020-05-08
CN111126857B true CN111126857B (en) 2022-08-19

Family

ID=70502764

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911363236.0A Active CN111126857B (en) 2019-12-25 2019-12-25 Intensive storage task management method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN111126857B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113762845A (en) * 2020-10-20 2021-12-07 北京京东乾石科技有限公司 Resource allocation method and device for intensive warehousing system
CN112938284B (en) * 2021-02-09 2022-12-13 深圳市库宝软件有限公司 Storage robot control method and device, electronic equipment and storage system
CN113626037A (en) * 2021-08-10 2021-11-09 平安普惠企业管理有限公司 Task-dependent panorama display method and device, computer equipment and storage medium
CN116957298B (en) * 2023-09-19 2023-11-28 江苏润和软件股份有限公司 Industrial Internet of Things equipment control method and control system

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103708161A (en) * 2013-12-20 2014-04-09 东南大学 Gravity goods shelf parallel layout system and method
CN103723422A (en) * 2013-12-20 2014-04-16 东南大学 Multi-depth bidirectional flow type shelf and layout storing and fetching method thereof
CN103761635A (en) * 2014-01-14 2014-04-30 大连理工大学 Three-dimensional multi-box specially-structured cargo loading optimizing method
CN104268728A (en) * 2014-06-09 2015-01-07 乐视网信息技术(北京)股份有限公司 Inventory control method and system
CN110182527A (en) * 2019-04-11 2019-08-30 上海快仓智能科技有限公司 Go out warehousing control method and handling system for shelf array
CN110322186A (en) * 2018-03-30 2019-10-11 阿里巴巴集团控股有限公司 Data object inventory information processing method, apparatus and system
CN110599090A (en) * 2019-09-04 2019-12-20 浙江明度智控科技有限公司 Warehouse-out management method, server and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090164285A1 (en) * 2007-12-20 2009-06-25 International Business Machines Corporation Auto-cascading clear to build engine for multiple enterprise order level parts management

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103708161A (en) * 2013-12-20 2014-04-09 东南大学 Gravity goods shelf parallel layout system and method
CN103723422A (en) * 2013-12-20 2014-04-16 东南大学 Multi-depth bidirectional flow type shelf and layout storing and fetching method thereof
CN103761635A (en) * 2014-01-14 2014-04-30 大连理工大学 Three-dimensional multi-box specially-structured cargo loading optimizing method
CN104268728A (en) * 2014-06-09 2015-01-07 乐视网信息技术(北京)股份有限公司 Inventory control method and system
CN110322186A (en) * 2018-03-30 2019-10-11 阿里巴巴集团控股有限公司 Data object inventory information processing method, apparatus and system
CN110182527A (en) * 2019-04-11 2019-08-30 上海快仓智能科技有限公司 Go out warehousing control method and handling system for shelf array
CN110599090A (en) * 2019-09-04 2019-12-20 浙江明度智控科技有限公司 Warehouse-out management method, server and storage medium

Also Published As

Publication number Publication date
CN111126857A (en) 2020-05-08

Similar Documents

Publication Publication Date Title
CN111126857B (en) Intensive storage task management method and device and electronic equipment
CN111091328B (en) Warehouse entry management method and management device
CN111126705B (en) Transport path generation method and device for dense storage and electronic equipment
CN109544054A (en) Inventory's dispatching method, device and computer readable storage medium
CN112801565B (en) Goods allocation dispatching method, system and storage medium for intelligent storage
CN109902983B (en) Method and device for controlling transport devices in unmanned silos
CN111709608B (en) Method and device for determining picking task, computer equipment and storage medium
CN116402445B (en) Goods delivery scheduling method, device and computer equipment
CN111985862A (en) Method and apparatus for locating inventory items
CN111784223B (en) Cargo allocation data processing method, device and storage medium
US11537977B1 (en) Method and system for optimizing delivery of consignments
CN115759929A (en) Goods sorting method and device, electronic equipment and readable storage medium
WO2021040612A1 (en) Methods and apparatuses for generating product delivery plans
CN113034088A (en) Warehouse logistics task scheduling method and device, electronic equipment and storage medium
JP2021088452A (en) Management system and management method of carrying-in/out of article
CN114590508A (en) Stacker task scheduling method, device and system for three-dimensional library
WO2022027357A1 (en) Goods picking method and system in unmanned environment, and computer readable storage medium
CN114399247A (en) Task allocation method, electronic device, storage medium, and computer program product
Pfrommer et al. SLAPStack: A Simulation Framework and a Large-Scale Benchmark Use Case for Autonomous Block Stacking Warehouses
CN113816049A (en) Container scheduling method, device and system
JP2012046309A (en) Device and method for managing operation
CN113393181A (en) Tallying method and device, electronic equipment, storage medium and warehouse management system
Nordsieck et al. Potential of improving truck-based drayage operations of marine terminals through street turns
CN116586312B (en) Goods sorting method, device, electronic equipment and readable storage medium
JP2010241549A (en) Product conveying work amount prediction device, product conveying work amount prediction method, and computer program

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