An optimized task execution queue method for cigarette sorting scheduling

Abstract

The present invention discloses a method for optimizing task execution queues for cigarette sorting and scheduling, which is characterized by comprising the following steps: S1: generating a sorting order according to the cross-generated sorting order of two outlets of the sorting line, re-ordering the sorting task list, and generating a new sorting task list; S2: merging small orders according to the new sorting task list, and each merged small order and single brand does not exceed a preset value, and optimizing the sorting task execution order of each sub-line. The present invention re-optimizes the execution order of the execution tasks of each sub-line by merging small orders, reducing the frequent swing of the outlet, and improving the sorting capacity, thereby realizing flexible cigarette sorting and scheduling.

Description

Technical Field

[0001] The invention relates to the field of cigarette sorting, and in particular to an optimized task execution queue method for cigarette sorting scheduling. Background Art

[0002] In my country's tobacco industry, according to the requirements of the Tobacco Monopoly Law, commercial retail distribution of cigarettes is the only legal way for cigarettes to flow from factories to retailers. With the continuous integration and optimization of the tobacco industry's operational needs, cigarette distribution centers have become an important part of the tobacco supply chain. The cigarette distribution center operation system generally consists of three parts, namely warehousing, stocking and sorting. With the improvement of the quality of tobacco market operations and the continuous changes in marketing strategies, it is inevitable that sales orders in different geographical regions, different distribution routes, and different time periods and seasons will have greater differences in characteristics, and the brands and order quantities of ordered cigarettes will fluctuate greatly; order fluctuations will have a greater impact on the sorting operation of the distribution center, and put forward higher requirements for the system's scheduling strategy.

[0003] In the cigarette distribution center, the traditional operation mode is the channel fixed material mode, that is, the sorting channel is fixed to store and sort a certain brand of cigarettes. The channel brand is set by the operator before the operation begins. The operator makes a setting decision based on experience to determine which brand the channel is set to. In the early stage of the system, this mode can basically meet the needs of fast sorting of sales orders. However, with the adjustment of marketing strategies, the structural changes of sales orders are frequent, and the disadvantages of the fixed brand cigarette mode of sorting channels have gradually emerged and continued to deepen. Faced with different orders corresponding to the time and geographical space dimensions, the resource allocation of the sorting system often presents a high demand and low configuration bottleneck, low demand and high configuration waste scenario, the system resource utilization rate is greatly reduced, and the system operation capacity is unstable and unbalanced; and the operator makes manual adjustments based on experience. Due to factors such as the need to manually adjust the physical materials in the channel from the automated equipment, the adjustment time is long, the labor cost is high, and it is complex and inefficient, and unsustainable.

[0004] In order to achieve flexible, green and efficient sales and distribution of tobacco distribution centers, cigarette sorting scheduling needs to flexibly adapt to the changes and fluctuations of orders, and automatically adjust and correct the allocation of operating resources, so that the system can achieve ideal sorting capacity and operating results. In the task execution of flexible cigarette sorting scheduling, due to orders with a small number of cigarettes, after the order is split, small order tasks are generated due to uneven brand distribution; and each order requires order spacing, which will make the total order queue length on the conveyor belt longer, and the number of cigarettes per unit time will be reduced, thereby reducing the sorting capacity of the sub-line. Therefore, a method for optimizing the task execution queue is needed to merge flexible small orders. Summary of the invention

[0005] The purpose of the present invention is to provide a method for optimizing task execution queues for cigarette sorting scheduling in response to the above-mentioned problems, by merging small orders, reducing task spacing, and reducing frequent outlet swings, and re-optimizing the execution order of execution tasks for each sub-line to improve the sorting capacity.

[0006] The technical solution of the present invention is as follows:

[0007] The present invention provides a method for optimizing task execution queues for cigarette sorting and scheduling, comprising the following steps:

[0008] S1: Rearrange the sorting task list according to the sorting order generated by the two exits of the sorting line to generate a new sorting task list;

[0009] S2: According to the new sorting task list, small orders are merged, and each merged small order and single brand does not exceed the preset value, and the sorting task execution order of each sub-line is optimized.

[0010] Furthermore, the specific step S1 includes:

[0011] S10: Get the total number of all export task rows JobCount; set the task sequence maxSortSeq = 1;

[0012] S11: Determine whether the task sequence number maxSortSeq is greater than JobCount;

[0013] S12: If it is greater than JobCount, the sorting is terminated; if it is less than or equal to JobCount, the task queue row number of each exit is set to currCount = 0;

[0014] S13: alternately loop to obtain the exit;

[0015] S14: Determine whether currCount is greater than the maximum number of rows in the task list; if so, return to S13;

[0016] S15: If it is less than or equal to the maximum number of rows in the task list, set the task execution order of the currCountth row in the task list = maxSortSeq;

[0017] S16: maxSortSeq=maxSortSeq+1, currCount=currCount+1;

[0018] S17: End sorting.

[0019] Furthermore, the specific steps of S2 include:

[0020] S20: Obtain a list of sub-lines corresponding to the main line according to the sorting line;

[0021] S21: Determine whether all sub-line lists have been cycled once; if they have been cycled once, end the optimization;

[0022] S22: If not, obtain the sorting task list corresponding to the sub-lines whose sorting sequence numbers are greater than 0 and whose small order merging flags are less than 0;

[0023] S23: Determine whether there is a value in the task list; if there is no value, return to S21;

[0024] S24: If there is a value, set the current combined quantity TOTALQTY = the total quantity of the first task;

[0025] S25: Get the current exit of this task, and sequentially get the tasks in the task list of the exit;

[0026] S26: TOTALQTY = TOTALQTY + total amount of export tasks;

[0027] S27: Determine whether TOTALQTY is less than 50 and the total amount of one export task is less than or equal to 22; if not, go to S29;

[0028] S28: If yes, set the merge flag of the two tasks = 1;

[0029] S29: Set the merge flag of the two tasks to 2; and return to S22.

[0030] Furthermore, the task scheduling method in the sorting task list is:

[0031] Step S31: setting the correspondence between the delivery routes and the sorting line outlets, the delivery routes are evenly divided on the sorting outlets, and one delivery route is assigned a unique sorting outlet;

[0032] Step S32: according to the sorting line structure and the corresponding export relationship list of the delivery line, each order on each delivery line is split to form a channel allocation;

[0033] Step S33: According to the sorting line structure and the corresponding channel allocation of the delivery line, each order on each delivery line is split into sorting tasks.

[0034] Furthermore, the distribution line-to-export relationship list is a sorting outlet distribution line allocation table, including the correspondence between line codes, line sorting volumes, outlets, outlet sorting volumes, and the number of outlet lines.

[0035] Furthermore, the channel allocation quantity corresponding to the distribution line is obtained through the flexible sorting channel sorting quantity allocation table; the flexible sorting channel sorting quantity allocation table includes line code, sorting outlet, sorting brand, order quantity, fixed unit number, fixed sorting quantity, flexible unit number, flexible channel, and flexible sorting quantity.

[0036] Furthermore, the method for allocating the sorting amount of the flexible sorting channel includes:

[0037] S41: Perform EIQ analysis on the orders to be sorted, and obtain the total order quantity, total number of orders, average order quantity per order, and number of order brands for each distribution route; obtain the order frequency, total order quantity, order quantity proportion, order quantity ranking, average order quantity per order per brand, and order coverage rate of the order brands involved in each distribution route; and obtain the fixed channel number of each brand according to the sorting channel allocation result;

[0038] S42: Set flexible channel allocation parameters: define the upper limit of the number of flexible channels for a single brand, which is used to constrain the upper limit of the number of flexible channels allocated to a single brand in a single distribution route; define the minimum allocation quantity for flexible sorting, which is the minimum value of the sorting quantity allocated to the flexible channel sorting in a single distribution route;

[0039] S43: According to the above two steps, as well as the fixed channel assignment and the flexible channel assignment, the sorting quantity of the flexible sorting channel corresponding to the delivery route is allocated.

[0040] Furthermore, when fixed channels are assigned, each sorting brand must have at least one fixed channel; when flexible channels are assigned, the flexible channels are configured with sub-lines.

[0041] In summary, due to the adoption of the above technical solution, the beneficial effects of the present invention are:

[0042] 1. The present invention combines small orders, reduces task spacing, and reduces frequent export swings.

[0043] 2. The present invention optimizes the task execution queue and realizes flexible sorting scheduling by setting dynamic outlets, cross-sorting between two outlets of the sorting line, and merging small orders.

[0044] 3. The present invention improves the sorting efficiency by 7%-10%. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The present invention will now be described by way of example with reference to the accompanying drawings, in which:

[0046] Figure 1 The present invention is a flow chart of a method for optimizing task execution queues for cigarette sorting and scheduling.

[0047] Figure 2 This is a flowchart of task number generation in the embodiment.

[0048] Figure 3 This is a flow chart for optimizing the execution order of sorting tasks in an embodiment.

[0049] Figure 4 Flow chart of the scheduling method of sorting tasks in the embodiment.

[0050] Figure 5 It is a flow chart of the method for allocating sorting quantity for flexible sorting channels in the embodiment. DETAILED DESCRIPTION

[0051] All features disclosed in this specification, or steps in all methods or processes disclosed, except mutually exclusive features and / or steps, can be combined in any manner.

[0052] Any feature disclosed in this specification (including any additional claims and abstract), unless otherwise stated, may be replaced by other equivalent or alternative features having similar purposes. That is, unless otherwise stated, each feature is only an example of a series of equivalent or similar features.

[0053] The features and performance of the present invention are further described in detail below in conjunction with the embodiments.

[0054] like Figure 1 As shown, the present invention discloses a method for optimizing task execution queues for cigarette sorting scheduling, comprising the following steps: S1: generating a sorting order according to the cross of two exits of a sorting line, re-arranging the sorting task list, and generating a new sorting task list;

[0055] S2: According to the new sorting task list, small orders are merged, and each merged small order and single brand does not exceed the preset value, and the sorting task execution order of each sub-line is optimized.

[0056] like Figure 2 As shown, the method for generating the task sequence number in S1 includes:

[0057] S10: Get the total number of all export task rows JobCount; set the task sequence maxSortSeq = 1;

[0058] S11: Determine whether the task sequence number maxSortSeq is greater than JobCount;

[0059] S12: If it is greater than JobCount, the sorting is terminated; if it is less than or equal to JobCount, the task queue row number of each exit is set to currCount = 0;

[0060] S13: alternately loop to obtain the exit;

[0061] S14: Determine whether currCount is greater than the maximum number of rows in the task list; if so, return to S13;

[0062] S15: If it is less than or equal to the maximum number of rows in the task list, set the task execution order of the currCountth row in the task list = maxSortSeq;

[0063] S16: maxSortSeq=maxSortSeq+1, currCount=currCount+1;

[0064] S17: End sorting.

[0065] Table 1 Flexible sorting task result table [TASKLIST] is the sorting task list in the embodiment. According to the sorting task list, the sorting sequence is generated by the cross-generation of the two exits of the sorting line, and a new sorting task list is regenerated.

[0066]

[0067]

[0068] like Figure 3 The method for optimizing the execution order of sorting tasks is shown. In the embodiment, according to the sorting task list generated by S1, each sub-line is calculated separately, and each merged small order does not exceed 50 items and a single brand does not exceed 20 items, and the sorting execution order of each sub-line is independently generated. The method for optimizing the execution order of sorting tasks specifically includes:

[0069] S20: Obtain a list of sub-lines corresponding to the main line according to the sorting line;

[0070] S21: Determine whether all sub-line lists have been cycled once; if they have been cycled once, end the optimization;

[0071] S22: If not, obtain the sorting task list corresponding to the sub-lines whose sorting sequence numbers are greater than 0 and whose small order merging flags are less than 0;

[0072] S23: Determine whether there is a value in the task list; if there is no value, return to S21;

[0073] S24: If there is a value, set the current combined quantity TOTALQTY = the total quantity of the first task;

[0074] S25: Get the current exit of this task, and sequentially get the tasks in the task list of the exit;

[0075] S26: TOTALQTY = TOTALQTY + total amount of export tasks;

[0076] S27: Determine whether TOTALQTY is less than 50 and the total amount of one export task is less than or equal to 22; if not, go to S29;

[0077] S28: If yes, set the merge flag of the two tasks = 1;

[0078] S29: Set the merge flag of the two tasks to 2; and return to S22.

[0079] like Figure 4 As shown, in an embodiment, the task scheduling method in the sorting task list specifically includes:

[0080] S31: setting the corresponding relationship between the delivery routes and the sorting line outlets, the delivery routes are evenly divided on the sorting outlets, and one delivery route is assigned a unique sorting outlet;

[0081] S32: According to the sorting line structure and the corresponding export relationship list of the delivery line, each order on each delivery line is split to form a channel allocation;

[0082] S33: According to the sorting line structure and the corresponding channel allocation of the delivery line, each order on each delivery line is split into sorting tasks.

[0083] Table 2 The distribution line corresponding to the export relationship list is the sorting export distribution line allocation table, including line code, line sorting volume, export, export sorting volume, and number of export lines.

[0084]

[0085]

[0086] Table 3 is a flexible sorting channel sorting quantity allocation table. The flexible sorting channel sorting quantity allocation table is used to obtain the channel allocation quantity corresponding to the distribution line; the flexible sorting channel sorting quantity allocation table includes line code, sorting outlet, sorting brand, order quantity, fixed unit number, fixed sorting quantity, flexible unit number, flexible channel, and flexible sorting quantity.

[0087]

[0088] like Figure 5 As shown, in an embodiment, the method for allocating the sorting amount of the flexible sorting channel includes:

[0089] S41: Perform EIQ analysis on the orders to be sorted, and obtain the total order quantity, total number of orders, average order quantity per order, and number of order brands for each distribution route; obtain the order frequency, total order quantity, order quantity proportion, order quantity ranking, average order quantity per order per brand, and order coverage rate of the order brands involved in each distribution route; and obtain the fixed channel number of each brand according to the sorting channel allocation result;

[0090] S42: Set flexible channel allocation parameters: define the upper limit of the number of flexible channels for a single brand, which is used to constrain the upper limit of the number of flexible channels allocated to a single brand in a single distribution route; define the minimum allocation quantity for flexible sorting, which is the minimum value of the sorting quantity allocated to the flexible channel sorting in a single distribution route;

[0091] S43: According to the above two steps, as well as the fixed channel assignment and the flexible channel assignment, the sorting quantity of the flexible sorting channel corresponding to the delivery route is allocated.

[0092] In the embodiment, in configuring the sorting line channel, the flexible channel and the fixed channel are processed separately: according to the fact that each sorting brand must have at least one fixed channel, the fixed channel is configured with its sorting materials; according to the fact that the flexible channel corresponds to the sorting sub-line, the flexible channel is configured with a list of flexible channels corresponding to the sub-line. For the flexible channel, it is included in the flexible channel list, and the principle of selecting the flexible channel is configured for each sub-line, so that the scheduling strategy in the subsequent steps can dynamically balance the sorting volume of the sub-line.

[0093] The above-mentioned embodiments only express the specific implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the protection scope of the present application. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the technical solution concept of the present application, and these all belong to the protection scope of the present application.

Claims

1. A method for optimizing task execution queues for cigarette sorting scheduling, characterized in that: The following steps are involved: S1: Rearrange the sorting task list according to the sorting order generated by the two exits of the sorting line to generate a new sorting task list; S2: According to the new sorting task list, small orders are merged, and each merged small order and single brand does not exceed the preset value, and the sorting task execution order of each sub-line is optimized; The specific steps of S1 include: S10: Get the total number of all export task rows, JobCount; Set the task sequence number maxSortSeq = 1; S11: Determine whether the task sequence number maxSortSeq is greater than JobCount; S12: If it is greater than JobCount, the sorting is terminated; if it is less than or equal to JobCount, the task queue row number of each exit is set to currCount = 0; S13: alternately loop to obtain the exit; S14: Determine whether currCount is greater than the maximum number of rows in the task list; if so, return to S13; S15: If it is less than or equal to the maximum number of rows in the task list, set the task execution order of the currCountth row in the task list = maxSortSeq; S16: maxSortSeq=maxSortSeq+1, currCount=currCount+1; S17: End sorting.

2. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 1 is characterized in that: The specific steps of S2 include: S20: Obtain a list of sub-lines corresponding to the main line according to the sorting line; S21: Determine whether all sub-line lists have been cycled once; if they have been cycled once, end the optimization; S22: If not, obtain the sorting task list corresponding to the sub-lines whose sorting sequence numbers are greater than 0 and whose small order merging flags are less than 0; S23: Determine whether there is a value in the task list; if there is no value, return to S21; S24: If there is a value, set the current combined quantity TOTALQTY = the total quantity of the first task; S25: Get the current exit of this task, and sequentially get the tasks in the task list of the exit; S26: TOTALQTY = TOTALQTY + total amount of export tasks; S27: Determine whether TOTALQTY is less than 50 and the total amount of one export task is less than or equal to 22; if not, go to S29; S28: If yes, set the merge flag of the two tasks = 1; S29: Set the merge flag of the two tasks to 2; and return to S22.

3. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 1, characterized in that: Task scheduling method in the sorting task list: Step S31: setting the correspondence between the delivery routes and the sorting line outlets, the delivery routes are evenly divided on the sorting outlets, and one delivery route is assigned a unique sorting outlet; Step S32: according to the sorting line structure and the corresponding export relationship list of the delivery line, each order on each delivery line is split to form a channel allocation; Step S33: According to the sorting line structure and the corresponding channel allocation of the delivery line, each order on each delivery line is split into sorting tasks.

4. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 3 is characterized in that: The distribution line corresponding to the export relationship list is a sorting export distribution line allocation table, including the correspondence between the line code, the line sorting volume, the export, the export sorting volume, and the number of export lines.

5. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 4 is characterized in that: The channel allocation quantity corresponding to the distribution line is obtained through the flexible sorting channel sorting quantity allocation table; the flexible sorting channel sorting quantity allocation table includes line code, sorting outlet, sorting brand, order quantity, fixed unit number, fixed sorting quantity, flexible unit number, flexible channel, and flexible sorting quantity.

6. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 5, characterized in that: The method of allocating the sorting amount of the flexible sorting channel includes: S41: Perform EIQ analysis on the orders to be sorted, and obtain the total order quantity, total number of orders, average order quantity per order, and number of order brands for each distribution route; obtain the order frequency, total order quantity, order quantity proportion, order quantity ranking, average order quantity per order per brand, and order coverage rate of the order brands involved in each distribution route; and obtain the fixed channel number of each brand according to the sorting channel allocation result; S42: Set flexible channel allocation parameters: define the upper limit of the number of flexible channels for a single brand, which is used to constrain the upper limit of the number of flexible channels allocated to a single brand in a single distribution route; define the minimum allocation quantity for flexible sorting, which is the minimum value of the sorting quantity allocated to the flexible channel sorting in a single distribution route; S43: According to the above two steps, as well as the fixed channel assignment and the flexible channel assignment, the sorting quantity of the flexible sorting channel corresponding to the delivery route is allocated.

7. The method for optimizing task execution queues for cigarette sorting and scheduling according to claim 6, characterized in that: When fixed channels are assigned, each sorting brand must have at least one fixed channel; when flexible channels are assigned, the flexible channels are configured with sub-lines.

Images