Method and device for label distribution according to order, equipment and storage medium
By forming multiple label allocation schemes and selecting the least number of downtimes for labeling, the problem of unreasonable label allocation of labeling machines is solved, and production efficiency is improved and downtime is reduced.
Patent Information
- Application Number
- CN202411591917.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-07
- Publication Date
- 2025-03-18
AI Technical Summary
In the prior art, during the production and manufacturing of notebooks, the label distribution on the labeling machine is unreasonable, resulting in line shutdown and low production efficiency.
By obtaining the combination of tags required for the order, multiple tag allocation plans are formed, and according to the number of downtimes in each plan, the scheme with the least downtime is selected for label attachment.
Reduces the number of label replacements and downtime, improves production efficiency, and avoids flexibility issues that rely on manual experience.
Smart Images
Figure CN119637227A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of communication technology, and in particular to a method, device, equipment and storage medium for allocating labels according to an order. Background Art
[0002] During the notebook manufacturing process, after the parts are assembled into the whole machine, the labels defined by the design department need to be attached to the notebook. Usually a notebook will have 1-7 different labels on the C-side, such as Intel, AMD, WeChat and other labels. There are many types of labels in general. Due to the limitation of the production line cycle, usually two labeling machines are required to work together to attach the C-side labels, and each labeling machine attaches different labels. Each labeling machine usually has 15-20 feeders, and each feeder is placed with different labels. The label combination placed on the feeder on the labeling machine affects the rationality of the label allocation of the labeling machine. Different label allocation combinations determine whether it is necessary to stop the machine and replace new labels when the work order changes. The number of label changes will affect production efficiency.
[0003] In the existing technology, the distribution of labels on each labeling machine is judged based on manual experience. Before importing a new work order, it is necessary to judge whether the label distribution is reasonable and whether it affects the production rhythm. The existing solution has a low degree of flexibility and relies on manual experience. There are many machine label configurations, and there are often situations where there are missing labels or unreasonable label distribution, resulting in line stoppages and affecting production efficiency. The total line stoppage time is long, and manual decisions cannot be made on reasonable solutions for subsequent orders that need to be replaced, increasing the number of shutdowns to replace labels. Summary of the invention
[0004] The present disclosure provides a method, device, equipment and storage medium for allocating labels according to orders, so as to at least solve the above technical problems existing in the prior art.
[0005] According to a first aspect of the present disclosure, a method for assigning labels according to an order is provided, the method comprising:
[0006] Get the m types of labels required for p orders. Each order requires at least one label, where p is greater than 1 and m is greater than 1.
[0007] providing at least one labeling machine, the at least one labeling machine comprising a total of n feeders, wherein m is greater than n;
[0008] According to the correspondence between one feeder and one label, m labels and n feeders are combined into multiple label distribution schemes;
[0009] Each label allocation scheme is used to attach labels in the order of orders, and the number of times the labeling machine stops for each label allocation scheme after all orders are completed is calculated;
[0010] According to the number of downtimes of the labeling machine corresponding to each label allocation scheme, the label allocation scheme with the least downtime is selected.
[0011] In one possible implementation, attaching labels for each label allocation scheme according to the order sequence, and calculating the number of shutdown times of the labeling machine corresponding to each label allocation scheme after completing all orders, includes:
[0012] Divide the p orders into the first order, the second order to the pth order;
[0013] Labels are attached in the order of orders, and it is determined whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p;
[0014] If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed;
[0015] If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order;
[0016] According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively;
[0017] According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
[0018] In one possible implementation, the method of calculating the number of shutdowns of the labeling machine after replacing the label types corresponding to some feeders with the label types lacking in the above-mentioned multiple label replacement schemes according to the prediction equation includes:
[0019] The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes:
[0020] dp[i][j′]=dp[i-1][j′]+cost(j,j′)
[0021]
[0022] Where i represents the i-th order, j represents the configuration of n feeders before label replacement, j′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j, j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
[0023] In one possible implementation, after selecting the label allocation scheme with the least number of downtimes, the method further includes:
[0024] The labels for the p orders are attached according to the label allocation scheme with the least number of downtimes and the label replacement scheme with the least number of downtimes in the label allocation scheme.
[0025] According to a second aspect of the present disclosure, a device for performing label allocation according to an order is provided, the device comprising:
[0026] an acquisition unit, configured to acquire m types of labels required for p orders, each order requiring at least one label, wherein p is greater than 1 and m is greater than 1;
[0027] A providing unit configured to provide at least one labeling machine, wherein the at least one labeling machine comprises n feeders in total, wherein m is greater than n;
[0028] A combination unit configured to combine m types of labels and n feeders into a plurality of label distribution schemes according to a correspondence relationship between one feeder and one type of label;
[0029] A calculation unit is configured to attach labels to each label allocation scheme according to the order sequence, and calculate the number of stoppages of the labeling machine corresponding to each label allocation scheme after all orders are completed;
[0030] The selection unit is configured to select the label allocation scheme with the least number of downtimes according to the number of downtimes of the labeling machine corresponding to each label allocation scheme.
[0031] In one possible implementation, the computing unit includes:
[0032] A division unit, configured to divide the p orders into a first order, a second order to a p-th order;
[0033] A judgment unit is configured to attach labels according to the order sequence, and judge whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p;
[0034] If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed;
[0035] If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order;
[0036] According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively;
[0037] According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
[0038] In one possible implementation, the method of calculating the number of shutdowns of the labeling machine after replacing the label types corresponding to some feeders with the label types lacking in the above-mentioned multiple label replacement schemes according to the prediction equation includes:
[0039] The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes:
[0040] dp[i][j′]=dp[i-1][j′]+cost(j,j′)
[0041]
[0042] Where i represents the i-th order, j represents the configuration of n feeders before label replacement, j′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j, j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
[0043] In one embodiment, the device further comprises:
[0044] The label attaching unit is configured to attach labels for the p orders according to the label allocation scheme with the least number of downtimes and the label replacement scheme with the least number of downtimes in the label allocation scheme.
[0045] According to a third aspect of the present disclosure, there is provided an electronic device, including:
[0046] at least one processor; and
[0047] a memory communicatively connected to the at least one processor; wherein,
[0048] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method described in the present disclosure.
[0049] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause the computer to execute the method described in the present disclosure.
[0050] The disclosed method, device, equipment and storage medium for label distribution according to orders first forms a plurality of initialized label distribution schemes, each of which performs label attachment in the order of the order, calculates the total number of downtimes under all initialized label distribution schemes, selects the scheme with the least number of downtimes as the optimal solution, and guides the production line to replace labels through the optimal solution to improve production efficiency. This solution can intelligently arrange the label feeding of the labeling machine according to the orders within a certain period of time in the future, no longer relying on manual experience, and provides the initial optimal solution for label distribution and the timing and content of label replacement, thereby reducing the number of times the feeder label is replaced when the order is changed, thereby reducing downtime and improving production efficiency.
[0051] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0052] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become readily understood by reading the detailed description below with reference to the accompanying drawings. In the accompanying drawings, several embodiments of the present disclosure are shown in an exemplary and non-limiting manner, in which:
[0053] In the drawings, the same or corresponding reference numerals represent the same or corresponding parts.
[0054] Figure 1 A flowchart of a method for assigning labels according to orders provided in an embodiment of the present disclosure;
[0055] Figure 2 A schematic diagram of a detailed processing flow of a method for allocating labels according to orders provided in an embodiment of the present disclosure;
[0056] Figure 3 A schematic diagram of the structure of a device for allocating labels according to orders provided in an embodiment of the present disclosure;
[0057] Figure 4 A schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure is shown. DETAILED DESCRIPTION
[0058] In order to make the purpose, features, and advantages of the present disclosure more obvious and easy to understand, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present disclosure.
[0059] The present disclosure provides a method for allocating labels according to orders. Figure 1 A flowchart of a method for assigning labels according to orders provided in an embodiment of the present disclosure, such as Figure 1 As shown, the method comprises the following steps:
[0060] Step 101, obtaining m types of labels required for p orders, each order requires at least one label, wherein p is greater than 1 and m is greater than 1.
[0061] It should be explained that if there is only one order, there is no need to replace the label, so there are at least two orders in this embodiment.
[0062] Step 102 : providing at least one labeling machine, wherein the at least one labeling machine comprises n feeders in total, wherein m is greater than n.
[0063] In this embodiment, because if m is less than or equal to n, that is, the total number of labels required for all orders is less than or equal to the number of feeders, then these feeders can complete the label attachment of all orders without stopping to replace labels. Therefore, m needs to be greater than n, so that it is necessary to stop and replace labels during the attachment process.
[0064] Step 103 , according to the correspondence relationship between one feeder and one label, m labels and n feeders are combined into a plurality of label distribution schemes.
[0065] Figure 2 A schematic diagram of a detailed processing flow of a method for allocating labels according to orders provided in an embodiment of the present disclosure.
[0066] Because one type of label is placed in one feeder, n types of labels can be placed in n feeders, and there are mn types of labels that need to be replaced during the attachment process.
[0067] In the disclosed embodiment, because one feeder corresponds to one label, there are multiple label allocation schemes for m labels and n feeders. For example, all orders require 4 labels, namely label 1, label 2, label 3 and label 4, and there are 2 feeders, namely feeder 1 and feeder 2. Then label allocation scheme 1 can be label 1 placed in feeder 1, label 2 placed in feeder 2, and label 3 and label 4 waiting for shutdown replacement; label allocation scheme 2 can be label 1 placed in feeder 1, label 3 placed in feeder 2, and label 2 and label 4 waiting for shutdown replacement; label allocation scheme 3 can be label 1 placed in feeder 1, label 4 placed in feeder 2, and label 2 and label 3 waiting for shutdown replacement, and so on. There may be x types of label allocation schemes.
[0068] Step 104, attach labels to each label allocation scheme according to the order sequence, and calculate the number of shutdown times of the labeling machine corresponding to each label allocation scheme after completing all orders.
[0069] like Figure 2 As shown, each label allocation scheme is labeled in the order of the order, and each scheme will feedback a total number of downtimes after completing all orders.
[0070] In one embodiment, each label allocation scheme is used to attach labels according to the order sequence, and the number of shutdown times of the labeling machine corresponding to each label allocation scheme after all orders are completed is calculated, including:
[0071] Divide p orders into the first order, the second order to the pth order;
[0072] Labels are attached in the order of orders, and it is determined whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p;
[0073] If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed;
[0074] If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order;
[0075] According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively;
[0076] According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
[0077] In one embodiment, the number of shutdowns of the labeling machine after replacing the label types corresponding to some feeders with the label types missing in the above-mentioned multiple label replacement schemes is calculated according to the prediction equation, including:
[0078] The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes:
[0079] dp[i][j′]=dp[i-1][j′]+cost(j,j′) (1)
[0080]
[0081] Where i represents the i-th order, j represents the configuration of n feeders without label replacement, and j ′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j,j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
[0082] Specifically, for example, in this embodiment, there are a total of 5 orders. When label allocation scheme 1 is used to process the 5 orders, when the first order is processed, the feeder configuration meets the label requirement of the first order, so there is no need to stop the machine to replace the label. At this time, the number of stoppages is 0; when the second order is processed, the feeder configuration does not meet the label requirement of the second order, so it is necessary to stop the machine to replace the label. At this time, the number of stoppages for each label replacement scheme is calculated according to formula (1). For example, the number of stoppages for replacing the missing label of the second order is 3 times, the number of stoppages for replacing the second and third orders together is 2 times, and ..., the number of stoppages for replacing the second to pth orders together is 4 times. Among them, the number of stoppages for replacing the second and third orders together is the least. Therefore, Figure 2 As shown, according to the label replacement scheme, the feeder is replaced with a new label set. At this time, the total number of downtimes of label allocation scheme 1 is 1; and so on, until all orders are completed, the total number of downtimes of label allocation scheme 1 is obtained.
[0083] Step 105 , according to the number of downtimes of the labeling machine corresponding to each label allocation scheme, select the label allocation scheme with the least downtime.
[0084] In one embodiment, after selecting the label allocation scheme with the least number of downtimes, the method further includes:
[0085] Labels are attached to p orders according to a label allocation scheme with the least number of downtimes and a label replacement scheme with the least number of downtimes in the label allocation scheme.
[0086] In the disclosed embodiment, according to different initialization label allocation schemes, after the current order is completed, when the label needs to be replaced for the next order, the label requirements of multiple future orders are dynamically considered, and multiple labels are replaced at one time to reduce the total number of label replacements. By calculating the total number of downtimes under all initialization label allocation schemes, the scheme with the least downtime is selected as the optimal solution. The optimal solution includes the initial label allocation scheme, the order node for replacing the label, and the label that needs to be replaced. The optimal solution guides the production line to replace labels and improves production efficiency.
[0087] The disclosed embodiment also provides a device for distributing labels according to orders. Figure 3 A schematic diagram of the structure of a device for distributing labels according to orders provided in an embodiment of the present disclosure, such as Figure 3 As shown, the device comprises:
[0088] An acquisition unit 301 is configured to acquire m types of labels required for p orders, each order requires at least one type of label, wherein p is greater than 1 and m is greater than 1;
[0089] A providing unit 302 is configured to provide at least one labeling machine, wherein the at least one labeling machine includes a total of n feeders, wherein m is greater than n;
[0090] The combining unit 303 is configured to combine m types of labels and n feeders into a plurality of label distribution schemes according to a corresponding relationship that one feeder corresponds to one type of label;
[0091] The calculation unit 304 is configured to attach labels to each label allocation scheme according to the order sequence, and calculate the number of shutdown times of the labeling machine corresponding to each label allocation scheme after all orders are completed;
[0092] The selection unit 305 is configured to select the label allocation scheme with the least number of downtimes according to the number of downtimes of the labeling machine corresponding to each label allocation scheme.
[0093] In one embodiment, the calculation unit 304 includes:
[0094] A division unit 3041 is configured to divide the p orders into the first order, the second order to the pth order;
[0095] The judging unit 3042 is configured to attach labels according to the order sequence, and to judge whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p;
[0096] If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed;
[0097] If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order;
[0098] According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively;
[0099] According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
[0100] In one embodiment, the number of shutdowns of the labeling machine after replacing the label types corresponding to some feeders with the label types missing in the above-mentioned multiple label replacement schemes is calculated according to the prediction equation, including:
[0101] The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes:
[0102] dp[i][j′]=dp[i-1][j′]+cost(j,j′)
[0103]
[0104] Where i represents the i-th order, j represents the configuration of n feeders before label replacement, j′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j,j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
[0105] In one embodiment, the apparatus further includes: a label attaching unit 306 configured to attach labels for p orders according to the label allocation scheme with the least number of downtimes and the label replacement scheme with the least number of downtimes in the label allocation scheme.
[0106] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device and a readable storage medium.
[0107] Figure 4 A schematic block diagram of an example electronic device 400 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.
[0108] like Figure 4As shown, the device 400 includes a computing unit 401, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 402 or a computer program loaded from a storage unit 408 into a random access memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the device 400 can also be stored. The computing unit 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input / output (I / O) interface 405 is also connected to the bus 404.
[0109] A number of components in the device 400 are connected to the I / O interface 405, including: an input unit 406, such as a keyboard, a mouse, etc.; an output unit 407, such as various types of displays, speakers, etc.; a storage unit 408, such as a disk, an optical disk, etc.; and a communication unit 409, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 409 allows the device 400 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0110] The computing unit 401 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 401 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 401 performs the various methods and processes described above, such as a method for label allocation according to an order. For example, in some embodiments, the method for label allocation according to an order may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 408. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 400 via the ROM 402 and / or the communication unit 409. When the computer program is loaded into the RAM 403 and executed by the computing unit 401, one or more steps of the method for label allocation according to an order described above may be performed. Alternatively, in other embodiments, the computing unit 401 may be configured to perform a method for label allocation according to an order in any other appropriate manner (e.g., by means of firmware).
[0111] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0112] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0113] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0114] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0115] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.
[0116] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.
[0117] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.
[0118] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.
[0119] The above is only a specific embodiment of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any person skilled in the art who is familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present disclosure, which should be included in the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be based on the protection scope of the claims.
Claims
1. A method for label allocation according to an order, characterized in that: The method comprises: Get the m types of labels required for p orders. Each order requires at least one label, where p is greater than 1 and m is greater than 1. providing at least one labeling machine, the at least one labeling machine comprising a total of n feeders, wherein m is greater than n; According to the correspondence between one feeder and one label, m labels and n feeders are combined into multiple label distribution schemes; Each label allocation scheme is used to attach labels in the order of orders, and the number of labeling machine shutdowns corresponding to each label allocation scheme is calculated after all orders are completed; According to the number of downtimes of the labeling machine corresponding to each label allocation scheme, the label allocation scheme with the least downtime is selected.
2. The method according to claim 1, characterized in that The labeling is performed according to the order sequence for each label allocation scheme, and the number of stoppages of the labeling machine corresponding to each label allocation scheme is calculated after all orders are completed, including: Divide the p orders into the first order, the second order to the pth order; Labels are attached in the order of orders, and it is determined whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p; If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed; If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order; According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively; According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
3. The method according to claim 2, characterized in that The method of calculating the number of shutdown times of the labeling machine after replacing the label types corresponding to some feeders with the label types lacking in the above-mentioned multiple label replacement schemes according to the prediction equation includes: The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes: dp[i][j′]=dp[i-1][j′]+cost(j,j′) Where i represents the i-th order, j represents the configuration of n feeders before label replacement, j′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j,j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
4. The method according to claim 1, characterized in that: After selecting the label allocation scheme with the least number of downtimes, the method further includes: The labels for the p orders are attached according to the label allocation scheme with the least number of downtimes and the label replacement scheme with the least number of downtimes in the label allocation scheme.
5. A device for distributing labels according to orders, characterized in that: The device comprises: an acquisition unit, configured to acquire m types of labels required for p orders, each order requiring at least one label, wherein p is greater than 1 and m is greater than 1; A providing unit configured to provide at least one labeling machine, wherein the at least one labeling machine comprises n feeders in total, wherein m is greater than n; A combination unit configured to combine m types of labels and n feeders into a plurality of label distribution schemes according to a correspondence relationship between one feeder and one type of label; A calculation unit is configured to attach labels to each label allocation scheme according to the order sequence, and calculate the number of shutdown times of the labeling machine corresponding to each label allocation scheme after all orders are completed; The selection unit is configured to select the label allocation scheme with the least number of downtimes according to the number of downtimes of the labeling machine corresponding to each label allocation scheme.
6. The device according to claim 5, characterized in that The computing unit comprises: a dividing unit configured to divide the p orders into a first order, a second order to a p-th order; A judgment unit is configured to attach labels according to the order sequence, and judge whether the label types corresponding to the n feeders meet the label types required by the i-th order before processing the i-th order, where i is greater than or equal to 1 and less than or equal to p; If the label types corresponding to the n feeders meet the label types required by the i-th order, the number of times the labeling machine stops after the i-th order is completed is equal to the number of times the labeling machine stops after the i-1-th order is completed; If the label types corresponding to the n feeders do not meet the label types required by the i-th order, multiple label replacement schemes are determined, wherein the multiple label replacement schemes include the label types missing from the i-th order, the label types missing from the i-th order and the (i+1)-th order, and the label types missing from the i-th order to the p-th order; According to the prediction equation, the number of stoppages of the labeling machine after the label types corresponding to some feeders are replaced with the label types missing in the above-mentioned multiple label replacement schemes is calculated respectively; According to the label replacement scheme with the least number of downtimes, the label types corresponding to some feeders are replaced with the label types missing in the scheme, and the number of downtimes after the i-th order is equal to the number of downtimes after the i-1-th order is completed plus 1.
7. The device according to claim 6, characterized in that The method of calculating the number of shutdown times of the labeling machine after replacing the label types corresponding to some feeders with the label types lacking in the above-mentioned multiple label replacement schemes according to the prediction equation includes: The following formula is used to calculate the number of downtimes corresponding to each label replacement scheme and determine the label replacement scheme with the least downtimes: dp[i][j′]=dp[i-1][j′]+cost(j,j′) Where i represents the i-th order, j represents the configuration of n feeders before label replacement, j′ represents the configuration of n feeders after label replacement, dp[i][j′] represents the number of downtimes under each label replacement scheme, cost(j,j′) represents the number of labels that need to be replaced from state j to state j′, Dp[i][j′] represents the minimum number of downtimes when the i-th order is processed and the labeling machine is in state j′, and Possible_configurations represents the configuration of n feeders after satisfying the above-mentioned multiple label replacement schemes.
8. The device according to claim 5, characterized in that The device also includes: The label attaching unit is configured to attach labels for the p orders according to the label allocation scheme with the least number of downtimes and the label replacement scheme with the least number of downtimes in the label allocation scheme.
9. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 4.
10. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to make a computer execute the method according to any one of claims 1-4.