CN112561266A - Service request processing method, device, equipment and storage medium - Google Patents
Service request processing method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112561266A CN112561266A CN202011411445.0A CN202011411445A CN112561266A CN 112561266 A CN112561266 A CN 112561266A CN 202011411445 A CN202011411445 A CN 202011411445A CN 112561266 A CN112561266 A CN 112561266A
- Authority
- CN
- China
- Prior art keywords
- service
- request
- time
- determining
- plan information
- 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
- 238000003860 storage Methods 0.000 title claims abstract description 16
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 22
- 238000012545 processing Methods 0.000 claims abstract description 22
- 230000004044 response Effects 0.000 claims abstract description 9
- 238000004590 computer program Methods 0.000 claims description 11
- 238000009826 distribution Methods 0.000 claims description 11
- 230000003442 weekly effect Effects 0.000 claims description 7
- 238000012790 confirmation Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 11
- 238000004140 cleaning Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004080 punching Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06314—Calendaring for a resource
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a service request processing method, a service request processing device, service request processing equipment and a storage medium. The method comprises the following steps: acquiring service plan information of a plurality of merchants; in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request; and distributing the service request of the user to the merchant according to the matching result. Through the scheme, when the service requests are matched and distributed, the service requests do not need to be strictly ordered according to the sequence of the order coming first and coming last, but can be flexibly ordered according to the actual time of the service requests, in addition, the service requests can be ordered by users instead, or the service terminals can also be ordered, so that the processing requirements of diversified service requests are met.
Description
Technical Field
The embodiment of the invention relates to the technical field of internet, in particular to a service request processing method, a service request processing device, service request processing equipment and a storage medium.
Background
With the development of internet technology, service merchants receive service orders more and more conveniently. New orders may often be added during the process of the order being processed by the service merchant.
In practical applications, when a service merchant provides services, service personnel can only provide services for one user at the same time. When the service order allocation is performed, it is sufficient to consider that no time conflict occurs between the new service order and the existing service order. Therefore, a technical solution capable of timely, fast and reasonably processing the service request is needed.
Disclosure of Invention
The embodiment of the invention provides a service request processing method, a service request processing device, service request processing equipment and a storage medium, which are used for meeting the technical scheme of diversified card punching requirements of service merchants.
In a first aspect, an embodiment of the present invention provides a method for processing a service request, where the method includes:
acquiring service plan information of a plurality of merchants;
in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request;
and distributing the service request of the user to the merchant according to the matching result.
Optionally, the obtaining service plan information of a plurality of merchants includes:
determining at least one date on which to provide the service based on the weekly schedule;
according to the service content, performing multi-period splitting on the at least one date to obtain a multi-dimensional service plan; wherein different said time periods correspond to different service contents and service charges;
generating the service plan information based on the multi-dimensional service plan.
Optionally, the determining at least one piece of service plan information matching a request time in the service request includes:
acquiring request starting time and request duration contained in the request time;
and if the request duration is matched with any time interval in the multi-dimensional service plan and the time interval between the request starting time and the plan starting time of any time interval is smaller than an interval threshold, determining that the service plan information contains the matching between any time interval and the service request.
Optionally, the determining that the time interval between the request start time and the scheduled start time of any time interval is smaller than the interval threshold includes:
determining the request start time;
determining the scheduled start time that is earlier than the request start time and/or the scheduled start time that is later than the request start time;
determining at least one of the arbitrary time periods matching the service request for which the time interval is less than the interval threshold.
Optionally, the obtaining service plan information of a plurality of merchants includes:
acquiring added service orders in the service plan information of the multiple merchants;
and determining the order starting time and the order ending time of the added service order.
Optionally, the determining at least one of the merchant service plan information that matches a request time in the service request includes:
acquiring request starting time and request ending time contained in the request time;
and if the request ending time is not later than the order starting time and the request starting time is not earlier than the order ending time, determining that the service request is matched with the service plan information.
Optionally, the allocating, according to the matching result, the service request of the user to the merchant includes:
feeding back the distribution result to the user;
and responding to confirmation information of the user confirming the distribution result, and distributing the service request to the merchant.
In a second aspect, an embodiment of the present invention provides a service request processing apparatus, including:
the acquisition module is used for acquiring service plan information of a plurality of merchants;
the determining module is used for responding to a service request of a user and determining at least one piece of service plan information matched with the request time in the service request;
and the distribution module is used for distributing the service request of the user to the merchant according to the matching result.
In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory, where the memory is configured to store one or more computer instructions, and when executed by the processor, the one or more computer instructions implement the service request processing method according to the first aspect.
In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium storing a computer program, which when executed by one or more processors causes the one or more processors to perform actions comprising:
acquiring service plan information of a plurality of merchants;
in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request;
and distributing the service request of the user to the merchant according to the matching result.
In the embodiment of the invention, the service plan information of a plurality of merchants is acquired; in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request; and distributing the service request of the user to the merchant according to the matching result. Through the scheme, when the service requests are matched and distributed, the service requests do not need to be strictly ordered according to the sequence of the order coming first and coming last, but can be flexibly ordered according to the actual time of the service requests, in addition, the service requests can be ordered by users instead, or the service terminals can also be ordered, so that the processing requirements of diversified service requests are met.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flowchart of a service request processing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a method for obtaining service plan information according to an embodiment of the present disclosure;
fig. 3 is a schematic flowchart of another method for obtaining service plan information according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a service request processing apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device corresponding to the service request processing apparatus provided in the embodiment of fig. 4.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely 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. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, and "a plurality" typically includes at least two.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
It is also noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a good or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such good or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a commodity or system that includes the element.
With the development of service business, more and more service merchants live in, and more service requests can be received by the platform. Upon receiving the service request, the service request is distributed such that the service request can be distributed to a reasonably large service merchant. However, during the distribution process, since each service merchant originally contains the service orders that have been reserved, when there are new service requests, the new service requests need to be added on the basis of the original service orders. Therefore, a solution is needed that enables a fast and rational allocation of new service requests.
Fig. 1 is a flowchart illustrating a service request processing method provided in an embodiment of the present application, and is applied to a server (for example, a cloud server or a server cluster), as shown in fig. 1, the method includes the following steps:
101: service plan information for a plurality of merchants is obtained.
102: and responding to a service request of a user, and determining at least one piece of service plan information matched with the request time in the service request.
103: and distributing the service request of the user to the merchant according to the matching result.
It should be noted that the service plan information may be a service plan pre-made by the merchant, for example, a month plan, a week plan, a day plan, and the like. These schedules may or may not include service requests or service orders, but rather may include a scheduled time table. The service plan information mentioned here may be the service order that has been added, and no planning is performed, and the time allocation is completely requested by the user, in other words, the service plan information is completely made according to the service request made by the user. In the following embodiments, the two service plan information and the corresponding allocation methods thereof will be illustrated separately, and details will not be repeated here, and the following embodiments may be referred to specifically.
In practical application, when service merchant allocation is performed for a service request of a user, more merchants can be recommended for the user at one time. So that the user can select a more appropriate service merchant and service time according to the preference or time of the user. And then, distributing the service request to the corresponding merchant according to the matching result fed back by the user, and finishing the processing of the new service request.
How to perform the access request processing will be described below by way of example according to the content of the service plan information. Fig. 2 is a schematic flowchart of a method for acquiring service plan information according to an embodiment of the present disclosure. From fig. 2 it can be seen that the method comprises the following steps:
201: at least one date on which the service is provided is determined according to the weekly schedule.
202: according to the service content, performing multi-period splitting on the at least one date to obtain a multi-dimensional service plan; wherein different said time periods correspond to different service contents and service charges.
203: generating the service plan information based on the multi-dimensional service plan.
In practical application, when the plan is made, the plan may be a weekly plan or a monthly plan, and the plan may be specifically selected according to practical application requirements. This is by way of example only and is not intended to be limiting. Of course, the weekly plan is exemplified here because if the plan is made too much and too long, the execution effect is not good, and it is easy to adjust or reset the plan due to some conditions in the middle. Therefore, it is more reasonable to customize the weekly schedule.
For example, in a planned week, there may be times during which no service is provided, i.e., during the week, saturday is not provided, and only monday through friday are available for providing service; still further, saturday services are provided, with no service being provided on a random day selected between monday and friday.
After the dates capable of providing the service are determined, the dates are split in multiple periods, during splitting, the splitting dimensions of the dates may be different, the same date can correspond to multiple dimensions, and a multi-dimensional service plan is obtained. The corresponding service content is different and the corresponding service cost is different in different time periods. For example, the cleaning service can be divided into simple cleaning and deep cleaning, assuming that the simple cleaning is only cleaning the ground, the corresponding service time is 1 hour, and the charge is 200 yuan; the rooms can be cleaned thoroughly by deep cleaning, the corresponding service time is 5 hours, and the charge is 800 yuan. Thus, a day may be split into multiple periods of multiple dimensions. For example, the split can be 5 simple cleaning and 1 deep cleaning, or two deep cleaning. And obtaining service plan information of at least one date capable of providing service in the week plan by adopting the same splitting mode.
In one or more embodiments of the present application, determining at least one piece of service plan information matching a request time in the service request as described in step 102 includes: acquiring request starting time and request duration contained in the request time; and if the request duration is matched with any time interval in the multi-dimensional service plan and the time interval between the request starting time and the plan starting time of any time interval is smaller than an interval threshold, determining that the service plan information contains the matching between any time interval and the service request.
The request time referred to herein includes a request start time and a request duration. It is easy to understand that, when a user sends a service request, not only the service type but also the start time and the service duration of the required service need to be specified. Of course, in some application scenarios, in application scenarios with diverse services, even if the same type of service is used, the service time lengths required by different users are not completely the same, and it is necessary for the user to specify the service type and the request time length when sending a service request. In practical application, the request duration may also be limited by a specified amount, for example, each time a user requests a certain service, and each time 100 yuan of service fee is added, the corresponding service duration is extended by 1 hour.
After the request time of the user is obtained, the service plan information of a plurality of merchants needs to be matched according to the request time. Specifically, if the request duration is not longer than any period in the predetermined multidimensional service plan, and the time interval between the request start time and the plan start time of any period is also smaller than the interval threshold, it indicates that any period matches the service request, in other words, the service request can be allocated to any corresponding period. In practice, a service request may be distributed to a plurality of arbitrary time periods, and the user may select which arbitrary time period is required.
In one or more embodiments of the present application, a determination manner that a time interval between the request start time and the scheduled start time of any time period is smaller than an interval threshold includes: determining the request start time; determining the scheduled start time that is earlier than the request start time and/or the scheduled start time that is later than the request start time; determining at least one of the arbitrary time periods matching the service request for which the time interval is less than the interval threshold.
It is readily understood that in the present solution, since the service plan information of the merchant is pre-established, it is established without a service request or a service order. After receiving the service request of the user, the service request is added to any proper time period in a blank filling mode. Therefore, at the time of the judgment, not only the scheduled start time of any one period later than the request start time specified by the user but also the scheduled start time of any one period earlier than the request start time specified by the user are compared. Thereby enabling more choices to be made for the user.
If, after comparison and judgment, both matching results are found, the two matching results can be simultaneously sent to the user, and the user selects any appropriate time period and the merchant corresponding to the time period according to the actual situation of the user.
Fig. 3 is a schematic flowchart of another method for acquiring service plan information according to an embodiment of the present application. From fig. 3 it can be seen that the following steps are included:
301: and acquiring the added service orders in the service plan information of the plurality of merchants.
302: and determining the order starting time and the order ending time of the added service order.
In this embodiment, the service plan information is generated from the received user order without the merchant dividing the multidimensional period in advance. The service plan information is continuously updated as new orders are added. In other words, the service request issued by the user is arranged based on the added service order of the previous reservation. In the service plan information, the scheduled service orders have specific order start time and order end time. Therefore, new service requests need to be specifically scheduled based on order start time and order end time when the addition is made.
In one or more embodiments of the present application, the determining at least one piece of the merchant service plan information that matches the request time in the service request includes: acquiring request starting time and request ending time contained in the request time; and if the request ending time is not later than the order starting time and the request starting time is not earlier than the order ending time, determining that the service request is matched with the service plan information.
In practical applications, in order to avoid the conflict between the new service request and the original service order in terms of time, the request start time and the order end time need to be compared, and the new service request can be executed only when the pre-added service order is already executed and ended, so that the new service request can be executed only when the request start time is later than the order end time. Alternatively, the new service request may have been executed only if the previously added service order has not been executed, and therefore, only if the request end time is earlier than the order start time.
In one or more embodiments of the present application, the allocating, according to the matching result, the service request of the user to the merchant includes: feeding back the distribution result to the user; and responding to confirmation information of the user confirming the distribution result, and distributing the service request to the merchant.
In some application scenarios, multiple alternative merchants (i.e., multiple alternative service plan information or multiple alternative arbitrary time periods) may be assigned to a service request at the same time. The user can select one of the users according to the needs of the user, and the selection result is fed back to the service end, so that the service end distributes the service request of the user to the merchant. Providing users with a wide variety of options.
Based on the embodiment, the service plan information of a plurality of merchants is obtained; in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request; and distributing the service request of the user to the merchant according to the matching result. Through the scheme, when the service requests are matched and distributed, the service requests do not need to be strictly ordered according to the sequence of the order coming first and coming last, but can be flexibly ordered according to the actual time of the service requests, in addition, the service requests can be ordered by users instead, or the service terminals can also be ordered, so that the processing requirements of diversified service requests are met.
Based on the same idea, an embodiment of the present application further provides a service request processing apparatus, and fig. 4 is a schematic structural diagram of the service request processing apparatus provided in the embodiment of the present application. As can be seen from fig. 4, the device comprises:
an obtaining module 41, configured to obtain service plan information of multiple merchants;
a determining module 42, configured to determine, in response to a service request of a user, at least one piece of service plan information that matches a request time in the service request;
and the distribution module 43 is configured to distribute the service request of the user to the merchant according to the matching result.
Optionally, the obtaining module 41 is further configured to determine at least one date for providing the service according to the weekly schedule; according to the service content, performing multi-period splitting on the at least one date to obtain a multi-dimensional service plan; wherein different said time periods correspond to different service contents and service charges; generating the service plan information based on the multi-dimensional service plan.
Optionally, the determining module 42 is configured to obtain a request start time and a request duration included in the request time; and if the request duration is matched with any time interval in the multi-dimensional service plan and the time interval between the request starting time and the plan starting time of any time interval is smaller than an interval threshold, determining that the service plan information contains the matching between any time interval and the service request.
Optionally, the determining module 42 is further configured to determine the request start time;
determining the scheduled start time that is earlier than the request start time and/or the scheduled start time that is later than the request start time;
determining at least one of the arbitrary time periods matching the service request for which the time interval is less than the interval threshold.
Optionally, the obtaining module 41 is further configured to obtain service orders added to the service plan information of the multiple merchants; and determining the order starting time and the order ending time of the added service order.
Optionally, the determining module 42 is further configured to obtain a request start time and a request end time included in the request time; and if the request ending time is not later than the order starting time and the request starting time is not earlier than the order ending time, determining that the service request is matched with the service plan information.
Optionally, the allocating module 43 is configured to feed back the allocation result to the user; and responding to confirmation information of the user confirming the distribution result, and distributing the service request to the merchant.
Based on the embodiment, the service plan information of a plurality of merchants is obtained; in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request; and distributing the service request of the user to the merchant according to the matching result. Through the scheme, when the service requests are matched and distributed, the service requests do not need to be strictly ordered according to the sequence of the order coming first and coming last, but can be flexibly ordered according to the actual time of the service requests, in addition, the service requests can be ordered by users instead, or the service terminals can also be ordered, so that the processing requirements of diversified service requests are met.
In a possible design, the structure of the service request processing apparatus shown in fig. 4 may be implemented as an electronic device, and as shown in fig. 5, the electronic device corresponding to the service request processing apparatus provided in the embodiment shown in fig. 4 may include: a processor 51, a memory 52, wherein the memory 52 is used for storing one or more computer instructions, and when the one or more computer instructions are executed by the processor 51, the steps performed by the server in the foregoing embodiments are implemented.
Optionally, the electronic device may further include a communication interface 53 for communicating with other devices.
In addition, an embodiment of the present invention provides a computer storage medium for storing a computer program, where the computer program enables a client to implement the service request processing method in the embodiment shown in fig. 1 when executed.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by adding a necessary general hardware platform, and of course, can also be implemented by a combination of hardware and software. With this understanding in mind, the above-described aspects and portions of the present technology which contribute substantially or in part to the prior art may be embodied in the form of a computer program product, which may be embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including without limitation disk storage, CD-ROM, optical storage, and the like.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable resource updating apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable resource updating apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable resource updating apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable resource updating apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A service request processing method is applied to a server side, and the method comprises the following steps:
acquiring service plan information of a plurality of merchants;
in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request;
and distributing the service request of the user to the merchant according to the matching result.
2. The method of claim 1, wherein obtaining service plan information for a plurality of merchants comprises:
determining at least one date on which to provide the service based on the weekly schedule;
according to the service content, performing multi-period splitting on the at least one date to obtain a multi-dimensional service plan; wherein different said time periods correspond to different service contents and service charges;
generating the service plan information based on the multi-dimensional service plan.
3. The method of claim 2, wherein said determining at least one of said service plan information that matches a request time in said service request comprises:
acquiring request starting time and request duration contained in the request time;
and if the request duration is matched with any time interval in the multi-dimensional service plan and the time interval between the request starting time and the plan starting time of any time interval is smaller than an interval threshold, determining that the service plan information contains the matching between any time interval and the service request.
4. The method of claim 3, wherein determining that the time interval between the request start time and the scheduled start time of the any time period is less than an interval threshold comprises:
determining the request start time;
determining the scheduled start time that is earlier than the request start time and/or the scheduled start time that is later than the request start time;
determining at least one of the arbitrary time periods matching the service request for which the time interval is less than the interval threshold.
5. The method of claim 1, wherein obtaining service plan information for a plurality of merchants comprises:
acquiring added service orders in the service plan information of the multiple merchants;
and determining the order starting time and the order ending time of the added service order.
6. The method of claim 5, wherein the determining at least one of the merchant service plan information that matches a request time in the service request comprises:
acquiring request starting time and request ending time contained in the request time;
and if the request ending time is not later than the order starting time and the request starting time is not earlier than the order ending time, determining that the service request is matched with the service plan information.
7. The method according to claim 3 or 5, wherein said allocating the service request of the user to the merchant according to the matching result comprises:
feeding back the distribution result to the user;
and responding to confirmation information of the user confirming the distribution result, and distributing the service request to the merchant.
8. A service request processing apparatus, characterized in that the apparatus comprises:
the acquisition module is used for acquiring service plan information of a plurality of merchants;
the determining module is used for responding to a service request of a user and determining at least one piece of service plan information matched with the request time in the service request;
and the distribution module is used for distributing the service request of the user to the merchant according to the matching result.
9. An electronic device, comprising: a processor, a memory for storing one or more computer instructions, wherein the one or more computer instructions, when executed by the processor, implement the service request processing method of any of claims 1 to 7.
10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by one or more processors, causes the one or more processors to perform acts comprising:
acquiring service plan information of a plurality of merchants;
in response to a service request of a user, determining at least one piece of service plan information matched with a request time in the service request;
and distributing the service request of the user to the merchant according to the matching result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011411445.0A CN112561266A (en) | 2020-12-04 | 2020-12-04 | Service request processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011411445.0A CN112561266A (en) | 2020-12-04 | 2020-12-04 | Service request processing method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112561266A true CN112561266A (en) | 2021-03-26 |
Family
ID=75048728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011411445.0A Pending CN112561266A (en) | 2020-12-04 | 2020-12-04 | Service request processing method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112561266A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116366436A (en) * | 2023-04-21 | 2023-06-30 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109087160A (en) * | 2018-06-15 | 2018-12-25 | 长沙市到家悠享家政服务有限公司 | Order processing method, apparatus and electronic equipment |
| CN109087171A (en) * | 2018-06-15 | 2018-12-25 | 长沙市到家悠享家政服务有限公司 | Service merchant recommendation method, device and electronic equipment |
| CN109191236A (en) * | 2018-06-15 | 2019-01-11 | 长沙市到家悠享家政服务有限公司 | Order generation method, device and electronic equipment |
| CN110334981A (en) * | 2019-05-27 | 2019-10-15 | 天津五八到家科技有限公司 | Information processing method and terminal device |
-
2020
- 2020-12-04 CN CN202011411445.0A patent/CN112561266A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109087160A (en) * | 2018-06-15 | 2018-12-25 | 长沙市到家悠享家政服务有限公司 | Order processing method, apparatus and electronic equipment |
| CN109087171A (en) * | 2018-06-15 | 2018-12-25 | 长沙市到家悠享家政服务有限公司 | Service merchant recommendation method, device and electronic equipment |
| CN109191236A (en) * | 2018-06-15 | 2019-01-11 | 长沙市到家悠享家政服务有限公司 | Order generation method, device and electronic equipment |
| CN110334981A (en) * | 2019-05-27 | 2019-10-15 | 天津五八到家科技有限公司 | Information processing method and terminal device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116366436A (en) * | 2023-04-21 | 2023-06-30 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
| CN116366436B (en) * | 2023-04-21 | 2024-03-05 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107959640B (en) | Network service scheduling method and device | |
| US20150269652A1 (en) | Method and system for processing periodic orders | |
| CN107844877B (en) | Order distribution method and device | |
| CN109426989B (en) | Order processing method, method and equipment for providing reservation service | |
| CN108764608A (en) | A kind of driver dispatches method, terminal and server-side | |
| US11488078B2 (en) | System and method for time slot assignment | |
| CN109996202B (en) | Flow charging method and device | |
| CN105608087B (en) | resource scheduling method and device | |
| CN111506398A (en) | Task scheduling method and device, storage medium and electronic device | |
| CN110888922B (en) | Method and device for creating target table during data synchronization | |
| US20190266523A1 (en) | Resource Processing Method and Device | |
| CN104301257A (en) | Resource distribution method, device and equipment | |
| CN110288276B (en) | Method and device for generating information | |
| CN112561266A (en) | Service request processing method, device, equipment and storage medium | |
| CN110008211B (en) | Data query method and device, electronic equipment and storage medium | |
| CN107295052B (en) | Service processing method and device | |
| CN109102200B (en) | Timed task processing method and device | |
| CN108241535B (en) | Resource management method and device and server equipment | |
| US20160189090A1 (en) | Smart Scheduling for Processing Back Orders | |
| CN112839093A (en) | Information display method and device, storage medium and electronic equipment | |
| WO2016195703A1 (en) | Pricing of cloud resources | |
| CN111915340A (en) | Merchant type identification method, device, equipment and storage medium | |
| CN112435071B (en) | Popularization data creation method and system | |
| CN114169733A (en) | Resource allocation method and device | |
| CN112509164A (en) | Attendance card-punching method, attendance card-punching device, attendance card-punching equipment and storage medium |
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 |