Shuttle vehicle task allocation method and device, computer equipment, storage medium and program product

Abstract

The invention relates to a shuttle vehicle task allocation method and device, computer equipment, a storage medium and a program product, and relates to the technical field of tobacco manufacturing. The method comprises the following steps: constructing a stack according to the number of feeding platforms respectively included by at least two production lines of the tobacco production workshop; under the condition that any feeding platform receives the goods transported by the shuttle vehicle, according to the identification of the feeding platform, the stacking operation is executed; according to at least one of the content of the stack, the cargo condition of each production line and the emergency coefficient of each production line, determining a target popping mode from a plurality of popping modes; and according to the target out-of-stack mode, carrying out an out-of-stack operation on the target content of the stack, and scheduling the shuttle vehicle to transport goods to a feeding station corresponding to the target content. By adopting the method, the scheduling efficiency of the shuttle vehicle can be improved.

Description

Technical Field

[0001] The present application relates to the technical field of tobacco manufacturing, and in particular to a shuttle vehicle task allocation method, device, computer equipment, storage medium and program product. Background Art

[0002] In the task allocation method of the shuttle car in the related art, after the feeding platform receives the goods, the platform signal is set to have goods and the timing is started. After the goods are delivered to the feeding platform, the platform signal is set to no goods and the timing is reset. In the case that at least one of the multiple feeding platforms has goods, the timing time of the goods arriving at the platform is compared, and the platform number with the longest timing time is assigned to the shuttle car, that is, the application platform number is sent to the shuttle car according to the first-come-first-served principle. For the production of multiple production lines, this task allocation method is not suitable. If there is a feeding platform that is already blocked by goods, but the shuttle car gives priority to other platforms that are farther away from the location where the earliest application for feeding is made, the blocked platform will be unable to continue production, and there is a problem of low shuttle car transportation efficiency. This will cause the shuttle car to have a long waiting time for transporting goods and low transportation efficiency. Summary of the Invention

[0003] Based on this, it is necessary to provide a shuttle vehicle task allocation method, device, computer equipment, computer-readable storage medium and computer program product that can improve the efficiency of workshop cargo transportation in order to address the above technical problems.

[0004] In a first aspect, the present application provides a shuttle vehicle task allocation method, comprising:

[0005] A stack is constructed according to the number of feeding stations included in each of at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations;

[0006] When any feeding station receives the goods transported by the shuttle, a stacking operation is performed according to the identification of the feeding station; the identification types of the feeding stations of different production lines are different;

[0007] a target stacking method is determined from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods include stacking methods corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack by identifying the feeding station that was first stacked in the production line;

[0008] According to the target popping method, the target content of the stack is popped, and the shuttle vehicle is dispatched to transport the goods to the feeding platform corresponding to the target content.

[0009] In one embodiment, determining a target stacking method from a plurality of stacking methods based on at least one of the contents of the stack, the cargo status of each production line, and the urgency coefficient of each production line includes:

[0010] When the stack is not empty, determining a target stacking mode according to at least one of the cargo status of each production line and the urgency coefficient of each production line;

[0011] When the content of the stack is empty, or when the goods of all the production lines are in the condition that the first feeding station has goods, the target out-of-stack mode is determined to be not out-of-stack.

[0012] In one embodiment, determining the target out-of-stock mode based on at least one of the cargo situation of each production line and the urgency coefficient of each production line includes:

[0013] When the cargo situation of any production line is that the first feeding station is out of cargo, and the cargo situation of the other production lines is that the first feeding station has cargo, the target discharging method is determined to be the discharging method corresponding to any production line.

[0014] In one embodiment, the method further comprises:

[0015] When the cargo situation of all the production lines is that the first feeding station has no cargo, the emergency coefficient of each production line is calculated;

[0016] The production line with the highest urgency coefficient is used as the target production line, and the target stacking method is determined to be the stacking method corresponding to the target production line.

[0017] In one embodiment, the method further comprises:

[0018] When the urgency coefficients of the production lines are the same, the target out-of-stack method is determined to be the bottom out-of-stack method; the bottom out-stack method represents an operation method of out-of-stack the identifier of the feeding station that is first stacked in the stack.

[0019] In one embodiment, the expression for determining the emergency coefficient includes:

[0020]

[0021] in, , ;

[0022] in, represents the emergency coefficient of the i-th production line, represents the number of feeding stations of the i-th production line, Indicates the cargo situation of the j-th feeding station of the i-th production line, Indicates the set flow rate of the electronic flow scale of the i-th production line.

[0023] In a second aspect, the present application further provides a shuttle vehicle task allocation device, comprising:

[0024] A stack building module is used to build a stack according to the number of feeding stations included in at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations;

[0025] an identification stacking module, configured to execute a stacking operation according to the identification of any feeding station when any feeding station receives the goods transported by the shuttle vehicle; the identification types of the feeding stations of different production lines are different;

[0026] a stacking selection module for determining a target stacking method from a plurality of stacking methods based on at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods includes a stacking method corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack according to the identifier of the feeding station that first put the cargo into the stack of the production line;

[0027] The cargo dispatching module is used to perform a popping operation on the target content of the stack according to the target popping method, and dispatch the shuttle vehicle to transport the cargo to the feeding platform corresponding to the target content.

[0028] In a third aspect, the present application further provides a computer device comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0029] A stack is constructed according to the number of feeding stations included in each of at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations;

[0030] When any feeding station receives the goods transported by the shuttle, a stacking operation is performed according to the identification of the feeding station; the identification types of the feeding stations of different production lines are different;

[0031] a target stacking method is determined from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods include stacking methods corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack by identifying the feeding station that was first stacked in the production line;

[0032] According to the target popping method, the target content of the stack is popped, and the shuttle vehicle is dispatched to transport the goods to the feeding platform corresponding to the target content.

[0033] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0034] A stack is constructed according to the number of feeding stations included in each of at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations;

[0035] When any feeding station receives the goods transported by the shuttle, a stacking operation is performed according to the identification of the feeding station; the identification types of the feeding stations of different production lines are different;

[0036] a target stacking method is determined from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods include stacking methods corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack by identifying the feeding station that was first stacked in the production line;

[0037] According to the target popping method, the target content of the stack is popped, and the shuttle vehicle is dispatched to transport the goods to the feeding platform corresponding to the target content.

[0038] In a fifth aspect, the present application further provides a computer program product, comprising a computer program, which, when executed by a processor, implements the following steps:

[0039] A stack is constructed according to the number of feeding stations included in each of at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations;

[0040] When any feeding station receives the goods transported by the shuttle, a stacking operation is performed according to the identification of the feeding station; the identification types of the feeding stations of different production lines are different;

[0041] a target stacking method is determined from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods include stacking methods corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack by identifying the feeding station that was first stacked in the production line;

[0042] According to the target popping method, the target content of the stack is popped, and the shuttle vehicle is dispatched to transport the goods to the feeding platform corresponding to the target content.

[0043] The above-mentioned shuttle task allocation method, device, computer equipment, computer-readable storage medium and computer program product, the method constructs a stack according to the number of feeding stations respectively included in at least two production lines of the cigarette making workshop, and concentrates the feeding station identifications of the delivery tasks to be assigned in one structure, so as to facilitate unified scheduling and control; the production line includes at least one feeding station; the stack capacity is the number of feeding stations; when any feeding station receives the goods transported by the shuttle, the stacking operation is performed according to the identification of any feeding station; the identification types of the feeding stations of different production lines are different, which is convenient for distinguishing different production lines and realizing orderly scheduling; according to the content of the stack, each The system determines a target out-of-stack method from a variety of out-of-stack methods based on at least one of the cargo status of each production line and the urgency coefficient of each production line, thereby adapting to different production needs and emergency situations. The multiple out-of-stack methods include an out-of-stack method corresponding to each production line and a bottom out-of-stack method. The urgency coefficient is determined by the number of feeding stations on the production line, the cargo status of the feeding stations, and the flow rate set by the electronic flow scale of the production line. The out-of-stack method corresponding to each production line is to identify the feeding station that first entered the production line and then out of the stack. Based on the target out-of-stack method, the target content of the stack is out-of-stacked, and a shuttle is dispatched to transport the cargo to the feeding station corresponding to the target content. Combining stack entry and exit operations, cargo status, and urgency coefficients to perform target out-of-stack and cargo dispatch improves the overall dispatch intelligence level, rationally allocates shuttle resources, reduces waiting time, and improves dispatch efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the following briefly introduces the drawings required for use in the embodiments of the present application or related technical descriptions. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying any creative work.

[0045] Figure 1 It is a schematic diagram of the structure of a cigarette cutting production line in the related art;

[0046] Figure 2 This is a schematic diagram of the shuttle management system interface in the related art;

[0047] Figure 3 Schematic diagram of a flow chart of a shuttle vehicle task allocation method in one embodiment;

[0048] Figure 4 A schematic flow chart of a shuttle vehicle task allocation method according to another embodiment;

[0049] Figure 5 Schematic diagram of a process of a stacking operation in one embodiment;

[0050] Figure 6 Schematic diagram of a pop operation flow in one embodiment;

[0051] Figure 7 is a structural block diagram of a shuttle vehicle task allocation device in one embodiment;

[0052] Figure 8 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0053] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0054] As described in the background art, the shuttle task allocation method of the related art has the problem of low transportation efficiency. The inventors have found that the reason for this problem is that Figure 1 The figure shows a schematic diagram of the structure of a cigarette shred production line in the related art. The feeding process of the shred production line consists of an elevated warehouse, a stacker, a feeding platform (207-212), a shuttle, and a transport platform (A1A10, B1-B10). 207, 209, and 211 are the feeding platforms for Line A, 208, 210, and 212 are the feeding platforms for Line B, A1-A10 are the transport platforms for Line A, and B1-B10 are the transport platforms for Line B. The feeding platform, shuttle, and transport platform all have photoelectric detection switches to detect the presence of goods (1 for goods in hand, 0 for no goods). The task of the feeding process is to transport the finished cigarette boxes in the elevated warehouse to the unpacking process of Lines A and B for use in the downstream processes of both lines. The transport path involves two stackers transporting finished cigarette cases from the high-bay warehouse to the feeding station. The shuttle car then accepts the transport task and moves the cigarette cases from the feeding station to either A1 or B1. Once the transport station detects a signal indicating the presence of goods ("in stock" is 1), the cigarette cases on the current station are transported to the next station in sequence until they are transported to the unpacking process. This process is controlled by two Siemens PLCs. The line PLC (Programmable Logic Controller) controls the high-bay warehouse, stackers, feeding stations (207-212), and transport stations (A1-A10, B1-B10), while the shuttle car PLC controls the shuttle car. Figure 2As shown, a schematic diagram of the shuttle management system interface in the relevant technology is provided. In online mode, the information interface reflects the task data, position feedback and conveying logic interaction between the shuttle and the line control in real time. Among them, the information processing logic of the shuttle management system includes: the shuttle is in online mode, and the line is in automatic mode; the shuttle is in a state where the task is empty, the goods are empty, and there is no fault, and there is goods on at least one feeding station. The line PLC sends an application platform number, and the platform number address range is 207 to 212; the shuttle receives the application platform number and arrives at the application platform from the current position; after arriving at the application platform, the shuttle sends the arrival platform number to the line PLC, and sends the arrival platform information at the same time; the line PLC sends the conveyor ready, and the shuttle chain machine rotates to receive the goods; the shuttle completes receiving the goods (the goods are in place), and the shuttle sends a trolley signal of 1 (1 with goods, 0 without goods), and the conveyor goods in place signal to the line PLC, and clears the arrival platform number and arrival information at the same time. Arrival platform information; after the shuttle completes its cargo pickup task, the line PLC sends the destination platform number (delivery platforms 207, 209, and 211 have destination platform number A1, while delivery platforms 208, 210, and 212 have destination platform number B1). After receiving the destination platform number, the shuttle sends a destination address. The shuttle moves to the destination platform. If the destination platform is empty, the line PLC sends a "Conveyor Ready" signal, and the shuttle enters the "Delivery" state. If the destination platform is empty, the shuttle stops and waits for the "Conveyor Ready" signal. Once the line PLC completes cargo pickup, it sends a "Conveyor Cargo in Place" signal, and the shuttle clears all states (except for automatic mode and fault conditions), completing its task. This shows that in the related art, the shuttle's task allocation method (i.e., the line PLC sends a request platform number) is as follows: after the delivery platform receives the cargo, the platform signal is set to 1 and the timer starts. After the delivery platform has delivered the cargo, the platform signal is set to 0 and the timer is reset. When at least one of the 207-212 feeding platforms has goods, the arrival time of the goods at the platforms is compared, and the platform number with the longest time is assigned to the shuttle car, that is, the requested platform number is sent to the shuttle car according to the first-come-first-served principle. This task allocation method has the problem of low shuttle car transportation efficiency for the production of lines A and B, such as Figure 1 As shown, there is cargo at B1, and cargo 212 takes the longest time to arrive at the delivery platform. Therefore, the shuttle car will be assigned the task of receiving cargo 210. After receiving the cargo, the shuttle car will go to B1 platform and wait for the cargo signal of the destination platform to be empty. This will cause the shuttle car to wait for a long time to deliver cargo and low delivery efficiency. Secondly, there is a risk that the shuttle car will not deliver cargo in time, causing the downstream process to be cut off. Figure 1Under the production situation, there is no production task in the downstream process of Line B (the flow rate is not set for the DB1201 belt scale), and there are goods at B1-B10. At this time, the goods at a certain feeding station (208, 210, 212) of Line B arrive longer than those at the feeding stations (207, 209, 211) of Line A. The shuttle car will be given priority in assigning tasks to the feeding stations of Line B. At this time, Line A is in production (the flow rate is set for the DB1301 belt scale), and there are only goods at A09 and A10 of the delivery stations. The shuttle car cannot deliver the cigarette boxes to Line A in time, which will cause a quality accident of material shortage in Production Line A.

[0055] Based on the above reasons, the present application provides a shuttle task allocation method, which aims to improve the shuttle transportation efficiency and avoid material breakage accidents on the production line.

[0056] In one embodiment, Figure 3 As shown, a method for allocating shuttle tasks is provided. This embodiment uses the method applied to a system deployed on a server as an example. It is understandable that the method can also be applied to a terminal system, or to a system including a terminal and a server, and implemented through the interaction between the terminal and the server. In this embodiment, the method includes the following steps:

[0057] Step S302: construct a stack according to the number of feeding stations included in at least two production lines of the cigarette manufacturing workshop.

[0058] The tobacco production workshop can be the core area of ​​tobacco product production, encompassing multiple production lines and supporting equipment (such as feed stations and shuttles), serving as the physical space responsible for completing tobacco processing and packaging processes. A production line can be an independently operated assembly line unit within the tobacco production workshop, including at least one feed station. These units may involve tobacco slitting, rolling, and packaging, and each production line can operate in parallel. In this embodiment, these lines are primarily those involved in the tobacco production process. A production line includes at least one feed station; a feed station can be a material receiving node on the production line, receiving goods (such as raw materials and semi-finished products) transported by shuttles.

[0059] Among them, the stack can be a data structure that follows the last-in-first-out principle, which is used to dynamically record the goods receiving status of the feeding station. In this embodiment, the stack is used to record the identification of the feeding station that needs to deliver the goods; the capacity of the stack is the total number of feeding stations included in all production lines.

[0060] Optionally, the system counts the total number of feeding stations included in at least two production lines of the cigarette making workshop, and constructs a stack based on the total number of feeding stations as the capacity, which serves as the basis for subsequent task allocation of shuttle vehicles.

[0061] Step S304: When any feeding station receives the goods transported by the shuttle vehicle, a stacking operation is performed according to the identification of any feeding station.

[0062] Among them, the identification can be a unique identification symbol of the feeding station (such as a number, a QR code), which is used to distinguish different stations; among them, the identification types of the feeding stations of different production lines are different, and the identification type can be a coding rule for distinguishing the feeding stations of different production lines. For example, if a cigarette making workshop includes two production lines, the identification type of one of the production lines can be an odd number, and the identification type of the other production line can be an even number.

[0063] The stacking operation may be to record the identification of the feeding station into the stack, indicating that there is a corresponding delivery task for the feeding station.

[0064] Optionally, when any feeding station receives goods transported by a shuttle vehicle, it indicates that there will be a delivery demand for the feeding station in subsequent production, that is, there will be a corresponding delivery task for the feeding station in subsequent production. The system records the identification of the feeding station into the stack and completes the stacking operation as a prelude to subsequent task allocation.

[0065] Step S306 , determining a target stacking method from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each production line, and the urgency coefficient of each production line.

[0066] Among them, the popping method can be a strategy for removing elements from the stack; among them, the multiple popping methods include the popping methods corresponding to each production line and the bottom popping method; the popping method corresponding to each production line is to pop the identifier of the feeding station that is first pushed into the stack of the production line from the stack; for example, the identifier type of the feeding station of production line A is an odd number, and the identifier type of the feeding station of production line B is an even number. The popping method of production line A is odd popping, and the popping method of production line B is even popping. Specifically, odd popping is to pop the identifier that is recorded in the stack, pushed into the stack first, and has an odd identifier type; even popping is to pop the identifier that is recorded in the stack, pushed into the stack first, and has an even identifier type.

[0067] Among them, the urgency coefficient can be a dynamic parameter that quantifies the task distribution priority of the production line; the urgency coefficient is determined by the number of feeding stations of the production line, the cargo situation of the feeding stations of the production line and the flow rate set by the electronic flow scale of the production line.

[0068] Optionally, the system determines the target out-of-stack method from a plurality of out-of-stack methods based on at least one of the contents of the stack, the cargo status of each production line, and the urgency factor of each production line, such as based on only any one of the three items, or any two of the three items, or all three items. It should be noted that if the feeding station identifier corresponding to the target out-of-stack method is not recorded in the stack, for example, if the target out-of-stack method is odd out-of-stack, but there is no identifier of an odd identifier type in the stack, a signal indicating that the single-line condition is not met is sent to the technician, so that the technician can coordinate the task allocation operation.

[0069] Step S308: According to the target popping method, the target content of the stack is popped out, and a shuttle is dispatched to transport the goods to the feeding platform corresponding to the target content.

[0070] The stacking operation may be an operation of taking out the feeding station identifier corresponding to the stacking method from the stack according to the selected stacking method.

[0071] The target content may be an identifier of a feeding station recorded in the stack corresponding to the target popping mode.

[0072] Optionally, the system performs a popping operation on the identification of the delivery station to which the target content of the stack needs to be delivered according to the target popping method, generates a delivery task according to the identification of the delivery station to which the delivery needs to be delivered, and assigns it to the shuttle car, thereby dispatching the shuttle car to transport the goods to the delivery station corresponding to the target content.

[0073] In the above-mentioned shuttle task allocation method, the method constructs a stack according to the number of feeding stations respectively included in at least two production lines of the cigarette making workshop, and concentrates the feeding station identifications of the feeding stations to be assigned delivery tasks in one structure, which is convenient for unified scheduling and control; the production line includes at least one feeding station; the stack capacity is the number of feeding stations; when any feeding station receives goods transported by the shuttle, the stacking operation is performed according to the identification of any feeding station; the identification types of the feeding stations of different production lines are different, which is convenient for distinguishing different production lines and realizing orderly scheduling; according to the content of the stack, the goods situation of each production line and each At least one of the production line's urgency factors determines a target out-of-stack method from a variety of out-of-stack methods, adapting to varying production needs and emergency situations. These methods include a specific out-of-stack method for each production line and a bottom out-of-stack method. The urgency factor is determined by the number of feeding stations on the production line, the cargo status of the stations, and the flow rate set on the production line's electronic flow scale. The out-of-stack method for each production line is to identify the first feeding station that was stacked on the production line and then remove the cargo from the stack. Based on the target out-of-stack method, the target contents of the stack are removed, and a shuttle is dispatched to transport the cargo to the corresponding feeding station. By combining stack in-and-out operations, cargo status, and the urgency factor, the target contents are removed and cargo dispatched, improving the overall intelligent dispatching level, rationally allocating shuttle resources, reducing waiting time, and improving dispatching efficiency.

[0074] In an exemplary embodiment, step S306 determines a target stacking method from multiple stacking methods based on at least one of the contents of the stack, the cargo status of each production line, and the urgency coefficient of each production line, including:

[0075] When the contents of the stack are not empty, the target out-of-stack method is determined based on at least one of the cargo conditions of each production line and the urgency coefficient of each production line; when the contents of the stack are empty, or the cargo conditions of all production lines are that the first feeding station has cargo, the target out-of-stack method is determined to be no out-of-stack.

[0076] Among them, non-empty means that there is content recorded in the stack, and empty means that there is no content recorded in the stack, and the content is the identification of the feeding platform.

[0077] Optionally, when the contents of the stack are not empty, it indicates that there is currently a delivery demand at a feeding station. The system determines the production line with the highest delivery task priority based on the cargo situation of each production line and at least one of the urgency coefficients of each production line, and uses the corresponding out-of-stacking method of the production line as the target out-of-stacking method; when the contents of the stack are empty, or the cargo situation of all production lines is that the first feeding station has cargo, it indicates that there is currently no delivery demand at a feeding station, or the first feeding station of the current production line is still in production, which will cause the shuttle to wait for a long time, and therefore the target out-of-stacking method is determined to be no out-of-stacking.

[0078] In this embodiment, the most urgent lines are processed first, the waiting time is reduced, and unloading is avoided when there is no demand or the waiting time is too long, thereby improving the overall scheduling efficiency of the shuttle.

[0079] In an exemplary embodiment, the steps of the above embodiment determine the target out-of-stock method based on at least one of the cargo situation of each production line and the urgency coefficient of each production line, including:

[0080] When the cargo situation of any production line is that the first feeding station has no cargo, and the cargo situation of the other production lines is that the first feeding station has cargo, the target discharging method corresponding to any production line is determined.

[0081] Optionally, when the cargo situation of any production line is that there is no cargo at the first feeding station, and the cargo situation of the remaining production lines is that there is cargo at the first feeding station, it indicates that the first feeding station of the remaining production lines is still in production, which will cause the shuttle vehicle to wait for a long time. Therefore, the delivery priority of the production line with no cargo at the first feeding station is higher than that of other production lines. The system determines the corresponding out-stacking method of this production line as the target out-stacking method, and performs an out-stacking operation on the identifier of the first feeding station in the production line from the stack.

[0082] In this embodiment, the system uses the out-of-stock method of the production line with no goods at the first feeding station as the target out-of-stock method, avoiding the long waiting time of the shuttle vehicle and the secondary waiting caused by congestion of the supply of goods, thereby further improving the scheduling efficiency.

[0083] In an exemplary embodiment, the method described in the above embodiment further includes:

[0084] When the cargo situation of all production lines is that there is no cargo at the first feeding station, the urgency coefficient of each production line is calculated; the production line with the highest urgency coefficient is taken as the target production line, and the target out-of-stack method is determined to be the out-of-stack method corresponding to the target production line.

[0085] The expressions for determining the emergency coefficient include:

[0086]

[0087] in, , ;

[0088] in, represents the emergency coefficient of the i-th production line, represents the number of feeding stations of the i-th production line, Indicates the cargo situation of the jth feeding station of the i-th production line. 1, out of stock is 0, Indicates the set flow rate of the electronic flow scale of the i-th production line.

[0089] Optionally, when the cargo situation of all production lines is that there is no cargo at the first feeding station, the system calculates the urgency coefficient of each production line based on the number of feeding stations of each production line, the cargo situation of each feeding station and the flow rate set by the electronic flow scale, sorts the urgency coefficients of each production line, takes the production line with the highest urgency coefficient as the target production line, and determines the target out-of-stacking method as the out-of-stacking method corresponding to the target production line, and out-stacking the identifier of the feeding station that was first stacked for the target production line from the stack.

[0090] It should be noted that It represents the total number of feeding stations with no goods on the i-th production line. The more feeding stations with no goods, the higher the urgency coefficient, with the highest being 10 and the lowest being 0. It means that when the electronic flow scale of the i-th production line is set to have flow (the rated flow of the production section is 5000kg / h), the emergency coefficient is increased by 10 times. When the electronic flow scale is not set to have flow, the emergency coefficient remains unchanged. This piecewise function is convenient for PLC programming. Approximate replacement. It means that when the total number of feeding stations with goods on the i-th production line reaches 6, the emergency coefficient is reduced by 10 times, and when the total number of feeding stations with goods is less than 6, the emergency coefficient remains unchanged. This piecewise function is convenient for PLC program writing and can be used It is understandable that the total number 6 can be dynamically adjusted according to actual needs, and can also be other data.

[0091] In some embodiments, the above-mentioned urgency coefficient calculation formula uses the total number of empty stations at the current station as the basic coefficient of the urgency coefficient, and modifies the urgency coefficient based on whether the electronic belt scale has a set flow rate and whether the total number of empty stations has reached 6. When the electronic flow scales of two production lines are both set to flow rate or both have no set flow rate, the total number of empty feeding stations is compared. The higher the total number of empty feeding stations, the higher the urgency coefficient. When only one of the two production lines has a set flow rate, and the total number of empty feeding stations on the production line with the set flow rate is less than 6, the priority is determined by whether the electronic flow scale has a set flow rate, and the production line with the set flow rate always has a higher urgency coefficient than the other production line. When only one of the two production lines has a set flow rate, and the total number of empty feeding stations on the production line with the set flow rate reaches 6, the priority is no longer determined by whether the flow rate is set, and the total number of empty feeding stations on the production line with the set flow rate is directly compared. The production line with the higher total number of empty feeding stations has a higher urgency coefficient.

[0092] In this embodiment, when the first feeding stations of multiple production lines are all out of stock, the system intelligently allocates delivery tasks by dynamically calculating the urgency coefficient of each production line, which can prioritize ensuring that the running production lines are not interrupted, and dynamically adjust the delivery priority of each production line according to the total number of feeding stations without stock, the operating status and the total number of feeding stations with stock, which not only improves the accuracy of delivery task allocation, but also further improves scheduling efficiency.

[0093] In an exemplary embodiment, the method described in the above embodiment further includes:

[0094] When the urgency coefficients of the production lines are the same, the target stacking mode is determined to be the bottom stacking mode.

[0095] The bottom-out method represents an operation method of out-of-stack the identifier of the feeding station that is first put into the stack.

[0096] Optionally, when the urgency coefficients of the production lines are the same and the contents of the stack are not empty, the target popping method is determined to be the bottom popping method. Regardless of which production line the earliest stacked feeding station identifier belongs to, the earliest stacked feeding station identifier will be popped out.

[0097] In this embodiment, if we only rely on the corresponding stacking method of each production line, when the urgency of two production lines is the same, it may cause the feeding station task of a certain production line to not be processed for a long time. However, the bottom stacking operation can ensure that all feeding station tasks are polled fairly according to the application time, avoiding the indefinite delay of a certain production line task, thereby reducing the accumulation of goods at the feeding station caused by delayed task allocation.

[0098] In an exemplary embodiment, Figure 4As shown, another shuttle task allocation method is provided, including:

[0099] Step 1: Use a stack to manage the application station numbers (feeding station identifiers) for lines A and B, 207-212. Line A's application station numbers are odd numbers (identification type), while Line B's application station numbers are even numbers. The total number of stacks is the number of feeding stations. Design one stacking method and three stacking methods. When stacking, data is stored at the top of the stack. Stacking is performed in three ways: odd, even, and bottom popping. When the stack is not empty, the pop data is odd (207, 209, 211), that is, the pop data is prioritized to apply for the platform number of line A. If there is no odd number in the stack, a signal indicating that the stack does not meet the single-line condition is issued; when the stack is not empty, the pop data is even (208, 210, 212), that is, the pop data is prioritized to apply for the platform number of line B. If there is no even number in the stack, a signal indicating that the stack does not meet the single-line condition is issued; when the stack is not empty, the pop data is the bottom data, that is, the pop data is the data that was first pushed into the stack.

[0100] Step 2: When the goods are received at the feeding station, a stacking operation is performed. The line PLC sends an application platform number to the shuttle car for a stacking operation. Figure 5 As shown, a schematic diagram of the stack push operation process is provided. First, the stack is checked to see if it is full. If it is full, a stack push exception is issued. If it is not full, the requested station number is stored as an element at the top of the stack, and the stack pointer is moved up. The following is a program for stack design:

[0101] / / Stack reset area

[0102] REGION clear stack data / / stack reset

[0103] IF # Clear data THEN

[0104] FOR #i := 0 TO 5 DO

[0105] #stack[#i] := 0;

[0106] END_FOR;

[0107] END_IF;

[0108] END_REGION

[0109] / / Push operation area

[0110] REGION push stack / / Push into the stack

[0111] IF #Push onto the stack THEN

[0112] IF #stack pointer >= 5 THEN / / Judge whether the stack is full

[0113] #stack is full:= TRUE;

[0114] ELSE

[0115] / / Push the value to the top of the stack

[0116] #stack is full:= FALSE;

[0117] #stack[#stack pointer] := #stack value;

[0118] #Stack pointer += 1; / / Stack pointer moves up

[0119] END_IF;

[0120] END_IF;

[0121] END_REGION

[0122] / / Pop operation area

[0123] REGION pop stack / / Pop out

[0124] IF # platform application THEN

[0125] IF #stack pointer = 0 THEN / / Judge whether the stack is empty

[0126] #Pop stack is empty:= TRUE;

[0127] ELSE

[0128] #Pop stack is empty:= FALSE;

[0129] / / Odd pop

[0130] IF #odd pop THEN / / Judge the odd pop condition

[0131] #Pop pointer:= 0; / / Initialize the pop pointer

[0132] WHILE #Pop pointer <= #Push pointer DO / / Loop condition

[0133] IF #pop pointer = #push pointer THEN / / pop pointer has reached the top of the stack

[0134] #The single-line condition is not met in the stack: = TRUE; / / Return condition

[0135] EXIT; / / Exit the loop

[0136] ELSIF #stack[#pop pointer] MOD 2 <> 0 THEN / / determine parity

[0137] #Pop value:= #stack[#pop pointer]; / / Take out the odd number

[0138] / / The data above the stack pointer moves down in sequence

[0139] MOVE_BLK(IN := #stack[#push pointer - 1], COUNT := #push pointer - 1 - #pop pointer, OUT => #stack[#push pointer - 2]);

[0140] #stack[#push pointer] := 0;

[0141] #Stack pointer -= 1; / / Stack pointer moves down

[0142] EXIT;

[0143] END_IF;

[0144] #Pop stack pointer += 1;

[0145] END_WHILE;

[0146] / / Pop the stack

[0147] ELSIF #even pop THEN / / Determine the even pop condition

[0148] #Pop pointer:= 0; / / Initialize the pop pointer

[0149] WHILE #Pop pointer <= #Push pointer DO / / Loop condition

[0150] IF #pop pointer = #push pointer THEN / / The pop pointer has reached the top of the stack

[0151] #The single-line condition is not met in the stack: = TRUE; / / Return condition

[0152] EXIT; / / Exit the loop

[0153] ELSIF #stack[#pop pointer] MOD 2 = 0 THEN / / Determine parity

[0154] #Pop value:= #stack[#pop pointer]; / / Take out an even number

[0155] / / The data above the stack pointer moves down in sequence

[0156] MOVE_BLK(IN := #stack[#push pointer - 1], COUNT := #push pointer - 1 - #pop pointer, OUT => #stack[#push pointer - 2]);

[0157] #stack[#push pointer] := 0;

[0158] #Stack pointer -= 1; / / Stack pointer moves down

[0159] EXIT;

[0160] END_IF;

[0161] #Pop stack pointer += 1;

[0162] END_WHILE;

[0163] / / Pop the stack from the bottom

[0164] ELSIF #Bottom pop THEN / / Determine the bottom pop condition

[0165] #Pop pointer:= 0; / / Initialize the pop pointer

[0166] #Pop value:= #stack[#pop pointer]; / / Take out the data at the bottom of the stack (Note: the text in the image says "take out an even number", but the logic should be the data at the bottom of the stack)

[0167] / / The data above the stack pointer moves down in sequence

[0168] MOVE_BLK(IN := #stack[#push pointer - 1], COUNT := #push pointer - 1 - #pop pointer, OUT => #stack[#push pointer - 2]);

[0169] #stack[#push pointer] := 0;

[0170] #Stack pointer -= 1; / / Stack pointer moves down

[0171] END_IF; / / End pop conditional branch (odd / even / bottom)

[0172] END_IF; / / End empty stack check

[0173] END_IF; / / End platform application judgment

[0174] END_REGION

[0175] Step 3, such as Figure 6The figure shows a schematic diagram of the stacking operation process. When performing a stacking operation, the inventory status (cargo status) of the first feeding station of lines A and B is taken into consideration (A1 and B1 are 0 if they have inventory, and 0 if they do not). When A1 is out of stock but B1 is, an odd stacking operation is performed. When B1 is out of stock but A1 is, an even stacking operation is performed. When both A1 and B1 are in stock or the stack is empty, no stacking operation is performed. When performing a stacking operation, the urgency of the demand for goods on lines A and B is considered. The urgency coefficients EA and EB for lines A and B are set. When both A1 and B1 are out of stock, the urgency coefficients of lines A and B are compared. When the urgency coefficient of line A is greater than that of line B, an odd stacking operation is performed. When the urgency coefficient of line A is less than that of line B, an even stacking operation is performed. When the urgency coefficient of line A is equal to that of line B, a bottom stacking operation is performed.

[0176] For example, the code of the task allocation program is provided as follows:

[0177] / / Platform task judgment and stack control

[0178] IF ("Platform Information".Apply Platform = TRUE) THEN

[0179] / / Platform application + double line material request

[0180] "Odd Outlet" := ("Line A Platform Has Goods"=0) AND ("Line B Platform Has Goods"=0) AND ("Platform Information EA">"Platform Information") AND ("Single Line Condition"=0); / / Line A has priority in outlet

[0181] "Even out of stack" := ("Line A platform has goods"=0) AND ("Line B platform has goods"=0) AND ("Platform information EA"<"Platform information") AND ("Single line condition"=0); / / Line B has priority in outflow

[0182] "Bottom stack" := ("Line A platform has goods" = 0) AND ("Line B platform has goods" = 0) AND ("Platform information EA" = "Platform information") AND ("Single line condition" = 0); / / First come first out

[0183] "Bottom Out": = ("Single Line Condition" = 1); / / There is only one line of material in the stack

[0184] / / Platform application + single line material request

[0185] "Qi Chu Zhan" :=("Line A platform has goods"=0) AND ("Line B platform has goods"=1); / / Line A single line discharge

[0186] "Occasionally out of the stack" :=("Line A platform has goods"=1) AND ("Line B platform has goods"=0); / / Line B single line out

[0187] END_IF;

[0188] For example, the program code for the emergency coefficient design is provided as follows:

[0189] / / Area: Calculate the number of platforms with cargo on Line A

[0190] REGION Calculate the number of cargo stations on Line A

[0191] #Number of cargo on Line A platform PA := 0;

[0192] FOR #i := 1 TO 10 DO

[0193] IF "Platform Information". Line A platform has cargo [#i] THEN

[0194] #Number of cargo on Line A platform PA += 1;

[0195] END_IF;

[0196] END_FOR;

[0197] END_REGION

[0198] / / Area: Calculate the number of platforms with cargo on Line B

[0199] REGION Calculate the number of cargo stations on Line B

[0200] #Number of goods on Line B platform PB := 0;

[0201] FOR #i := 1 TO 10 DO

[0202] IF "Platform Information". Line B platform has goods_1[#i] THEN

[0203] #Number of cargo on Line B platform PB += 1;

[0204] END_IF;

[0205] END_FOR;

[0206] END_REGION

[0207] / / Area: Calculate the emergency coefficient

[0208] REGION Calculates the emergency factor

[0209] #Emergency coefficient EA := (#NA - #A-line platform cargo count PA)

[0210] * ((9 * ATAN("Station Information".DB1201 Set Flow - 2500) / 3.14) + 5.5)

[0211] / ((9 * ATAN(2500 * #A-Line platform cargo number PA - 13750) / 3.14) + 5.5);

[0212] #Emergency coefficient EB: = (#NB - #Number of goods on Line B platform PB)

[0213] * ((9 * ATAN("Station Information".DB1301 Set Flow - 2500) / 3.14) + 5.5)

[0214] / ((9 * ATAN(2500 * #B Line Platform Number of Cargo PB - 13750) / 3.14) + 5.5);

[0215] END_REGION

[0216] In this embodiment, a stack is used to manage shuttle bus application platform numbers. By designing three methods for removing the stack, the shuttle bus's task allocation is clarified, allowing the shuttle bus to be assigned different application platform numbers based on production conditions. This fully utilizes platform information to reduce the shuttle bus's waiting time after receiving goods. If the first delivery platform has goods, the shuttle bus will not be assigned a task to receive goods for that line, thereby improving the shuttle bus's receiving efficiency. By comparing the demand for goods from the two production lines in the feeding process, the supply of goods to the production line can be prioritized, eliminating untimely supply delays caused by irrational task allocation between the two lines and reducing quality accidents caused by material shortages in downstream processes due to the feeding process. This significantly improves the production efficiency of the two production lines in the feeding process. While ensuring timely supply of goods to the production lines, the supply quantity of goods to the two production lines is balanced, reducing the pressure on the feeding platform of the production line caused by only ensuring production on one line and the untimely supply of goods to the delivery platform of the other line. This maximizes the use of cargo resources upstream of the shuttle bus, balances the supply of goods to the feeding platforms of the two lines, and maximizes the efficiency of the two production lines in the feeding process.

[0217] It should be understood that, although the various steps in the flowcharts involved in the various embodiments described above are displayed in sequence according to the instructions of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowcharts involved in the various embodiments described above can include multiple steps or multiple stages, and these steps or stages are not necessarily executed and completed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0218] Based on the same inventive concept, embodiments of the present application also provide a shuttle task allocation device for implementing the aforementioned shuttle task allocation method. The solution provided by this device is similar to the solution described in the aforementioned method. Therefore, the specific limitations of one or more shuttle task allocation device embodiments provided below can be found in the above-described limitations of the shuttle task allocation method and will not be further elaborated here.

[0219] In an exemplary embodiment, Figure 7 As shown, a shuttle task allocation device 700 is provided, comprising: a stack construction module 701, a stack identification module 702, a stack selection module 703 and a cargo scheduling module 704, wherein:

[0220] The stack construction module 701 is used to construct a stack according to the number of feeding stations included in at least two production lines of the cigarette manufacturing workshop; a production line includes at least one feeding station; and the stack capacity is the number of feeding stations;

[0221] The identification stacking module 702 is used to perform a stacking operation according to the identification of any feeding station when any feeding station receives goods transported by the shuttle vehicle; the identification types of the feeding stations of different production lines are different;

[0222] The stacking selection module 703 is configured to determine a target stacking method from a plurality of stacking methods based on at least one of the contents of the stack, the cargo status of each production line, and the urgency factor of each production line. The plurality of stacking methods includes a stacking method corresponding to each production line and a bottom stacking method. The urgency factor is determined by the number of feeding stations of the production line, the cargo status of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line. The stacking method corresponding to each production line is to remove the material from the stack based on the identifier of the feeding station that first loaded the material into the production line.

[0223] The cargo dispatching module 704 is used to perform a popping operation on the target content of the stack according to the target popping method, and dispatch a shuttle vehicle to transport the cargo to the feeding platform corresponding to the target content.

[0224] Furthermore, in one embodiment, the stack popping selection module 703 is also used to determine the target stack popping method based on at least one of the cargo situation of each production line and the urgency coefficient of each production line when the content of the stack is not empty; when the content of the stack is empty, or the cargo situation of all production lines is that the first feeding station has cargo, the target stack popping method is determined to be no stack popping.

[0225] Furthermore, in one embodiment, the stacking selection module 703 is also used to determine the target stacking method as the stacking method corresponding to any production line when the cargo situation of any production line is that the first feeding station is out of stock, and the cargo situation of the other production lines is that the first feeding station has stock.

[0226] Furthermore, in one embodiment, the stacking selection module 703 is also used to calculate the urgency coefficient of each production line when the cargo situation of all production lines is that there is no cargo at the first feeding station; the production line with the highest urgency coefficient is used as the target production line, and the target stacking method is determined to be the stacking method corresponding to the target production line.

[0227] Furthermore, in one embodiment, the stacking selection module 703 is also used to determine that the target stacking method is the bottom stacking method when the urgency coefficients of each production line are the same; the bottom stacking method represents an operation method of stacking out the identifier of the feeding station that is first stacked in the stack.

[0228] Each module in the shuttle task allocation device 700 can be implemented in whole or in part through software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in the computer device in the form of software, so that the processor can call and execute the corresponding operations of each module.

[0229] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 8As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, abbreviated as I / O) and a communication interface. The processor, memory and input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store data such as the identification of the feeding station of each production line. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a shuttle task allocation method is implemented.

[0230] Those skilled in the art will understand that Figure 8 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0231] In one embodiment, a computer device is further provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps in the above method embodiments when executing the computer program.

[0232] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0233] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0234] Those skilled in the art will understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. In particular, any reference to memory, database, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The databases involved in the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the various embodiments provided herein may be, but are not limited to, general-purpose processors, central processing units (CPUs), graphics processing units (GPUs), digital signal processors (DSPs), programmable logic devices (PLDs), quantum computing-based data processing logic devices, artificial intelligence (AI) processors, and the like.

[0235] The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0236] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be determined by the appended claims.

Claims

1. A shuttle task allocation method, characterized in that: The method comprises: A stack is constructed according to the number of feeding stations included in each of at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations; When any feeding station receives the goods transported by the shuttle, a stacking operation is performed according to the identification of the feeding station; the identification types of the feeding stations of different production lines are different; a target stacking method is determined from a plurality of stacking methods according to at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods include stacking methods corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack by identifying the feeding station that was first stacked in the production line; According to the target popping method, the target content of the stack is popped, and the shuttle vehicle is dispatched to transport the goods to the feeding platform corresponding to the target content.

2. The method according to claim 1, characterized in that The method of determining a target stacking method from a plurality of stacking methods based on at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines includes: When the stack is not empty, determining a target stacking mode according to at least one of the cargo status of each production line and the urgency coefficient of each production line; When the content of the stack is empty, or when the goods of all the production lines are in the condition that the first feeding station has goods, the target out-of-stack mode is determined to be not out-of-stack.

3. The method according to claim 2, characterized in that The determining of the target stacking mode according to at least one of the cargo situation of each production line and the urgency coefficient of each production line includes: When the cargo situation of any production line is that the first feeding station is out of cargo, and the cargo situation of the other production lines is that the first feeding station has cargo, the target discharging method is determined to be the discharging method corresponding to any production line.

4. The method according to claim 3, characterized in that The method further comprises: When the cargo situation of all the production lines is that the first feeding station has no cargo, the emergency coefficient of each production line is calculated; The production line with the highest urgency coefficient is used as the target production line, and the target stacking method is determined to be the stacking method corresponding to the target production line.

5. The method according to claim 4, characterized in that The method further comprises: When the urgency coefficients of the production lines are the same, the target out-of-stack method is determined to be the bottom out-of-stack method; the bottom out-stack method represents an operation method of out-of-stack the identifier of the feeding station that is first stacked in the stack.

6. The method according to any one of claims 1 to 5, characterized in that The expression for determining the emergency coefficient includes: in, , ; in, represents the emergency coefficient of the i-th production line, represents the number of feeding stations of the i-th production line, Indicates the cargo situation of the j-th feeding station of the i-th production line, Indicates the set flow rate of the electronic flow scale of the i-th production line.

7. A shuttle task allocation device, characterized in that: The device comprises: A stack building module is used to build a stack according to the number of feeding stations included in at least two production lines of the cigarette manufacturing workshop; the production line includes at least one feeding station; the stack capacity is the number of feeding stations; an identification stacking module, configured to execute a stacking operation according to the identification of any feeding station when any feeding station receives the goods transported by the shuttle vehicle; the identification types of the feeding stations of different production lines are different; a stacking selection module for determining a target stacking method from a plurality of stacking methods based on at least one of the contents of the stack, the cargo conditions of each of the production lines, and the urgency coefficient of each of the production lines; the plurality of stacking methods includes a stacking method corresponding to each of the production lines and a bottom stacking method; the urgency coefficient is determined by the number of the feeding stations of the production line, the cargo conditions of the feeding stations of the production line, and the flow rate set by the electronic flow scale of the production line; the stacking method corresponding to each of the production lines is to remove the cargo from the stack according to the identifier of the feeding station that first put the cargo into the stack of the production line; The cargo dispatching module is used to perform a popping operation on the target content of the stack according to the target popping method, and dispatch the shuttle vehicle to transport the cargo to the feeding platform corresponding to the target content.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images