CN111861182B - Schedule creation method, device and system - Google Patents

Schedule creation method, device and system Download PDF

Info

Publication number
CN111861182B
CN111861182B CN202010673410.8A CN202010673410A CN111861182B CN 111861182 B CN111861182 B CN 111861182B CN 202010673410 A CN202010673410 A CN 202010673410A CN 111861182 B CN111861182 B CN 111861182B
Authority
CN
China
Prior art keywords
schedule
terminal
execution
created
task
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010673410.8A
Other languages
Chinese (zh)
Other versions
CN111861182A (en
Inventor
房运
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shandong Inspur Innovation and Entrepreneurship Technology Co Ltd
Original Assignee
Shandong Inspur Innovation and Entrepreneurship Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shandong Inspur Innovation and Entrepreneurship Technology Co Ltd filed Critical Shandong Inspur Innovation and Entrepreneurship Technology Co Ltd
Priority to CN202010673410.8A priority Critical patent/CN111861182B/en
Publication of CN111861182A publication Critical patent/CN111861182A/en
Application granted granted Critical
Publication of CN111861182B publication Critical patent/CN111861182B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • 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/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a schedule creating method, a schedule creating device and a schedule creating system, wherein the method at least comprises the following steps: according to the received request information which is sent by the first terminal and is used for creating the first schedule for the second terminal and comprises the first schedule execution time [ T 1,T2 ], whether the second terminal has the created second schedule in [ T 1-t,T2 +t ] or not is searched based on the terminal identification of the second terminal, if the second terminal has the created second schedule in [ T 1-t,T2 +t ], whether the schedule of the second terminal needs to be updated or not is judged, if yes, updating is carried out, and updating information is sent to the second terminal.

Description

Schedule creation method, device and system
Technical Field
The present invention relates to the field of mobile terminals, and in particular, to a method, an apparatus, and a system for creating a schedule.
Background
In the prior enterprise management process, when an upper department transmits tasks to a lower department in an offline task transmission mode, due to barriers existing between organizational levels, the situation that the tasks exist or a plurality of lower departments cannot be timely reached, or the tasks in the same or similar time period are transmitted to the same lower department by a plurality of upper departments to cause task conflict exists, and finally the lower department can not completely finish the work of leading arrangement, so that the work progress is seriously influenced. Particularly, when the matters to be completed are related to more people or to reserved clients, the influence on enterprises is large. Specific tasks include customer visits and the like.
Off-line task communication cannot ensure access to a plurality of departments, and the task completion rate is affected; when the task issuing period is longer, the task completion condition of feedback collection is scattered and is easy to lose.
For this reason, a method capable of uniformly issuing tasks and creating schedule tasks has been sought.
Disclosure of Invention
In order to solve the technical problems, the invention provides a schedule creation method, a schedule creation device and a schedule creation system, which can effectively cope with schedule creation in a multi-schedule scene, and provides a flexible and efficient schedule creation method.
The technical scheme provided by the invention is as follows:
in a first aspect, a schedule creation method is provided, the method at least comprising the steps of:
receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
Searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
If the second terminal has the created second schedule in the [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
and sending the updated information to the second terminal.
In some preferred embodiments, the searching whether the second terminal has the created second schedule in [ T 1-t,T2 +t ] based on the terminal identification of the second terminal includes:
Searching any second schedule, a corresponding second schedule execution place and second schedule execution time [ T 3,T4 ] which are created by the second terminal based on the terminal identification of the second terminal;
invoking a map application interface to inquire the travel time delta t between the first schedule execution place and the second schedule execution place;
When T 3∈[T1-δt,T2 + δt or T 4∈[T1-δt,T2 + δt ], the second terminal has the second schedule created at [ T 1-t,T2 + T ].
In some preferred embodiments, the invoking the map application interface to query the travel time δt between the first and second schedule execution sites includes:
inquiring the travel time delta T from the second schedule execution place to the first schedule execution place at the moment T 4 in the historical data of the map application; or;
In the historical data of the map application, inquiring the travel time delta T from the first schedule execution place to the second schedule execution place at the moment T 2.
In some preferred embodiments, when the second terminal has the created second schedule at [ T 1-t,T2 +t ], determining whether updating of the schedule of the second terminal is required, if yes, updating includes:
respectively extracting a first task emergency degree score of a first schedule and a second task emergency degree score of a second schedule;
comparing the first task emergency degree with the second task emergency degree;
When the first task urgency score is higher than the second task urgency score, canceling the second schedule with execution time [ T 3,T4 ] for the second terminal, and creating the first schedule with execution time [ T 1,T2 ].
In some preferred embodiments, when the first task urgency score is not greater than the second task urgency score:
searching the free time of the first terminal except for the time T 3,T4 in the same day and feeding back the free time to the first terminal so as to facilitate the selection of the first terminal;
based on the received execution time [ T 5,T6 ] selected by the first terminal, searching whether the second terminal has the created third schedule in [ T 5-t,T6 +t ], wherein T is more than or equal to 0.
In some preferred embodiments, whenAnd/>The second terminal does not have the second schedule created at [ T 1-t,T2 + T ].
In some preferred embodiments, if the second terminal does not have the second schedule already created in [ T 1-t,T2 +t ], the first schedule with the execution time of [ T 1,T2 ] is created for the second terminal.
In some preferred embodiments of the present invention,
Searching whether the second terminal has the created second schedule in [ T 1-t,T2 +t ] based on the terminal identification of the second terminal, wherein T is more than or equal to 0, and the method comprises the following steps:
Searching any second schedule, a corresponding second schedule execution place and second schedule execution time [ T 3,T4 ] which are created by the second terminal based on the terminal identification of the second terminal;
Invoking a map application interface to inquire the distance between the first schedule execution place and the second schedule execution place;
When T 3∈[T1-t,T2 +t or T 4∈[T1-t,T2 +t ], the second terminal has a second schedule created at [ T 1-t,T2 +t ];
Wherein t is an empirical value:
When the distance L between the first schedule execution place and the second schedule execution place is less than or equal to 10Km, t is 30min;
when the distance between the first schedule execution place and the second schedule execution place is 10Km < L less than or equal to 100Km, t is 2h;
when the distance 100Km < L is less than or equal to 1000Km between the first schedule execution place and the second schedule execution place, t is 24h.
In a second aspect, there is provided a schedule creation apparatus including at least:
The receiving module is used for receiving request information sent by the first terminal, the request information indicates to create a first date for the second terminal, and the request information at least comprises first date execution time [ T 1,T2 ], first date execution place and second terminal identification;
The searching module is used for searching whether the second terminal has the created second schedule within [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, and T is more than or equal to 0;
the updating module is used for judging whether the schedule of the second terminal needs to be updated if the second terminal has the created second schedule in the [ T 1-t,T2 +t ], and if so, updating;
and the sending module is used for sending the updated information to the second terminal.
In a third aspect, there is provided a computer system comprising:
One or more processors; and
A memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the operations of:
receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
Searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
If the second terminal has the created second schedule in the [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
and sending the updated information to the second terminal.
Compared with the prior art, the invention has the beneficial effects that:
The invention provides a schedule creation method, a schedule creation device and a schedule creation system, wherein when a schedule to be created is created, by setting time T and checking whether a second created schedule exists in a time period [ T 1-t,T2 +t ] where a new schedule execution time extension T to be created exists, compared with the scheme that whether a schedule is created in the current offline task transmission or only the scheme that whether the schedule is created in [ T 1,T2 ] is searched, the accuracy of inquiring conflict schedules can be improved, and the rationality, flexibility and effectiveness of schedule creation are further improved;
In a preferred scheme, t is set according to an empirical value, and the empirical value has certain reliability, so that the calculation process is greatly simplified, and the processing capacity is reduced;
In another preferred scheme, by searching all created schedules of the second terminal, determining the travel time delta t according to the distance between the to-be-created schedule and each created execution place, judging whether the created schedules have hidden conflicts to the to-be-created schedule, and further improving the rationality and effectiveness of schedule creation.
The scheme of the application only needs to realize any technical effect.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a schedule creation method according to a first embodiment of the present invention;
FIG. 2 is a flow chart of searching a second schedule according to a first embodiment of the present invention;
FIG. 3 is a flowchart of searching a second schedule according to a second embodiment of the present invention;
Fig. 4 is a block diagram of a schedule creating apparatus in a third embodiment of the present invention;
FIG. 5 is a block diagram of a computer system according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Based on various drawbacks existing in the offline task delivery process in the current enterprise management, tasks have been issued by creating schedules for the person or task associates. However, in the process of creating schedules, there are some situations that the execution time is not overlapped and does not seem to conflict among schedules, and the next task execution point cannot be reached on time after the last task is completed due to the fact that the distance between execution places is far, so as to overcome the problems, a more reasonable, flexible and effective schedule creation method, device and system are provided in the embodiment.
The schedule creation method, apparatus and system will be further described with reference to specific embodiments and fig. 1 to 5.
Example 1
As shown in fig. 1, the present embodiment provides a schedule creating method, which at least includes the following steps:
S1, receiving request information sent by a first terminal, wherein the request information indicates to create a first date for a second terminal, and the request information at least comprises first date execution time [ T 1,T2 ], first date execution place and second terminal identification.
The schedule creating method is implemented based on interaction among the first terminal, the second terminal and the schedule creating server, and is specifically described by taking the example that the first terminal creates a schedule for the second terminal through the server. Taking marketing management as an example, assume that the user of the first terminal in this embodiment is the superior leader P, and the user of the second terminal is the subordinate marketer Q. After P collects the marketing clue, the first terminal edits the request information and sends the request information to the server, and the request information indicates to create a first schedule for Q, where the request information includes: regarding the first schedule content of the marketing thread, the first task urgency score, the first schedule execution time of the envisioned creation [ T 1,T2 ], the first schedule execution place A, and the second terminal identification.
The task emergency degree scoring of the schedule can be achieved by setting the evaluation rule, automatically giving the score by the system after the first schedule content is acquired, or by prompting the user to score himself and then enter the score into the system, and the embodiment is not limited to the method.
After receiving the request information, the schedule creation server extracts the relevant information and starts the information processing described below.
S2, searching whether the second terminal has the created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0.
It will be appreciated that in creating a schedule of [ T 1,T2 ] for a second terminal, it is first necessary to ensure that the second terminal does not have a created second schedule affecting the execution of the first schedule for a certain period of time, which is [ T 1-t,T2 + T ].
As shown in fig. 2, step S2 includes at least the following sub-steps:
S21, searching any second schedule created by the second terminal, a corresponding second schedule execution place B and second schedule execution time T 3,T4 based on the terminal identification of the second terminal.
S22, calling a map application interface to inquire the travel time delta t between the first schedule execution place A and the second schedule execution place B.
There are two cases in which the travel time δt between the first schedule execution point a and the second schedule execution point B is calculated. In the first case, the execution of the second schedule goes from B to a at time T 4 after the completion of the second schedule before the first schedule is to be created for time T 1,T2. In the historical data of the map application, the travel time delta T of Q from the second schedule execution place to the first schedule execution place at the moment T 4 under the proper traffic mode is inquired. In the second case, after the first schedule is to be created for time [ T 1,T2 ], execution of the second schedule proceeds from a to B at time T 2 after the first schedule is completed. In the historical data of the map application, the travel time delta T of Q from the first schedule execution place to the second schedule execution place at the moment T 2 under the proper traffic mode is inquired.
S23, when T 3∈[T1-δt,T2 +δt or T 4∈[T1-δt,T2 +δt ], the second terminal has the second schedule created at [ T 1-t,T2 +t ].
In this embodiment, by setting the expansion time T, the time range of the query is further expanded based on the first schedule execution time [ T 1,T2 ], and whether the second terminal has the created second schedule in [ T 1-t,T2 +t ] is queried. t is an uncertainty time value.
In the searching mode, not only the second schedule with the origin and destination obviously having time conflict with the first schedule in the range of [ T 1,T2 ] can be searched, but also the second schedule with the origin and destination not in the range of [ T 1,T2 ] but in the hidden conflict in the ranges of [ T 1-t,T1 ] and [ T 2,T2 +t ] can be searched. The second schedule with the partial hidden conflict does not have direct time conflict with the first schedule, but because the two execution sites are far away, when Q is driven from one execution site to the other execution site by adopting a proper traffic mode, a certain travel time δt is required to be consumed, and whether the first schedule can be created under the condition of [ T 1,T2 ] is restricted by the existence of δt. Therefore, for any second day schedule with hidden conflict which is created by the second terminal, δt is taken as t, and then whether the schedule is the second schedule with hidden conflict is judged.
For example: when the first schedule content to be created is a visit customer, the first schedule execution time is 9-14 points 2020.6.1, and the first schedule execution place is Beijing. And (3) finding a second schedule which is created at present in the Q, wherein the execution time of the second schedule is 19-21 points of 2020.6.1, and the execution place of the second schedule is Suzhou. Thus, if a first schedule is created, going from Beijing to Suzhou is required, a suitable vehicle is a train, and the required travel time δt is 5.5 hours.
Therefore, the range of the first schedule in [9-5.5,14+5.5] is queried, and the execution time of the second schedule is 19-21 points in the time range, so that the second schedule is a hidden conflict schedule of the first schedule, and the second terminal is judged to have the created second schedule in [ T 1-t,T2 +t ]. Otherwise, if the creation time of the second schedule is 20-21 points of 2020.6.1, the second schedule does not belong to the hidden conflict schedule of the first schedule, and the second terminal is judged to not have the created second schedule in [ T 1-t,T2 +t ].
Of course, whenAnd/>The second terminal does not have the second schedule created at [ T 1-t,T2 + T ].
S3, if the second terminal has the created second schedule in [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating.
When it is found in step S2 that the second terminal has the created second schedule in said [ T 1-t,T2 + T ], step S3 comprises:
S31, respectively extracting a first task emergency degree score of a first schedule and a second task emergency degree score of a second schedule;
s32, comparing the first task emergency degree with the second task emergency degree to obtain a score;
S33, when the first task emergency degree score is higher than the second task emergency degree score, canceling the second schedule with the execution time of [ T 3,T4 ] for the second terminal, and creating the first schedule with the execution time of [ T 1,T2 ].
Conversely:
S32', when the emergency degree score of the first task is not higher than that of the second task, searching the free time of the first terminal except for the time T 3,T4 in the same day and feeding back to the first terminal to facilitate the selection of the first terminal;
S33', based on the received execution time [ T 5,T6 ] selected by the first terminal, searching whether the second terminal has the created third schedule in [ T 5-t,T6 +t ], wherein T is more than or equal to 0.
Of course, in S23And/>When the second terminal does not have the created second schedule [ T 1-t,T2 +t ], the schedule of the second terminal needs to be updated, and the first schedule with the execution time [ T 1,T2 ] is created for the second terminal.
And S4, sending the update information to the second terminal.
After the schedule creation server creates or adjusts the schedule for the second terminal, the server sends the update information to the second terminal, and reminds the user in the modes of short message, mail, popup window display and the like, so as to finish the schedule creation process.
When creating the schedule to be created, the schedule creation method provided by the embodiment sets the time T and checks whether the created second schedule exists in the time period [ T 1-t,T2 +t ] where the execution time of the new schedule to be created is epitaxial T, compared with the current off-line task transmission or only searching for the scheme of whether the created schedule exists in [ T 1,T2 ], the accuracy of inquiring the conflict schedule can be improved, and the rationality, flexibility and effectiveness of schedule creation are further improved;
Further, the method determines the travel time delta t according to the distance between the to-be-created schedule and each created execution place by searching all created schedules of the second terminal, so that whether the created schedules have hidden conflicts to the to-be-created schedule is judged, and the rationality and the effectiveness of schedule creation are further improved.
Example two
The present embodiment provides another schedule creation method including the steps of:
s1, receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
s2, searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
S3, if the second terminal has the created second schedule in [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
And S4, sending the update information to the second terminal.
As shown in fig. 3, step 2 includes the following sub-steps:
S21', searching any second schedule created by the second terminal, a corresponding second schedule execution place and second schedule execution time [ T 3,T4 ] based on the terminal identification of the second terminal;
S22', calling a map application interface to inquire the journey between the first schedule execution place and the second schedule execution place.
S23', when T 3∈[T1-t,T2 +t ] or T 4∈[T1-t,T2 +t ], the second terminal has a second schedule created at [ T 1-t,T2 +t ];
Wherein t is an empirical value, and the specific setting of t is as follows:
When the distance L between the first schedule execution place and the second schedule execution place is less than or equal to 10Km, t is 30min; when the distance between the first schedule execution place and the second schedule execution place is 10Km < L less than or equal to 100Km, t is 2h; when the distance 100Km < L is less than or equal to 100Km between the first schedule execution place and the second schedule execution place, t is 24h.
In this embodiment, t is set according to an empirical value, which has a certain reliability, so that the calculation process is greatly simplified, and the throughput is reduced.
Example III
To perform a schedule creation method in the first embodiment, the present embodiment provides a schedule creation apparatus corresponding thereto, as shown in fig. 4, which includes at least:
The receiving module 1 is configured to receive request information sent by a first terminal, where the request information indicates to create a first schedule for a second terminal, and the request information at least includes a first schedule execution time [ T 1,T2 ], a first schedule execution location, and a second terminal identifier;
the searching module 2 is used for searching whether the second terminal has the created second schedule within [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, and T is more than or equal to 0;
An updating module 3, configured to determine whether updating of the schedule of the second terminal is required if the second terminal has the created second schedule in [ T 1-t,T2 +t ], and if so, update;
And the sending module 4 is used for sending the update information to the second terminal.
The search module 2 includes:
The first searching unit is used for searching any second schedule created by the second terminal, a corresponding second schedule execution place and second schedule execution time T 3,T4 based on the terminal identification of the second terminal.
The first map calling unit is used for calling the map application interface to inquire the travel time delta t between the first schedule execution place and the second schedule execution place.
And a first judging unit for, when T 3∈[T1-δt,T2 +δt or T 4∈[T1-δt,T2 +δt ], the second terminal having the second schedule created at [ T 1-t,T2 +t ].
Wherein the map invoking unit includes:
A first inquiring subunit, configured to inquire, in the history data of the map application, a travel time δt from the second schedule execution location to the first schedule execution location at a time T 4;
and the second inquiring subunit is used for inquiring the travel time delta T from the first schedule execution place to the second schedule execution place at the moment T 2 in the historical data of the map application.
The update module 3 includes:
The extraction unit is used for respectively extracting a first task emergency degree score of the first schedule and a second task emergency degree score of the second schedule;
The comparison unit is used for comparing the score of the first task emergency degree with the score of the second task emergency degree;
And the first updating unit is used for canceling the second schedule with the execution time of [ T 3,T4 ] for the second terminal and creating the first schedule with the execution time of [ T 1,T2 ] when the first task emergency degree score is higher than the second task emergency degree score.
The first updating unit is further used for searching the free time of the first terminal except for [ T 3,T4 ] on the same day and feeding back the free time to the first terminal to facilitate the selection of the first terminal when the first task emergency degree score is not higher than the second task emergency degree score; based on the received execution time [ T 5,T6 ] selected by the first terminal, searching whether the second terminal has the created third schedule in [ T 5-t,T6 +t ], wherein T is more than or equal to 0.
The first judging unit is also used for, whenAnd/>The second terminal does not have the second schedule created at [ T 1-t,T2 + T ].
The first updating unit is further configured to create a first schedule with execution time [ T 1,T2 ] for the second terminal if the second terminal does not have the created second schedule [ T 1-t,T2 +t ].
It should be noted that: the schedule creating apparatus provided in the above embodiment only uses the division of the above functional modules to illustrate when triggering a schedule creating service in the embodiment, in practical application, the above functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the apparatus is divided into different functional modules to perform all or part of the functions described above. In addition, the schedule creating apparatus provided in the above embodiment belongs to the same concept as the embodiment of the schedule creating method provided in the first embodiment, that is, the apparatus is based on the method, and the detailed implementation process of the apparatus is shown in the method embodiment, which is not repeated here.
Example IV
To perform a schedule creation method in the second embodiment, the present embodiment provides a schedule creation apparatus corresponding thereto, as shown in fig. 4, which includes at least:
The receiving module 1 is configured to receive request information sent by a first terminal, where the request information indicates to create a first schedule for a second terminal, and the request information at least includes a first schedule execution time [ T 1,T2 ], a first schedule execution location, and a second terminal identifier;
the searching module 2 is used for searching whether the second terminal has the created second schedule within [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, and T is more than or equal to 0;
An updating module 3, configured to determine whether updating of the schedule of the second terminal is required if the second terminal has the created second schedule in [ T 1-t,T2 +t ], and if so, update;
And the sending module 4 is used for sending the update information to the second terminal.
Wherein the search module 2 comprises:
The second searching unit searches any second schedule created by the second terminal, a corresponding second schedule execution place and second schedule execution time [ T 3,T4 ] based on the terminal identification of the second terminal;
the second map calling unit is used for calling the map application interface to inquire the distance between the first schedule execution place and the second schedule execution place;
A second judging unit for, when T 3∈[T1-t,T2 + T or T 4∈[T1-t,T2 + T ], the second terminal having a second schedule created at [ T 1-t,T2 + T ];
Wherein t is an empirical value:
When the distance L between the first schedule execution place and the second schedule execution place is less than or equal to 10Km, t is 30min;
when the distance between the first schedule execution place and the second schedule execution place is 10Km < L less than or equal to 100Km, t is 2h;
when the distance 100Km < L is less than or equal to 1000Km between the first schedule execution place and the second schedule execution place, t is 24h.
It should be noted that: the schedule creating apparatus provided in the above embodiment is only exemplified by the division of the above functional modules when triggering the schedule creating service in the second embodiment, and in practical application, the above functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the apparatus is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the schedule creating apparatus provided in the above embodiment belongs to the same concept as the embodiment of the schedule creating method provided in the first embodiment, that is, the apparatus is based on the method, and the detailed implementation process of the apparatus is shown in the method embodiment, which is not repeated here.
Example five
In response to the above method and apparatus, a third embodiment of the present application provides a computer system, including:
One or more processors; and
A memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the operations of:
receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
Searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
If the second terminal has the created second schedule in the [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
and sending the updated information to the second terminal.
FIG. 5 illustrates an architecture of a computer system, which may include a processor 1510, a video display adapter 1511, a disk drive 1512, an input/output interface 1513, a network interface 1514, and a memory 1520, among others. The processor 1510, the video display adapter 1511, the disk drive 1512, the input/output interface 1513, the network interface 1514, and the memory 1520 may be communicatively connected by a communication bus 1530.
The processor 1510 may be implemented by a general-purpose CXU (Central Xrocessing Unit, central processing unit), a microprocessor, an application specific integrated circuit (AXXlication SXecific Integrated Circuit, ASIC), or one or more integrated circuits, etc., for executing related programs to implement the technical solutions provided by the present application.
The Memory 1520 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage, dynamic storage, or the like. Memory 1520 may store an operating system 1521 for controlling the operation of computer system 1500, a Basic Input Output System (BIOS) for controlling the low-level operation of computer system 1500. In addition, a web browser 1523, a data storage management system 1524, an icon font processing system 1525, and the like may also be stored. The icon font processing system 1525 may be an application program that implements the operations of the foregoing steps in the embodiment of the present application. In general, when the present application is implemented in software or firmware, the relevant program code is stored in the memory 1520 and executed by the processor 1510.
The input/output interface 1513 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The network interface 1514 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
Bus 1530 includes a path for transporting information between various components of the device (e.g., processor 1510, video display adapter 1511, disk drive 1512, input/output interface 1513, network interface 1514, and memory 1520).
In addition, the computer system 1500 may also obtain information of specific acquisition conditions from the virtual resource object acquisition condition information database 1541 for making condition judgment, and so on.
It is noted that although the above devices illustrate only the processor 1510, video display adapter 1511, disk drive 1512, input/output interface 1513, network interface 1514, memory 1520, bus 1530, etc., the device may include other components necessary to achieve proper functioning in a particular implementation. Furthermore, it will be appreciated by those skilled in the art that the apparatus may include only the components necessary to implement the present application, and not all of the components shown in the drawings.
From the above description of embodiments, it will be apparent to those skilled in the art that the present application may be implemented in software plus a necessary general hardware platform. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a cloud server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present application.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for a system or system embodiment, since it is substantially similar to a method embodiment, the description is relatively simple, with reference to the description of the method embodiment being made in part. The systems and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden from the data of their inventive step.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (7)

1. A schedule creation method, the method comprising the steps of:
receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
Searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
If the second terminal has the created second schedule in the [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
transmitting the update information to the second terminal;
wherein the searching whether the second terminal has the created second schedule in [ T1-T, T2+t ] based on the terminal identification of the second terminal comprises:
searching any second schedule, a corresponding second schedule execution place and second schedule execution time [ T3, T4] which are created by the second terminal based on the terminal identification of the second terminal;
invoking a map application interface to inquire the travel time delta t between the first schedule execution place and the second schedule execution place;
When T3 epsilon [ T1-delta T, T2+ delta T ] or T4 epsilon [ T1-delta T, T2+ delta T ], the second terminal has a second created schedule at [ T1-T, T2+ T ];
wherein, judging whether the schedule of the second terminal needs to be updated includes:
respectively extracting a first task emergency degree score of a first schedule and a second task emergency degree score of a second schedule;
comparing the first task emergency degree with the second task emergency degree;
When the first task emergency degree score is higher than the second task emergency degree score, canceling the second schedule with the execution time of [ T3, T4] for the second terminal, and creating the first schedule with the execution time of [ T1, T2 ];
when the emergency degree score of the first task is not higher than the emergency degree score of the second task, searching the free time of the first terminal except for [ T3, T4] on the same day and feeding back the free time to the first terminal so as to facilitate the selection of the first terminal;
searching whether the second terminal has a created third schedule within [ T5-T, T6+ T ] or not based on the received execution time [ T5, T6] selected by the first terminal, wherein T is more than or equal to 0;
If the second terminal does not have the created third schedule in the [ T5-T, T6+ T ], creating a first schedule with the execution time of [ T 5,T6 ] for the second terminal;
Wherein t represents an empirical value of the journey time between the first schedule execution location and the second schedule execution location.
2. The method of claim 1, wherein invoking the map application interface to query a travel time δt between the first and second calendar execution sites comprises:
inquiring the travel time delta T from the second schedule execution place to the first schedule execution place at the moment T 4 in the historical data of the map application; or;
In the historical data of the map application, inquiring the travel time delta T from the first schedule execution place to the second schedule execution place at the moment T 2.
3.A method according to claim 1 or 2, characterized in that when And is also provided withThe second terminal does not have the second schedule created at [ T 1-t,T2 + T ].
4. The method of claim 3, wherein if the second terminal does not have the second schedule created at [ T 1-t,T2 + T ], creating a first schedule for the second terminal with an execution time of [ T 1,T2 ].
5. The method of claim 1, wherein the searching for whether the second terminal has the created second schedule within [ T 1-t,T2 +t ] based on the terminal identification of the second terminal, T being greater than or equal to 0, comprises:
Searching any second schedule, a corresponding second schedule execution place and second schedule execution time [ T 3,T4 ] which are created by the second terminal based on the terminal identification of the second terminal;
Invoking a map application interface to inquire the distance between the first schedule execution place and the second schedule execution place;
When T 3∈[T1-t,T2 +t or T 4∈[T1-t,T2 +t ], the second terminal has a second schedule created at [ T 1-t,T2 +t ];
When the distance L between the first schedule execution place and the second schedule execution place is less than or equal to 10Km, t is 30min;
when the distance between the first schedule execution place and the second schedule execution place is 10Km < L less than or equal to 100Km, t is 2h;
when the distance 100Km < L is less than or equal to 1000Km between the first schedule execution place and the second schedule execution place, t is 24h.
6. A schedule creation apparatus for implementing the method of claim 1, said apparatus comprising at least:
The receiving module is used for receiving request information sent by the first terminal, the request information indicates to create a first date for the second terminal, and the request information at least comprises first date execution time [ T 1,T2 ], first date execution place and second terminal identification;
The searching module is used for searching whether the second terminal has the created second schedule within [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, and T is more than or equal to 0;
the updating module is used for judging whether the schedule of the second terminal needs to be updated if the second terminal has the created second schedule in the [ T 1-t,T2 +t ], and if so, updating;
the sending module is used for sending the update information to the second terminal;
the updating module is specifically configured to:
respectively extracting a first task emergency degree score of a first schedule and a second task emergency degree score of a second schedule;
comparing the first task emergency degree with the second task emergency degree;
When the first task emergency degree score is higher than the second task emergency degree score, canceling the second schedule with the execution time of [ T3, T4] for the second terminal, and creating the first schedule with the execution time of [ T1, T2 ];
when the emergency degree score of the first task is not higher than the emergency degree score of the second task, searching the free time of the first terminal except for [ T3, T4] on the same day and feeding back the free time to the first terminal so as to facilitate the selection of the first terminal;
Based on the received execution time [ T5, T6] selected by the first terminal, searching whether the second terminal has the created third schedule in [ T5-T, T6+ T ], wherein T is more than or equal to 0.
7. A computer system, comprising:
One or more processors; and
A memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the operations of:
receiving request information sent by a first terminal, wherein the request information indicates to create a first day for a second terminal, and the request information at least comprises first day execution time [ T 1,T2 ], a first day execution place and a second terminal identifier;
Searching whether the second terminal has a created second schedule in [ T 1-t,T2 +t ] or not based on the terminal identification of the second terminal, wherein T is more than or equal to 0;
If the second terminal has the created second schedule in the [ T 1-t,T2 +t ], judging whether the schedule of the second terminal needs to be updated, and if so, updating;
transmitting the update information to the second terminal;
wherein the searching whether the second terminal has the created second schedule in [ T1-T, T2+t ] based on the terminal identification of the second terminal comprises:
searching any second schedule, a corresponding second schedule execution place and second schedule execution time [ T3, T4] which are created by the second terminal based on the terminal identification of the second terminal;
invoking a map application interface to inquire the travel time delta t between the first schedule execution place and the second schedule execution place;
When T3 epsilon [ T1-delta T, T2+ delta T ] or T4 epsilon [ T1-delta T, T2+ delta T ], the second terminal has a second created schedule at [ T1-T, T2+ T ];
wherein, judging whether the schedule of the second terminal needs to be updated includes:
respectively extracting a first task emergency degree score of a first schedule and a second task emergency degree score of a second schedule;
comparing the first task emergency degree with the second task emergency degree;
When the first task emergency degree score is higher than the second task emergency degree score, canceling the second schedule with the execution time of [ T3, T4] for the second terminal, and creating the first schedule with the execution time of [ T1, T2 ];
when the emergency degree score of the first task is not higher than the emergency degree score of the second task, searching the free time of the first terminal except for [ T3, T4] on the same day and feeding back the free time to the first terminal so as to facilitate the selection of the first terminal;
searching whether the second terminal has a created third schedule within [ T5-T, T6+ T ] or not based on the received execution time [ T5, T6] selected by the first terminal, wherein T is more than or equal to 0;
If the second terminal does not have the created third schedule in the [ T5-T, T6+ T ], creating a first schedule with the execution time of [ T 5,T6 ] for the second terminal;
Wherein t represents an empirical value of the journey time between the first schedule execution location and the second schedule execution location.
CN202010673410.8A 2020-07-14 2020-07-14 Schedule creation method, device and system Active CN111861182B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010673410.8A CN111861182B (en) 2020-07-14 2020-07-14 Schedule creation method, device and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010673410.8A CN111861182B (en) 2020-07-14 2020-07-14 Schedule creation method, device and system

Publications (2)

Publication Number Publication Date
CN111861182A CN111861182A (en) 2020-10-30
CN111861182B true CN111861182B (en) 2024-06-07

Family

ID=72983317

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010673410.8A Active CN111861182B (en) 2020-07-14 2020-07-14 Schedule creation method, device and system

Country Status (1)

Country Link
CN (1) CN111861182B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113240389A (en) * 2021-05-12 2021-08-10 网宿科技股份有限公司 Workflow creating method, electronic device and storage medium

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6167379A (en) * 1998-03-24 2000-12-26 Siemens Information And Communication Networks, Inc. System for user to accept or decline updating a calendar remotely with a proposed schedule update that may have schedule confliction
JP2006178792A (en) * 2004-12-24 2006-07-06 Ricoh Co Ltd Schedule management system, program, and recording medium
CN101686571A (en) * 2008-09-28 2010-03-31 联想(北京)有限公司 Method, mobile terminal and server for providing scheduling in real time
KR20100126052A (en) * 2009-05-22 2010-12-01 삼성전자주식회사 Schedule managing system and method
CN102970334A (en) * 2012-10-29 2013-03-13 东莞宇龙通信科技有限公司 Multi-agenda conflict processing method and system thereof
WO2013147527A1 (en) * 2012-03-30 2013-10-03 Son Won Bae Device and method for planning personalized travel schedule
CN109214783A (en) * 2018-09-21 2019-01-15 英华达（上海）科技有限公司 Cloud automatically upgrading calendar method, system, equipment and storage medium
CN110443586A (en) * 2019-08-12 2019-11-12 Oppo（重庆）智能科技有限公司 Shared schedule information processing method and device, terminal and storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030093706A1 (en) * 2001-11-15 2003-05-15 Intel Corporation Personal scheduling apparatus and method
US20160267439A1 (en) * 2015-03-11 2016-09-15 Microsoft Technology Licensing, Llc Contextual calendar conflict resolution
US20180341924A1 (en) * 2017-05-26 2018-11-29 Salesforce.Com, Inc. Calendar application, system and method for providing multiple time zone calendar views during travel between time zones

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6167379A (en) * 1998-03-24 2000-12-26 Siemens Information And Communication Networks, Inc. System for user to accept or decline updating a calendar remotely with a proposed schedule update that may have schedule confliction
JP2006178792A (en) * 2004-12-24 2006-07-06 Ricoh Co Ltd Schedule management system, program, and recording medium
CN101686571A (en) * 2008-09-28 2010-03-31 联想(北京)有限公司 Method, mobile terminal and server for providing scheduling in real time
KR20100126052A (en) * 2009-05-22 2010-12-01 삼성전자주식회사 Schedule managing system and method
WO2013147527A1 (en) * 2012-03-30 2013-10-03 Son Won Bae Device and method for planning personalized travel schedule
CN102970334A (en) * 2012-10-29 2013-03-13 东莞宇龙通信科技有限公司 Multi-agenda conflict processing method and system thereof
CN109214783A (en) * 2018-09-21 2019-01-15 英华达（上海）科技有限公司 Cloud automatically upgrading calendar method, system, equipment and storage medium
CN110443586A (en) * 2019-08-12 2019-11-12 Oppo（重庆）智能科技有限公司 Shared schedule information processing method and device, terminal and storage medium

Also Published As

Publication number Publication date
CN111861182A (en) 2020-10-30

Similar Documents

Publication Publication Date Title
CA3018756C (en) Casual driver ride sharing
CN107491825B (en) Taxi booking processing method and system
US20120259540A1 (en) Methods and systems for workforce management
JP2002538448A (en) Base station control device, traveling method of mobile vehicle, and communication method of notification message
CN113627792B (en) Unmanned vehicle scheduling management method, device, equipment, storage medium and program
CN102479431A (en) Taxi calling system possessing matching function and method thereof
CN111325612B (en) Order counting method, order distribution method, device and system
CN111861296A (en) Piece collecting task allocation method and device, piece collecting system, equipment and medium
US11379539B2 (en) Efficient freshness crawl scheduling
CN111401608B (en) Line planning method, device and storage medium for passenger vehicle
CN113537955A (en) Milestone project management device and method, electronic equipment and storage medium
CN111861182B (en) Schedule creation method, device and system
CN113360792A (en) Information recommendation method and device, electronic equipment and storage medium
CN103559632A (en) Intelligent client visiting system
CN107678839B (en) Priority-based client follow-up method, system and readable storage medium
CN113761398B (en) Information recommendation method and device, electronic equipment and storage medium
US20180330318A1 (en) Systems and Methods for Dynamically Updating Stored Lists Based on Contemporaneous Location Data Associated with Client Devices
US20210312583A1 (en) Control device, program for control device, and program for terminal device
KR102250648B1 (en) Method and server for providing service to recommend shipping company through consumption pattern of online shopping
CN105791426A (en) Method and device for processing patrol support collaboration information
CN111343101A (en) Server current limiting method and device, electronic equipment and readable storage medium
CN111832875B (en) Data processing method, readable storage medium, and electronic device
KR101764026B1 (en) Simulation based Pre-Planning Method and System for Optimizing the Transport on National and International Events
CN116501516B (en) Multi-map calling method, device, equipment and storage medium
CN113256177B (en) Existing vehicle distribution calculation 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
TA01 Transfer of patent application right

Effective date of registration: 20240509

Address after: S02 Building, 1036 Langchao Road, Jinan Area, China (Shandong) Pilot Free Trade Zone, Jinan City, Shandong Province, 250000

Applicant after: Shandong Inspur innovation and entrepreneurship Technology Co.,Ltd.

Country or region after: China

Address before: No.316, Xuxiang Road, Xujing Town, Qingpu District, Shanghai, 201799

Applicant before: Shanghai Yanxi Software Information Technology Co.,Ltd.

Country or region before: China

TA01 Transfer of patent application right
GR01 Patent grant