A carton cigarette sorting double-outlet dynamic scheduling method
Patent Information
- Application Number
- CN202410638792.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-22
- Publication Date
- 2026-10-16
- Estimated Expiration
- 2044-05-22
AI Technical Summary
[0013]为克服现有技术的不足,本发明提供了一种条烟分拣双出口动态调度方法,解决现有技术存在的流量不均衡、柔性不足、智能化程度低等问题
[0038] (1) This invention balances the flow rate of each branch line;
Smart Images

Figure CN118439246B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of tobacco logistics technology, specifically a dynamic scheduling method for sorting cigarette cartons with dual exits. Background Technology
[0002] The most important functions of a tobacco commercial logistics and distribution center mainly include warehousing and sorting. Among them, sorting has developed rapidly over the years, and the sorting speed of cigarette cartons has been greatly improved. From one-way sorting to two-way sorting, from single-line sorting to multi-line composite sorting, from sorting standard cigarettes and special-shaped cigarettes separately to sorting all categories together, various forms have emerged, all with the goal of improving sorting efficiency.
[0003] While the rapid increase in automation has led to improved sorting efficiency, it has also reduced system flexibility and fault tolerance. As sorting capacity increases, a single back-end packaging machine is insufficient (a single packaging machine typically processes 12,000-18,000 pieces per hour, while current sorting equipment generally processes 22,000-34,000 pieces per hour, thus requiring multiple machines, usually two). Therefore, multiple packaging machines are now sharing a single sorting exit, aiming to achieve speed matching through increased throughput.
[0004] Typically, one outlet corresponds to two packaging machines, and the switching of cigarette packs to branch lines is achieved through a swing arm.
[0005] Its work process is as follows:
[0006] 1) Orders from the sorting exit are alternately assigned to branch line 1 and branch line 2. For example, the previous order is assigned to branch line 1, and the next order is assigned to branch line 2. Cartons of cigarettes pass through the packaging machine, where they are packaged, wrapped in plastic film, and then passed through the labeling machine. The labeling machine's main function is to provide a detailed inventory list of the packaged cigarettes.
[0007] 2) The sorting system assigns a target address to each order, such as 1 representing branch line 1 and 2 representing branch line 2. When an order arrives at the swing arm position, it enters the corresponding branch line according to the target address.
[0008] 3) The labeling data and the branch line switching arm of the labeling machine are one-to-one and predefined to ensure that the incoming smoke is exactly the smoke required by the labeling machine.
[0009] Problems with existing technology:
[0010] 1) The problem of uneven traffic. We can see that orders are alternately sent to the top and bottom, which on the one hand ensures that the number of orders is evenly distributed, but ignores the difference in order size. In extreme cases, there may be a situation where one branch has a large number of orders and another branch has a very small number of orders.
[0011] 2) Insufficient flexibility. When a packaging machine or labeling machine malfunctions, the entire line may come to a standstill. According to the logic of alternating order delivery, if a downstream device (packaging machine, labeling machine) on a branch line fails, the main line orders will still be sent to the faulty branch line according to the fixed labeling orders. When the branch line's buffer is full, it will prevent another branch line from receiving smoke, thus causing the entire line to stop.
[0012] 3) Current solution: This mainly involves timely maintenance and increasing spare parts reserves to avoid prolonged downtime. However, this solution suffers from high labor costs, low efficiency, and low level of automation. Summary of the Invention
[0013] To overcome the shortcomings of existing technologies, this invention provides a dynamic scheduling method for dual-outlet cigarette sorting, which solves problems such as uneven flow, insufficient flexibility, and low level of intelligence in existing technologies.
[0014] The technical solution adopted by the present invention to solve the above problems is:
[0015] A dynamic scheduling method for dual-exit cigarette sorting is proposed, which enables the labeling machine to have a complete set of orders. By determining the destination of the orders at the diversion location, the method retrieves the order information after diversion from the order set, thus transforming fixed order scheduling into dynamic order scheduling.
[0016] As a preferred technical solution, the quantity of cigarettes in each branch line is dynamically balanced by the number of orders and the remaining quantity of cigarettes in each branch line.
[0017] As a preferred technical solution, mainline order X i After passing through the diversion point, the number of cigarettes is included in the cigarette balance of the branch line. Each time the packaging machine finishes packaging a cigarette, one cigarette is deducted from the cigarette balance.
[0018] As a preferred technical solution, mainline order X i After the distribution point is determined, the remaining number of corresponding branch line orders increases by 1. For each order completed by the packaging machine, the remaining number of corresponding branch line orders decreases by 1.
[0019] As a preferred technical solution, mainline order X i Upon reaching the distribution point, the destination of the orders is determined based on the current number of orders and the remaining quantity of cigarettes on each branch line. The determination is based on the following criteria:
[0020]
[0021]
[0022] Where, δ a The determinant δ represents the factor indicating the presence of equipment failure in branch 1. brepresents the certainty factor for determining that a device fault exists in branch line 2.
[0023] As a preferred technical solution, when δ a |δ b =1, the order destination is:
[0024] If δ a =1, main line order X i goes to branch line 2;
[0025] If δ b =1, main line order X i goes to branch line 1.
[0026] As a preferred technical solution, when δ a &δ b =0 and both branch lines have available capacity, the order destination is:
[0027] If Y<Z, main line order X i goes to branch line 1;
[0028] If Y>Z, main line order X i goes to branch line 2;
[0029] If Y=Z&P≤Q+(M-N), main line order X i goes to branch line 1;
[0030] If none of the above conditions are met, main line order X i goes to branch line 2;
[0031] where Y denotes the current remaining number of orders for branch line 1, Z denotes the current remaining number of orders for branch line 2, P denotes the current remaining number of cigarette packs for branch line 1, Q denotes the current remaining number of cigarette packs for branch line 2, M denotes the maximum buffered number of cigarette packs for branch line 1, and N denotes the maximum buffered number of cigarette packs for branch line 2.
[0032] As a preferred technical solution, when δ a &δ b =0 and branch line 2 has available capacity, the order destination is:
[0033] Main line order X i goes to branch line 2.
[0034] As a preferred technical solution, when δ a &δ b =0 and branch line 1 has available capacity, the order destination is:
[0035] Main line order X i goes to branch line 1.
[0036] As a preferred technical solution, when δ a &δb When the main line has zero capacity and both branches have no capacity, the main line is paused.
[0037] Compared with the prior art, the present invention has the following advantages:
[0038] (1) This invention balances the flow rate of each branch line;
[0039] (2) This invention improves the flexibility and fault tolerance of the sorting system;
[0040] (3) This invention reduces labor costs, improves sorting efficiency, and enhances the level of intelligence. Attached Figure Description
[0041] Figure 1 This is a schematic diagram of a dual-branch cigarette sorting line. Detailed Implementation
[0042] The present invention will be further described in detail below with reference to the embodiments and accompanying drawings, but the embodiments of the present invention are not limited thereto.
[0043] Example 1
[0044] like Figure 1 As shown, this invention provides a new solution: dynamic order scheduling.
[0045] Overall approach:
[0046] like Figure 1 As shown, the labeling machine has a complete set of orders. By determining the destination of orders at the swing position, it retrieves the diverted order information from the order set, transforming fixed orders into dynamic orders. Simultaneously, it dynamically balances the operations of each branch line based on the number of orders and the remaining quantity of cigarette packs.
[0047] Specifically:
[0048] 1) Assumption:
[0049] a) Branch line 1 and branch line 2 have maximum buffer cigarette capacity of M and N respectively, which is determined by the length of the branch line;
[0050] b) The current remaining quantity of cigarettes on branch lines 1 and 2 is divided into P and Q cartons, initialized to 0. After an order is placed, the quantity can be included in the remaining quantity. Each time the packaging machine completes packaging, the corresponding packaging quantity is deducted from the remaining quantity (each packaging is calculated as one pack; for example, if an order has 35 cartons, it will be divided into two packs, one pack of 30 cartons and one pack of 5 cartons, or one pack of 15 cartons and one pack of 20 cartons, depending on the packaging strategy; the remaining quantity is deducted based on the quantity of one pack).
[0051] c) The current remaining order quantities of Branch Line 1 and Branch Line 2 are Y and Z respectively, which are initialized to 0. After an order passes through the swing belt, the remaining order quantity of the corresponding branch line is increased by 1; each time the packaging machine completes one order, the remaining order quantity is decreased by 1;
[0052] 2) The C labeling machine and the D labeling machine have the same order set X (the full set, including all orders), and no longer only have partial orders;
[0053] 3) Main line order X i When reaching the swing diverting position, judge Q, P, Y and Z to determine the destination;
[0054]
[0055]
[0056] includes the following situations:
[0057] a) The branch line and its associated packaging equipment (the associated packaging equipment includes: packaging machine, labeling machine) are faulty (δ a |δ b =1);
[0058] If δ a =1, order X i goes to Branch Line 2;
[0059] If δ b =1, order X i goes to Branch Line 1;
[0060] b) The branch line and its associated packaging equipment (the associated packaging equipment includes: packaging machine, labeling machine) are normal (δ a &δ b =0);
[0061] Situation 1: Both directions have available capacity, and the destination is determined according to the order quantity (P≤0.9M&Q≤0.9N);
[0062] If Y<Z, order X i goes to Branch Line 1;
[0063] If Y>Z, order X i goes to Branch Line 2;
[0064] If Y=Z&P≤Q+(M-N), order X i goes to Branch Line 1;
[0065] If none of the above conditions are met, order X i goes to Branch Line 2;
[0066] Situation 2: Branch Line 2 has available capacity (P>0.9M&Q≤0.9N);
[0067] Order X i Go to side quest 2;
[0068] Case 3: Branch line 1 has capacity (P≤0.9M&Q>0.9N);
[0069] Order X i Go to side quest 1;
[0070] Scenario 4: Neither has capacity (P>0.9M&Q>0.9N)
[0071] Main storyline paused;
[0072] 4) After confirming order X i After the direction is determined, the order quantity is given to the packaging machine, and the order number is given to the labeling machine. The packaging machine stores the data in a queue, following a first-in, first-out (FIFO) principle. More specifically, for example:
[0073] After receiving the order quantity (the quantity of one order, such as 35 items), the packaging machine stores it in a queue and places it at the end of the queue. As more and more orders come in (and continue to be placed at the end of the queue), the quantity of the first order that the packaging machine is currently packaging (the head of the queue) is popped out when the packaging machine finishes packaging the first order. The labeling machine retrieves the corresponding order information from the order set X based on the given order number and creates a new labeling task queue.
[0074] As described above, the present invention can be implemented well.
[0075] All features disclosed in all embodiments of this specification, or steps in all methods or processes implied in the disclosure, may be combined and / or extended or replaced in any way, except for mutually exclusive features and / or steps.
[0076] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention in any way. Based on the technical essence of the present invention, any simple modifications, equivalent substitutions, and improvements made to the above embodiments within the spirit and principles of the present invention shall still fall within the protection scope of the present invention.
Claims
1. A dynamic scheduling method for dual-outlet sorting of cigarette packs, characterized in that, Includes the following steps The labeling machine has a complete set of orders. By determining the destination of the orders at the diversion point, the order information after diversion is retrieved from the order set, and the fixed order scheduling is transformed into dynamic order scheduling. The quantity of cigarettes in each branch line is dynamically balanced by the number of orders and the remaining quantity of cigarettes in each branch line. Mainline orders After passing through the diversion position, the number of cigarettes is included in the cigarette balance of the branch line. After the packaging machine finishes packaging one pack of cigarettes, one pack of cigarettes is deducted from the cigarette balance. Mainline orders After the distribution point is determined, the remaining number of corresponding branch line orders increases by 1. For each order completed by the packaging machine, the remaining number of corresponding branch line orders decreases by 1. When a main line order arrives at the distribution point, the order destination is determined based on the current number of orders and the remaining amount of cigarettes on each branch line.
2. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 1, characterized in that, Mainline orders Upon reaching the distribution point, the destination of the orders is determined based on the current number of orders and the remaining quantity of cigarettes on each branch line. The determination is based on the following criteria: in, This indicates that a device malfunction exists in branch 1. This indicates the determinant that a device malfunction exists in branch 2.
3. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 2, characterized in that, when At that time, the order destination was: if =1, Mainline Order Go to side quest 2; if =1, Mainline Order Go to side quest 1.
4. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 2, characterized in that, when When both branches have available capacity, the order destination is as follows: if Mainline orders Go to side quest 1; if Mainline orders Go to side quest 2; If Y=Z& Mainline orders Go to side quest 1; If none of the above conditions are met, the main line order Go to side quest 2; in, This indicates the current remaining number of orders for branch line 1. This indicates the current remaining number of orders for branch line 2. This indicates the current remaining amount of cigarettes in branch line 1. This indicates the current remaining amount of cigarettes in branch line 2. This indicates the maximum amount of smoke in the buffer bar for branch 1. This indicates the maximum amount of smoke in the buffer bar for branch 2.
5. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 2, characterized in that, when And when branch line 2 has capacity, the order destination is: Mainline orders Go to side quest 2.
6. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 2, characterized in that, when And when branch line 1 has capacity, the order destination is: Mainline orders Go to side quest 1.
7. The dynamic scheduling method for dual-outlet cigarette sorting according to claim 2, characterized in that, when When both branch lines have no capacity, the main line is paused.
Citation Information
Patent Citations
Packing and separating conveying device for cigarette finished products
CN108860753A
Method and device for logistics object selection, method and device for determining logistics line overload, and apparatus
CN109214732A
Soft cotton towel conveying channel sectional control system and control method thereof
CN112644783A