CN110705951A - Method and device for scheduling warehouse commodities and electronic equipment - Google Patents
Method and device for scheduling warehouse commodities and electronic equipment Download PDFInfo
- Publication number
- CN110705951A CN110705951A CN201911290499.3A CN201911290499A CN110705951A CN 110705951 A CN110705951 A CN 110705951A CN 201911290499 A CN201911290499 A CN 201911290499A CN 110705951 A CN110705951 A CN 110705951A
- Authority
- CN
- China
- Prior art keywords
- order
- scheduling
- orders
- goods
- scheduled
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
Abstract
The application provides a method for scheduling warehouse commodities, which comprises the steps of receiving input quantity M of goods collection areas, constructing an order interception rule at least based on the quantity of the goods collection areas, determining a plurality of orders corresponding to more than M demanders according to the order interception rule to form a combination of orders to be scheduled, constructing a scheduling rule based on the quantity of the goods collection areas, determining a benchmark order in the combination of the orders to be scheduled, determining a collocation order having commodities similar to the benchmark order in the combination of the orders to be scheduled, generating scheduling plan information corresponding to the demanders not to exceed M according to part or all of the collocation orders and the benchmark order, enabling the orders of the scheduling plan information to come from the combination of the orders to be scheduled, wherein the quantity of the demanders corresponding to the scheduling plan information is adaptive to the quantity of the goods collection areas of a warehouse, and accordingly improving the utilization rate of the goods collection areas, and further improve the efficiency of the whole link of commodity scheduling.
Description
Technical Field
The present application relates to the field of computers, and in particular, to a method and an apparatus for scheduling warehouse commodities, and an electronic device.
Background
One of the key processes of warehouse operation is how to process the ex-warehouse orders, so that the goods picking process has the highest efficiency, and the operation efficiency of the whole warehouse is improved. In actual operation, after a general warehouse receives a customer order, the system automatically allocates the goods locations according to the received order, picks up goods according to the goods locations, and then performs subsequent operations.
In this way, only one order is processed at a time, but the positions of different goods in the warehouse may be dispersed, which makes the route for picking up the goods on the goods location too long and inefficient. Therefore, a method of combining a plurality of orders and picking up the orders at one time is now available.
The essence of the mode is that a plurality of order lists are collected together to pick up goods on the goods space, and then the goods in other orders can be picked up when the goods in other orders pass through the goods space, so that the overall route length can be reduced, and the efficiency is improved.
The applicant finds that the method considers improving the efficiency of picking up goods from the warehouse to combine a plurality of orders, however, in practical implementation, for a factory, only goods (raw materials) need to be picked up from the warehouse, and then, persons can distribute the raw materials to the production line, and the method of combining scheduling can be better applied, however, for a scheduling mode (such as multi-customer and long-distance transportation) which needs to pack and dispatch goods individually, a plurality of orders often correspond to a plurality of demand parties (lower order parties), the mode of goods scheduling comprises two stages, namely, one is picking up goods from the warehouse and the other is packing and dispatching goods, and the method is easy to implement for the scheduling of order, however, when the method of combining and monotony is used, although the efficiency of picking up goods from the warehouse is improved, the complexity of the stage from picking up goods to packing and dispatching goods is increased due to the need of sorting and packing, the efficiency of the overall link of commodity scheduling is reduced.
Therefore, an efficient commodity scheduling method is needed to improve the efficiency of the whole commodity scheduling link.
Disclosure of Invention
The embodiment of the specification provides a method and a device for scheduling warehouse commodities and electronic equipment, and is used for solving the problem of low utilization rate of a warehouse goods collection area in the prior art.
An embodiment of the present specification provides a method for scheduling warehouse commodities, including:
receiving the input quantity M of the goods collection areas, and constructing an order interception rule at least based on the quantity of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, comprising the following steps:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
constructing a scheduling rule based on the number of the cargo collection areas, and generating scheduling plan information by using the order combination to be scheduled and the scheduling rule, wherein the method comprises the following steps:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
Optionally, the generating scheduling plan information corresponding to the N demand parties according to part or all of the collocation orders and the benchmark orders includes:
determining the number N of idle cargo areas;
determining a demander threshold value for generating dispatching plan information based on the number of the idle cargo areas;
and generating scheduling plan information according to the demander threshold, part or all of the collocation orders and the benchmark orders.
Optionally, the scheduling rule further includes a monitoring update rule, and the method further includes:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
monitoring newly added orders, and updating the scheduling plan information according to the received newly added orders, wherein the steps of:
and determining the scheduling progress of the scheduling device, if newly added orders are received and the orders in the scheduling plan information have the same demander and the scheduling device does not complete goods picking, updating the scheduling plan information according to the newly added orders, and controlling the scheduling device to pick goods according to the updated scheduling plan information.
Optionally, the method further comprises:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
the number N of the determined idle goods collection areas comprises the following steps:
and predicting the deadline of the dispatching device for completing the sorting of the cargo areas and the number of cargo areas with idle states in the deadline.
Optionally, the method further comprises:
constructing a scheduling progress prediction model;
the predicting the deadline of the dispatching device for completing the sorting of the goods collecting areas and the number of the goods collecting areas with the idle states in the deadline comprises the following steps:
and predicting the deadline of the dispatching device for completing goods picking of the goods location and the number of the goods collecting areas with idle states in the deadline by using the dispatching prediction model.
Optionally, the constructing a scheduling progress prediction model includes:
at least obtaining commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the goods collection area sorting time of each goods collection area;
and at least obtaining the commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the sorting time of the goods collection area to construct a scheduling progress prediction model.
Optionally, the determining a benchmark order in the order combination to be scheduled includes:
determining commodity contact ratio of each order in the order combination;
and taking the order with the commodity coincidence degree at the head as a reference order.
Optionally, the determining the commodity contact ratio of each order in the order combination includes:
and according to the number of similar items when the order with the commodity contact ratio to be determined and other orders in the order combination to be scheduled have similar commodities.
Optionally, the determining, in the order combination to be scheduled, a collocation order having a commodity similar to the benchmark order further includes:
and matching orders of similar commodities are arranged with the reference orders according to the priority of each order.
Optionally, the order interception rule further includes: updating the rule;
the intercepting of the order according to the order intercepting rule forms an order combination to be scheduled, further comprising:
removing the scheduled orders from the order combination to be scheduled;
and if the number of the demand parties corresponding to the updated order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to the updated order combination to be scheduled.
An embodiment of the present specification further provides an apparatus for scheduling warehouse commodities, including:
the scheduling module receives the input number M of the goods collection areas and constructs an order interception rule at least based on the number of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, comprising the following steps:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
the dispatching plan module constructs dispatching rules based on the number of the goods collecting areas, and generates dispatching plan information by using the order combination to be dispatched and the dispatching rules, wherein the dispatching plan module comprises:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
Optionally, the generating scheduling plan information corresponding to the N demand parties according to part or all of the collocation orders and the benchmark orders includes:
determining the number N of idle cargo areas;
determining a demander threshold value for generating dispatching plan information based on the number of the idle cargo areas;
and generating scheduling plan information according to the demander threshold, part or all of the collocation orders and the benchmark orders.
Optionally, the scheduling rule further includes a monitoring update rule, and the scheduling planning module is further configured to:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
monitoring newly added orders, and updating the scheduling plan information according to the received newly added orders, wherein the steps of:
and determining the scheduling progress of the scheduling device, if newly added orders are received and the orders in the scheduling plan information have the same demander and the scheduling device does not complete goods picking, updating the scheduling plan information according to the newly added orders, and controlling the scheduling device to pick goods according to the updated scheduling plan information.
Optionally, the dispatch plan module is further configured to:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
the number N of the determined idle goods collection areas comprises the following steps:
and predicting the deadline of the dispatching device for completing the sorting of the cargo areas and the number of cargo areas with idle states in the deadline.
Optionally, the dispatch plan module is further configured to:
constructing a scheduling progress prediction model;
the predicting the deadline of the dispatching device for completing the sorting of the goods collecting areas and the number of the goods collecting areas with the idle states in the deadline comprises the following steps:
and predicting the deadline of the dispatching device for completing goods picking of the goods location and the number of the goods collecting areas with idle states in the deadline by using the dispatching prediction model.
Optionally, the constructing a scheduling progress prediction model includes:
at least obtaining commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the goods collection area sorting time of each goods collection area;
and at least obtaining the commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the sorting time of the goods collection area to construct a scheduling progress prediction model.
Optionally, the determining a benchmark order in the order combination to be scheduled includes:
determining commodity contact ratio of each order in the order combination;
and taking the order with the commodity coincidence degree at the head as a reference order.
Optionally, the determining the commodity contact ratio of each order in the order combination includes:
and according to the number of similar items when the order with the commodity contact ratio to be determined and other orders in the order combination to be scheduled have similar commodities.
Optionally, the determining, in the order combination to be scheduled, a collocation order having a commodity similar to the benchmark order further includes:
and matching orders of similar commodities are arranged with the reference orders according to the priority of each order.
Optionally, the order interception rule further includes: updating the rule;
the intercepting of the order according to the order intercepting rule forms an order combination to be scheduled, further comprising:
removing the scheduled orders from the order combination to be scheduled;
and if the number of the demand parties corresponding to the updated order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to the updated order combination to be scheduled.
An embodiment of the present specification further provides an electronic device, where the electronic device includes:
a processor; and the number of the first and second groups,
a memory storing computer executable instructions that, when executed, cause the processor to perform the method of any of the above embodiments.
The present specification also provides a computer readable storage medium, wherein the computer readable storage medium stores one or more programs, and the one or more programs, when executed by a processor, implement the method of any one of the above embodiments.
Various embodiments provided by the present specification enable an order of scheduling plan information to be derived from a to-be-scheduled order combination in which the number of demand parties exceeds the number of cargo collection areas, and simultaneously enable the number of demand parties corresponding to the scheduling plan information to be adapted to the number of cargo collection areas of a warehouse by receiving an input number of cargo collection areas M, constructing an order interception rule at least based on the number of cargo collection areas, determining a plurality of orders corresponding to more than M demand parties according to the order interception rule, forming a to-be-scheduled order combination, constructing a scheduling rule based on the number of cargo collection areas, determining a benchmark order in the to-be-scheduled order combination, determining a collocation order having a commodity of the same type as the benchmark order in the to-be-scheduled order combination, and generating scheduling plan information corresponding to no more than M demand parties according to part or all of the collocation order and the benchmark order, therefore, the utilization rate of the goods collection area is improved, and the efficiency of the whole link of commodity scheduling is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic diagram illustrating a method for scheduling warehouse commodities according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an apparatus for scheduling warehouse commodities according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure;
fig. 4 is a schematic diagram of a computer-readable medium provided in an embodiment of the present specification.
Detailed Description
The applicant finds that a goods collection area is arranged in a warehouse, so that goods picked up by a goods location can be directly placed in the goods collection area, and a scheduling device or personnel can continue to carry out goods delivery of the goods location without waiting, so that the efficiency of the whole goods scheduling link can be improved if the utilization efficiency of the goods collection area can be improved.
An embodiment of the present specification provides a method for scheduling warehouse commodities, including:
receiving the input quantity M of the goods collection areas, and constructing an order interception rule at least based on the quantity of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, comprising the following steps:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
constructing a scheduling rule based on the number of the cargo collection areas, and generating scheduling plan information by using the order combination to be scheduled and the scheduling rule, wherein the method comprises the following steps:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
The embodiment of the specification receives input quantity M of the goods collection areas, constructs an order interception rule at least based on the quantity of the goods collection areas, determines a plurality of orders corresponding to more than M demand parties according to the order interception rule, forms a combination of orders to be scheduled, constructs a scheduling rule based on the quantity of the goods collection areas, determines a benchmark order in the combination of the orders to be scheduled, determines a collocation order having the same type of goods with the benchmark order in the combination of the orders to be scheduled, generates scheduling plan information corresponding to no more than M demand parties according to part or all of the collocation order and the benchmark order, leads the order of the scheduling plan information to be from the combination of the orders to be scheduled, the quantity of the demand parties corresponding to the scheduling plan information is adapted to the quantity of the goods collection areas of a warehouse, thereby improving the utilization rate of the goods collection areas, and further improve the efficiency of the whole link of commodity scheduling.
Exemplary embodiments of the present invention will now be described more fully with reference to the accompanying drawings. The exemplary embodiments, however, may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these exemplary embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the invention to those skilled in the art. The same reference numerals denote the same or similar elements, components, or parts in the drawings, and thus their repetitive description will be omitted.
Features, structures, characteristics or other details described in a particular embodiment do not preclude the fact that the features, structures, characteristics or other details may be combined in a suitable manner in one or more other embodiments in accordance with the technical idea of the invention.
In describing particular embodiments, the present invention has been described with reference to features, structures, characteristics or other details that are within the purview of one skilled in the art to provide a thorough understanding of the embodiments. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific features, structures, characteristics, or other details.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various elements, components, or sections, these terms should not be construed as limiting. These phrases are used to distinguish one from another. For example, a first device may also be referred to as a second device without departing from the spirit of the present invention.
The term "and/or" and/or "includes all combinations of any one or more of the associated listed items.
Fig. 1 is a schematic diagram of a method for scheduling warehouse commodities, according to an embodiment of the present disclosure, where the method may include:
s101: receiving the input quantity M of the goods collection areas, and constructing an order interception rule at least based on the quantity of the goods collection areas.
In this embodiment of the present specification, the number of cargo areas receiving the input may be input by a user, or may be determined according to the number of cargo areas networked when the networking device is installed in each cargo area in the warehouse, such as the internet of things, which is specifically set forth and limited herein.
The order interception rule in the embodiment of the specification is used for intercepting order combinations to be scheduled in the generated orders.
In this embodiment, constructing the order interception rule may include:
constructing an order interception rule with a demander threshold;
and determining a demand side threshold value of the order interception rule according to the number of the goods collection areas, wherein the demand side threshold value of the order interception rule is a lower limit threshold value.
In this embodiment of the present specification, the number of cargo areas may refer to the number of cargo areas of a static warehouse, or may be the number of idle cargo areas, which may indicate that, in an actual scene, the cargo areas in an idle state may change with the progress of scheduling.
S102: intercepting the order according to the order interception rule to form an order combination to be scheduled, which may include:
and determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled.
In an embodiment of the present specification, the order intercepting rule has a demander identification rule, and is configured to identify a demander corresponding to an order, determine the number of demanders corresponding to the order in an order combination to be scheduled, and if the number of demanders does not exceed a demander threshold, continue to intercept one or more orders in the order combination to be scheduled until a plurality of orders corresponding to more than M demanders are intercepted.
In the embodiment of the present specification, the demander identification rule is further used to identify a demander corresponding to the order to be intercepted, and even, to identify whether the demander corresponding to the order to be intercepted falls into a demander set corresponding to the order combination to be scheduled, if the order combination to be scheduled is enough, but the demand side corresponding to the order to be intercepted still falls into the demand side set corresponding to the order combination to be scheduled, the order can be intercepted into the order combination to be scheduled, and in this way, while the number of the demand parties corresponding to the order combination to be scheduled is not increased and the pressure of the cargo collection area is not increased, the range of the order combination to be scheduled is expanded, the order quantity contained in the scheduling plan information generated according to the order combination to be scheduled is improved, the collection area sorting can still be carried out while the order number is increased and the warehouse collection area does not need to be increased.
S103: constructing a scheduling rule based on the number of the cargo collection areas, and generating scheduling plan information by using the order combination to be scheduled and the scheduling rule, wherein the method comprises the following steps:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
The method comprises the steps of receiving input quantity M of the goods collection areas, constructing an order interception rule at least based on the quantity of the goods collection areas, determining a plurality of orders corresponding to more than M demand parties according to the order interception rule, forming an order combination to be scheduled, constructing a scheduling rule based on the quantity of the goods collection areas, determining a reference order in the order combination to be scheduled, determining a collocation order having commodities of the same type as the reference order in the order combination to be scheduled, generating scheduling plan information corresponding to no more than M demand parties according to part or all of the collocation order and the reference order, enabling the order of the scheduling plan information to be from the order combination to be scheduled, of which the demand parties exceed the quantity of the goods collection areas, and enabling the quantity of demand parties corresponding to the scheduling plan information to be adaptive to the quantity of the goods collection areas of a warehouse, so that the utilization rate of the goods collection areas is improved, and further improve the efficiency of the whole link of commodity scheduling.
In an application scenario, the number of currently idle cargo areas is 5, the combination of the orders intercepted for the first time corresponds to 4 demand parties, if the interception is completed at this time, and then the orders are selected from the combinations to generate scheduling plan information, 1 cargo area is not fully utilized, so that the orders need to be intercepted continuously.
In another application scenario, the number of the currently idle cargo collection areas is 5, the combination of the orders intercepted for the first time corresponds to 5 demand parties, if the interception is completed at this time, the orders are selected from the combinations to generate scheduling plan information, and the method is equivalent to simply selecting the orders according to the number of the cargo collection areas to perform combination and scheduling. Therefore, when executing S102 of the method, the orders may be continuously intercepted to form an order combination to be scheduled corresponding to 10 demand parties, and the similar commodities are determined from the 10 orders, so as to finally generate scheduling plan information.
In this embodiment, the number of the scheduling plan information may be 1, or may be multiple, which may mean that one scheduling apparatus may complete scheduling, multiple scheduling may complete scheduling, or multiple scheduling apparatuses may complete scheduling together.
In an embodiment of this specification, the generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders includes:
determining the number N of idle cargo areas;
determining a demander threshold value for generating dispatching plan information based on the number of the idle cargo areas;
and generating scheduling plan information according to the demander threshold, part or all of the collocation orders and the benchmark orders.
In an embodiment of this specification, in the method, the scheduling rule further includes a monitoring update rule, and the method further includes:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
monitoring newly added orders, and updating the scheduling plan information according to the received newly added orders, wherein the steps of:
and determining the scheduling progress of the scheduling device, if newly added orders are received and the orders in the scheduling plan information have the same demander and the scheduling device does not complete goods picking, updating the scheduling plan information according to the newly added orders, and controlling the scheduling device to pick goods according to the updated scheduling plan information.
The dispatch plan information may be sent by the processor to the real-world device, or sent to the robot controlling the pick order, or sent to the user terminal when picking up the goods manually, which is not limited and illustrated in detail herein.
In the embodiment of the present specification, the method may further include:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
updating the scheduling plan information according to the received new order may include:
and determining the scheduling progress of the scheduling device, if receiving that the newly added orders and the orders in the scheduling plan information have the same demander and the scheduling device does not complete scheduling, updating the scheduling plan information by using the newly added orders, and controlling the scheduling device to schedule.
In this embodiment of the present specification, generating scheduling plan information by using the combination of orders to be scheduled and the scheduling rule may further include:
and generating scheduling plan information according to historical scheduling plan information and by using the order combination to be scheduled and the scheduling rule.
In practical application, this may mean that 3 of 4 commodities in one order of a certain demand party are included in already generated scheduling plan information due to overlapping with orders of other demand parties, and then the goods picking up at the goods location is completed, and the remaining 1 commodity which is not overlapped in the order combination to be scheduled, but considering that 3 commodities of the demand party are already located in the goods collection area and occupy 1 goods collection area resource, it may be determined that a goods is missing in the goods collection area according to the historical scheduling plan information, and after the scheduling plan information is generated by using the step S103, the missing commodity is added to the scheduling plan information. Therefore, the goods can be quickly picked in the goods collection area with the missing goods and then packaged and delivered, and the waiting time is reduced, so that the utilization efficiency of the goods collection area is further improved.
Therefore, in the embodiment of the present specification, the method may further include:
determining missing commodities in each goods collection area;
adding the missing commodity to the generated scheduling plan information;
and controlling a scheduling device to pick the goods in the goods location and sort the goods in the goods collecting area according to the updated scheduling plan information.
In an embodiment of the present specification, the determining the missing commodities of each cargo area may include:
determining the commodities currently sorted in each goods collection area;
determining a sorted order corresponding to the current sorted commodity;
and determining the unsorted commodities in the sorted order as missing commodities in the corresponding goods collection area.
In the embodiment of the present specification, the method may further include:
controlling a scheduling device to schedule according to the scheduling plan information;
the determining the number N of idle cargo areas may include:
and predicting the deadline of the dispatching device for completing the sorting of the cargo areas and the number of cargo areas with idle states in the deadline.
In the embodiment of the present specification, the method may further include:
constructing a scheduling progress prediction model;
the predicting the deadline for the dispatching device to complete the sorting of the cargo areas and the number of cargo areas with the idle state in the deadline may include:
and predicting the deadline of goods picking of the goods position of the scheduling device and the number of the goods collecting areas with idle states in the deadline by using the scheduling prediction model.
In an embodiment of this specification, the building a scheduling progress prediction model may include:
the construction of the scheduling progress prediction model comprises the following steps:
at least obtaining commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the goods collection area sorting time of each goods collection area;
and at least obtaining the commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the sorting time of the goods collection area to construct a scheduling progress prediction model.
The next link of the goods collection area is packaging and delivery, so that different goods collection areas need to be sorted for orders of different demanders, the number of the goods collection areas can limit the upper limit of the orders when the goods are picked up by the goods location sorting operation scheduling device, and therefore the order combination to be scheduled, with the number of the corresponding demanders being larger than that of the goods collection areas, can be preliminarily expanded to screen the order combination, and the probability of combining the orders to the goods of the same type is improved.
Although the combination of orders to be scheduled and the scheduling plan information in the embodiment of the present specification are all the combination of a plurality of orders, the combination mode does not directly select continuous orders according to the number of cargo areas, and the combination mode is essentially different from the conventional order combination.
In an application scenario, in order to sort the commodities picked up by combining 10 orders, 10 cargo collection areas are configured in one warehouse, and the conventional method is to combine orders once every 10 orders and collect the commodities once, and then perform cargo collection area sorting, wherein the dispatching device moves to each cargo collection area to perform cargo collection area sorting, or the dispatching device and a special sorting device respectively transport the sorted commodities to the cargo collection areas, and then perform packaging and delivery. After the method is applied, 20 orders corresponding to 12 (more than 10) demand parties can be selected preliminarily as the order combination to be scheduled.
Because the goods positions of the same goods or the goods of the same type are the same or similar, the goods picking routes are also approximately the same, and if the goods with the same or similar goods positions in a plurality of orders are picked at one time, the round-trip routes can be reduced, and the efficiency is improved.
For convenience of description, a concept of the benchmark order is introduced, and a collocation order corresponds to the benchmark order, and the collocation order has the same type of goods as the benchmark order, even the same kind of goods.
In order to further improve the goods picking efficiency, in a practical scene, different matching orders may be obtained by taking different orders in the order combination to be scheduled as reference orders, and in order to greatly improve the number of goods in one-time goods picking, a concept of goods coincidence degree is introduced, which represents the number of items of the same goods in the matching orders and the reference orders, and the number of the matching orders can be multiple.
For example, the order combination to be scheduled has A, B, C, D orders, order a has a1 and a2 commodities, order B has a1 commodities, order C has a2 commodities, and order D has D commodities, then for order a, order B and order C both have superposed commodities with them, and for convenience of understanding, it can be calculated that in this order combination, the commodity coincidence of order a is 2, the commodity coincidence of order B is 1, order C is 1, and the commodity coincidence of order D is 0. Therefore, if the order A is taken as a reference order, the pick-up of the orders B and C can be completed at one time, and if the order B is taken as a reference order, only part of the pick-up of the order A can be completed. Therefore, the pick efficiency can be improved to the maximum degree by taking the order A as a reference order and taking the order B and the order C as matching orders.
Based on this concept, in this specification embodiment, the determining a benchmark order in the order combination to be scheduled may include:
determining commodity contact ratio of each order in the order combination;
and taking the order with the commodity coincidence degree at the head as a reference order.
In consideration of the fact that in an actual scene, a plurality of orders of the same demand side can utilize the same goods collecting area without sorting, therefore, the orders of the same demand side can be preferentially picked, and specifically, the orders of the demand side can be used as reference orders to determine collocation orders.
In this embodiment of the present specification, the determining the commodity contact ratio of each order in the order combination may include:
and according to the number of similar items when the order with the commodity contact ratio to be determined and other orders in the order combination to be scheduled have similar commodities.
Of course, the product contact ratio may be described in other forms, such as a weighted product contact ratio of the order with the quantity as a weight in consideration of the quantity of each product, which is within the scope of the present disclosure.
Based on this concept, in this specification embodiment, determining a benchmark order in the order combination to be scheduled may include:
and if the order combination to be scheduled has a plurality of orders corresponding to the same demand side, taking the plurality of orders of the demand side as reference orders.
Besides the orders of the demand side as the benchmark orders, orders with overlapped commodities in the orders of other demand sides and the demand side can be used as the collocation orders.
Of course, it is also possible to determine the benchmark order according to the scheduling priority generated in other scenarios, which is within the scope of the present specification, for example, in the embodiment of the present specification, the determining the benchmark order in the order combination to be scheduled may include:
and determining a reference order according to the required time of each order in the order combination to be scheduled.
Other ways of determining the benchmark order are not specifically set forth herein.
In an embodiment of this specification, the determining a collocation order having a commodity similar to the benchmark order in the order combination to be scheduled may further include:
and matching orders of similar commodities are arranged with the reference orders according to the priority of each order.
In the cyclic process, after one-time scheduling is carried out, the orders in the order combination to be scheduled are reduced, so the order combination to be scheduled can be updated when needed.
Therefore, in this embodiment of the present specification, the order interception rule may further include: updating the rule;
the intercepting an order according to the order intercepting rule to form an order combination to be scheduled may further include:
removing the scheduled orders from the order combination to be scheduled;
and if the number of the demand parties corresponding to the updated order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to the updated order combination to be scheduled.
Specifically, the orders of the same demand side can be updated as benchmark orders in multiple scheduling.
Orders with the number larger than that of the goods collection area are used as order combinations to be scheduled, and the reference orders and the matched orders are determined in the order combinations to be scheduled, so that the coincidence degree of similar commodities of each order in the generated scheduling plan information is high, orders with the similar commodities can be combined preferentially because orders are combined according to the coincidence dimension of the commodities, and the problem of low efficiency caused by directly combining and scheduling a plurality of orders with continuous time is solved.
In specific implementation, the method may include:
configuring a model for scheduling warehouse commodities based on commodity contact ratio;
comparing the number of the orders in the order combination to be scheduled with the number of the goods collection areas;
if the number of the orders in the order combination to be scheduled is larger than that of the goods collection area, calculating the commodity coincidence degree with other orders by taking each order as a reference, taking the order with the largest commodity coincidence degree as a reference order, and determining a collocation order with the same type of commodities as the reference order;
generating scheduling plan information comprising the reference order and the collocation order, wherein the number of the demand parties corresponding to the scheduling plan information is smaller than that of the cargo collection area;
scheduling plan information is generated, and goods can be picked up in the goods location and sorted in the goods collection area according to the scheduling plan information;
judging the number of the remaining orders in the order combination to be scheduled;
if the number of the remaining orders in the order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to S202-S204;
and if the number of the remaining orders in the order combination to be scheduled is less than the number of the goods collection areas, releasing the unscheduled orders into the order combination to be scheduled, and updating the order combination to be scheduled.
In this embodiment of the present specification, in intercepting an order according to the order interception rule to form an order combination to be scheduled, the method may further include:
identifying a special commodity;
the generating scheduling plan information by using the combination of orders to be scheduled and the scheduling rule may include:
the scheduling plan information is generated by skipping the special commodity, and is not specifically illustrated and limited herein.
This can mean, in an example application scenario: for special commodities, such as non-unpackable or non-cuttable commodities, sorting, taking off shelves and collecting are respectively carried out according to the number of lines in each order, and the number is not combined.
In the various embodiments, the order intercepting rule and the scheduling rule are constructed based on the number of the goods collection areas, when the order is intercepted by the intercepting rule, the order is intercepted based on the number of the goods collection areas in the rule and the demand side corresponding to the order to form a combination of the order to be scheduled, because the order of the scheduling plan information is from the combination of the order to be scheduled, which is obtained by the demand side exceeding the number of the goods collection areas, the combination range is expanded, the probability that 1 goods collection area corresponds to a plurality of orders of the same demand side is increased, when the scheduling plan information is generated by using the combination of the order to be scheduled and the scheduling rule, the scheduling plan information is generated according to the plurality of orders, which correspond to the number of the goods collection areas, in the combination of the order to be scheduled, so that the number of the demand side corresponding to the scheduling plan information is adapted to the number of the.
Fig. 2 is a schematic structural diagram of an apparatus for scheduling warehouse commodities, according to an embodiment of the present disclosure, where the apparatus may include:
the scheduling module 201 receives the input number M of the goods collection areas, and establishes an order interception rule at least based on the number of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, which may include:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
the scheduling plan module 202, which constructs a scheduling rule based on the number of the cargo areas, and generates scheduling plan information by using the combination of the orders to be scheduled and the scheduling rule, may include:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
Optionally, the generating scheduling plan information corresponding to the N demand parties according to part or all of the collocation orders and the benchmark orders includes:
determining the number N of idle cargo areas;
determining a demander threshold value for generating dispatching plan information based on the number of the idle cargo areas;
and generating scheduling plan information according to the demander threshold, part or all of the collocation orders and the benchmark orders.
Optionally, the scheduling rule further includes a monitoring update rule, and the scheduling planning module is further configured to:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
monitoring newly added orders, and updating the scheduling plan information according to the received newly added orders, wherein the steps of:
and determining the scheduling progress of the scheduling device, if newly added orders are received and the orders in the scheduling plan information have the same demander and the scheduling device does not complete goods picking, updating the scheduling plan information according to the newly added orders, and controlling the scheduling device to pick goods according to the updated scheduling plan information.
Optionally, the dispatch plan module is further configured to:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
the number N of the determined idle goods collection areas comprises the following steps:
and predicting the deadline of the dispatching device for completing the sorting of the cargo areas and the number of cargo areas with idle states in the deadline.
Optionally, the dispatch plan module is further configured to:
constructing a scheduling progress prediction model;
the predicting the deadline of the dispatching device for completing the sorting of the goods collecting areas and the number of the goods collecting areas with the idle states in the deadline comprises the following steps:
and predicting the deadline of the dispatching device for completing goods picking of the goods location and the number of the goods collecting areas with idle states in the deadline by using the dispatching prediction model.
Optionally, the constructing a scheduling progress prediction model includes:
at least obtaining commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the goods collection area sorting time of each goods collection area;
and at least obtaining the commodities and scheduling result information corresponding to the sample scheduling plan information, and the commodities to be sorted in each goods collection area and the sorting time of the goods collection area to construct a scheduling progress prediction model.
In this embodiment of the present specification, the determining a benchmark order in the order combination to be scheduled may include:
determining commodity contact ratio of each order in the order combination;
and taking the order with the commodity coincidence degree at the head as a reference order.
In this embodiment of the present specification, the determining the commodity contact ratio of each order in the order combination may include:
and according to the number of similar items when the order with the commodity contact ratio to be determined and other orders in the order combination to be scheduled have similar commodities.
In an embodiment of this specification, the determining a collocation order having a commodity similar to the benchmark order in the order combination to be scheduled may further include:
and matching orders of similar commodities are arranged with the reference orders according to the priority of each order.
In this embodiment of the present specification, the order interception rule may further include: updating the rule;
the intercepting an order according to the order intercepting rule to form an order combination to be scheduled may further include:
removing the scheduled orders from the order combination to be scheduled;
and if the number of the demand parties corresponding to the updated order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to the updated order combination to be scheduled.
The device receives input quantity M of the goods collecting areas, establishes an order intercepting rule at least based on the quantity of the goods collecting areas, determines a plurality of orders corresponding to more than M demand parties according to the order intercepting rule to form an order combination to be scheduled, establishes a scheduling rule based on the quantity of the goods collecting areas, determines a reference order in the order combination to be scheduled, determines a collocation order having the same type of goods with the reference order in the order combination to be scheduled, generates scheduling plan information corresponding to no more than M demand parties according to part or all of the collocation order and the reference order, enables the order of the scheduling plan information to come from the order combination to be scheduled, of which the demand parties exceed the quantity of the goods collecting areas, and simultaneously, the quantity of demand parties corresponding to the scheduling plan information is adaptive to the quantity of the goods collecting areas of a warehouse, thereby improving the utilization rate of the goods collecting areas, and further improve the efficiency of the whole link of commodity scheduling.
Based on the same inventive concept, the embodiment of the specification further provides the electronic equipment.
In the following, embodiments of the electronic device of the present invention are described, which may be regarded as specific physical implementations for the above-described embodiments of the method and apparatus of the present invention. Details described in the embodiments of the electronic device of the invention should be considered supplementary to the embodiments of the method or apparatus described above; for details which are not disclosed in embodiments of the electronic device of the invention, reference may be made to the above-described embodiments of the method or the apparatus.
Fig. 3 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure. An electronic device 300 according to this embodiment of the invention is described below with reference to fig. 3. The electronic device 300 shown in fig. 3 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 3, electronic device 300 is embodied in the form of a general purpose computing device. The components of electronic device 300 may include, but are not limited to: at least one processing unit 310, at least one memory unit 320, a bus 330 connecting the various system components (including the memory unit 320 and the processing unit 310), a display unit 340, and the like.
Wherein the storage unit stores program code executable by the processing unit 310 to cause the processing unit 310 to perform the steps according to various exemplary embodiments of the present invention described in the above-mentioned processing method section of the present specification. For example, the processing unit 310 may perform the steps as shown in fig. 1.
The storage unit 320 may include readable media in the form of volatile storage units, such as a random access memory unit (RAM) 3201 and/or a cache storage unit 3202, and may further include a read only memory unit (ROM) 3203.
The storage unit 320 may also include a program/utility 3204 having a set (at least one) of program modules 3205, such program modules 3205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 300 may also communicate with one or more external devices 400 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 300, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 300 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 350. Also, the electronic device 300 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 360. Network adapter 360 may communicate with other modules of electronic device 300 via bus 330. It should be appreciated that although not shown in FIG. 3, other hardware and/or software modules may be used in conjunction with electronic device 300, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments of the present invention described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, which can be stored in a computer-readable storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to make a computing device (which can be a personal computer, a server, or a network device, etc.) execute the above-mentioned method according to the present invention. The computer program, when executed by a data processing apparatus, enables the computer readable medium to implement the above-described method of the invention, namely: such as the method shown in fig. 1.
Fig. 4 is a schematic diagram of a computer-readable medium provided in an embodiment of the present specification.
A computer program implementing the method shown in fig. 1 may be stored on one or more computer readable media. The computer readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
In summary, the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that some or all of the functionality of some or all of the components in embodiments in accordance with the invention may be implemented in practice using a general purpose data processing device such as a microprocessor or a Digital Signal Processor (DSP). The present invention may also be embodied as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing the present invention may be stored on computer-readable media or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
While the foregoing embodiments have described the objects, aspects and advantages of the present invention in further detail, it should be understood that the present invention is not inherently related to any particular computer, virtual machine or electronic device, and various general-purpose machines may be used to implement the present invention. The invention is not to be considered as limited to the specific embodiments thereof, but is to be understood as being modified in all respects, all changes and equivalents that come within the spirit and scope of the invention.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (12)
1. A method of scheduling warehouse goods, comprising:
receiving the input quantity M of the goods collection areas, and constructing an order interception rule at least based on the quantity of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, comprising the following steps:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
constructing a scheduling rule based on the number of the cargo collection areas, and generating scheduling plan information by using the order combination to be scheduled and the scheduling rule, wherein the method comprises the following steps:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
2. The method of claim 1, wherein generating scheduling plan information for N demand parties based on the benchmark order and some or all of the collocation orders comprises:
determining the number N of idle cargo areas;
determining a demander threshold value for generating dispatching plan information based on the number of the idle cargo areas;
and generating scheduling plan information according to the demander threshold, part or all of the collocation orders and the benchmark orders.
3. The method of any of claims 1 or 2, wherein the scheduling rules further comprise monitoring update rules, the method further comprising:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
monitoring newly added orders, and updating the scheduling plan information according to the received newly added orders, wherein the steps of:
and determining the scheduling progress of the scheduling device, if newly added orders are received and the orders in the scheduling plan information have the same demander and the scheduling device does not complete goods picking, updating the scheduling plan information according to the newly added orders, and controlling the scheduling device to pick goods according to the updated scheduling plan information.
4. The method of claim 2, further comprising:
controlling a scheduling device to pick up goods in a goods position and sort the goods in a goods collecting area according to the scheduling plan information;
the number N of the determined idle goods collection areas comprises the following steps:
and predicting the deadline of the dispatching device for completing the sorting of the cargo areas and the number of cargo areas with idle states in the deadline.
5. The method of claim 4, further comprising:
constructing a scheduling progress prediction model;
the predicting the deadline of the dispatching device for completing the sorting of the goods collecting areas and the number of the goods collecting areas with the idle states in the deadline comprises the following steps:
and predicting the deadline of the dispatching device for completing goods picking of the goods location and the number of the goods collecting areas with idle states in the deadline by using the dispatching prediction model.
6. The method of claim 1, wherein determining a benchmark order among the combination of orders to be scheduled comprises:
determining commodity contact ratio of each order in the order combination;
and taking the order with the commodity coincidence degree at the head as a reference order.
7. The method of claim 6, wherein determining a commodity overlap ratio for each order in the order combination comprises:
and according to the number of similar items when the order with the commodity contact ratio to be determined and other orders in the order combination to be scheduled have similar commodities.
8. The method of claim 7, wherein determining a collocation order in the combination of orders to be scheduled that has a commodity similar to the benchmark order further comprises:
and matching orders of similar commodities are arranged with the reference orders according to the priority of each order.
9. The method of claim 8, wherein the order intercept rule further comprises: updating the rule;
the intercepting of the order according to the order intercepting rule forms an order combination to be scheduled, further comprising:
removing the scheduled orders from the order combination to be scheduled;
and if the number of the demand parties corresponding to the updated order combination to be scheduled is larger than the number of the goods collection areas, continuing scheduling according to the updated order combination to be scheduled.
10. An apparatus for scheduling warehouse goods, comprising:
the scheduling module receives the input number M of the goods collection areas and constructs an order interception rule at least based on the number of the goods collection areas;
intercepting the order according to the order interception rule to form an order combination to be scheduled, comprising the following steps:
determining a plurality of orders corresponding to more than M demand parties to form an order combination to be scheduled;
the dispatching plan module constructs dispatching rules based on the number of the goods collecting areas, and generates dispatching plan information by using the order combination to be dispatched and the dispatching rules, wherein the dispatching plan module comprises:
determining a benchmark order in the order combination to be scheduled;
determining a collocation order with the same type of commodities as the benchmark order in the order combination to be scheduled;
and generating scheduling plan information corresponding to N demand parties according to part or all of the collocation orders and the benchmark orders, wherein N is less than or equal to M.
11. An electronic device, wherein the electronic device comprises:
a processor; and the number of the first and second groups,
a memory storing computer-executable instructions that, when executed, cause the processor to perform the method of any of claims 1-9.
12. A computer readable storage medium, wherein the computer readable storage medium stores one or more programs which, when executed by a processor, implement the method of any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290499.3A CN110705951A (en) | 2019-12-16 | 2019-12-16 | Method and device for scheduling warehouse commodities and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290499.3A CN110705951A (en) | 2019-12-16 | 2019-12-16 | Method and device for scheduling warehouse commodities and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110705951A true CN110705951A (en) | 2020-01-17 |
Family
ID=69193249
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911290499.3A Pending CN110705951A (en) | 2019-12-16 | 2019-12-16 | Method and device for scheduling warehouse commodities and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110705951A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114348585A (en) * | 2021-12-30 | 2022-04-15 | 重庆特斯联智慧科技股份有限公司 | Logistics robot system based on platform scheduling and control method thereof |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030046143A1 (en) * | 2000-07-13 | 2003-03-06 | Kazuya Nakagawa | Workflow system |
| CN109658018A (en) * | 2017-10-10 | 2019-04-19 | 北京京东尚科信息技术有限公司 | The method and apparatus for improving storage outbound efficiency |
| CN109658017A (en) * | 2017-10-10 | 2019-04-19 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus of automatic picking |
| CN110111048A (en) * | 2019-04-29 | 2019-08-09 | 西安电子科技大学 | Order taking responsibility dispatching method in warehousing system |
| CN110223011A (en) * | 2019-05-22 | 2019-09-10 | 杭州海仓科技有限公司 | Intelligent storage equipment scheduling method, system, storage medium and electronic equipment |
-
2019
- 2019-12-16 CN CN201911290499.3A patent/CN110705951A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030046143A1 (en) * | 2000-07-13 | 2003-03-06 | Kazuya Nakagawa | Workflow system |
| CN109658018A (en) * | 2017-10-10 | 2019-04-19 | 北京京东尚科信息技术有限公司 | The method and apparatus for improving storage outbound efficiency |
| CN109658017A (en) * | 2017-10-10 | 2019-04-19 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus of automatic picking |
| CN110111048A (en) * | 2019-04-29 | 2019-08-09 | 西安电子科技大学 | Order taking responsibility dispatching method in warehousing system |
| CN110223011A (en) * | 2019-05-22 | 2019-09-10 | 杭州海仓科技有限公司 | Intelligent storage equipment scheduling method, system, storage medium and electronic equipment |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114348585A (en) * | 2021-12-30 | 2022-04-15 | 重庆特斯联智慧科技股份有限公司 | Logistics robot system based on platform scheduling and control method thereof |
| CN114348585B (en) * | 2021-12-30 | 2024-04-09 | 重庆特斯联智慧科技股份有限公司 | Logistics robot system based on platform scheduling and control method thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111738654B (en) | Method, device, equipment and storage medium for generating picking task in-house delivery warehouse | |
| CN108846609A (en) | Picking method, device, server and medium based on order taking responsibility | |
| CN109772714A (en) | Cargo picking method and device, storage medium, electronic equipment | |
| CN107392543A (en) | Information processing method, data handling system, medium and computing device | |
| CN111950803A (en) | Logistics object delivery time prediction method and device, electronic equipment and storage medium | |
| CN112184115B (en) | Logistics early warning method, logistics recommendation method, device and related equipment | |
| Rafiei et al. | Reliable multi period multi product supply chain design with facility disruption | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| WO2022228133A1 (en) | Order picking task processing method and apparatus, and medium and electronic device | |
| CN115220882A (en) | Data processing method and device | |
| CN110689293B (en) | Article delivery processing method and device | |
| CN110163543B (en) | Delivery decision method and device and computer readable storage medium | |
| CN110705951A (en) | Method and device for scheduling warehouse commodities and electronic equipment | |
| CN113128821A (en) | Method and device for determining task | |
| CN116562770A (en) | Information sequence storage method, apparatus, electronic device, and computer readable medium | |
| CN111861323B (en) | Logistics information management method and device, storage medium and computer system | |
| CN112101690A (en) | Article sorting method and device | |
| CN112785212A (en) | Transportation equipment management method and device | |
| CN109118028B (en) | Logistics line management method, resource processing method, display method, equipment and system | |
| EP4318346A1 (en) | Warehouse order task processing method and apparatus, storage medium, and electronic device | |
| WO2022266827A1 (en) | Logistics network simulation method and system | |
| CN114997779A (en) | Storage processing method and device, electronic equipment and computer readable medium | |
| CN112278692B (en) | Warehouse processing method and device based on stereoscopic warehouse, equipment and medium | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN113222310B (en) | Goods picking productivity scheduling method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200117 |