CN113342871A - Queue design method applied to government affair service entity hall queuing - Google Patents
Queue design method applied to government affair service entity hall queuing Download PDFInfo
- Publication number
- CN113342871A CN113342871A CN202110532242.5A CN202110532242A CN113342871A CN 113342871 A CN113342871 A CN 113342871A CN 202110532242 A CN202110532242 A CN 202110532242A CN 113342871 A CN113342871 A CN 113342871A
- Authority
- CN
- China
- Prior art keywords
- queue
- queuing
- window
- window point
- service
- 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 45
- 238000013461 design Methods 0.000 title claims abstract description 24
- 238000011161 development Methods 0.000 claims description 3
- 230000007717 exclusion Effects 0.000 claims description 3
- 230000006870 function Effects 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 238000011835 investigation Methods 0.000 description 2
- 238000007619 statistical method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2462—Approximate or statistical queries
-
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- General Health & Medical Sciences (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Marketing (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a queue design method applied to hall queuing of government affair service entities, and belongs to the technical field of government affair services. The queue design method applied to the hall queuing of the government affair service entity binds the window point position and the transaction service, controls conflict when calling the queuing number, verifies the rationality of the window point position and the transaction service distribution, and corrects the window point position and the transaction service distribution according to the data of the running condition. The queue design method applied to the hall queuing of the government affair service entity can keep accurate, reasonable and efficient queuing operation, meanwhile, the window and business distribution are continuously corrected according to the data obtained by operation to improve the experience of the government affair service, and the method has good popularization and application values.
Description
Technical Field
The invention relates to the technical field of government affair service, and particularly provides a queue design method applied to hall queuing of a government affair service entity.
Background
The internet and government affair service are deeply promoted, more matters are handled on the internet, and the work that needs to be done on the spot is struggled to achieve the aims of only entering one door and running once at most. The government affair service hall integrates the business, a business handling window and a professional window are provided, during the operation process, the business handling window and the professional window can handle various businesses, and the transactable businesses are crossed; some services can be handled in both a business window and a professional window, and a multi-service multi-window cross queuing phenomenon is formed.
Under the condition of the cross queuing, how to accurately, reasonably and efficiently finish queuing and provide excellent work handling experience is a challenge, and a queuing queue model which runs efficiently on the premise of meeting business requirements is needed. The currently adopted mode includes that all services are in a single queue, all window points are called simultaneously, and efficiency is not high due to competition problems; or a partition mode is adopted, but the field adjustment difficulty is high due to the intersection of multi-window services.
Disclosure of Invention
The technical task of the invention is to provide a queue design method applied to hall queuing of government affair service entities, which can keep accurate, reasonable and efficient queuing operation and can continuously correct window and business distribution according to data obtained by operation to improve the experience of government affair service.
In order to achieve the purpose, the invention provides the following technical scheme:
a queue design method applied to government affair service entity hall queuing binds window point locations and business handling services, controls conflicts when calling queuing numbers, verifies the rationality of window point locations and business handling service distribution, and corrects the window point locations and the business handling service distribution according to data of operation conditions.
Preferably, a grouping queue is set according to the development of business handling, a used queue and business handling are set for each window point, a lock corresponding to the window point is obtained in an internal lock when queuing is carried out, the process of obtaining the lock carries out access according to rules in the set queue, and the lock is released after the access is finished; and data archiving is performed after the number taking and calling are completed.
The present invention realizes the memory lock by using redis, etc., and can also realize the unified lock function by using other modes.
Preferably, the queue design method applied to hall queuing of the government affairs service entity specifically comprises the following steps:
s1, setting a grouping queue;
s2, associating business handling with the window point;
s3, carrying out call mutual exclusion and concurrence;
and S4, packet queue index deduction.
Preferably, in step S1, in the process of setting the grouping queue, the corresponding transaction services at each window point are sorted, the window point capable of handling the transaction service is found starting from the window point a, if the found window point handles different services from the window point a at the same time, the other window points are continuously found based on the found window point until the transaction services capable of being handled by the found window point are not handled by window points other than the found window point, the same transaction service is grouped into one group until all the transactable services are allocated completely.
Researching and combing the transactable business on each point location, starting with the point location A, finding other point locations B and C, D … capable of transacting the business, if the found point location B (C, D …) transacts business different from the point location A, continuing to find other point locations on the basis of the found point location until the transactable business of the found point location is not transacted in other point locations except the found point location, and forming the business into a group AA; and forming other service groups BB and CC … in the same way until all the trafficable services in the lobby are distributed. AA. The traffic in these packets BB, CC … do not cross each other.
Preferably, in step S2, in the process of handling business by window point association, a processable business is set from the formed queues for each window point, and each window point corresponds to one queue.
Setting transactable business for each point location according to previous investigation and combing; the requirement here is that only one queue can be selected from the queues formed before, i.e. each window can only correspond to one queue, and the requirement of only corresponding to one queue can be met just because the combing mode of the previous queue already contains the services that all windows can handle.
Preferably, in step S3, after the window point sends the call request, the lock corresponding to the window point is requested in the memory lock, the queuing information is obtained by sequencing according to the service code set by the window point in the waiting queue according to the set queuing miss, and the data is locked and the lock is released after obtaining the queuing information.
After the people are transacted to fetch the number, the system enters a waiting queue. When the window point location calls, the implementation logic is as follows: when a window point sends a call request, firstly, a lock corresponding to the window is requested in a memory lock module, the lock identifier is unique in the lock module, if the lock is obtained, the next operation is carried out, otherwise, the next operation is continued to wait until the lock is obtained or the return is overtime; when a lock is requested to be obtained, sequencing according to a service code set by a window in a waiting queue according to a set queuing logic to obtain queuing information, and locking data and releasing the lock immediately after obtaining the queuing information; in the process, all window points using the same queue group are mutually exclusive when in concurrent calling, so as to ensure the correctness of queuing; when the queue groups used by the windows sending the call requests are different, the lock identifications required to be obtained are different, so that no rejection is generated and the processes can be carried out respectively. Therefore, through the design, under the specific service requirement of the government affair hall, the accuracy and the high efficiency of operation of the service can be considered.
Preferably, in step S4, based on the data obtained from the business handling operation, the data is deduced according to the set rule to obtain the current queuing business operation status, and the window point and the setting of the business handling are adjusted.
Preferably, the grouping index includes a traffic waiting index, a window waiting index and a crowd index.
And counting the average waiting time AW of the similar services, the average waiting time BW of all the services in the queue, the average handling time AD of the similar services and the average handling time BD of all the services in the same queue. Calculating a total waiting index BPW (business to business) BW/BD and APW (business to business) AW/AD of the same type of business, if the APW is larger than the BPW, the business is influenced by the queuing of other businesses to be lengthened, finding out all businesses exceeding the BPW, calculating an influence ratio APW/BPW, and analyzing as a key business if the influence ratio is larger.
Statistical studies were performed on data from all windows using the same cohort, as follows: and counting the average transaction time AD and the waiting time AW of all transaction services in the window, and counting the total average transaction time BD and the average waiting time BW of all transaction services in the window in the same queue. And calculating the waiting coefficient APW of each window, AW/AD, and the total waiting coefficient BPW, BW/BD, and when the APW is larger than the BPW window, the waiting pressure of the window is higher than average, and the window needs to be increased or the traffic needs to be shared.
For each queue, the waiting number of the transacted people is segmented and counted according to a fixed time period, one time is set every 5 minutes, the waiting people number change data is formed, and 3 services with the highest waiting people number ratio are simultaneously separated from the data. This forms the trend of the change of the waiting population of the corresponding queue and the corresponding 3 types of services with the highest occupation ratio. And (3) taking time as a horizontal axis and taking the number as a vertical axis to form a curve, recording time and data when a vertical index exceeds a set threshold value, taking the time and data as important reference data to study, and adjusting corresponding services and window point positions.
Compared with the prior art, the queue design method applied to the hall queuing of the government affair service entity has the following outstanding beneficial effects: the queue design method applied to the service entity hall queuing of the government affairs does not use the traditional single service or single queue queuing mode but adopts a grouping mode on the premise of carrying out the work of multi-point and multi-service queuing of the business of the government affair center, thereby ensuring the correctness and flexibility of the work and maximally ensuring the efficiency; the method is based on the method for collecting the data actually generated by the queuing service and performing statistical analysis, so that the indexes of three dimensions of personnel, windows and services are obtained, and the distribution of window point positions and transaction services is adjusted according to the index result, so that the experience is improved, and the method has good popularization and application values.
Detailed Description
The queue design method applied to hall queuing of the government affairs service entity according to the present invention will be described in further detail with reference to the following embodiments.
Examples
The method binds the window point location and the transaction service, controls conflict when calling the queuing number, verifies the reasonability of the window point location and the distribution of the transaction service, and corrects the window point location and the distribution of the transaction service according to the data of the running condition. Setting a grouping queue according to the development of business handling, setting a used queue and business handling for each window point location, acquiring a lock corresponding to the window point location in an internal memory lock when queuing is carried out, taking the number of the lock acquisition process in the set queue according to rules, and releasing the lock after the number taking is finished; and data archiving is performed after the number taking and calling are completed. The present invention realizes the memory lock by using redis, etc., and can also realize the unified lock function by using other modes. The method specifically comprises the following steps:
and S1, setting a packet queue.
Researching and combing the transactable business on each point location, starting with the point location A, finding other point locations B and C, D … capable of transacting the business, if the found point location B (C, D …) transacts business different from the point location A, continuing to find other point locations on the basis of the found point location until the transactable business of the found point location is not transacted in other point locations except the found point location, and forming the business into a group AA; and forming other service groups BB and CC … in the same way until all the trafficable services in the lobby are distributed. AA. The traffic in these packets BB, CC … do not cross each other.
And S2, associating business handling by the window point.
Setting transactable business for each point location according to previous investigation and combing; the requirement here is that only one queue can be selected from the queues formed before, i.e. each window can only correspond to one queue, and the requirement of only corresponding to one queue can be met just because the combing mode of the previous queue already contains the services that all windows can handle.
S3, call mutual exclusion and concurrency.
After the people are transacted to fetch the number, the system enters a waiting queue. When the window point location calls, the implementation logic is as follows: when a window point sends a call request, firstly, a lock corresponding to the window is requested in a memory lock module, the lock identifier is unique in the lock module, if the lock is obtained, the next operation is carried out, otherwise, the next operation is continued to wait until the lock is obtained or the return is overtime; when a lock is requested to be obtained, sequencing according to a service code set by a window in a waiting queue according to a set queuing logic to obtain queuing information, and locking data and releasing the lock immediately after obtaining the queuing information; in the process, all window points using the same queue group are mutually exclusive when in concurrent calling, so as to ensure the correctness of queuing; when the queue groups used by the windows sending the call requests are different, the lock identifications required to be obtained are different, so that no rejection is generated and the processes can be carried out respectively. Therefore, through the design, under the specific service requirement of the government affair hall, the accuracy and the high efficiency of operation of the service can be considered.
And S4, packet queue index deduction.
And on the basis of the data obtained by the operation of the business handling, deducing the data according to a set rule to obtain the operation condition of the current queuing business, and adjusting the window point position and the setting of the business handling. Wherein the grouping index comprises a service waiting index, a window waiting index and a crowd index.
And counting the average waiting time AW of the similar services, the average waiting time BW of all the services in the queue, the average handling time AD of the similar services and the average handling time BD of all the services in the same queue. Calculating a total waiting index BPW (business to business) BW/BD and APW (business to business) AW/AD of the same type of business, if the APW is larger than the BPW, the business is influenced by the queuing of other businesses to be lengthened, finding out all businesses exceeding the BPW, calculating an influence ratio APW/BPW, and analyzing as a key business if the influence ratio is larger.
Statistical studies were performed on data from all windows using the same cohort, as follows: and counting the average transaction time AD and the waiting time AW of all transaction services in the window, and counting the total average transaction time BD and the average waiting time BW of all transaction services in the window in the same queue. And calculating the waiting coefficient APW of each window, AW/AD, and the total waiting coefficient BPW, BW/BD, and when the APW is larger than the BPW window, the waiting pressure of the window is higher than average, and the window needs to be increased or the traffic needs to be shared.
For each queue, the waiting number of the transacted people is segmented and counted according to a fixed time period, one time is set every 5 minutes, the waiting people number change data is formed, and 3 services with the highest waiting people number ratio are simultaneously separated from the data. This forms the trend of the change of the waiting population of the corresponding queue and the corresponding 3 types of services with the highest occupation ratio. And (3) taking time as a horizontal axis and taking the number as a vertical axis to form a curve, recording time and data when a vertical index exceeds a set threshold value, taking the time and data as important reference data to study, and adjusting corresponding services and window point positions.
The invention groups the service by grouping queues, the grouping mode is the maximization of the window point location associated service, a large group, namely a queuing queue, can be provided with a plurality of queuing queues in a place, and the service can not be crossed among different queuing queues. The window point location takes a window as a unit, and the window point location is associated with the service which needs to be handled, and the service can be selected from only one queue. The memory lock is used for locking the queue ID, and when a call action is carried out, the lock of the queue ID corresponding to a window needs to be obtained firstly, so that the operation of obtaining data in the same queue is ensured to be only one process. The different queues are not affected and can be performed simultaneously. The queuing index is used for carrying out statistical analysis on the running data in three dimensions of personnel, windows, business and the like.
The queue design method applied to the hall queuing of the government affair service entity realizes the management of departments, windows, services and queues in a management system in actual operation, wherein the queue management finishes the establishment of a queuing queue, a queue name and an identifier are newly added at first, the services are associated in the queue, the queue design method has a checking function, and each service only exists in one queue. The window management realizes that the window and the service are associated to form a window service group, and each window can only select the service from one queuing queue. The number taking system is added into a queuing waiting queue after number taking, and comprises number taking time, a queuing queue ID and a service ID. The memory lock is realized by a redis lock, and a cluster can be adopted under large-scale deployment. When a calling system calls, firstly, the lock in the redis is tried to be acquired, the ID of the lock is the ID of a packet queue, when the lock is successfully acquired, data is immediately acquired from the waiting queue, the data is marked, then the lock is released, other subsequent processing actions are finished outside the lock, and each thread runs independently without conflict. In the whole operation process, the competition process of the lock is short, and the competition range is not large.
The above-described embodiments are merely preferred embodiments of the present invention, and general changes and substitutions by those skilled in the art within the technical scope of the present invention are included in the protection scope of the present invention.
Claims (8)
1. A queue design method applied to hall queuing of government affair service entities is characterized in that: the method binds the window point location and the business handling service, controls conflict when calling the queuing number, verifies the rationality of the window point location and the business handling service distribution, and corrects the window point location and the business handling service distribution according to the data of the running condition.
2. A queue design method applied to hall queuing of government affairs service entities according to claim 1, wherein: setting a grouping queue according to the development of business handling, setting a used queue and business handling for each window point location, acquiring a lock corresponding to the window point location in an internal memory lock when queuing is carried out, taking the number of the lock acquisition process in the set queue according to rules, and releasing the lock after the number taking is finished; and data archiving is performed after the number taking and calling are completed.
3. A queue design method applied to hall queuing of government affairs service entities according to claim 2, wherein: the method specifically comprises the following steps:
s1, setting a grouping queue;
s2, associating business handling with the window point;
s3, carrying out call mutual exclusion and concurrence;
and S4, packet queue index deduction.
4. A queue design method applied to hall queuing of government affairs service entities according to claim 3, wherein: in step S1, in the process of setting a grouping queue, the corresponding transaction services at each window point are combed, a window point capable of handling the transaction service is found starting from the window point a, if the found window point also handles a service different from the window point a, other window points are continuously found based on the found window point, until the found window point can handle the transaction services other than the found window point, the same transaction service is grouped into a group until all the transactable services are completely allocated.
5. A queue design method applied to hall queuing of government affairs service entities according to claim 4, wherein: in step S2, in the process of window point association transaction, a transactable service is set for each window point from the formed queues, and each window point corresponds to one queue.
6. A queue design method applied to hall queuing of government affairs service entities according to claim 5, wherein: in step S3, after the window point sends the call request, the lock corresponding to the window point is requested in the memory lock, the queuing information is obtained by ordering according to the service code set by the window point in the waiting queue according to the set queuing roberts, and the data is locked and the lock is released after obtaining.
7. A queue design method applied to hall queuing of government affairs service entities according to claim 6, wherein: in step S4, based on the data obtained by the business transaction, the data is deduced according to the set rules to obtain the current queuing business operation status, and the window point and the business transaction settings are adjusted.
8. A queue design method applied to hall queuing of government affairs service entities according to claim 7, wherein: the business grouping index comprises a business waiting index, a window waiting index and a crowd index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110532242.5A CN113342871A (en) | 2021-05-17 | 2021-05-17 | Queue design method applied to government affair service entity hall queuing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110532242.5A CN113342871A (en) | 2021-05-17 | 2021-05-17 | Queue design method applied to government affair service entity hall queuing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113342871A true CN113342871A (en) | 2021-09-03 |
Family
ID=77468843
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110532242.5A Pending CN113342871A (en) | 2021-05-17 | 2021-05-17 | Queue design method applied to government affair service entity hall queuing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113342871A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113781698A (en) * | 2021-11-15 | 2021-12-10 | 浪潮软件股份有限公司 | Window number calling automatic distribution method used in government affair service field |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103440698A (en) * | 2013-09-18 | 2013-12-11 | 国家电网公司 | Queue calling method and queue server |
| CN104537752A (en) * | 2015-01-30 | 2015-04-22 | 浪潮软件股份有限公司 | Queuing method, cloud server and system |
| WO2015076683A1 (en) * | 2013-11-22 | 2015-05-28 | Atilano Philip Adrian | A versatile queuing management system and method |
| CN105303307A (en) * | 2015-10-16 | 2016-02-03 | 北京京北方信息技术有限公司 | Method and device for distributing work tasks |
| CN106951973A (en) * | 2017-04-07 | 2017-07-14 | 国网山东省电力公司 | Power Material provider service hall information Real-Time Sharing system and method |
| CN108256660A (en) * | 2018-01-02 | 2018-07-06 | 甘肃万维信息技术有限责任公司 | A kind of E-Government reservation system |
| CN111382177A (en) * | 2020-03-09 | 2020-07-07 | 中国邮政储蓄银行股份有限公司 | Service data task processing method, device and system |
-
2021
- 2021-05-17 CN CN202110532242.5A patent/CN113342871A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103440698A (en) * | 2013-09-18 | 2013-12-11 | 国家电网公司 | Queue calling method and queue server |
| WO2015076683A1 (en) * | 2013-11-22 | 2015-05-28 | Atilano Philip Adrian | A versatile queuing management system and method |
| CN104537752A (en) * | 2015-01-30 | 2015-04-22 | 浪潮软件股份有限公司 | Queuing method, cloud server and system |
| CN105303307A (en) * | 2015-10-16 | 2016-02-03 | 北京京北方信息技术有限公司 | Method and device for distributing work tasks |
| CN106951973A (en) * | 2017-04-07 | 2017-07-14 | 国网山东省电力公司 | Power Material provider service hall information Real-Time Sharing system and method |
| CN108256660A (en) * | 2018-01-02 | 2018-07-06 | 甘肃万维信息技术有限责任公司 | A kind of E-Government reservation system |
| CN111382177A (en) * | 2020-03-09 | 2020-07-07 | 中国邮政储蓄银行股份有限公司 | Service data task processing method, device and system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113781698A (en) * | 2021-11-15 | 2021-12-10 | 浪潮软件股份有限公司 | Window number calling automatic distribution method used in government affair service field |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1095120C (en) | Computer system having client-server architecture | |
| CN107992359B (en) | Task scheduling method for cost perception in cloud environment | |
| CN111752965B (en) | Real-time database data interaction method and system based on micro-service | |
| US20100077107A1 (en) | Storage-side storage request management | |
| Hordijk et al. | On the assignment of customers to parallel queues | |
| CA2522096A1 (en) | Concurrent access of shared resources | |
| CN113342871A (en) | Queue design method applied to government affair service entity hall queuing | |
| WO2020211606A1 (en) | Parking space allocation method, parking space allocation system, and storage medium | |
| CN111752708A (en) | Storage system self-adaptive parameter tuning method based on deep learning | |
| CN107193898A (en) | The inquiry sharing method and system of log data stream based on stepped multiplexing | |
| CN114841374A (en) | Method for optimizing transverse federated gradient spanning tree based on stochastic greedy algorithm | |
| Tong et al. | Dynamic task assignment in spatial crowdsourcing | |
| CA2455917A1 (en) | Victim selection for deadlock detection | |
| CN106686619B (en) | Performance evaluation method and equipment | |
| CN113269957A (en) | Parking lot parking space scheduling system and method | |
| CN110347726A (en) | A kind of efficient time series data is integrated to store inquiry system and method | |
| CN115357651A (en) | ETL system based on dispatching center | |
| CN114462831A (en) | Effectiveness evaluation method and system for police reconnaissance cloud platform system | |
| CN113488147A (en) | Intelligent guiding and detecting prompt system for monitoring and physical examination of customs entry and exit personnel | |
| Fryer | Organizational Structure of Dual‐Constraint Job Shops | |
| CN111523990B (en) | Multi-dimensional accounting processing system and method for financial data | |
| US20230305941A1 (en) | Systems and methods for isolating transactions to a pseudo-wait-for-input region | |
| WO2024138788A1 (en) | Task resource scheduling method and system for htap | |
| CN117194579A (en) | Distributed database resource lock queue management method, system and device | |
| CN118101411A (en) | Event-driven cross-channel data synchronization method and system |
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: 20210903 |
|
| RJ01 | Rejection of invention patent application after publication |