CN112061519B - Method for improving efficiency of sorting and dispensing processes - Google Patents
Method for improving efficiency of sorting and dispensing processes Download PDFInfo
- Publication number
- CN112061519B CN112061519B CN202010941778.8A CN202010941778A CN112061519B CN 112061519 B CN112061519 B CN 112061519B CN 202010941778 A CN202010941778 A CN 202010941778A CN 112061519 B CN112061519 B CN 112061519B
- Authority
- CN
- China
- Prior art keywords
- sorting
- batch
- prescription
- prescriptions
- bound
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65B—MACHINES, APPARATUS OR DEVICES FOR, OR METHODS OF, PACKAGING ARTICLES OR MATERIALS; UNPACKING
- B65B57/00—Automatic control, checking, warning, or safety devices
- B65B57/10—Automatic control, checking, warning, or safety devices responsive to absence, presence, abnormal feed, or misplacement of articles or materials to be packaged
- B65B57/12—Automatic control, checking, warning, or safety devices responsive to absence, presence, abnormal feed, or misplacement of articles or materials to be packaged and operating to control, or stop, the feed of wrapping materials, containers, or packages
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Medical Treatment And Welfare Office Work (AREA)
Abstract
The utility model relates to a method for improving the efficiency of a sorting and dispensing flow, which can bind prescriptions of a batch with an empty medicine frame and a sorting port when the empty medicine frame appears and the sorting machine sorts the prescriptions of the previous batch, directly enters the sorting machine after the sorting of the previous batch without spending binding time, and can correspondingly reduce the binding time of a plurality of prescriptions by circulating the empty medicine frame and the sorting machine in sequence, thereby improving the medicine dispensing efficiency and reducing the medicine dispensing time.
Description
Technical Field
The utility model relates to the technical field of automatic medicine distribution, in particular to a method for improving the efficiency of a sorting medicine distribution process.
Background
The medicine sorting machine sorts medicines according to different prescriptions, and places the medicines of a single prescription together, the medicine sorting machine is mainly used for sorting boxed medicines, designated empty medicine frames are bound according to the number of the prescriptions, the existing medicine sorting machine mainly has a round shape and a long shape, the number of sorting openings is fixed, for example, the long-strip-shaped medicine sorting machine has two rows, each row has 12 sorting openings and 24 sorting openings, the prescription, the empty medicine frames and the sorting openings can be bound again after the medicines are sorted by each sorting opening, because some sorting openings can be sorted firstly and bound after other sorting openings are finished, the leaving time of the medicine frames is the time when the sorting of the last sorting opening is finished, the next batch of prescriptions are bound from the time, and the medicine outlet efficiency is low, and the whole medicine discharging process is long in time.
Disclosure of Invention
The utility model aims to provide a method for improving the efficiency of a sorting and dispensing process by fully utilizing an empty medicine frame.
The technical scheme adopted by the utility model for solving the technical problems is as follows: a method for improving the efficiency of a sorting and medicine distributing process is characterized by comprising the following steps:
s1, numbering sorting ports of the sorting machine in sequence, wherein the number of the sorting ports is N;
s2, receiving a first batch of prescriptions, wherein the number of the prescriptions is M1A plurality of;
s3, judgment MnIf < N is true, if so, then M is assertednEach prescription is in one-to-one correspondence with MnBinding at each sorting gate, MnEach sorting opening is in one-to-one correspondence with MnBinding the empty medicine boxes; if not, binding N prescriptions with N sorting ports in one-to-one correspondence, binding N sorting ports with N empty medicine frames in one-to-one correspondence, and keeping Mn-N prescriptions are merged with the next batch; wherein n is the batch number and is more than or equal to 1, and the batch number is increased by 1 every cycle;
s4, sorting the n-th batch of prescriptions by the sorting machine, receiving the next batch of prescriptions, and combining the prescriptions by M n+11, judging MnIf < N is true, if yes, go to step S5; if not, returning to the step S3 for circulation;
s5, judgment Mn+1≤N-MnIf true, then M is addedn+1One-to-one correspondence of each recipe to M unbound in step S3n+1Binding the empty medicine frames in one-to-one correspondence, Mn+1An empty medicine frame and Mn+1The sorting ports are bound in a one-to-one correspondence mode, after the nth batch of prescription is sorted, the sorting machine sends out the sorted medicine frames, the (n + 1) th batch of bound empty medicine frames enters, and the S4 is returned for circulation;
if not, then N-M is addednOne-to-one correspondence of each recipe to N-M unbound in step S3nBinding the empty medicine boxes in one-to-one correspondence, N-MnAn empty medicine frame and N-MnThe sorting ports are bound in one-to-one correspondence, after the sorting of the nth batch of prescription is finished, the sorting machine sends out the sorted medicine frames, the nth batch of bound empty medicine frames enters, and meanwhile, the binding of the prescription, the empty medicine frames and the sorting ports is continuously supplemented until M is supplementednA prescription is prepared; judgment Mn+1If N is true, if so, the remaining Mn+1-N recipes are merged with the next batch, and the process returns to step S4 for circulation, and if not, returns directly to step S4;
s6, until all prescription sorting is completed.
More specifically, in the steps S3 and S5, the prescription is bound to the sorting opening and the empty medicine box at the same time.
More specifically, in the steps S3 and S5, the prescription is bound to the sorting opening first, and then bound to the empty medicine box.
More specifically, in the step S1, the sorting openings farthest from the sorting machine start to be numbered from small to large, and in the steps S3 and S5, the sorting openings are bound with the smallest numbers.
More specifically, the new prescriptions received before the previous batch of prescriptions are sorted are all the same batch of prescriptions.
More specifically, the previous batch or the remaining prescriptions of the previous batch are bound first when the binding is performed.
More specifically, when binding is performed, if a prescription for which a medication is urgently needed is arranged in front of the batch of prescriptions, the binding is performed.
More specifically, the sorting machine is annular or strip-shaped.
The utility model has the beneficial effects that: by the method, when the empty medicine frame appears, the prescription of the batch can be bound with the empty medicine frame and the sorting port when the sorting machine sorts the prescription of the previous batch, the prescription can be directly bound after the sorting of the previous batch is finished without spending binding time, and the binding time of a plurality of prescriptions can be correspondingly reduced, so that the medicine dispensing efficiency is improved, and the medicine dispensing time is shortened.
Drawings
FIG. 1 is a logic diagram of the present invention;
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings.
As shown in fig. 1, a method for improving efficiency of sorting and dispensing processes includes:
s1, numbering the sorting ports of the sorting machine according to sequence, wherein the number of the sorting ports is N, the sorting ports which are farthest from the sorting machine are numbered from small to large in a digital mode, namely the numbers are 1, 2 and 3, the farthest sorting port is the sorting port which is closest to the outlet of the sorting machine, and if a plurality of sorting ports are equal to the outlet of the sorting machine in distance, the sorting ports are numbered randomly according to the numbering sequence.
S2, receiving the first batchPrescription, the number of the prescription is M1And (4) respectively.
S3, judgment MnIf N is true, if yes, the number of prescriptions is less than the number of sorting openings, and M can be usednBinding the individual prescriptions completely, and combining MnEach prescription is in one-to-one correspondence with MnBinding at each sorting gate, MnEach sorting opening is in one-to-one correspondence with MnBinding the empty medicine boxes, wherein the binding with the sorting opening is started from the minimum number, namely the binding is started from the number 1 in sequence; if not, the prescription quantity is larger than the quantity of the sorting openings, only N prescriptions can be bound at the moment, the N prescriptions are bound with the N sorting openings in a one-to-one correspondence mode, the N sorting openings are bound with the N empty medicine frames in a one-to-one correspondence mode, the binding with the sorting openings starts from the minimum number, namely, the binding starts from the number 1 in sequence, and M prescriptions are remainedn-N prescriptions are merged with the next batch; wherein n is the number of the batch and n is more than or equal to 1, 1 is added to the number of the batch once the cycle in the method, namely, the initial n is 1, and the n is 2 when the cycle is once.
S4, sorting the n-th batch of prescriptions by the sorting machine, receiving the next batch of prescriptions, and combining the prescriptions by Mn+1Then, judging M againnIf < N is true, if yes, go to step S5; if not, the process returns to step S3 to loop.
S5, judgment Mn+1≤N-MnIf true, then M is addedn+1One-to-one correspondence of each recipe to M unbound in step S3n+1Binding the empty medicine frames in one-to-one correspondence, Mn+1An empty medicine frame and Mn+1The sorting ports are bound in a one-to-one correspondence mode, after the nth batch of prescription is sorted, the sorting machine sends out the sorted medicine frames, the (n + 1) th batch of bound empty medicine frames enters, and the S4 is returned for circulation;
if not, then N-M is addednOne-to-one correspondence of each recipe to N-M unbound in step S3nBinding the empty medicine boxes in one-to-one correspondence, N-MnAn empty medicine frame and N-MnThe sorting ports are bound in one-to-one correspondence, after the nth batch of prescription is sorted, the sorting machine sends out the sorted medicine frames, and the nth batch of bound empty medicine frames enterMeanwhile, the prescription is continuously supplemented and bound with the empty medicine frame and the sorting opening until M is supplementednA prescription is prepared; judgment Mn+1If N is true, if so, the remaining Mn+1Merging the N prescriptions with the next batch, and returning to step S4 for circulation, or directly returning to step S4 for circulation.
S6, until all prescription sorting is completed.
In the step S3 and the step S5, there may be a plurality of binding manners for the prescription to the sorting opening and the empty medicine frame, and the first binding manner is to bind the prescription to the sorting opening and the empty medicine frame at the same time, and not in sequence; secondly, the prescription is bound with a sorting port firstly and then bound with an empty medicine frame; thirdly, the prescription is bound with an empty medicine frame firstly and then bound with a sorting port; fourthly, the empty medicine frame is bound with the sorting port firstly and then bound with the prescription; the four binding modes can be used alternatively or in a mixed mode according to specific conditions, and the purpose is to improve the drug delivery efficiency.
Since the prescriptions are not sent together but arrive at the sorting machine in sequence, the judgment of the same batch of prescriptions is that the new prescriptions received before the previous batch of prescriptions are sorted are all the same batch of prescriptions.
The binding rule of the prescription is that the remaining prescriptions in the last batch are arranged in the front of the prescription in the batch and are bound, and the medicines are dispensed according to the sequence, so that the overlong waiting time is prevented; meanwhile, if the prescription for continuing medication is provided with a queue-insertion rule, if the prescription for urgent medication is arranged in the front of the prescription in the batch, the prescription is bound; therefore, the priority of the prescription for continuous medication is higher than the prescription left in the last batch, and the priority of the prescription left in the last batch is higher than the prescription of the current batch.
The method can be used for ring-shaped sorting machines and strip-shaped sorting machines.
The above steps will be described below by way of example.
A long-strip-shaped sorting machine is adopted, and the number of sorting openings N is 24, and the sorting openings N are divided into two rows; take 5 batches of recipes as an example.
The specific operation is as follows:
first, when the prescription quantity M of the first lot of prescriptions1When the number is equal to 21, the number is as follows,
s3, judgment M1If < N is true, M1Since 21 < 24 holds true, 21 prescriptions are bound to 21 sorting gates and 21 empty medicine boxes, and the sorting gates are bound from number 1.
S4, the medicine dispensing machine dispenses medicines to the sorting machine, and the sorting machine sorts the 21 prescriptions; at the same time, the prescription quantity M of the second batch of prescription is received, because no prescription remains in the first batch and is not combined212 due to M1Since 21 < 24 holds true, the process proceeds directly to step S5.
S5, judgment M2≤N-M1If the number of the first prescription is not more than 12, namely the number of the first prescription is not more than 24-21, the first three prescriptions in the second batch of prescriptions are bound with 3 empty medicine frames of the first batch of medicines which are not sorted, and are bound with a sorting opening, and the sorting opening is bound from the number 1; after the first batch of prescriptions are sorted, the 3 bound empty medicine frames of the second batch are subjected to corresponding sorting openings, and simultaneously 9 prescriptions are bound with the empty medicine frames and the sorting openings again, the sorting openings are bound from the number 4, and the second batch of prescriptions are all bound; judgment M2If N is true, i.e., 12 > 24 is false, the process returns to step S4 directly.
S41, the medicine dispensing machine dispenses medicines to the sorting machine, and the sorting machine sorts the 12 prescriptions; starting to accept the third batch of prescriptions at the same time, and since there are no remaining prescriptions in the second batch and the second batch is not merged, the number M of the third batch of prescriptions310 due to M2Since 12 < 24 holds true, the process proceeds directly to step S5.
S51, judgment M3≤N-M2Whether or not it is true, i.e., 10. ltoreq.24-12, so that the third batchAnd binding the 10 prescriptions with 10 unbound empty medicine frames in the second batch, binding the 10 empty medicine frames with 10 sorting ports, binding the sorting ports from the number 1, sending out the sorted medicine frames by the sorting machine after the sorting of the prescriptions in the second batch is finished, and returning to S4 for circulation after the third batch of bound empty medicine frames enter.
S42, the medicine dispensing machine dispenses medicines to the sorting machine, and the sorting machine sorts the 10 prescriptions; starting to accept the recipe of the fourth batch at the same time, and since there is no recipe left for the third batch and the recipe of the fourth batch is not merged, the recipe quantity M of the fourth batch426 due to M3Since 10 < 24 holds, the process proceeds directly to step S5.
S52, judgment M4≤N-M3If the number is not more than 26, namely the number is not more than 24-10, the first 14 prescriptions in the fourth batch of prescriptions are bound with the 14 empty medicine frames of the third batch of medicines which are not sorted, and the empty medicine frames are bound with the sorting opening, and the sorting opening is bound from the number 1; after the third batch of prescriptions are sorted, carrying out corresponding sorting opening on 14 bound empty medicine frames of the fourth batch, simultaneously binding 10 prescriptions with the empty medicine frames and the sorting opening again, binding the sorting openings from the number 4, and finishing the binding of all the prescriptions of the fourth batch; judgment M4If N is true, i.e. 26 > 24 is true, the remaining 2 recipes are merged with the recipe of the fifth batch, and the process returns to step S4 for circulation.
S43, the medicine dispensing machine dispenses medicines to the sorting machine, and the sorting machine sorts the 24 prescriptions; at the same time, the recipe of the fifth batch begins to be received, and the fourth batch has the remaining 2 recipes, so the recipes are combined into the recipe of the fifth batch, and the recipe quantity M is532 since M4If 26 < 24 is not satisfied, the process returns to step S3 to loop.
S31, judgment M5If < N is true, i.e. 32 < 24 is false, 24 prescriptions are bound with 24 sorting mouths, 24 sorting mouths are bound with 24 empty medicine boxes, the binding with the sorting mouths starts from the smallest number, i.e. the binding starts from number 1 in sequence, and the remaining 8 prescriptions are merged with the sixth batch.
And cycling through the orders until the prescription dispensing is completed.
Second, the prescription quantity M of the first lot of prescriptions1When the pressure is equal to 26, the pressure is higher,
s3, judgment M1If < N is true, i.e. 26 < 24 is false, 24 recipes are bound to 24 sorting gates, 24 sorting gates are bound to 24 empty medicine boxes, the binding to the sorting gates is started from the smallest number, i.e. from number 1 in order, and the remaining 2 recipes are merged with the second batch.
Only the processing selection of the first batch is inconsistent, and the subsequent processing mode is consistent with the first processing mode.
In conclusion, through the method, the empty medicine frames which are not used in the previous batch are bound in advance and are bound with the corresponding sorting ports in sequence, so that the corresponding binding time can be saved, the medicine discharging efficiency is improved, and the medicine discharging time is shortened.
It is to be emphasized that: the above embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention in any way, and all simple modifications, equivalent changes and modifications made to the above embodiments according to the technical spirit of the present invention are within the scope of the technical solution of the present invention.
Claims (8)
1. A method for improving the efficiency of a sorting and medicine distributing process is characterized by comprising the following steps:
s1, numbering sorting ports of the sorting machine in sequence, wherein the number of the sorting ports is N;
s2, receiving a first batch of prescriptions, wherein the number of the prescriptions is M1A plurality of;
s3, judgment MnIf < N is true, if so, then M is assertednEach prescription is in one-to-one correspondence with MnBinding at each sorting gate, MnEach sorting opening is in one-to-one correspondence with MnBinding the empty medicine boxes; if not, binding N prescriptions with N sorting ports in one-to-one correspondence, binding N sorting ports with N empty medicine frames in one-to-one correspondence, and keeping Mn-N prescriptions are merged with the next batch; wherein n is the batch number and is more than or equal to 1, and the batch number is increased by 1 every cycle;
s4, sorting the n-th batch of prescriptions by the sorting machine, receiving the next batch of prescriptions, and combining the prescriptions by Mn+11, judging MnIf < N is true, if yes, go to step S5; if not, returning to the step S3 for circulation;
s5, judgment Mn+1≤N-MnIf true, then M is addedn+1One-to-one correspondence of each recipe to M unbound in step S3n+1Binding the empty medicine frames in one-to-one correspondence, Mn+1An empty medicine frame and Mn+1The sorting ports are bound in a one-to-one correspondence mode, after the nth batch of prescription is sorted, the sorting machine sends out the sorted medicine frames, the (n + 1) th batch of bound empty medicine frames enters, and the S4 is returned for circulation;
if not, then N-M is addednOne-to-one correspondence of each recipe to N-M unbound in step S3nBinding the empty medicine boxes in one-to-one correspondence, N-MnAn empty medicine frame and N-MnThe sorting ports are bound in one-to-one correspondence, after the sorting of the nth batch of prescription is finished, the sorting machine sends out the sorted medicine frames, the nth batch of bound empty medicine frames enters, and meanwhile, the binding of the prescription, the empty medicine frames and the sorting ports is continuously supplemented until M is supplementednA prescription is prepared; judgment Mn+1If N is true, if so, the remaining Mn+1-N recipes are merged with the next batch, and the process returns to step S4 for circulation, and if not, returns directly to step S4;
s6, until all prescription sorting is completed.
2. The method of claim 1, wherein the prescription is bound to the sorting opening and the empty medicine box at the same time in the steps S3 and S5.
3. The method of claim 1, wherein the prescription is bound to the sorting opening first and then bound to the empty medicine box in steps S3 and S5.
4. The method for improving the efficiency of the sorting and dispensing process according to claim 2, wherein the farthest sorting opening of the sorting machine starts to be numbered from small to large in step S1, and the steps S3 and S5 start to be bound with the smallest number.
5. The method of claim 4, wherein the new prescriptions received before the previous prescription is sorted are all the same prescription.
6. The method for improving the efficiency of the sorting and dispensing process of claim 1, wherein the previous batch or the remaining prescriptions of the previous batch are bound before the prescription of the batch when the binding is performed.
7. The method of claim 1, wherein the prescription is bound before the batch if the prescription is in need of immediate use.
8. The method for improving the efficiency of the sorting and dispensing process of claim 1, wherein the sorting machine is in the shape of a ring or a strip.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010941778.8A CN112061519B (en) | 2020-09-09 | 2020-09-09 | Method for improving efficiency of sorting and dispensing processes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010941778.8A CN112061519B (en) | 2020-09-09 | 2020-09-09 | Method for improving efficiency of sorting and dispensing processes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112061519A CN112061519A (en) | 2020-12-11 |
| CN112061519B true CN112061519B (en) | 2022-03-22 |
Family
ID=73663114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010941778.8A Active CN112061519B (en) | 2020-09-09 | 2020-09-09 | Method for improving efficiency of sorting and dispensing processes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112061519B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101053869A (en) * | 2007-04-30 | 2007-10-17 | 苏州艾隆科技有限公司 | Automatic sorting system for drugstore |
| CN103158992A (en) * | 2013-03-29 | 2013-06-19 | 江苏迅捷装具科技有限公司 | Fast dispensing procedure sorting method and intelligent dispensing control system |
| CN105217202A (en) * | 2015-09-22 | 2016-01-06 | 苏州艾隆科技股份有限公司 | Prescription transfer system |
| CN107597607A (en) * | 2017-08-25 | 2018-01-19 | 深圳市恒之易电子商务有限公司 | A kind of logistics Automated Sorting System and method for sorting |
| CN109494178A (en) * | 2018-11-16 | 2019-03-19 | 上海华力微电子有限公司 | A kind of work dispatching method detecting board |
| CN110723445A (en) * | 2019-07-29 | 2020-01-24 | 沈阳新松机器人自动化股份有限公司 | Medicine logistics rapid medicine dispensing system and medicine dispensing method |
| CN110796402A (en) * | 2018-08-03 | 2020-02-14 | 阿里巴巴集团控股有限公司 | Order batch scheduling method, device and computer system |
| CN111570297A (en) * | 2020-04-17 | 2020-08-25 | 上海中通吉网络技术有限公司 | Sorting port automatic start-stop method, device and equipment and sorting control system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1814785A1 (en) * | 2004-11-15 | 2007-08-08 | The Escher Group, Ltd. | System and method for dispensing, sorting and delivering prescription and non-prescription medications through the post office |
-
2020
- 2020-09-09 CN CN202010941778.8A patent/CN112061519B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101053869A (en) * | 2007-04-30 | 2007-10-17 | 苏州艾隆科技有限公司 | Automatic sorting system for drugstore |
| CN103158992A (en) * | 2013-03-29 | 2013-06-19 | 江苏迅捷装具科技有限公司 | Fast dispensing procedure sorting method and intelligent dispensing control system |
| CN105217202A (en) * | 2015-09-22 | 2016-01-06 | 苏州艾隆科技股份有限公司 | Prescription transfer system |
| CN107597607A (en) * | 2017-08-25 | 2018-01-19 | 深圳市恒之易电子商务有限公司 | A kind of logistics Automated Sorting System and method for sorting |
| CN110796402A (en) * | 2018-08-03 | 2020-02-14 | 阿里巴巴集团控股有限公司 | Order batch scheduling method, device and computer system |
| CN109494178A (en) * | 2018-11-16 | 2019-03-19 | 上海华力微电子有限公司 | A kind of work dispatching method detecting board |
| CN110723445A (en) * | 2019-07-29 | 2020-01-24 | 沈阳新松机器人自动化股份有限公司 | Medicine logistics rapid medicine dispensing system and medicine dispensing method |
| CN111570297A (en) * | 2020-04-17 | 2020-08-25 | 上海中通吉网络技术有限公司 | Sorting port automatic start-stop method, device and equipment and sorting control system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112061519A (en) | 2020-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106991010B (en) | A kind of memory concentration dynamic allocation method for streaming media server | |
| CN105022377B (en) | A kind of control method of the automated manufacturing system based on Petri network | |
| CN105185731B (en) | A kind of the chip dispatch control method and system of semiconductor heat treatment equipment | |
| CN106485441A (en) | A kind of take-away allocator and system | |
| CN112061519B (en) | Method for improving efficiency of sorting and dispensing processes | |
| CN107578197A (en) | The uncertain mix flow vehicles dispatching system optimization of region method of demand | |
| CN100358295C (en) | Timer scheduling method | |
| CN103646301A (en) | Batch dispatching system and method for furnace tube device | |
| CN111369194A (en) | Method for managing goods in idle time of automatic three-dimensional warehouse | |
| CN206380123U (en) | A kind of LED drive controls circuit and LED matrix | |
| CN105045652B (en) | A kind of multiple terminals is jointly processed by the method and processing system of multiple parallel multi-threaded program | |
| CN113947317A (en) | Material warehousing method, material ex-warehouse method, device, scheduling equipment and system | |
| CN114154922A (en) | Tobacco storage scheduling system | |
| CN105843772A (en) | Device and method for processing data | |
| CN107239316A (en) | The optimized treatment method and device of a kind of function | |
| CN107392515A (en) | Thickness connection induction system stock control and line optimization method based on genetic algorithm | |
| CN110265109B (en) | Combined intelligent traditional Chinese medicine cabinet system and control method | |
| CN116882555B (en) | Multi-order layout optimization method with limited sorting stations | |
| CN116207013B (en) | Distribution control method and device for furnace tube machine, electronic equipment and storage medium | |
| CN102253861A (en) | Method for executing stepwise plug-in computation | |
| CN101610552A (en) | The dispatching method of common source and device | |
| CN112101717A (en) | Method, device, equipment and storage medium for adjusting production tasks of production line | |
| CN202624680U (en) | Beer mixing and incasing device | |
| JPS61243701A (en) | Method for carrying out of automatic warehouse | |
| US20230392313A1 (en) | Array of laundry washing machines |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |