CN112468551A - Intelligent scheduling working method based on service priority - Google Patents
Intelligent scheduling working method based on service priority Download PDFInfo
- Publication number
- CN112468551A CN112468551A CN202011276170.4A CN202011276170A CN112468551A CN 112468551 A CN112468551 A CN 112468551A CN 202011276170 A CN202011276170 A CN 202011276170A CN 112468551 A CN112468551 A CN 112468551A
- Authority
- CN
- China
- Prior art keywords
- service
- queue
- priority
- business
- scheduling
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000012544 monitoring process Methods 0.000 claims description 17
- 230000008569 process Effects 0.000 claims description 5
- 238000013507 mapping Methods 0.000 claims description 3
- 230000007246 mechanism Effects 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 238000003032 molecular docking Methods 0.000 abstract description 7
- 230000008901 benefit Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000007474 system interaction Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The invention provides an intelligent scheduling working method based on business priority, belonging to the business docking field of government business services, aiming at the business scheduling of system docking in the government business service field, classifying the business handled by a system according to the timeliness requirement by analyzing the problems existing in the existing business scheduling and the timeliness requirement of the business, setting different scheduling priorities for each class, temporarily storing the business into different priority queues according to the priority agreed in advance in the scheduling link after the business is received, then scheduling the business by a distribution center, scheduling the business with high priority first and scheduling the business with low priority later. The method relieves the service scheduling failure under the condition of high concurrency, and also ensures the timeliness of service handling with high timeliness requirements.
Description
Technical Field
The invention relates to the field of service docking of government affair services, in particular to an intelligent scheduling working method based on service priority.
Background
In recent years, with the promotion of the management service and the promotion of the business modes such as a window type business mode and a door type business mode, departments in various regions are actively promoted and reformed, people run legs less, information runs more, barriers in business handling are continuously opened, information islands in business handling are opened, information runs really, and the government services of all levels of departments are greatly developed at present, and the government service level is greatly improved.
In the service modes of pushing a window type and a door type, the entrance of various services is centralized in one system for handling, the comprehensive acceptance mode is adopted for receiving the service, the comprehensive acceptance system pushes the service to each service system for handling the service after receiving the service, each service system pushes the auditing link and the handling information to the comprehensive acceptance system, and the comprehensive acceptance system completes the issuing of the certificate, so that the common people can handle the service through the comprehensive window, and the approval department only focuses on the approval process.
When the business mode is just popularized, the business volume is small, the system interaction efficiency is high, but with the improvement, more transaction items can be brought into the comprehensive acceptance system for handling, so that more users can use the comprehensive acceptance foreground, more businesses need to be distributed and dispatched in the background, the challenge is brought to the comprehensive acceptance performance, business pushing failure is easily caused in a high-concurrency large-business volume scene, high-performance servers need to be purchased by each stage of government affair service centers to meet the business dispatching performance requirement, but the price of the servers is high, and the method is not suitable for all government affair centers.
Some places adopt a mode of deploying a plurality of sets of systems, and each government hall is deployed with one set of system, so that the problems are solved to a certain extent, the implementation and maintenance of the plurality of sets of systems are huge expenses, the systems are consistent, the maintenance cost is high, and the popularization value is not realized.
Some places adopt a method of delaying pushing butt-joint services, but the timeliness requirement of most service handling in the field of government services is higher, some service handling is finished immediately, the service handling must be finished on the same day, obviously, the delay pushing cannot solve the problem, and the problem of poor experience is brought to the handling of the masses, but the timeliness of pushing of some commitment pieces is not so strict, and the pushing can be finished within a specified time.
Disclosure of Invention
In order to solve the technical problems, the invention provides an intelligent scheduling working method based on service priority, which classifies service types, allocates different priorities to different types of services according to timeliness requirements, when a comprehensive acceptance system finishes service handling and pushes services, a scheduling center temporarily stores the services into different priority queues according to the priorities, a distribution center regularly polls the queues to push the services, the service with high priority is pushed preferentially to ensure timeliness of service handling, the service with low priority is pushed after pushing the service with high priority, the service volume and service handling time in the field of government service for many years are integrated, the method can solve the service pushing requirement under large service volume, no purchased server is needed, no high-maintenance multistage deployment mode is needed, can bring certain social benefits.
The technical scheme of the invention is as follows:
an intelligent scheduling working method based on service priority,
according to the service handling timeliness requirement, the service is divided into priorities, and each service is assigned with a priority; when the service is required to be scheduled after being handled, the scheduling center temporarily stores the service into the corresponding priority queue according to the priority configured by the service, and meanwhile, the distribution center polls each service queue, preferentially distributes the service of the high-priority queue and then distributes the service in the low-priority queue.
Further, in the above-mentioned case,
1) combing the service to be dispatched according to the timeliness requirement
Classifying the services to be scheduled according to handling timeliness, and orderly sequencing according to the handling timeliness of the services;
for priority queues of different service types, the consequent binding service queues can be matched according to the priority queues combed.
2) Centralized business queue management
According to the types of the sorted queues, carrying out configuration management on the sorted service queues in a dispatching center, and setting information of dispatching priority and applicable scenes for each type of queues;
after the business queue is added, the business queue can be used externally after being audited and released;
after the release, the dispatching center dynamically establishes a corresponding service queue according to the relevant queue information of the queue, and waits for the storage of service data.
The dispatching center can check the service quantity and the distribution dispatching condition of each service queue in real time so as to find problems in real time for manual intervention and ensure normal operation of service distribution dispatching.
3) Centralized traffic queuing and transaction binding
Binding related business queues aiming at each government affair service affair so as to push related business information into a specific queue when the business is distributed after being generated;
the unique identifier of the binding use item of the item and the service queue is used, so that the corresponding service queue can be found according to the unique identifier of the item when the subsequent service is forwarded;
after the government affair service affair is bound to the queue, the affairs bound to the queue can be checked, and the bearing capacity of the queue can be estimated and adjusted in advance according to the actual traffic so that the dispatching center can provide the most efficient service for the outside.
4) Scheduling center based on service priority
After the applicant declares the service by the comprehensive acceptance system, the comprehensive acceptance system pushes the service information to the scheduling center, and the scheduling center completes task distribution scheduling work;
after receiving the service sending request, the scheduling center analyzes the service distribution message information, obtains the unique item identifier, searches the service queue corresponding to the item according to the unique item identifier, stores the service information into the corresponding service queue, and waits for the timed distribution task to execute the corresponding distribution operation.
5) Priority-based distribution center
And the dispatching and distributing center carries out monitoring polling on each service queue with different priorities, when the high-priority queue has services, the services in the high-priority queue are preferentially pushed, and the dispatching and distributing are carried out one by one according to the priority sequence.
And a monitoring mechanism is added in the scheduling process, if the high-priority service is always in forwarding and the low-priority service cannot be forwarded, an early warning is sent, a distribution processing program needs to be added so as to distribute the high-priority service and then distribute the low-priority service, otherwise, if the number of the services in the monitoring data display queue is very low, part of the distribution program is dynamically suspended.
6) Centralized monitoring center
Establishing a centralized monitoring center to provide technical support for decision analysis of an information center;
the monitoring contents of the monitoring center mainly comprise:
(4) service queue conditions
How many service queues are established, the service condition stored in each queue and the distribution condition;
(5) queue item mapping map
Checking which items are bound to a queue in the system, and storing which services in the queue;
checking which queues are bound by the items in the system and the forwarding condition of the service;
(6) queue distribution monitoring
The distribution efficiency of each queue is monitored to distribute the distribution programs in real time.
The invention has the advantages that
Compared with other schemes, the method and the system have the advantages that the method and the system can push the business in batches according to the business priority, do not need to purchase a high-performance server or carry out system deployment in a grading manner, and can greatly reduce government affair service cost and implementation and maintenance cost.
Drawings
FIG. 1 is a schematic diagram of the intelligent scheduling process based on service priority of the present invention;
FIG. 2 is a schematic diagram of service timeliness combing;
FIG. 3 is a schematic diagram of task distribution scheduling;
figure 4 is a schematic diagram of a distribution center schedule.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer and more complete, the technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention, and based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts belong to the scope of the present invention.
The invention provides a new calling working method based on business priority aiming at the problems and the defects of business scheduling in system docking in the field of government affair services under the condition of high concurrent business volume, and the flow is as follows:
the method comprises the steps of firstly combing government affair service types, then setting business queues with different priorities aiming at each type, then binding the business queues with specific business items, when business is handled, pushing the business into the matched business queues by a dispatching center according to the business queues corresponding to the items, polling the business queues by the dispatching center according to the priority levels, dispatching and dispatching the business, and simultaneously monitoring so as to dynamically adjust a dispatching program, finish the efficient dispatching of the business and ensure the smoothness of the business.
The detailed content of the scheme comprises the following steps:
1) unified business timeliness combing
As shown in fig. 1, the services to be scheduled are classified according to handling timeliness, and are sorted according to the handling timeliness.
The types of government affair service items accepted by the comprehensive acceptance system are various, and are distinguished by handling, commitment and reporting, namely, the timeliness required by handling the items is the highest, the items are required to be pushed to the business handling system for handling after receiving the items, the commitment and the reporting are relatively low in timeliness, different business pushing queues can be established according to different handling types, the pushing priorities of the different business pushing queues are different and the business with high priority is preferentially pushed.
The above is only roughly divided, and for different docking modes, the queues of the commitment piece and the reporting piece can be further subdivided, for example, some commitment piece docking modes are pre-library docking modes which are used, so that the requirement on the timeliness is lower, and the lower priority can be appropriately reduced inside. In addition, some services in the office piece belong to the filed query class, the priorities can be lower, and the pushing can be completed within the time required by the assessment.
Through the service type division, the following priority queues for different service types can be obtained, and the follow-up item binding service queues can be matched according to the priority queues combed.
2) Centralized business queue management
According to the types of the queues combed in the prior art, the combed service queues need to be configured and managed in a dispatching center, and information such as dispatching priority, applicable scenes and the like is set for each type of queues.
After the service queue is added, the service queue can be used externally after being audited and released.
After the release, the dispatching center dynamically establishes a corresponding service queue according to the relevant queue information of the queue, and waits for the storage of service data.
The dispatching center can check the service quantity and the distribution dispatching condition of each service queue in real time so as to find problems in real time for manual intervention and ensure normal operation of service distribution dispatching.
3) Centralized traffic queuing and transaction binding
The service types are sorted and classified in the foregoing, and binding of relevant service queues needs to be performed for each government service event, so that relevant service information can be pushed into a specific queue when the service is distributed after being generated. The unique identification of the binding use item of the item and the service queue, so that the corresponding service queue can be found according to the unique identification of the item when the subsequent service is forwarded.
After the government affair service affair is bound to the queue, which affairs are bound to which queue can be checked, and the bearing capacity of the queue can be estimated and adjusted in advance according to the actual traffic so that the dispatching center can provide the most efficient service to the outside.
4) Scheduling center based on service priority
As shown in fig. 3, after the applicant declares a service in the comprehensive acceptance system, the comprehensive acceptance system pushes service information to the scheduling center, and the scheduling center completes task distribution scheduling.
After receiving the service sending request, the scheduling center analyzes the service distribution message information, obtains the unique item identifier, searches the service queue corresponding to the item according to the unique item identifier, stores the service information into the corresponding service queue, and waits for the timed distribution task to execute the corresponding distribution operation.
5) Priority-based distribution center
And the dispatching and distributing center carries out monitoring polling on each service queue with different priorities, when the high-priority queue has services, the services in the high-priority queue are preferentially pushed, and the dispatching and distributing are carried out one by one according to the priority sequence. A monitoring mechanism is added in the scheduling process, if high-priority services are always in forwarding due to the problem of large traffic and low-priority services cannot be forwarded, early warning is given out, a distribution processing program needs to be added so as to distribute the high-priority services and then distribute the low-priority services, otherwise, if the number of the services in a monitoring data display queue is low, some distribution programs can be dynamically suspended, and the resource consumption is reduced.
6) Centralized monitoring center
And a centralized monitoring center is established to provide technical support for decision analysis of the information center.
The monitoring contents of the monitoring center mainly comprise:
(7) service queue conditions
How many service queues are established, service condition stored in each queue, and distribution condition.
(8) Queue item mapping map
It is possible to see which transactions are bound to a queue in the system, which services are stored in the queue.
Can check which queues are bound by the matters in the system and the forwarding condition of the service
(9) Queue distribution monitoring
And monitoring the distribution efficiency of each queue so as to distribute the distribution program in real time and ensure the efficient and stable distribution of the service.
The above description is only a preferred embodiment of the present invention, and is only used to illustrate the technical solutions of the present invention, and not to limit the protection scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (9)
1. An intelligent scheduling working method based on service priority is characterized in that,
according to the service handling timeliness requirement, the service is divided into priorities, and each service is assigned with a priority; when the service is required to be scheduled after being handled, the scheduling center temporarily stores the service into the corresponding priority queue according to the priority configured by the service, and meanwhile, the distribution center polls each service queue, preferentially distributes the service of the high-priority queue and then distributes the service in the low-priority queue.
2. The method of claim 1,
1) combing the service to be dispatched according to the timeliness requirement
Classifying the services to be scheduled according to handling timeliness, and orderly sequencing according to the handling timeliness of the services;
for priority queues of different service types, the consequent binding service queues can be matched according to the priority queues combed.
3. The method of claim 2,
2) centralized business queue management
According to the types of the sorted queues, carrying out configuration management on the sorted service queues in a dispatching center, and setting information of dispatching priority and applicable scenes for each type of queues;
after the business queue is added, the business queue can be used externally after being audited and released;
after the release, the dispatching center dynamically establishes a corresponding service queue according to the relevant queue information of the queue, and waits for the storage of service data.
4. The method of claim 3,
the dispatching center can check the service quantity and the distribution dispatching condition of each service queue in real time so as to find problems in real time for manual intervention and ensure normal operation of service distribution dispatching.
5. The method according to claim 3 or 4,
3) centralized traffic queuing and transaction binding
Binding related business queues aiming at each government affair service affair so as to push related business information into a specific queue when the business is distributed after being generated;
the unique identifier of the binding use item of the item and the service queue is used, so that the corresponding service queue can be found according to the unique identifier of the item when the subsequent service is forwarded;
after the government affair service affair is bound to the queue, the affairs bound to the queue can be checked, and the bearing capacity of the queue can be estimated and adjusted in advance according to the actual traffic so that the dispatching center can provide the most efficient service for the outside.
6. The method of claim 5,
4) scheduling center based on service priority
After the applicant declares the service by the comprehensive acceptance system, the comprehensive acceptance system pushes the service information to the scheduling center, and the scheduling center completes task distribution scheduling work;
after receiving the service sending request, the scheduling center analyzes the service distribution message information, obtains the unique item identifier, searches the service queue corresponding to the item according to the unique item identifier, stores the service information into the corresponding service queue, and waits for the timed distribution task to execute the corresponding distribution operation.
7. The method of claim 6,
5) priority-based distribution center
And the dispatching and distributing center carries out monitoring polling on each service queue with different priorities, when the high-priority queue has services, the services in the high-priority queue are preferentially pushed, and the dispatching and distributing are carried out one by one according to the priority sequence.
8. The method of claim 7,
and a monitoring mechanism is added in the scheduling process, if the high-priority service is always in forwarding and the low-priority service cannot be forwarded, an early warning is sent, a distribution processing program needs to be added so as to distribute the high-priority service and then distribute the low-priority service, otherwise, if the number of the services in the monitoring data display queue is very low, part of the distribution program is dynamically suspended.
9. The method of claim 8,
6) centralized monitoring center
Establishing a centralized monitoring center to provide technical support for decision analysis of an information center;
the monitoring contents of the monitoring center mainly comprise:
(1) service queue conditions
How many service queues are established, the service condition stored in each queue and the distribution condition;
(2) queue item mapping map
Checking which items are bound to a queue in the system, and storing which services in the queue;
checking which queues are bound by the items in the system and the forwarding condition of the service;
(3) queue distribution monitoring
The distribution efficiency of each queue is monitored to distribute the distribution programs in real time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011276170.4A CN112468551A (en) | 2020-11-16 | 2020-11-16 | Intelligent scheduling working method based on service priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011276170.4A CN112468551A (en) | 2020-11-16 | 2020-11-16 | Intelligent scheduling working method based on service priority |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112468551A true CN112468551A (en) | 2021-03-09 |
Family
ID=74837474
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011276170.4A Pending CN112468551A (en) | 2020-11-16 | 2020-11-16 | Intelligent scheduling working method based on service priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112468551A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113034010A (en) * | 2021-03-29 | 2021-06-25 | 潘丽璇 | Intelligent government affair request processing system based on cloud computing |
| CN113347228A (en) * | 2021-05-11 | 2021-09-03 | 浪潮卓数大数据产业发展有限公司 | Data docking method, device and storage medium based on timed task |
| CN115358517A (en) * | 2022-07-11 | 2022-11-18 | 欧冶工业品股份有限公司 | Multi-user multi-base purchasing plan multi-level member configuration strategy method and system |
| CN116048819A (en) * | 2023-03-30 | 2023-05-02 | 杭州西软计算机工程有限公司 | High concurrency data storage method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070253438A1 (en) * | 2006-04-28 | 2007-11-01 | Tellabs San Jose, Inc. | Differentiated services using weighted quality of service (QoS) |
| CN101790239A (en) * | 2010-02-23 | 2010-07-28 | 中国电信股份有限公司 | Packet dispatching method and forward service dispatcher |
| CN107483363A (en) * | 2017-08-15 | 2017-12-15 | 无锡职业技术学院 | A kind of Weight Round Robin device and method of layering |
| CN110321202A (en) * | 2018-03-29 | 2019-10-11 | 优酷网络技术（北京）有限公司 | Task processing method and device |
| CN111382177A (en) * | 2020-03-09 | 2020-07-07 | 中国邮政储蓄银行股份有限公司 | Service data task processing method, device and system |
-
2020
- 2020-11-16 CN CN202011276170.4A patent/CN112468551A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070253438A1 (en) * | 2006-04-28 | 2007-11-01 | Tellabs San Jose, Inc. | Differentiated services using weighted quality of service (QoS) |
| CN101790239A (en) * | 2010-02-23 | 2010-07-28 | 中国电信股份有限公司 | Packet dispatching method and forward service dispatcher |
| CN107483363A (en) * | 2017-08-15 | 2017-12-15 | 无锡职业技术学院 | A kind of Weight Round Robin device and method of layering |
| CN110321202A (en) * | 2018-03-29 | 2019-10-11 | 优酷网络技术（北京）有限公司 | Task processing method and device |
| CN111382177A (en) * | 2020-03-09 | 2020-07-07 | 中国邮政储蓄银行股份有限公司 | Service data task processing method, device and system |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113034010A (en) * | 2021-03-29 | 2021-06-25 | 潘丽璇 | Intelligent government affair request processing system based on cloud computing |
| CN113034010B (en) * | 2021-03-29 | 2023-12-05 | 上海讯久网络科技有限公司 | Intelligent government affair request processing system based on cloud computing |
| CN113347228A (en) * | 2021-05-11 | 2021-09-03 | 浪潮卓数大数据产业发展有限公司 | Data docking method, device and storage medium based on timed task |
| CN113347228B (en) * | 2021-05-11 | 2022-07-12 | 浪潮卓数大数据产业发展有限公司 | Data docking method, device and storage medium based on timed task |
| CN115358517A (en) * | 2022-07-11 | 2022-11-18 | 欧冶工业品股份有限公司 | Multi-user multi-base purchasing plan multi-level member configuration strategy method and system |
| CN116048819A (en) * | 2023-03-30 | 2023-05-02 | 杭州西软计算机工程有限公司 | High concurrency data storage method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112468551A (en) | Intelligent scheduling working method based on service priority | |
| CN112311868B (en) | Message touch method and device and electronic equipment | |
| CN107302488B (en) | Virtual article distribution method, system and server | |
| CN108734388A (en) | A kind of Power Material mixing system | |
| CN104657214A (en) | Multi-queue multi-priority big data task management system and method for achieving big data task management by utilizing system | |
| Buffa et al. | Disaggregation in manufacturing and service organizations: survey of problems and research | |
| CN114091941A (en) | Task allocation method and device, electronic equipment and storage medium | |
| CN101504754A (en) | Banking business data sorting and processing system based on image information | |
| CN110889656A (en) | Warehouse rule configuration method and device | |
| CN112381418A (en) | Case allocation method, device, equipment and storage medium | |
| CN111985865B (en) | Order receiving and distribution management method, management platform and terminal equipment | |
| CN109901918A (en) | A kind of method and apparatus handling overtime task | |
| CN111597033A (en) | Task scheduling method and device | |
| CN110288276A (en) | Method and apparatus for generating information | |
| US20050031163A1 (en) | Method and device for reading postal article inscriptions or document inscriptions | |
| CN105376155B (en) | A kind of Intelligent routing system and method based on distributed type assemblies framework | |
| WO2022266827A1 (en) | Logistics network simulation method and system | |
| CN111341038B (en) | Off-border tax refund self-service trusteeship refund system for overseas passenger shopping | |
| CN112785208A (en) | Tourism order task allocation method, system, equipment and storage medium | |
| CN113436018A (en) | Asset hosting business processing method and device, storage medium and electronic equipment | |
| CN110852700A (en) | Data sorting method and device for workflow system | |
| CN107690128B (en) | Method and system for quickly inquiring communication activity | |
| CN111210288A (en) | Tax control server-based invoicing batch invoicing job optimized scheduling method and system | |
| CN109784816A (en) | Express delivery distribution method and device | |
| CN110956430A (en) | Department door recommendation method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210309 |
|
| RJ01 | Rejection of invention patent application after publication |