Case scheduling planning method and system and computer program product

Abstract

A case scheduling method is implemented by a case scheduling system. The case scheduling system stores an electronic map and multiple case data. Each case data includes a case period and a case location. The method includes: when the case scheduling system receives a scheduling request including a specified period, multiple target case data that are respectively related to the specified period and meet the planning conditions are determined from the case data according to the scheduling request, and a scheduling result including a planning path is generated and output according to the target case data. The planning conditions include that the case periods of the target case data do not overlap with each other, and the planning path is generated according to the electronic map and the case location of the target case data.

Description

Technical Field

[0001] The present invention relates to a planning method and system and a computer program product, and in particular to a case scheduling planning method and system and a computer program product involving case scheduling. Background Art

[0002] With the advent of an aging society, the importance of care services is increasing, and there is no shortage of temporary needs for short-term care. However, many caregivers can only passively accept care cases through the arrangements of intermediary companies. In this way, caregivers are not only likely to miss many job opportunities, but also find it difficult to choose and arrange work according to their own needs and preferences.

[0003] On the other hand, if employers need different types of professional care according to time periods during the day or have shorter hours / temporary needs, they will also face the aforementioned problem of difficulty in selecting and arranging care according to their own needs and preferences. Summary of the invention

[0004] One of the objectives of the present invention is to provide a case scheduling planning method that can improve the background technology.

[0005] The case scheduling planning method of the present invention is implemented by a case scheduling planning system, which stores an electronic map and multiple case data, each case data includes a case period and a case location, and the case scheduling planning method includes: when the case scheduling planning system receives a scheduling planning request including a specified period, a plurality of target case data that are each related to the specified period and meet the planning conditions are determined from the case data according to the scheduling planning request, and a scheduling planning result including a planning path is generated and output according to the target case data, wherein the planning conditions include that the case periods of the target case data do not overlap with each other, and the planning path is generated according to the electronic map and the case location of the target case data.

[0006] In some implementations of the case scheduling method of the present invention, the case scheduling system first selects a plurality of matching case data that each meets a matching condition from the case data according to the scheduling request, and then determines the target case data from the matching case data, wherein, for each case data, the matching condition includes that the case period of the case data is covered within the specified period.

[0007] In some implementations of the case scheduling method of the present invention, the scheduling request also includes a specified area range related to the electronic map, and a specified time length threshold value, the matching condition also includes that the case location of the case data is within the specified area range, and when the specified time length threshold value is the specified time length lower limit, the matching condition also includes that the case time length indicated by the case period of the case data is greater than or equal to the specified time length lower limit, and when the specified time length threshold value is the specified time length upper limit, the matching condition also includes that the case time length is less than or equal to the specified time length upper limit.

[0008] In some implementations of the case scheduling planning method of the present invention, the case scheduling planning system also determines the arrangement order of the target case data based on the chronological order of the case periods of the target case data; the planned path is generated based on the arrangement order of the target case data and the relative position relationship of the case locations of the target case data in the electronic map, the scheduling planning request also includes a specified distance upper limit, and the planning conditions also include: the path distance of the planned path is less than or equal to the specified distance upper limit.

[0009] In some implementations of the case scheduling planning method of the present invention, the case scheduling planning system also determines the arrangement order between the target case data according to the time sequence of the case periods of the target case data; the planned path is generated according to the arrangement order of the target case data and the relative position relationship of the case positions of the target case data in the electronic map; the case scheduling planning system also generates N estimated movement time lengths related to the planned path, each estimated movement time length corresponds to two of the target case data that are adjacent to each other in the arrangement order, and N is an integer greater than or equal to 1; for each two target case data that are adjacent to each other in the arrangement order, the interval between the case periods of the two target case data indicates the interval time length corresponding to the two target case data, and the planning conditions also include: each estimated movement time length is less than or equal to the interval time length corresponding to the two target case data to which it corresponds.

[0010] In some implementations of the case scheduling method of the present invention, each case data also includes a case amount, the scheduling request also includes a specified lower limit of income and a specified upper limit of case quantity, and the planning conditions also include that the sum of the case amounts of the target case data is greater than or equal to the specified lower limit of income, and the total number of the target case data is less than or equal to the specified upper limit of case quantity.

[0011] Another object of the present invention is to provide a case scheduling system capable of implementing the case scheduling method.

[0012] The case scheduling system of the present invention includes a storage unit and a processing unit electrically connected to the storage unit, wherein the storage unit stores an electronic map and multiple case data, each case data including a case period and a case location; when the processing unit receives a scheduling request including a specified period, a plurality of target case data that are respectively related to the specified period and meet the planning conditions are determined from the case data according to the scheduling request, and a scheduling result including a planning path is generated and output according to the target case data, wherein the planning conditions include that the case periods of the target case data do not overlap with each other, and the planning path is generated according to the electronic map and the case location of the target case data.

[0013] In some implementations of the case scheduling system of the present invention, the processing unit first selects a plurality of matching case data that each meets a matching condition from the case data according to the scheduling request, and then determines the target case data from the matching case data, wherein, for each case data, the matching condition includes that the case period of the case data is covered within the specified period.

[0014] In some implementations of the case scheduling system of the present invention, the scheduling request also includes a specified area range related to the electronic map, and a specified time length threshold value, the matching condition also includes that the case location of the case data is within the specified area range, and when the specified time length threshold value is the specified time length lower limit, the matching condition also includes that the case time length indicated by the case period of the case data is greater than or equal to the specified time length lower limit, and when the specified time length threshold value is the specified time length upper limit, the matching condition also includes that the case time length is less than or equal to the specified time length upper limit.

[0015] In some implementations of the case scheduling system of the present invention, the processing unit also determines the arrangement order of the target case data based on the chronological order of the case periods of the target case data; the planned path is generated based on the arrangement order of the target case data and the relative position relationship of the case locations of the target case data in the electronic map, the scheduling planning request also includes a specified distance upper limit, and the planning conditions also include: the path distance of the planned path is less than or equal to the specified distance upper limit.

[0016] In some implementations of the case scheduling planning system of the present invention, the processing unit also determines the arrangement order between the target case data according to the time sequence of the case periods of the target case data; the planned path is generated according to the arrangement order of the target case data and the relative position relationship of the case positions of the target case data in the electronic map; the case scheduling planning system also generates N estimated movement time lengths related to the planned path, each estimated movement time length corresponds to two of the target case data that are adjacent to each other in the arrangement order, and N is an integer greater than or equal to 1; for each two target case data that are adjacent to each other in the arrangement order, the interval between the two case periods of the two target case data indicates the interval time length corresponding to the two target case data, and the planning condition also includes: each estimated movement time length is less than or equal to the interval time length corresponding to the two target case data to which it corresponds.

[0017] In some implementations of the case scheduling system of the present invention, each case data also includes a case amount, the scheduling request also includes a specified lower limit of income and a specified upper limit of case quantity, and the planning conditions also include that the sum of the case amounts of the target case data is greater than or equal to the specified lower limit of income, and the total number of the target case data is less than or equal to the specified upper limit of case quantity.

[0018] Yet another object of the present invention is to provide a computer program product.

[0019] The computer program product of the present invention includes application software. When the application software is loaded and executed by an electronic device, the electronic device can implement the case scheduling planning method as described in any of the aforementioned implementations.

[0020] The beneficial effects of the present invention are: the case scheduling planning system can determine the target case data from the case data according to the scheduling planning request, and output the scheduling planning results generated according to the target case data for reference by the caregiver, and the case scheduling planning system can ensure that the target case data meet the planning conditions together. Therefore, the scheduling planning results can meet the needs and preferences of the caregivers, so it can effectively assist the caregivers to undertake multiple care cases in one day, and the needs of the employer can also be effectively handled in time-sharing due to the scheduling of the caregivers, so that the patients being cared for can receive appropriate care according to the care case, so it can indeed improve the inconvenience of the background technology. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Other features and effects of the present invention will be clearly presented in the embodiments with reference to the accompanying drawings, in which:

[0022] Figure 1 It is a block diagram of an embodiment of the case scheduling system of the present invention cooperating with a first user terminal and a second user terminal;

[0023] Figure 2 is a schematic diagram, exemplarily illustrating the second user terminal displaying a case editing form;

[0024] Figure 3 is a flow chart, which exemplarily illustrates how the embodiment implements a case scheduling planning method;

[0025] Figure 4 is a flow chart that exemplarily illustrates how the embodiment performs a check process in the case scheduling planning method; and

[0026] Figure 5 is a schematic diagram, exemplarily illustrating the first user terminal displaying a scheduling planning result generated by the embodiment. DETAILED DESCRIPTION

[0027] Before the present invention is described in detail, it should be noted that in the following description, similar elements are represented by the same number. In addition, the "electrical connection" described in this specification generally refers to the wired electrical connection achieved by connecting multiple electronic devices / devices / components through conductive materials, and the radio connection for wireless signal transmission through wireless communication technology. In addition, the "electrical connection" described in this specification also generally refers to the "direct electrical connection" formed by the direct connection between two electronic devices / devices / components, and the "indirect electrical connection" formed by the connection between two electronic devices / devices / components through other electronic devices / devices / components.

[0028] See also Figure 1 An embodiment of the case scheduling system 1 of the present invention is suitable for connecting multiple user terminals 2 via a communication network 5. The communication network 5 may include one or more of a Wi-Fi network, the Internet, a 4G network, a 5G network, or other types of networks, and each user terminal 2 may be, for example, a smart phone, a tablet computer, a notebook computer, or a desktop computer. A portion of the user terminals 2 may be, for example, a plurality of first user terminals 2A ( Figure 1 Only one is shown in the figure for example), and each first user end 2A may, for example, belong to a caregiver who can provide care services. On the other hand, another part of the user end 2 may, for example, be a plurality of second user ends 2B ( Figure 1 Only one is shown in the figure for example), and each second user end 2B may be owned by a client who has a care service demand. Figure 1 The first user end 2A and the second user end 2B shown in FIG.

[0029] The case scheduling system 1, for example, includes a storage unit 11 and a processing unit 12 electrically connected to the storage unit 11. In this embodiment, the processing unit 12 is implemented as a server, and the storage unit 11 is implemented as a blockchain database composed of at least the first user end 2A and the second user end 2B. However, in other embodiments, the processing unit 12 may also be implemented as other types of electronic devices, such as smart phones, tablet computers, notebook computers or desktop computers, or may be implemented as a combination of multiple electronic devices (such as a servo system including multiple servers), and the storage unit 11 may also be implemented as one or more hard disks or other types of data storage devices. It should be understood that the specific implementation of the storage unit 11 and the processing unit 12 can be freely adjusted based on considerations such as the cost and performance of the application, and is not limited to this embodiment.

[0030] The storage unit 11 stores an electronic map and a plurality of case data. In this embodiment, each case data, for example, represents a care case entrusted by a client, and is, for example, received by the processing unit 12 from one of the second user terminals 2B and stored in the storage unit 11. More specifically, each second user terminal 2B can, for example, Figure 2 As shown, a case editing form is displayed, and case data is generated according to the editing input of the corresponding client, and then the generated case data is transmitted to the case scheduling planning system 1 for storage, but it is not limited to this.

[0031] In more detail, each case data in this embodiment includes, for example, a case period, a case location, a case amount, and a case content. The case period, for example, has a case start time and a case end time, and indicates a case time length. For example, assuming that the case start time and the case end time of the case period are "10:00" and "12:00" on the same day, respectively, the case time length indicated by the case period is "2 hours". The case location can be, for example, an address located in the electronic map, and is used to indicate the location of the person to be cared for in the corresponding care case. The case amount, for example, represents the remuneration of the corresponding care case, and the case content, for example, indicates the specific work content and precautions of the corresponding care case, which can be used for reference by caregivers, but is not limited to this.

[0032] See also Figure 1 and Figure 3 , the following Figure 1 The first user end 2A is used as an example to illustrate how the case scheduling system 1 of this embodiment implements a scheduling method.

[0033] First, in step S1, the processing unit 12 receives a scheduling request from the first user terminal 2A. In this embodiment, the scheduling request is generated by the first user terminal 2A according to the editing input of the corresponding caregiver, and includes, for example, a specified area range, a specified period, a specified distance limit, a specified time length threshold, a specified income lower limit, and a specified case volume upper limit.

[0034] In this embodiment, the designated area range indicates, for example, a closed area in the electronic map. More specifically, the designated area range may indicate, for example, a specific county or city, or a specific administrative district. However, in other embodiments, the designated area range may also be, for example, a circular area range defined by a designated center position and a designated radius distance, and the designated center position and the designated radius distance may be, for example, generated by the first user terminal 2A according to the input of the corresponding caregiver, and are not limited to this embodiment. In this way, the designated area range can be used for the caregiver to set the geographical location that he or she prefers.

[0035] The designated period, for example, has a designated start time and a designated end time, and indicates a designated time length. For example, assuming that the designated start time and the designated end time of the designated period are "08:00" and "18:00" on the same day, respectively, the designated time length indicated by the designated period is, for example, "10 hours". In this way, the designated period allows the caregiver to set a single-day working period of his or her own preference.

[0036] The designated distance upper limit may indicate a distance value, for example, and the designated distance can be used for the caregiver to set the upper limit of the total daily moving distance that the caregiver can accept.

[0037] In this embodiment, the specified time length threshold is implemented as a specified time length lower limit, for example, so that the caregiver can set a single care case with the shortest working hours that he or she can accept. However, in another embodiment, the specified time length threshold is implemented as a specified time length upper limit, for example, so that the caregiver can set a single care case with the longest working hours that he or she can accept. Alternatively, in another embodiment, the specified time length threshold can also be replaced by a specified time length range, so that the caregiver can set the time length range of the single care case that he or she prefers (for example, between 2 and 6 hours), and is not limited to this embodiment.

[0038] The specified income floor allows the caregiver to set a lower limit on the total income amount that he or she wishes to receive in a day.

[0039] The designated caseload limit allows caregivers to set the maximum number of care cases they can accept in a day.

[0040] After the processing unit 12 receives the scheduling request from the first user terminal 2A, step S2 is then performed.

[0041] In step S2, the processing unit 12 selects a plurality of matching case data that meet a matching condition from the case data according to the scheduling request. In this embodiment, the matching condition includes, for example, three sub-conditions, and the three sub-conditions are an area range matching condition corresponding to the specified area range, a period matching condition corresponding to the specified period, and a time length matching condition corresponding to the specified time length threshold value. More specifically, the processing unit 12 selects each case data that meets the area range matching condition, the period matching condition, and the time length matching condition as matching case data.

[0042] In this embodiment, for each case data, the area range matching condition represents that the case location of the case data is located within the specified area range in the electronic map, the period matching condition represents that the case period of the case data is covered within the specified period, and the time length matching condition represents that the case time length indicated by the case period of the case data is greater than or equal to the specified time length threshold value (that is, greater than or equal to the specified time length lower limit), but is not limited to this.

[0043] It is additionally noted that, in the embodiment where the specified time length threshold is implemented as the upper limit of the specified time length, the time length matching condition represents that the case time length indicated by the case period of the case data is less than or equal to the upper limit of the specified time length. Further, in the embodiment where the specified time length threshold is replaced by the specified time length range, the time length matching condition represents that the case time length indicated by the case period of the case data is within the specified time length range. Therefore, the specific implementation of the period matching condition is not limited to this embodiment.

[0044] After the processing unit 12 selects the matching case data from the case data, the process proceeds to step S3.

[0045] In step S3, the processing unit 12 generates a plurality of first groups according to the arrangement and combination of the matching case data and a grouping condition. In the present embodiment, each first group is composed of a plurality of matching case data in the matching case data, and the matching case data of each first group is not completely the same as any other first group. More specifically, in the present embodiment, for any M matching case data (M is an integer greater than 1) in the matching case data, the grouping condition includes:

[0046] (1) The sum of the M case amounts of the M matching case data is greater than or equal to the specified income lower limit included in the scheduling request.

[0047] (2) M is less than or equal to the upper limit of the specified number of cases included in the scheduling request.

[0048] (3) The M case periods of the M matching case data do not overlap with each other.

[0049] By grouping according to the grouping condition, each first group generated by the processing unit 12 will meet the grouping condition. For example, assuming that the designated income lower limit is "2,500 yuan", the sum of the case amounts of all matching case data in each first group will be greater than or equal to 2,500. And, assuming that the designated case volume upper limit is "4 cases", the total number of matching case data in each first group will be one of two to four. Further, the case periods of all matching case data in each first group will not overlap with each other. For example, assuming that the case periods of two matching case data are "12:00-14:00" and "13:00-15:00", respectively, since the two case periods overlap with each other during the period of "13:00-14:00", the two matching case data will not appear in the same first group.

[0050] After the processing unit 12 generates the first group, step S4 is performed.

[0051] In step S4 , the processing unit 12 performs a check process on the matching case data of each first group to select one or more second groups from the first group.

[0052] In order to facilitate the description of the checking process of this embodiment, a first group including four matching case data is taken as an example group, and the four matching case data of the example group are taken as four example case data respectively.

[0053] Next, refer to Figure 4 The following takes the example group as an example and explains how the processing unit 12 performs the verification process on the example group.

[0054] First, in step S41 , the processing unit 12 determines the arrangement order of the four exemplary case data according to the time sequence of the four case periods of the four exemplary case data.

[0055] For the convenience of description, the four example case data are respectively referred to as a first example case data, a second example case data, a third example case data and a fourth example case data in the order of arrangement. On the other hand, the four case periods included in the first to fourth case data are respectively referred to as a first case period, a second case period, a third case period and a fourth case period in the order of time. On the other hand, the four case positions included in the first to fourth case data are respectively referred to as a first case position, a second case position, a third case position and a fourth case position.

[0056] It is worth noting that, for each two example case data that are adjacent to each other in arrangement order, an interval period between the two case periods of the two example case data indicates a corresponding interval time length of the two example case data. For example, assuming that the first to the fourth case periods are "10:00-12:00", "12:10-16:10", "16:20-18:20" and "19:00-20:00", respectively, then for the first and second example case data that are adjacent to each other in arrangement order, a first interval period between the first case period and the second case period (that is, "12:00-12:10") indicates a corresponding first interval time length of the first and second example case data, and the first interval time length is 10 minutes in this example. On the other hand, for the second and third example case data adjacent to each other in arrangement order, a second interval period between the second case period and the third case period (i.e., "16:10-16:20") indicates a second interval time length corresponding to the second and third example case data, and the second interval time length is also 10 minutes in this example. On the other hand, for the third and fourth example case data adjacent to each other in arrangement order, a third interval period between the third case period and the fourth case period (i.e., "18:20-19:00") indicates a third interval time length corresponding to the third and fourth example case data, and the third interval time length is 40 minutes in this example.

[0057] Next, in step S42, the processing unit 12 generates a path planning data according to the first to fourth case locations and the electronic map. The path planning data includes a planned path, three estimated moving distances, and three estimated moving time lengths corresponding to the three estimated moving distances.

[0058] Specifically, the planned path is generated by the processing unit 12 in a manner of planning a shortest moving distance according to the arrangement order of the first to fourth example case data and the relative position relationship of the first to fourth case locations in the electronic map. In other words, the planned path connects the first to fourth case locations in sequence according to the arrangement order of the first to fourth example case data in the electronic map.

[0059] For ease of description, the three expected moving distances are respectively referred to as a first expected moving distance, a second expected moving distance, and a third expected moving distance, wherein the first expected moving distance corresponds to the first and second example case data adjacent to each other in arrangement order, and indicates the distance of the portion connecting the first and second case positions in the planned path. On the other hand, the second expected moving distance corresponds to the second and third example case data adjacent to each other in arrangement order, and indicates the distance of the portion connecting the second and third case positions in the planned path. On the other hand, the third expected moving distance corresponds to the third and fourth example case data adjacent to each other in arrangement order, and indicates the distance of the portion connecting the third and fourth case positions in the planned path.

[0060] For ease of description, the three estimated moving time lengths are respectively used as the first estimated moving time length corresponding to the first estimated moving distance, the second estimated moving time length corresponding to the second estimated moving distance, and the third estimated moving time length corresponding to the third estimated moving distance. The first to the third estimated moving time lengths are for example calculated by the processing unit 12 at least according to the first to the third estimated moving distance and an estimated moving speed, and the numerical value of the estimated moving speed can be different for example according to the setting of the moving mode (for example walking, riding a bicycle, driving or taking public transportation), but is not limited thereto. And, the first estimated moving time length also corresponds to the first and second example case data adjacent to each other in the arrangement order, and indicates the time required to move from the first case position to the second case position. On the other hand, the second estimated moving time length also corresponds to the second and third example case data adjacent to each other in the arrangement order, and indicates the time required to move from the second case position to the third case position. On the other hand, the third estimated moving time length also corresponds to the third and fourth example case data which are arranged adjacent to each other in sequence, and indicates the time required to move from the third case position to the fourth case position.

[0061] Next, in step S43, the processing unit 12 determines whether the first to fourth example case data of the example group meet a common check condition according to the path planning data. If the result of the processing unit 12 is yes, the example group is selected as the second group. On the contrary, if the result of the processing unit 12 is no, the example group is not selected as the second group. In this embodiment, the check condition includes:

[0062] (1) The path distance of the planned path (here taking the sum of the first to third estimated moving distances as an example) is less than or equal to the specified distance upper limit of the scheduling planning request.

[0063] (2) Each estimated moving time length is less than or equal to the interval time length corresponding to the two example case data. Continuing with the previous example, the first to third estimated moving times need to be less than or equal to the first to third interval time lengths, respectively. This will help the caregiver to have enough time to move from the first case location to the second case location after the care case of the first example case data ends, to have enough time to move from the second case location to the third case location after the care case of the second example case data ends, and to have enough time to move from the third case location to the fourth case location after the care case of the third example case data ends.

[0064] The above steps S41 to S43 are examples of the processing unit 12 performing the checking process on the example group. It should be noted that the above grouping condition and the checking condition are used together as a planning condition in this embodiment.

[0065] It should be noted that, since the example group is based on four example case data, the path planning data generated by the processing unit 12 includes three estimated moving distances and three estimated moving time lengths. A person with ordinary knowledge in the technical field of the present invention should understand that for each first group, if the first group is composed of a different number of matching case data, the processing unit 12 will generate a different number of estimated moving distances and estimated moving time lengths for the first group in step S42.

[0066] Furthermore, in another embodiment, in addition to the case location, the processing unit 12 may further generate the planned path according to a starting location included in the scheduling request, and the starting location may be, for example, a residence of the caregiver. Taking the first to fourth case locations as an example, in another embodiment, the planned path not only sequentially connects the first to fourth case locations, but also further connects the starting location with the first case location, and connects the fourth case location with the starting location. In other words, by further generating the planned path according to the starting location, the planned path may, for example, indicate a closed loop movement path in another embodiment.

[0067] After the processing unit 12 selects the second group from the first group, step S5 is performed. In addition, for the convenience of description, it is assumed that there are multiple second groups in this embodiment.

[0068] In step S5, the processing unit 12 selects a target group from the second group according to a specific screening mode, and uses the matching case data of the target group as a plurality of target case data. In the present embodiment, the specific screening mode may be, for example, one of an income amount priority mode, a moving distance priority mode, and a case quantity priority mode, but is not limited thereto. In more detail, in the income amount priority mode, the processing unit 12, for example, selects the second group with the highest total case amount among all the second groups as the target group. In the moving distance priority mode, the processing unit 12, for example, selects the second group with the shortest path distance of the planned path among all the second groups as the target group. In the case quantity priority mode, the processing unit 12, for example, selects the second group with the lowest (or highest) number of matching case data among all the second groups as the target group. It is additionally noted that the type of the specific screening mode may be, for example, a default setting by the processing unit 12, or may be indicated by the scheduling request (ie, set by the caregiver at the first user terminal 2A), and this embodiment does not impose any particular limitation thereto.

[0069] For ease of understanding, it is assumed here that the aforementioned example group is determined by the processing unit 12 to meet the verification condition in step S43, and is further selected as the target group by the processing unit 12 in this step S5. That is to say, the aforementioned first to fourth example case data are exemplarily used by the processing unit 12 as four target case data in this step S5.

[0070] After the processing unit 12 selects the target group from the second group (ie, determines the target case data from all matching case data), step S6 is performed.

[0071] In step S6, the processing unit 12 generates a scheduling planning result corresponding to the target group. In the present embodiment, the scheduling planning result, for example, includes the planning path generated by the processing unit 12 according to the four target case data in the verification process, the case period, the case location, the case amount and the case content of each of the four target case data, and a statistical result generated according to the four target case data. In more detail, the statistical result, for example, includes a total scheduling duration, a total number of cases and a total revenue amount. And, in this example, the total scheduling duration is, for example, calculated based on the start time of the first case period (that is, "10:00") and the end time of the fourth case period (that is, "20:00"), and is, for example Figure 5 The total number of cases is the number of target case data, and for example Figure 5 The total revenue amount is the sum of the case amounts of the target case data, and is, for example, Figure 5 The "2800 yuan" shown in the figure.

[0072] In step S7, the processing unit 12 outputs the scheduling result. More specifically, the processing unit 12 transmits the scheduling result to the first user terminal 2A in this embodiment so that the first user terminal 2A can Figure 5 As shown, the scheduling result is displayed in a graphical user interface for reference by the caregiver.

[0073] It is additionally noted that in other implementations, according to the operation performed by the caregiver on the first user terminal 2A, the scheduling request may also only include the specified period, but not the specified distance upper limit, the specified time length threshold, the specified income lower limit, and the specified case volume upper limit. Furthermore, in the implementation, the matching condition only includes the period matching condition, and the planning condition only includes that the case periods of the matching case data do not overlap with each other.

[0074] In addition, after step S7, if the processing unit 12 receives a confirmation notification corresponding to the scheduling result from the first user terminal 2A, it means that the caregiver holding the first user terminal 2A decides to undertake the care case represented by the target case data. At this time, the processing unit 12 will use the scheduling result as a formal schedule, use the target case data as multiple formal case data, and add the formal schedule and the formal case data to an online calendar stored in the storage unit 11. On the other hand, when the processing unit 12 receives the confirmation notification, it will immediately send a commission success notification to the second user terminal 2B corresponding to each formal case data, thereby reminding the entruster that the care case he entrusted has been undertaken by the caregiver.

[0075] Furthermore, after the processing unit 12 adds the formal schedule and the formal case data to the online calendar, the caregivers and clients related to the formal case data can instantly view the content of the formal case data through the user terminal 2 they hold, so as to facilitate communication and coordination of the content of the care case. It is worth noting that each formal case data in the online calendar can be edited by the caregiver or client through the user terminal 2 they hold, and when the processing unit 12 determines that the content of any formal case data has changed (that is, it has been edited), it will instantly update the formal schedule related to the changed formal case data, and determine whether the updated formal schedule still meets the planning conditions. If the processing unit 12 determines that the updated formal schedule does not meet the planning conditions, it will instantly send a warning notification to the first user terminal 2A and the second user terminal 2B related to the formal schedule, thereby reminding the relevant caregivers and clients. In this embodiment, the original data of the online calendar is accessed using blockchain technology, and is not restricted to being built on a public chain or a private chain, thereby establishing a possible evaluation system to record execution results and ensure data accuracy and immutability.

[0076] In some preferred embodiments, when the processing unit 12 determines that the change in any formal case data in the formal schedule is that the client cancels the commission or the caregiver cancels the acceptance, the processing unit 12 will immediately re-match the remaining formal case data in the formal schedule with other case data in the storage unit 11 that have not yet been accepted by the caregiver, thereby adding the new formal case data to the formal schedule and reducing the losses caused to the caregivers and the client by the temporary cancellation of the care case.

[0077] In some preferred embodiments, for the calculation of the estimated moving time length, the processing unit 12 can further calculate the estimated moving time length based on an external meteorological database and / or a traffic condition database in addition to the estimated moving distance. In this way, the weather and / or traffic conditions can be used as calculation parameters for the estimated moving time length, so that the calculated estimated moving time length is more accurate. In addition, after the formal schedule and the formal case data are added to the online calendar, the processing unit 12 will also regularly update the estimated moving time length based on the meteorological database and / or traffic condition data, and determine whether the relevant formal schedule still meets the planning conditions based on the updated estimated moving time length. In addition, when the processing unit 12 determines that the updated formal schedule does not meet the planning conditions, it will immediately send a warning notification to the relevant user terminal 2 to remind the relevant caregivers and clients to respond.

[0078] In some preferred embodiments, each case data may further include an environmental image data related to the case location, and the storage unit 11 may also store an augmented reality service algorithm. The environmental image data may be, for example, a 360-degree panoramic environmental image of the corresponding case location. In this way, the caregiver can first familiarize himself with the actual working environment of the care case (such as the spatial planning of the working environment, whether there are barrier-free facilities, the relative position of the bed and the toilet, etc.) through the environmental image data before actually going to handle the care case, and perform a simulated care procedure based on the environmental image data on the first user terminal 2A held by him through the augmented reality service algorithm. In addition to being familiar with the care process, the action confirmation and live recording during the care can also be performed. When the care is completed, it will be stored in the case data for confirmation by the client and the subsequent caregivers who may take over. It is worth mentioning that the augmented reality service algorithm can introduce applications such as holographic imaging, virtual reality (VR) and augmented reality (AR) in response to the enhanced mobile broadband (eMBB) technology in the 5G network specification, responding to the aforementioned care operations and thereby improving the quality of care.

[0079] In addition, in each of the above-mentioned embodiments, the processing unit 12 can implement the case scheduling planning method by, for example, loading and executing an application software included in a computer program product. Specifically, the computer program product can be, for example, a data carrier such as a CD or a flash drive storing the application software, or can be, for example, a set of program software stored in a network space and available for download and installation. Furthermore, when an electronic device loads and executes the application software, the application software can enable the electronic device to implement the case scheduling planning method described in each of the above-mentioned embodiments.

[0080] The above is an example of the scheduling system of this embodiment. It should be noted that although this embodiment uses the example of a caregiver taking care cases to illustrate the scheduling method, the scheduling system and the scheduling method can also be applied to the client's situation for explanation and understanding, and can be further applied to case planning in other fields such as education, engineering and transportation, and are not limited to this embodiment.

[0081] In summary, by implementing the case scheduling planning method, the case scheduling planning system 1 can determine the target case data from the case data according to the scheduling planning request, and output the scheduling planning results generated according to the target case data to the first user end 2A for reference by the caregiver. It is worth mentioning that, through the case scheduling planning method, the case scheduling planning system 1 can not only ensure that the target case data collectively meet the planning conditions (that is, the grouping conditions and the verification conditions), but also ensure that each of the target case data meets the matching conditions. Therefore, the scheduling planning results can fully meet the needs and preferences of the caregivers, so it can effectively assist the caregivers to undertake multiple care cases in one day, and the needs of the employer can also be effectively handled in time-sharing due to the caregiver's scheduling, so that the cared patients can receive appropriate care according to the care case, so the purpose of the present invention can be achieved.

[0082] The above are merely embodiments of the present invention and should not be used to limit the scope of the present invention. That is, any simple equivalent changes and modifications made according to the claims and description of the present invention still fall within the scope of the present invention.

Claims

1. A case scheduling method, implemented by a case scheduling system, wherein the case scheduling system stores an electronic map and a plurality of case data, each case data including a case period and a case location, characterized in that: The case scheduling planning method comprises: When the case scheduling system receives a scheduling request including a specified period and a specified case quantity upper limit, a plurality of target case data each related to the specified period is determined from the case data according to the scheduling request, and a scheduling result including a planning path is generated and output according to the target case data, wherein: The case scheduling system first selects a plurality of matching case data that each meets a matching condition from the case data according to the scheduling request, generates a plurality of first groups according to the arrangement and combination of the matching case data and the grouping condition, then selects a target group from the first groups, and uses the matching case data in the target group as the target case data; For each case data, the matching condition includes: the case period of the case data is included in the specified period; Each first group is composed of a plurality of matching case data in the matching case data; and For any M matching case data among the matching case data, the grouping condition includes: M is less than or equal to the specified case quantity upper limit, and the M case periods of the M matching case data do not overlap with each other, where M is an integer greater than 1.

2. The case scheduling method according to claim 1, characterized in that: The scheduling request also includes a specified area range related to the electronic map, and a specified time length threshold value, and the matching condition also includes that the case location of the case data is within the specified area range, and when the specified time length threshold value is the specified time length lower limit, the matching condition also includes that the case time length indicated by the case period of the case data is greater than or equal to the specified time length lower limit, and when the specified time length threshold value is the specified time length upper limit, the matching condition also includes that the case time length is less than or equal to the specified time length upper limit.

3. The case scheduling method according to claim 1, characterized in that: The scheduling request also includes a specified distance upper limit; The case scheduling system also performs a verification process on the matching case data of each first group, and the verification process includes: Determining the arrangement order of the matching case data of the first group according to the time sequence of the case periods of the matching case data of the first group; generating a planning path corresponding to the first group according to the arrangement order of the matching case data of the first group and the relative position relationship of the case locations of the matching case data of the first group in the electronic map; and It is determined whether the matching case data of the first group meet a common verification condition, wherein the verification condition includes: a path distance of the planned path is less than or equal to the specified distance upper limit.

4. The case scheduling method according to claim 1, characterized in that: The case scheduling system further performs a verification process on the matching case data of each first group, wherein the verification process includes: Determining the arrangement order of the matching case data of the first group according to the time sequence of the case periods of the matching case data of the first group; According to the arrangement order of the matching case data of the first group and the relative position relationship of the case positions of the matching case data of the first group in the electronic map, a planned path corresponding to the first group and N estimated travel time lengths related to the planned path are generated, wherein: each estimated travel time length corresponds to two matching case data that are adjacent to each other in the arrangement order of the matching case data, and N is an integer greater than or equal to 1; for each two matching case data that are adjacent to each other in the arrangement order, the interval between the case periods of the two matching case data indicates the interval time length corresponding to the two matching case data; and It is determined whether the matching case data of the first group meet a common checking condition, wherein the checking condition includes: each estimated moving time length is less than or equal to the interval time length corresponding to the two matching case data.

5. The case scheduling method according to claim 1, characterized in that: Each case data also includes a case amount, the scheduling planning request also includes a specified income lower limit, and the grouping condition further includes: the sum of the M case amounts of the M matching case data is greater than or equal to the specified income lower limit.

6. A case scheduling system, characterized in that: Include: A storage unit storing an electronic map and a plurality of case data, each case data including a case period and a case location; and a processing unit, electrically connected to the storage unit; When the processing unit receives a scheduling request including a specified period and a specified case quantity upper limit, a plurality of target case data each related to the specified period is determined from the case data according to the scheduling request, and a scheduling result including a planning path is generated and output according to the target case data, wherein: The processing unit first selects a plurality of matching case data that each meets a matching condition from the case data according to the scheduling planning request, generates a plurality of first groups according to the arrangement and combination of the matching case data and the grouping condition, then selects a target group from the first groups, and uses the matching case data in the target group as the target case data; For each case data, the matching condition includes: the case period of the case data is included in the specified period; Each first group is composed of a plurality of matching case data in the matching case data; and For any M matching case data among the matching case data, the grouping condition includes: M is less than or equal to the specified case quantity upper limit, and the M case periods of the M matching case data do not overlap with each other, where M is an integer greater than 1.

7. The case scheduling system according to claim 6, characterized in that: The scheduling request also includes a specified area range related to the electronic map, and a specified time length threshold value, and the matching condition also includes that the case location of the case data is within the specified area range, and when the specified time length threshold value is the specified time length lower limit, the matching condition also includes that the case time length indicated by the case period of the case data is greater than or equal to the specified time length lower limit, and when the specified time length threshold value is the specified time length upper limit, the matching condition also includes that the case time length is less than or equal to the specified time length upper limit.

8. The case scheduling system according to claim 6, characterized in that: The scheduling request also includes a specified distance upper limit; The processing unit further performs a verification process on the matching case data of each first group, wherein the verification process includes: Determining the arrangement order of the matching case data of the first group according to the time sequence of the case periods of the matching case data of the first group; generating a planning path corresponding to the first group according to the arrangement order of the matching case data of the first group and the relative position relationship of the case locations of the matching case data of the first group in the electronic map; and It is determined whether the matching case data of the first group meet a common verification condition, wherein the verification condition includes: a path distance of the planned path is less than or equal to the specified distance upper limit.

9. The case scheduling system according to claim 6, characterized in that: The processing unit further performs a verification process on each first group of the matching case data, wherein the verification process includes: Determining the arrangement order of the matching case data of the first group according to the time sequence of the case periods of the matching case data of the first group; According to the arrangement order of the matching case data of the first group and the relative position relationship of the case positions of the matching case data of the first group in the electronic map, a planned path corresponding to the first group and N estimated travel time lengths related to the planned path are generated, wherein: each estimated travel time length corresponds to two matching case data that are adjacent to each other in the arrangement order of the matching case data, and N is an integer greater than or equal to 1; for each two matching case data that are adjacent to each other in the arrangement order, the interval between the case periods of the two matching case data indicates the interval time length corresponding to the two matching case data; and It is determined whether the matching case data of the first group meet a common checking condition, wherein the checking condition includes: each estimated moving time length is less than or equal to the interval time length corresponding to the two matching case data.

10. The case scheduling system according to claim 6, characterized in that: Each case data also includes a case amount, the scheduling planning request also includes a specified income lower limit, and the grouping condition further includes: the sum of the M case amounts of the M matching case data is greater than or equal to the specified income lower limit.

11. A computer program product, characterized in that: The computer program product includes application software, and when the application software is loaded and executed by an electronic device, the electronic device can implement the case scheduling planning method as described in any one of claims 1 to 5.

Images