An intelligent scheduling method, device, electronic device and storage medium for vehicle maintenance and repair

Abstract

The present application provides a vehicle maintenance and repair intelligent scheduling method, device, electronic device and storage medium, which relates to the technical field of vehicle maintenance and repair scheduling. The key points of its technical solution are as follows: when the first updated delivery time of the newly added first maintenance order is later than the first required delivery time, obtain the first process splitting information of the first maintenance order; adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order; insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated insertion delivery time corresponding to the second maintenance order and the first maintenance order, and when the estimated insertion delivery time is delayed, send a first request instruction; receive the first feedback instruction to schedule the first maintenance order. The vehicle maintenance and repair intelligent scheduling method, device, electronic device and storage medium provided by the present application have the advantages of high flexibility and improved efficiency.

Description

Technical Field

[0001] This application relates to the technical field of vehicle maintenance scheduling. Specifically, it relates to a vehicle maintenance intelligent scheduling method, device, electronic device, and storage medium. Background Art

[0002] With the rapid growth of the automobile ownership and the continuous improvement of users' requirements for the quality of vehicle repair services, the vehicle repair industry is facing increasingly severe challenges. Traditional repair scheduling methods mainly rely on manual experience and the simple first-come, first-served principle, and often seem powerless when facing complex and changeable repair demands.

[0003] In the prior art, there have been some attempts to introduce intelligent means to improve vehicle repair scheduling. For example, Chinese Patent Application CN113326954A discloses a vehicle repair task scheduling method, which further includes: performing damage part detection processing on the environmental inspection photos of the vehicle to be repaired based on vehicle damage image recognition technology to generate a vehicle damage list; extracting damage data from the vehicle damage part pictures through a preset replacement and repair data model, and marking replacement and repair work items for the damage parts according to the damage data to generate a work item list; extracting repair work items from the work item list to form a repair list; evaluating the repair duration of the vehicle damage part pictures in the repair list through a preset repair duration evaluation model to obtain a repair task list; and generating a task update list for the repair workstations based on the current task list of the repair workstations and the repair task list according to a preset repair task scheduling rule.

[0004] Specifically, this prior art sorts the vehicle codes in the batch repair task list in descending order of repair duration to obtain a repair task list, and sorts the required durations for completing the current task list of the repair workstations in ascending order to obtain a repair workstation list, and assigns the vehicle codes in the repair task list to the repair workstation list one by one from the front to the back to generate a task update list for the repair workstations, so as to realize the scheduling of different vehicle repair tasks.

[0005] However, this solution mainly focuses on shortening the repair time and does not consider the delivery of each maintenance order. Because in specific practices, users have requirements for the pick-up time when maintaining their vehicles, but the above-mentioned existing scheduling methods do not consider this factor.

[0006] Generally, when facing maintenance orders with delivery time requirements, the common practice is to first estimate the delivery time of the maintenance order. If the estimated delivery time does not meet the user's requirements, the existing maintenance orders will be scheduled to see if the new maintenance order can be inserted into the existing maintenance orders. If the requirements still cannot be met after the insertion, the user will be clearly informed that the delivery cannot be made within the specified time. The current scheduling method has poor flexibility and there is still room for efficiency improvement.

[0007] Therefore, the existing technology needs to be improved. Summary of the Invention

[0008] The purpose of this application is to provide a vehicle maintenance intelligent scheduling method, device, electronic device and storage medium, which has the advantages of high flexibility and improved efficiency.

[0009] In the first aspect, this application provides a vehicle maintenance intelligent scheduling method, including:

[0010] After entering the insertion mode, when the first updated delivery time for the first maintenance order recalculated due to the first maintenance order being allowed to be inserted between the existing second maintenance orders at the target work station is later than the first required delivery time, obtain the first process splitting information of the first maintenance order. The first process splitting information includes whether process splitting is allowed, and when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process.

[0011] When the first process splitting information allows splitting, adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type.

[0012] Insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated delivery time for the insertion corresponding to the second maintenance order and the first maintenance order, and send a first request instruction when the insertion estimated delivery time is delayed.

[0013] Receive the first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.

[0014] After receiving a newly added first maintenance order, if the estimated completion time of the first maintenance order cannot meet the first required delivery time specified by the user, the first maintenance order will be given priority first, and at this time, the priority mode is entered. In the priority mode, it will be determined whether to allow the first maintenance order to be given priority according to the current existing second maintenance orders at the target work station of the first maintenance order. That is, if the first maintenance order is given priority, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. Under this condition, the first maintenance order is given priority. After giving priority, the first updated delivery time of the first maintenance order will be recalculated. If the first updated delivery time is still later than the first required delivery time, at this time, it will be determined whether the first maintenance order allows splitting, that is, the first process splitting information of the first maintenance order is obtained. In the case of allowing splitting, the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order will be adjusted according to the first split maintenance time and the first process type, and then the split process will be inserted between the second maintenance orders after the maintenance order is adjusted. In this way, the split process can be inserted between the second maintenance orders and connected with the relevant maintenance items, thereby improving efficiency. On this basis, the inserted estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If there is a delay, a first request instruction is sent, and the scheduling operation of the first maintenance order is determined according to the first feedback instruction of the user. Therefore, when the first updated delivery time is later than the first required delivery time in this application, the maintenance order of the maintenance items in the second maintenance order is adjusted according to the first process type, and then the split process is inserted to connect the split process with the relevant maintenance items, thereby improving efficiency. Therefore, the solution of this application has the beneficial effects of high flexibility and improved efficiency.

[0015] Further, in this application, the step of adjusting the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type includes:

[0016] Obtain the first time window corresponding to each second maintenance order, where the first time window is the difference between the estimated completion time and the corresponding required completion time of the second maintenance order;

[0017] Obtain the maintenance items included in each second maintenance order;

[0018] When the first split maintenance time is less than or equal to the first time window, the maintenance items related to the first process type in the maintenance items included in the second maintenance order are sorted in the front;

[0019] When the first split maintenance time is greater than the first time window, the maintenance items related to the first process type in the maintenance items included in the second maintenance order are sorted at the back.

[0020] Further, in the present application, the step of inserting the split process of the first maintenance order into the second maintenance order according to the maintenance order includes:

[0021] Obtain the maintenance items at the head and tail of the second maintenance order after the maintenance order is adjusted;

[0022] When the corresponding maintenance item is at the head, insert the corresponding split process before the corresponding second maintenance order;

[0023] When the corresponding maintenance item is at the tail, insert the corresponding split process after the corresponding second maintenance order;

[0024] The method further includes:

[0025] Obtain two maintenance items at the head and tail of adjacent second maintenance orders after the maintenance order is adjusted;

[0026] When two maintenance items at the head and tail of adjacent second maintenance orders are both related to the first process type, insert the corresponding split process between the adjacent two second maintenance orders;

[0027] The method further includes:

[0028] When there are maintenance items of different second maintenance orders related to the first process type and at the head or at the tail at the same time, select the second maintenance order with the larger first time window. When the corresponding maintenance item is at the head, insert the corresponding split process before the corresponding second maintenance order. When the corresponding maintenance item is at the tail, insert the corresponding split process after the corresponding second maintenance order.

[0029] Further, in the present application, the step of receiving the first feedback instruction made according to the first request instruction and scheduling the first maintenance order according to the first feedback instruction includes:

[0030] When the first feedback instruction is sent by the user corresponding to the first maintenance order, if the first feedback instruction is consent, schedule the first maintenance order. If the first feedback instruction is dissent, stop scheduling the first maintenance order;

[0031] When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is consent, schedule the first maintenance order. If the first feedback instruction is dissent, select insertion positions for each split work process according to the first split maintenance time and the first time window, so as to schedule the first maintenance order.

[0032] Further, in the present application, the step of selecting insertion positions for each split work process according to the first split maintenance time and the first time window includes:

[0033] Screen out the first split maintenance times that are less than the first time window according to the smallest first time window to obtain a first split group;

[0034] Screen out one or more of the first split maintenance times from the first split group, so that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window;

[0035] Insert the split work processes corresponding to the one or more first split maintenance times screened out before the second maintenance order corresponding to the smallest first time window.

[0036] Further, in the present application, the step of screening out one or more of the first split maintenance times from the first split group, so that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window includes:

[0037] Send a second request instruction;

[0038] Receive a second feedback instruction made according to the second request instruction;

[0039] When there is no specified information about the split work process in the second feedback instruction, screen out one or more of the first split maintenance times from the first split group, so that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window;

[0040] When the second feedback instruction has the specified information about the split work process, judge whether the first split maintenance time corresponding to the specified split work process specified is not greater than the smallest first time window. If so, insert the specified split work process before the second maintenance order corresponding to the smallest first time window.

[0041] Further, in the present application, the step of determining whether the first split maintenance time corresponding to the designated split process is not greater than the minimum of the first time windows according to the designated information further includes:

[0042] If not, obtain third maintenance orders in other workstations with an estimated completion time earlier than the first demand delivery time, and obtain the corresponding second time window;

[0043] Determine whether the first split maintenance time corresponding to the designated split process is not greater than the minimum of the second time windows. If so, insert the designated split process before the third maintenance order corresponding to the minimum second time window;

[0044] The step of determining whether the first split maintenance time corresponding to the designated split process is not greater than the minimum of the second time windows further includes:

[0045] If not, obtain the second process split information of the second maintenance order sorted before the insertion position of the first maintenance order. The second process split information includes whether process splitting is allowed and, when process splitting is allowed, the second split maintenance time corresponding to each split process;

[0046] Obtain the corresponding second split maintenance time according to the second process split information;

[0047] According to the second demand delivery time and the second split maintenance time corresponding to the second maintenance order capable of process splitting, determine whether the split process of the second maintenance order can be inserted between the third maintenance orders without affecting the delivery of the second maintenance order and the third maintenance order. If so, perform the insertion operation. If not, perform a warning operation;

[0048] The method further includes:

[0049] Obtain the second updated delivery time of the first maintenance order after splitting the second maintenance order and inserting the split process of the second maintenance order after the third maintenance order;

[0050] When the second updated delivery time is earlier than the first demand delivery time, reduce the number of the second maintenance orders for which process splitting is performed.

[0051] In a second aspect, the present application also proposes a vehicle maintenance intelligent scheduling device, including:

[0052] The first module is used to obtain the first process splitting information of the first maintenance order when, after entering the queue-jumping mode, the first updated delivery time for the first maintenance order recalculated due to allowing the first maintenance order to jump the queue between the existing second maintenance orders at the target work station is later than the first required delivery time. The first process splitting information includes whether process splitting is allowed, and when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process;

[0053] The second module is used to, when the first process splitting information allows splitting, adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type;

[0054] The third module is used to insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated delivery time for the insertion corresponding to the second maintenance order and the first maintenance order, and send a first request instruction when the estimated delivery time for the insertion is delayed;

[0055] The fourth module is used to receive a first feedback instruction made according to the first request instruction and schedule the first maintenance order according to the first feedback instruction.

[0056] In a third aspect, the present application also proposes an electronic device, including a processor and a memory. The memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the above method are run.

[0057] In a fourth aspect, the present application also proposes a storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above method are run.

[0058] As can be seen from the above, for a vehicle maintenance intelligent scheduling method, device, electronic device and storage medium provided by the present application, after receiving a newly added first maintenance order, if the estimated completion time of the first maintenance order cannot meet the first required delivery time specified by the user, the first maintenance order will be given priority first, and at this time, the priority mode is entered. In the priority mode, it will be determined whether to allow the first maintenance order to be given priority according to the current existing second maintenance order at the target work station of the first maintenance order, that is, if the first maintenance order is given priority, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. Under this condition, the first maintenance order is given priority. After giving priority, the first updated delivery time of the first maintenance order will be recalculated. If the first updated delivery time is still later than the first required delivery time, at this time, it will be determined whether the first maintenance order allows splitting, that is, the first process splitting information of the first maintenance order is obtained. In the case of allowing splitting, the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order will be adjusted according to the first split maintenance time and the first process type, and then the split process will be inserted between the second maintenance orders after the maintenance order is adjusted, so that the split process can be inserted between the second maintenance orders and connected with the relevant maintenance items, thereby improving the efficiency. On this basis, the insertion estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If there is a delay, a first request instruction will be sent, and the scheduling operation for the first maintenance order will be determined according to the first feedback instruction of the user. Therefore, when the first updated delivery time is later than the first required delivery time in the present application, the maintenance order of the maintenance items in the second maintenance order is adjusted according to the first process type, and then the split process is inserted to connect the split process with the relevant maintenance items, thereby improving the efficiency. Therefore, the solution of the present application has the beneficial effects of high flexibility and improved efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 It is a flowchart of a vehicle maintenance intelligent scheduling method provided by the present application.

[0060] Figure 2 It is a schematic structural diagram of a vehicle maintenance intelligent scheduling device provided by the present application.

[0061] Figure 3 It is a schematic structural diagram of an electronic device provided by the present application.

[0062] In the figure: 210, the first module; 220, the second module; 230, the third module; 240, the fourth module; 310, the processor; 320, the memory. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0063] The following will clearly and completely describe the technical solutions in the present application in conjunction with the accompanying drawings in the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The components of the present application usually described and illustrated in the accompanying drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present application provided in the accompanying drawings is not intended to limit the scope of the present application claimed, but only represents the selected embodiments of the present application. All other embodiments obtained by those skilled in the art based on the embodiments of the present application without creative efforts belong to the scope of protection of the present application.

[0064] It should be noted that: Similar reference numerals and letters denote similar items in the following drawings. Therefore, once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of the present application, terms such as "first", "second", etc. are only used for distinguishing descriptions and cannot be understood as indicating or implying relative importance.

[0065] With the rapid development of the automotive industry and the continuous growth of vehicle ownership, vehicle maintenance and repair services are facing unprecedented challenges and opportunities. On the one hand, users have put forward higher requirements for the quality and efficiency of repair services; on the other hand, repair workshops need to handle the increasing repair demands more flexibly and efficiently under limited resource conditions. In this context, how to optimize repair scheduling, improve resource utilization, and at the same time meet the diverse needs of customers has become a key issue faced by the industry.

[0066] Traditional repair scheduling methods mainly rely on manual experience and the simple first-come, first-served principle. When facing the complex and changeable modern repair environment, this method is difficult to effectively handle emergency orders and cannot fully utilize the resources of the repair workshop, often resulting in low efficiency and customer dissatisfaction.

[0067] In recent years, with the development of information technology and artificial intelligence, intelligent scheduling systems have begun to stand out in the vehicle repair industry. These systems attempt to improve scheduling effects through data analysis and algorithm optimization. However, existing intelligent scheduling schemes are often too rigid and difficult to adapt to various variables and special situations in the actual repair process. Especially in dealing with emergency orders and making full use of fragmented time, there are still obvious deficiencies.

[0068] The present invention precisely aims at the above problems and proposes an innovative intelligent scheduling method for vehicle maintenance. The core of this method lies in maximizing the utilization of existing time resources through flexible process splitting and dynamic insertion strategies to advance the delivery of newly added orders while trying to meet the delivery requirements of existing orders as much as possible.

[0069] Specifically, please refer to Figure 1, this application provides a vehicle maintenance intelligent scheduling method, including:

[0070] S110. After entering the queue-jumping mode, when the first updated delivery time for the first maintenance order recalculated due to the first maintenance order being allowed to jump the queue between the existing second maintenance orders at the target work station is later than the first required delivery time, obtain the first process splitting information of the first maintenance order. The first process splitting information includes whether process splitting is allowed, and when process splitting is allowed, the first splitting maintenance time corresponding to each split process and the first process type of the split process;

[0071] S120. When the first process splitting information allows splitting, adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first splitting maintenance time and the first process type;

[0072] S130. Insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated insertion delivery time of the corresponding second maintenance order and the first maintenance order, and send a first request instruction when the estimated insertion delivery time is delayed;

[0073] S140. Receive the first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.

[0074] Among them, the method proposed in this application can be implemented relying on an intelligent system. The system includes a server for data processing, a data acquisition end for receiving data, and an output end for outputting processing results.

[0075] Among them, the queue-jumping mode is a special operating state of the system, usually triggered when receiving the first maintenance order that needs to be processed preferentially. In this mode, the system will try to insert the new order into the existing scheduling plan. The queue-jumping mode can be triggered manually by the staff or set to be automatically triggered under specific conditions.

[0076] Among them, the first maintenance order refers to the newly added maintenance order that needs to be inserted into the scheduling plan, usually an urgent or high-priority order.

[0077] Among them, the target work station refers to the specific work station or area selected by the system for the first maintenance order to perform maintenance work. In a complex repair workshop, there are usually multiple maintenance work stations, and each maintenance work station may specialize in processing specific types of maintenance tasks or have specific equipment.

[0078] In vehicle maintenance and repair, for more refined division of labor, different maintenance and repair workstations can be set for different maintenance and repair tasks or different vehicle models. A maintenance and repair workstation may handle the maintenance and repair tasks of a specific vehicle model or one or more highly related maintenance and repair tasks. It should be noted that a maintenance and repair workstation can also perform other tasks besides the initial division tasks, that is, different maintenance and repair workstations are interchangeable in some cases. In other words, a maintenance and repair workstation can also perform the maintenance and repair tasks of other workstations under certain conditions.

[0079] Among them, the second maintenance order refers to an existing maintenance order already in the scheduling plan.

[0080] Among them, the first updated delivery time refers to the estimated completion time of the first maintenance order recalculated after the system attempts to insert the first maintenance order into the existing scheduling plan.

[0081] Among them, the first required delivery time refers to the time when the customer requests the completion of the first maintenance order.

[0082] Among them, the first process splitting information includes detailed information on how the first maintenance order can be split into multiple sub-processes, including whether it can be split and the time required for each split process, etc.

[0083] Among them, the split process refers to splitting a complete maintenance order into multiple relatively independent sub-tasks or processes.

[0084] Among them, the insertion position refers to the time point or position where the system plans to insert the first maintenance order.

[0085] Among them, the maintenance item refers to the tasks included in the second maintenance order. For example, for a second maintenance order, it may include oil change, oil filter change, air filter inspection or change, fuel filter inspection or change, brake fluid inspection or change, coolant inspection or change, transmission oil inspection or change. These maintenance items belong to maintenance and are usually carried out at a repair workstation. That is, the split processes in the first maintenance order can also be regarded as maintenance items.

[0086] In vehicle maintenance, when faced with the situation where the user specifies a delivery time, the usual practice is to first estimate the preliminary completion time. If the estimated preliminary completion time cannot meet the delivery time specified by the user, according to the user's priority, an attempt can be made to arrange for queue-jumping. Generally, the approach is to determine whether queue-jumping is allowed on the premise that existing orders will not be delayed. If it is determined that queue-jumping is not possible, the user will be informed that delivery cannot be completed at the specified delivery time. If queue-jumping is possible, the first updated delivery time after queue-jumping will be further calculated. When the first updated delivery time is not later than the delivery time specified by the user, that is, the first required delivery time, all orders can be delivered normally. However, if the first updated delivery time is later than the first required delivery time, the user will be informed that delivery cannot be completed at the specified delivery time, and then the user will decide whether to perform maintenance according to the queue-jumping position or cancel the order.

[0087] In the above actual production scenario, the first updated delivery time is calculated based on the estimated maintenance time for the first maintenance order and the second maintenance order to complete the entire order separately. In fact, the first maintenance order and the second maintenance order may include various maintenance items. Different maintenance items may require different maintenance inspection tools and even different maintenance staff. The traditional approach usually takes the whole vehicle as the maintenance unit, that is, after all maintenance items of the whole vehicle are completed, the maintenance of the next vehicle will be carried out. In this process, it is easy to have a mismatch in the connection of maintenance items between the two consecutive vehicles, resulting in unreasonable arrangements for maintenance inspection tools and maintenance staff, thus requiring more maintenance time. That is, if the last maintenance item of the vehicle in front and the first maintenance item of the vehicle behind are the same, the scheduling time for maintenance inspection tools and maintenance staff can be reduced, thereby improving efficiency.

[0088] In response to this, the present application proposes that after inserting the entire first maintenance order into the queue, when the first updated delivery time is later than the first required delivery time, obtain the first process splitting information of the first maintenance order, and determine whether the first maintenance order can be split. When it can be split, adjust the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type.

[0089] That is, when the first updated delivery time is later than the first required delivery time, split the first maintenance order and adjust the order of the maintenance items of the specific second maintenance order, and then insert the split process so that the inserted split process can be connected with the second maintenance order in front or the second maintenance order behind, thereby improving the maintenance efficiency.

[0090] For example, there are at least two second maintenance orders for the target work station, namely Order A and Order B. Among them, the maintenance items of Order A include (a, b, d), and the maintenance items of Order B include (c, d, e). The newly added first maintenance order is Order C, and the disassembly process of Order C is (d, e, f). When the first updated delivery time of Order C is still later than the first required delivery time after insertion, and Order A and Order B are before the insertion position of Order C, at this time, adjust the maintenance order of the maintenance items of Order A and Order B according to the first process type of the disassembly process. The original default maintenance order is A (a→b→d) and B (c→d→e), that is, the maintenance is carried out in the order of Aa→Ab→Ad→Bc→Bd→Be→Cd→Ce→Cf. After adjustment, the order can be A (a→b→d) and B (d→c→e). At this time, insert the disassembly process d of Order C between Order A and Order B, and sort the disassembly process e and the disassembly process f in sequence after Order B, that is, the maintenance is carried out in the order of Aa→Ab→Ad→Cd→Bd→Bc→Be→Ce→Cf. From the above two orders, it can be seen that in the order of Aa→Ab→Ad→Bc→Bd→Be→Cd→Ce→Cf, there is no connection between all adjacent two tasks, which results in the need to call the corresponding maintenance inspection tools, or even maintenance staff, for each task. This method leads to low maintenance efficiency. When estimating the completion time, usually estimate separately according to each order and then add them up.

[0091] In the order of Aa→Ab→Ad→Cd→Bd→Bc→Be→Ce→Cf, it can be found that the three tasks of Ad→Cd→Bd are tasks of the same type, and the two tasks of Be→Ce are tasks of the same type. Since the tasks between different orders can be connected to each other, the scheduling of the corresponding maintenance inspection tools, or even maintenance staff, is reduced, thus improving the maintenance efficiency.

[0092] In some embodiments, the order of the maintenance items in the second maintenance order can be adjusted in advance so that they can be connected before and after, thus improving the maintenance efficiency. Taking the above embodiment as an example, the original default maintenance order is A (a→b→d) and B (c→d→e), and after adjustment, it can become A (a→b→d) and B (d→c→e). This method can improve the efficiency to a certain extent in advance. However, it has limitations, that is, there may be no connected maintenance items between the original second maintenance orders.

[0093] For example, the maintenance items for the original order A are (a, b, d), and the maintenance items for order B are (c, e, f). In this case, it is not possible to improve efficiency by adjusting the maintenance sequence in advance. In such a situation, if the disassembly process for order c is (d, e, f), then the maintenance sequence of the maintenance items for order B can be adjusted. Specifically, it becomes (e → c → f). Then, insert the disassembly process d and the disassembly process e between order A and order B, and place the disassembly process f after order B. That is, originally, the maintenance was carried out in the order of Aa → Ab → Ad → Bc → Be → Bf → Cd → Ce → Cf. At this time, there is no connection between any two adjacent tasks. After adjustment, the maintenance is carried out in the order of Aa → Ab → Ad → Cd → Ce → Be → Bc → Bf → Cf. It can be found that the two tasks Ad → Cd are of the same type, the two tasks Ce → Be are of the same type, and the two tasks Bf → Cf are of the same type. Since the tasks between different orders can be connected to each other, the scheduling of the corresponding maintenance and repair tools and even the maintenance staff is reduced, thereby improving the maintenance efficiency.

[0094] Specifically, when the method provided in this application is specifically executed, it can be implemented based on a liftable car repair lift with multiple layers. A car repair lift can usually lift a car during car repair for inspecting the chassis and facilitating disassembly. By setting a multi-layer structure, it is convenient to insert the disassembly process of the first maintenance order. For example, taking some of the above embodiments as an example, after completing the maintenance of order A, drive the vehicle corresponding to order C into the liftable car repair lift with multiple layers for the disassembly process maintenance operation. After completing the maintenance operation of the specific disassembly process, lift the vehicle corresponding to order C through the car repair lift, and then drive the vehicle corresponding to order B into the remaining layers of the car repair lift to carry out the maintenance operation of order B. This way can quickly realize the maintenance operations of different vehicles at one work station, thereby improving the efficiency.

[0095] It should be noted that in the solution of this application, the purpose is to improve the maintenance efficiency as much as possible, thereby reducing the overtime waiting time required by the user corresponding to the first maintenance order, and thus improving the success rate of order transactions. On this basis, the efficiency can be effectively improved through process splitting, adjustment of the maintenance sequence of maintenance items, and insertion of split processes, so that the first maintenance order can be advanced as much as possible. During this process, since the insertion of split processes will cause the completion time of the second maintenance order being cut in line to be postponed. At this time, it is necessary to consider whether the postponement of the completion time of the second maintenance order will cause the second maintenance order to time out. Usually, each second maintenance order corresponds to an estimated completion time and a corresponding required completion time, and the difference between the two is the first time window. The first time window represents the time margin that can be inserted. Inserting tasks that exceed the first time window may cause the second maintenance order to time out. Therefore, in some preferred embodiments, it is also necessary to adjust the maintenance sequence and insert split processes according to the first split maintenance time.

[0096] For example, the existing second maintenance orders at least include order A, order B, order D, and order E arranged in sequence. Among them, the maintenance items of order A and order D are exactly the same, and the maintenance items of order B and order E are exactly the same. If a split process of order C as the first maintenance order can be inserted between order A and order B, and can also be inserted between order D and order E, at this time, the specific adjustment of the maintenance sequence of order A and / or order B, or the adjustment of the maintenance sequence of order D and / or order E can be selected according to the first split maintenance time corresponding to the split process. Inserting the split process between order A and order B means adjusting the maintenance sequence of order A and / or order B, and inserting the split process between order D and order E means adjusting the maintenance sequence of order D and / or order E. Specifically, it can be judged according to the difference between the first split maintenance time corresponding to the split process and the first time windows of order B and order D, and preferably insert it at the order position corresponding to the positive and larger difference. A positive difference means that the first time window is greater than the corresponding first split maintenance time.

[0097] Since the split process is cut in line, it is necessary to recalculate the inserted estimated delivery time. If the first maintenance order or the second maintenance order is delayed, a first request instruction is sent. The first request instruction can specifically be sent to the corresponding user, and then the scheduling strategy for the first maintenance order is executed according to the user's first feedback instruction.

[0098] In summary, in the solution of the present application, after receiving a new first maintenance order, if the estimated completion time of the first maintenance order cannot meet the first required delivery time specified by the user, the first maintenance order will be given priority first, and at this time, the priority mode is entered. In the priority mode, it will be determined whether to allow the first maintenance order to be given priority according to the current existing second maintenance order at the target work station of the first maintenance order. That is, if the first maintenance order is given priority, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. Under this condition, the first maintenance order is given priority. After the priority is given, the first updated delivery time of the first maintenance order will be recalculated. If the first updated delivery time is still later than the first required delivery time, at this time, it will be determined whether the first maintenance order allows splitting. That is, the first process splitting information of the first maintenance order is obtained. In the case where splitting is allowed, the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order will be adjusted according to the first split maintenance time and the first process type, and then the split process will be inserted between the second maintenance orders after the maintenance order is adjusted, so that the split process can be inserted between the second maintenance orders and connected with the relevant maintenance items, thereby improving efficiency. On this basis, the inserted estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If there is a delay, a first request instruction will be sent, and the scheduling operation for the first maintenance order will be determined according to the first feedback instruction of the user. Therefore, when the first updated delivery time is later than the first required delivery time in the present application, the maintenance order of the maintenance items in the second maintenance order is adjusted according to the first process type, and then the split process is inserted to connect the split process with the relevant maintenance items, thereby improving efficiency. Therefore, the solution of the present application has the beneficial effects of high flexibility and improved efficiency.

[0099] Further, in some embodiments, the step of adjusting the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type includes:

[0100] Obtain the first time window corresponding to each second maintenance order, where the first time window is the difference between the estimated completion time of the second maintenance order and the corresponding required completion time;

[0101] Obtain the maintenance items included in each second maintenance order;

[0102] When the first split maintenance time is less than or equal to the first time window, the maintenance items related to the first process type in the maintenance items included in the second maintenance order are sorted in the front;

[0103] When the first split maintenance time is greater than the first time window, the maintenance items related to the first process type in the maintenance items included in the second maintenance order are sorted in the back.

[0104] In some of the above embodiments, the present application proposes to adjust the maintenance order of the maintenance items of the second maintenance order according to the first process type of the first maintenance order, and to jump the disassembly process. In this process, the improvement of efficiency can be taken as the highest priority. When the improvement of efficiency is taken as the highest priority, the principle of adjusting the maintenance order of the maintenance items of the second maintenance order is to connect the most maintenance items with the disassembly process. This method has the greatest effect on the overall efficiency improvement. However, this method may cause delays in some second maintenance orders. Therefore, in some other embodiments, it is proposed that the delivery of the second maintenance order can be guaranteed as the highest priority.

[0105] Specifically, when the delivery of the second maintenance order is guaranteed as the highest priority, the strategy for adjusting the maintenance order of the maintenance items in the second maintenance order is to adjust according to the first disassembly maintenance time and the first time window.

[0106] When the first disassembly maintenance time is less than or equal to the first time window, the maintenance items related to the first process type in the maintenance items included in the second maintenance order are sorted in the front. This is because if the first disassembly maintenance time is less than or equal to the first time window, inserting the corresponding disassembly process before the corresponding second maintenance order will not affect the delivery of the second maintenance order. The corresponding disassembly process can be inserted before the corresponding second maintenance order. Therefore, the relevant maintenance items need to be sorted in the front to connect with the disassembly process.

[0107] For example, the existing second maintenance order at least includes order A, and the maintenance items of order A include (a, b, d). The first maintenance order is order C, and the disassembly process of order C is (b, e, f). If order A is arranged before order C, since the disassembly process b is related to the maintenance item b, order A can be used as the object for adjusting the maintenance order. At this time, the first time window of order A and the first disassembly maintenance time of the disassembly process b can be obtained. Assume that the first time window of order A is T1 and the first disassembly maintenance time of the disassembly process b is T2. If T2 is less than or equal to T1, then the maintenance item b in order A is sorted in the front, specifically (b→a→d). At this time, the disassembly process b can be inserted before order A.

[0108] If T2 is greater than T1, then the maintenance item b in order A is sorted in the back, specifically (a→d→b). At this time, the disassembly process b can be inserted after order A.

[0109] Through the above solution, it is possible to avoid the delay of the second maintenance order caused by the disassembly process.

[0110] Specifically, the steps of inserting the splitting processes of the first maintenance order into the second maintenance order according to the maintenance sequence include:

[0111] Obtain the maintenance items at the head and tail of the second maintenance order after the maintenance sequence is adjusted;

[0112] When the corresponding maintenance item is at the head, insert the corresponding splitting process before the corresponding second maintenance order;

[0113] When the corresponding maintenance item is at the tail, insert the corresponding splitting process after the corresponding second maintenance order;

[0114] The method further includes:

[0115] Obtain two maintenance items at the head and tail of adjacent second maintenance orders after the maintenance sequence is adjusted;

[0116] When both of the two maintenance items at the head and tail of adjacent second maintenance orders are related to the first process type, insert the corresponding splitting process between the adjacent two second maintenance orders;

[0117] The method further includes:

[0118] When there are maintenance items of different second maintenance orders related to the first process type and at the head or at the tail simultaneously, select the second maintenance order with a larger first time window. When the corresponding maintenance item is at the head, insert the corresponding splitting process before the corresponding second maintenance order. When the corresponding maintenance item is at the tail, insert the corresponding splitting process after the corresponding second maintenance order.

[0119] In the solution of the present application, in addition to considering a single second maintenance order, the insertion strategy between adjacent orders is further optimized:

[0120] The system will obtain two maintenance items at the head and tail of adjacent second maintenance orders after adjustment. The purpose of this step is to identify possible cross - order coherence opportunities.

[0121] When both of the two maintenance items at the head and tail of adjacent second maintenance orders are related to the first process type, insert the corresponding splitting process between the adjacent two second maintenance orders. This arrangement can make the most of the coherence of maintenance items and further improve efficiency.

[0122] For example, if the last item of order A as the second maintenance order is c, the first item of order B as the second maintenance order is c, and the first maintenance order has a splitting process related to c, then the system will select to insert this splitting process between order A and order B. In this way, an efficient maintenance sequence can be formed: order A → splitting process c → order B.

[0123] In addition, this application also considers a more complex scenario, that is, the decision-making strategy when multiple second maintenance orders may be suitable for insertion:

[0124] When there are maintenance items of different second maintenance orders related to the first process type and at the head or at the tail simultaneously, select the second maintenance order with a larger first time window. A larger first time window means that the order has more flexibility to accommodate the inserted split process.

[0125] The specific operation is as follows: when the corresponding maintenance item is at the head, insert the corresponding split process before the corresponding second maintenance order; when the corresponding maintenance item is at the tail, insert the corresponding split process after the corresponding second maintenance order.

[0126] For example, assume that both order A and order B as second maintenance orders have maintenance items related to split process x at the head, and the first time window of order A is 30 minutes while that of order B is 20 minutes. In this case, the system will choose to insert split process x before order A because order A has a larger time buffer to accommodate this insertion.

[0127] Through this refined insertion strategy, this application not only ensures the efficient coherence of maintenance work but also maximally utilizes the time window of each order, thereby improving the overall maintenance efficiency while minimizing the impact on the delivery time of existing orders as much as possible. This balancing strategy not only meets the urgent needs of new orders but also protects the interests of existing orders.

[0128] Furthermore, in some of these embodiments, the step of receiving a first feedback instruction according to the first request instruction and scheduling the first maintenance order according to the first feedback instruction includes:

[0129] When the first feedback instruction is sent by the user corresponding to the first maintenance order, if the first feedback instruction is consent, schedule the first maintenance order; if the first feedback instruction is dissent, stop scheduling the first maintenance order;

[0130] When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is consent, schedule the first maintenance order; if the first feedback instruction is dissent, select an insertion position for each split process according to the first split maintenance time and the first time window, thereby scheduling the first maintenance order.

[0131] Based on the above embodiments, this application further improves the feedback mechanism of the scheduling system to better balance the interests of new orders and existing orders and improve the overall customer satisfaction. This mechanism not only considers the improvement of maintenance efficiency but also fully considers the needs and wishes of different users, making the entire scheduling process more flexible and user-friendly.

[0132] Specifically, in the step of receiving the first feedback instruction made according to the first request instruction and scheduling the first maintenance order according to the first feedback instruction, the system will adopt different processing strategies according to different feedback sources:

[0133] When the first feedback instruction is sent by the user corresponding to the first maintenance order:

[0134] If the first feedback instruction is consent, the system will schedule the first maintenance order according to the previously calculated insertion plan. This indicates that the user of the newly added first maintenance order has accepted the queuing-jumping arrangement proposed by the system.

[0135] If the first feedback instruction is dissent, the system will stop scheduling the first maintenance order. In this case, the system may provide other options for the user, such as delaying the delivery time or redirecting to other repair points.

[0136] For example, assume that the system proposes a queuing-jumping plan for an urgent brake system repair order (the first maintenance order), which is expected to be completed 2 hours earlier than the original schedule. If the user agrees to this plan, the system will execute this scheduling plan. If the user disagrees (possibly because the advanced time is not ideal enough), the system will cancel this queuing-jumping arrangement and may suggest that the user consider other options.

[0137] When the first feedback instruction is sent by the user corresponding to the second maintenance order:

[0138] If the first feedback instruction is consent, the system will schedule the first maintenance order according to the plan. This indicates that the user of the order being queued-jumped understands and accepts this arrangement.

[0139] If the first feedback instruction is dissent, the system will not simply abandon the scheduling but will adopt a more flexible strategy. Specifically, the system will select new insertion positions for each split operation according to the first split maintenance time and the first time window, so as to schedule the first maintenance order.

[0140] This flexible processing method reflects the intelligence of the system in balancing the needs of different users. For example, assume that the system originally planned to insert a split operation of an engine inspection (belonging to the first maintenance order) before a regular maintenance order (the second maintenance order). If this queuing-jumping method causes a delay in the second maintenance order and the corresponding user disagrees with this arrangement, the system will not completely abandon the scheduling but will try to find other suitable insertion positions.

[0141] The system can check the time windows of other second maintenance orders to see if it is possible to insert disassembly processes without affecting these orders. For example, the system may find that there is enough time window between two tire replacement orders to insert an engine inspection process, which will neither significantly delay any existing orders nor affect the time required for emergency orders.

[0142] This ability of dynamic adjustment greatly improves the adaptability and efficiency of the system. It not only considers time factors but also takes into account the wishes of users, maximizing the satisfaction of all parties while ensuring service quality.

[0143] In addition, this feedback mechanism can be further extended. For example, the system can set a priority threshold, and only when the priority of a new order exceeds a certain level, a request instruction will be sent to the users of existing orders. This can avoid disturbing the users of regular orders too much while ensuring that truly urgent situations can be handled in a timely manner.

[0144] The system can also adjust the request strategy according to the user's historical feedback. For example, if a certain user often agrees to be cut in line, the system may be more inclined to select the order of this user as the insertion target, and may provide some discounts or rewards for such users to thank them for their cooperation.

[0145] Generally speaking, this feedback mechanism greatly improves the flexibility and efficiency of the entire maintenance scheduling system. It can not only cope with complex and changeable actual situations, but also take into account the needs of individual users while improving the overall efficiency, reflecting the innovation and practicality of the present invention in the field of intelligent scheduling. In this way, the repair shop can not only better manage its resources and time, but also provide better customer service, improve customer satisfaction, and thus gain an advantageous position in the highly competitive automotive repair market.

[0146] Further, in some of the embodiments, the step of selecting an insertion position for each disassembly process according to the first split maintenance time and the first time window includes:

[0147] Filter out the first split maintenance times that are less than the first time window according to the smallest first time window to obtain a first split group;

[0148] Select one or more first split maintenance times from the first split group such that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window;

[0149] Insert the disassembly processes corresponding to the one or more first split maintenance times selected before the second maintenance order corresponding to the smallest first time window.

[0150] Based on the above embodiments, the present application further optimizes the insertion strategy for the disassembly process, especially in the case where the user of the second maintenance order does not agree to the queue-jumping arrangement. This optimization not only improves the flexibility of the system but also better balances the relationship between efficiency improvement and user satisfaction.

[0151] Specifically, when the system needs to select an insertion position for each disassembly process according to the first disassembly maintenance time and the first time window, the following steps will be taken:

[0152] First, the system will screen out the first disassembly maintenance times that are less than the time window based on the smallest first time window, thereby obtaining the first disassembly group. The purpose of this step is to ensure that the selected disassembly processes will not cause delays to existing orders.

[0153] For example, if the system detects that the smallest first time window is 30 minutes, it will screen out all disassembly processes with a maintenance time of less than 30 minutes. If the first maintenance order includes disassembly processes such as changing the engine oil (20 minutes), checking the braking system (25 minutes), and replacing the air filter (15 minutes), then they will all be included in the first disassembly group.

[0154] Next, the system will screen out one or more first disassembly maintenance times from the first disassembly group so that their total sum is less than the smallest first time window and as close as possible to this time window. This approach aims to maximize the utilization of available time and improve overall efficiency.

[0155] Continuing with the above example, the system will try to find the best combination. In this case, it may select the process of checking the braking system (25 minutes) because the total time for this work is 25 minutes, which is less than and closest to the 30-minute time window.

[0156] Finally, the system will insert the disassembly processes corresponding to the one or more first disassembly maintenance times screened out before the second maintenance order corresponding to the smallest first time window. This ensures that the inserted processes will not cause delays to any existing orders.

[0157] In practical applications, this method demonstrates extremely high flexibility and efficiency. For example, suppose there is an emergency braking system repair order (the first maintenance order) that includes multiple disassembly processes: checking the brake pads (15 minutes), changing the brake fluid (20 minutes), and adjusting the handbrake (10 minutes). The system first attempts to insert the entire order but is rejected by the user of the order being jumped in line.

[0158] At this time, the system checks the time windows of all existing orders and assumes that the smallest time window found is 25 minutes. The system immediately filters out the processes that can be completed within 25 minutes, namely, checking the brake pads and adjusting the handbrake. Then, it selects the combination of these two processes (totaling 25 minutes) and inserts them into the corresponding time window.

[0159] Through precise calculation and selection, the system can make the most of each available time window. Even if it is not possible to insert the entire order, the system can still partially meet the urgent needs, which greatly improves the flexibility of scheduling. This method not only takes into account the needs of urgent orders but also respects the wishes of existing order users, helping to improve overall user satisfaction. By finely managing the time windows, the system can better optimize the use of workstations and personnel resources. This algorithm can effectively handle the complex situations of multiple split processes and multiple time windows, improving the adaptability of the system.

[0160] In addition, this method can be further extended and optimized. For example, the system can consider the dependencies between processes to ensure that the inserted process combination is technically feasible. It can also combine the specialization level of workstations and preferentially select the process combination most suitable for a specific workstation.

[0161] The system can also introduce a dynamic pricing mechanism. For example, for successfully inserted split processes, a certain price discount can be provided to compensate for the possible inconvenience to customers and at the same time encourage more customers to accept flexible repair arrangements.

[0162] Generally speaking, this refined scheduling method based on the first time window and split processes greatly improves the efficiency and flexibility of the entire maintenance system. It can not only better handle urgent orders but also maximize the utilization rate of workstations while ensuring service quality.

[0163] Furthermore, in some of these embodiments, the step of screening out one or more first split maintenance times from the first split group such that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window includes:

[0164] Sending a second request instruction;

[0165] Receiving a second feedback instruction made according to the second request instruction;

[0166] When there is no specified information about split processes in the second feedback instruction, screening out one or more first split maintenance times from the first split group such that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window;

[0167] When the second feedback instruction has specified information about the splitting process, it is determined according to the specified information whether the corresponding first splitting maintenance time of the specified splitting process is not greater than the smallest first time window. If so, the specified splitting process is inserted before the second maintenance order corresponding to the smallest first time window.

[0168] Based on the above embodiments, the present application further optimizes the process of splitting process selection and insertion, introducing a more flexible and intelligent decision-making mechanism. This improvement not only enhances the adaptability of the system but also increases user participation, making the entire scheduling process more user-friendly and personalized.

[0169] Specifically, in the process of screening one or more first splitting maintenance times from the first splitting group, the system introduces the following steps:

[0170] First, the system sends a second request instruction. The purpose of this instruction is to obtain more user input or preferences, enabling the system to make decisions that better meet user needs. For example, the system may send a message to the user of the first maintenance order asking if they have any particularly prioritized repair items.

[0171] Next, the system receives a second feedback instruction made in response to the second request instruction. This feedback may come from the user or from the technicians in the repair shop, providing additional decision-making basis for the system.

[0172] The system then takes different actions according to the content of the second feedback instruction:

[0173] When there is no specified information about the splitting process in the second feedback instruction:

[0174] The system screens one or more first splitting maintenance times from the first splitting group in the manner described previously, such that their sum is less than the smallest first time window and is closest to this time window. In this case, the system makes decisions based on pure time efficiency.

[0175] For example, assume that the first splitting group includes the following processes: oil change (20 minutes), brake system inspection (25 minutes), and air filter replacement (15 minutes), and the smallest first time window is 35 minutes. The system will select the processes of oil change and air filter replacement because their total time (35 minutes) is closest to and does not exceed the available time window.

[0176] When the second feedback instruction has specified information about the splitting process:

[0177] The system will give priority to the processes specified by the user or technician. Specifically, the system will determine based on the specified information whether the first split maintenance time corresponding to the specified split process is not greater than the smallest first time window. If so, the system will insert the specified split process before the second maintenance order corresponding to the smallest first time window.

[0178] For example, if the user specifically emphasizes in the feedback that the brake system inspection (25 minutes) needs to be given priority, and the smallest first time window happens to be 30 minutes, then the system will arrange this work first, even though from the perspective of pure time efficiency, choosing other combinations might be more optimal.

[0179] By allowing users to participate in the decision-making process, the system can better meet personalized needs and improve user satisfaction. The system can adjust the scheduling strategy based on real-time feedback, making the whole process more flexible and dynamic. Although the system still pursues time efficiency, it also takes into account the importance or urgency of specific processes. Allowing technicians to participate in the decision-making process can ensure that key safety-related maintenance work is given priority. By precisely understanding user needs, the system can better allocate workstations and human resources.

[0180] In addition, through the above technical solution, the split processes specified by the user can be completed first, and part of the work of the first maintenance order can be completed on the basis of effectively using the first time window. In this way, even if the user needs to pick up the vehicle at the first demand delivery time, some of the most important maintenance processes can be guaranteed to be completed.

[0181] In addition, this method can be further extended and optimized. For example, the system can learn and record user preferences and automatically consider these factors in future scheduling. It can also combine vehicle usage data and maintenance history to proactively propose priority maintenance suggestions.

[0182] The system can also introduce more complex decision-making logic. For instance, when the process specified by the user cannot fully fit into the smallest first time window, the system can try to arrange this work in other larger time windows while arranging other suitable processes in the smallest first time window. This method can meet the specific needs of users while still maintaining a relatively high overall efficiency.

[0183] Furthermore, in some of these embodiments, the step of determining based on the specified information whether the first split maintenance time corresponding to the specified split process is not greater than the smallest first time window further includes:

[0184] If not, obtain the third maintenance order in other workstations with an estimated completion time earlier than the first demand delivery time, and obtain the corresponding second time window;

[0185] Determine whether the first split maintenance time corresponding to the specified split process is not greater than the smallest second time window. If so, insert the specified split process before the third maintenance order corresponding to the smallest second time window;

[0186] The step of determining whether the first split maintenance time corresponding to the specified split process is not greater than the smallest second time window further includes:

[0187] If not, obtain the second process split information of the second maintenance order sorted before the insertion position of the first maintenance order. The second process split information includes whether process splitting is allowed and, when process splitting is allowed, the second split maintenance time corresponding to each split process;

[0188] Obtain the corresponding second split maintenance time according to the second process split information;

[0189] According to the second demand delivery time and the second split maintenance time corresponding to the second maintenance order that can be process-split, determine whether the split process of the second maintenance order can be inserted between the third maintenance orders without affecting the delivery of the second and third maintenance orders. If so, perform the insertion operation; if not, perform the warning operation;

[0190] The method further includes:

[0191] Obtain the second updated delivery time of the first maintenance order after splitting the second maintenance order into processes and inserting the split processes of the second maintenance order after the third maintenance order;

[0192] When the second updated delivery time is earlier than the first demand delivery time, reduce the number of second maintenance orders for which process splitting is performed.

[0193] On the basis of the above embodiments, the present application further expands the scheduling ability of the system, introduces more comprehensive and flexible strategies to cope with more complex actual situations. This improvement not only enhances the system's ability to handle emergency orders, but also strengthens the optimization effect of the overall work process, enabling the repair shop to make more efficient use of all available resources.

[0194] Specifically, when the system encounters a situation where the specified split process cannot be arranged within the smallest first time window, the following steps will be taken:

[0195] First, the system will query the situations of other maintenance workstations by obtaining the third maintenance orders in other maintenance workstations with an estimated completion time earlier than the first demand delivery time and calculating the corresponding second time window. The purpose of this step is to find more possibilities and not be limited to the arrangements of a single workstation.

[0196] For example, assume that the original maintenance station cannot schedule a comprehensive brake system inspection that requires 45 minutes within 30 minutes. The system will check other stations and, for example, find that the tire replacement station has a 60-minute idle time window (the second time window) one hour later.

[0197] Next, the system will determine whether the first split maintenance time corresponding to the specified split process is not greater than the smallest second time window. If so, the system will insert the specified split process before the third maintenance order corresponding to the smallest second time window.

[0198] Continuing with the above example, since the 45-minute brake system inspection can be scheduled within the 60-minute time window, the system will choose to insert this task into the idle time of the tire replacement station.

[0199] However, if no suitable time window can be found even at other stations, the system will adopt a more innovative approach:

[0200] The system will obtain the second process split information of the second maintenance order before the insertion position of the first maintenance order. This information includes whether process splitting is allowed, and in the case of allowed splitting, the second split maintenance time corresponding to each split process.

[0201] The purpose of this step is to explore whether space can be created for the urgent work by adjusting the existing orders. For example, the system may find that a comprehensive maintenance order that originally requires 2 hours can be split into several smaller processes.

[0202] Then, the system will obtain the corresponding second split maintenance time according to the second process split information.

[0203] Next, the system will perform a complex judgment: based on the second required delivery time and the second split maintenance time of the second maintenance order corresponding to the process that can be split, determine whether the split process of the second maintenance order can be inserted between the third maintenance orders without affecting the delivery of the second and third maintenance orders.

[0204] If it can, the system will perform this insertion operation. If not, the system will perform a warning operation to remind the relevant personnel that manual intervention may be required.

[0205] Through cross-station scheduling and reorganization of existing orders, the system can make full use of all available time and resources. Even in seemingly space-less situations, the system can still find innovative solutions. The system is no longer limited to fixed work processes but can dynamically adjust and optimize the work arrangements of the entire repair shop. While pursuing efficiency, the system still ensures respect for the delivery times of existing orders. The system can independently perform complex decision-making processes, reducing the need for manual intervention.

[0206] In addition, this application also introduces an optimization mechanism:

[0207] The system will obtain the second updated delivery time of the first maintenance order after splitting the second maintenance order into processes and inserting the split processes into the third maintenance order.

[0208] When the second update delivery time is earlier than the first required delivery time, the system will reduce the number of second maintenance orders for process splitting. The purpose of this step is to meet urgent needs while minimizing interference with existing workflows.

[0209] For example, if the system finds that an urgent need can be met by splitting two existing orders, but splitting one order would actually be sufficient, it will choose to split only one order to reduce unnecessary complexity.

[0210] In general, this comprehensive and flexible scheduling method greatly improves the adaptability and efficiency of the entire maintenance system. It not only enables better handling of emergencies, but also optimizes the overall workflow while ensuring service quality. This innovative method reflects the advanced nature of the invention in the field of intelligent scheduling and provides a new paradigm for the intelligent and refined management of the automotive maintenance industry. In this way, repair shops can better balance efficiency, quality and customer satisfaction.

[0211] Second, refer to Figure 2 , the present application also proposes a vehicle maintenance intelligent dispatching device, comprising:

[0212] The first module 210 is used to obtain the first process splitting information of the first maintenance order after entering the queue-jumping mode, when the first updated delivery time for the first maintenance order recalculated is later than the first required delivery time because the newly added first maintenance order is allowed to jump in between the existing second maintenance orders of the target workstation, the first process splitting information includes whether process splitting is allowed and, when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process;

[0213] The second module 220 is used to adjust the maintenance order of the maintenance items of the second maintenance order that is sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type when the first process split information is to allow splitting;

[0214] The third module 230 is used to insert the split process of the first maintenance order into the second maintenance order according to the maintenance order, calculate the insertion estimated delivery time corresponding to the second maintenance order and the first maintenance order, and send a first request instruction when the insertion estimated delivery time is delayed;

[0215] The fourth module 240 is used to receive a first feedback instruction made according to a first request instruction, and schedule a first maintenance order according to the first feedback instruction.

[0216] After receiving a newly added first maintenance order, if the estimated completion time of the first maintenance order cannot meet the first required delivery time specified by the user, the first maintenance order will be given priority first, and at this time, the priority mode is entered. In the priority mode, it will be determined whether to allow the first maintenance order to be given priority according to the current existing second maintenance order at the target work station of the first maintenance order. That is, if the first maintenance order is given priority, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. Under this condition, the first maintenance order is given priority. After giving priority, the first updated delivery time of the first maintenance order will be recalculated. If the first updated delivery time is still later than the first required delivery time, at this time, it will be determined whether the first maintenance order allows splitting. That is, the first process splitting information of the first maintenance order is obtained. In the case of allowing splitting, the maintenance order of the maintenance items in the second maintenance order sorted before the insertion position of the first maintenance order will be adjusted according to the first split maintenance time and the first process type, and then the split process will be inserted between the second maintenance orders after the maintenance order is adjusted. In this way, the split process can be inserted between the second maintenance orders and connected with the relevant maintenance items, thereby improving efficiency. On this basis, the inserted estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If there is a delay, a first request instruction will be sent, and the scheduling operation of the first maintenance order will be determined according to the user's first feedback instruction. Therefore, when the first updated delivery time is later than the first required delivery time in this application, the maintenance order of the maintenance items in the second maintenance order is adjusted according to the first process type, and then the split process is inserted to connect the split process with the relevant maintenance items, thereby improving efficiency. Therefore, the solution of this application has the beneficial effects of high flexibility and improved efficiency.

[0217] In addition, in some preferred embodiments, a vehicle maintenance intelligent scheduling device proposed in this application can execute any one of the above method steps.

[0218] In a third aspect, referring to Figure 3 , this application also proposes an electronic device, including a processor 310 and a memory 320. The memory 320 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 310, the steps in the above method are run.

[0219] Through the above technical solution, the processor 310 and the memory 320 are interconnected and communicate with each other through a communication bus and / or other forms of connection mechanisms (not shown). The memory 320 stores computer-readable instructions executable by the processor 310. When the electronic device is running, the processor 310 executes the computer-readable instructions to execute the method in any optional implementation manner of the above embodiments to achieve the following functions: After entering the queue-jumping mode, when the newly added first maintenance order is recalculated due to being allowed to queue-jump between the existing second maintenance orders at the target work station, and the first updated delivery time for the first maintenance order is later than the first required delivery time, obtain the first process splitting information of the first maintenance order. The first process splitting information includes whether process splitting is allowed, and when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process; when the first process splitting information allows splitting, adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type; insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated insertion delivery time for the corresponding second maintenance order and the first maintenance order, and when the estimated insertion delivery time is delayed, send a first request instruction; receive a first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.

[0220] In a fourth aspect, the present application also proposes a storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above method are run.

[0221] Through the above technical solution, when the computer program is executed by a processor, the method in any optional implementation manner of the above embodiments is executed to achieve the following functions: After entering the queue-jumping mode, when the newly added first maintenance order is recalculated due to being allowed to queue-jump between the existing second maintenance orders at the target work station, and the first updated delivery time for the first maintenance order is later than the first required delivery time, obtain the first process splitting information of the first maintenance order. The first process splitting information includes whether process splitting is allowed, and when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process; when the first process splitting information allows splitting, adjust the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type; insert the split processes of the first maintenance order into the second maintenance order according to the maintenance order, calculate the estimated insertion delivery time for the corresponding second maintenance order and the first maintenance order, and when the estimated insertion delivery time is delayed, send a first request instruction; receive a first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.

[0222] Among them, the computer-readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM for short), electrically erasable programmable read-only memory (EEPROM for short), erasable programmable read-only memory (EPROM for short), programmable read-only memory (PROM for short), read-only memory (ROM for short), magnetic memory, flash memory, magnetic disk or optical disk.

[0223] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For another example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections with each other can be through some communication interfaces, and the indirect couplings or communication connections of the devices or units can be in electrical, mechanical or other forms.

[0224] In addition, the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units. They can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0225] Furthermore, in each embodiment of the present application, the various functional modules can be integrated together to form an independent part, or each module can exist alone, or two or more modules can be integrated to form an independent part.

[0226] The above are only the embodiments of the present application and are not used to limit the protection scope of the present application. For those skilled in the art, the present application can have various changes and modifications. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A vehicle maintenance intelligent scheduling method, characterized in that: include: After entering the queue-jumping mode, when the first updated delivery time of the newly added first maintenance order is recalculated to be later than the first required delivery time because the first maintenance order is allowed to jump the queue between the existing second maintenance orders of the target workstation, the first process splitting information of the first maintenance order is obtained, and the first process splitting information includes whether process splitting is allowed and, when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process; When the first process splitting information indicates that splitting is allowed, adjusting the maintenance order of the maintenance items of the second maintenance order that is sorted before the insertion position of the first maintenance order according to the first splitting maintenance time and the first process type; Inserting the splitting process of the first maintenance order into the second maintenance order according to the maintenance order, calculating the insertion estimated delivery time corresponding to the second maintenance order and the first maintenance order, and sending a first request instruction when the insertion estimated delivery time is delayed; receiving a first feedback instruction made according to the first request instruction, and scheduling the first maintenance order according to the first feedback instruction; The step of adjusting the maintenance order of the maintenance items of the second maintenance order that is sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type comprises: Obtain a first time window corresponding to each second maintenance order, where the first time window is the difference between the estimated completion time of the second maintenance order and the corresponding required completion time; Obtaining the maintenance items included in each of the second maintenance orders; When the first split maintenance time is less than or equal to the first time window, the maintenance items included in the second maintenance order and related to the first process type are sorted first; When the first split maintenance time is greater than the first time window, the maintenance items included in the second maintenance order and related to the first process type are sorted later; The step of inserting the splitting process of the first maintenance order into the second maintenance order according to the maintenance sequence includes: Obtaining the maintenance items at the beginning and end of the second maintenance order after the maintenance sequence has been adjusted; When the type of the second maintenance order after adjustment is the first maintenance item related to the split process type, the corresponding split process is inserted before the corresponding second maintenance order; When the type of the second maintenance order after adjustment is at the end of the corresponding maintenance item related to the split process type, insert the corresponding split process after the corresponding second maintenance order; The step of receiving a first feedback instruction made according to the first request instruction, and scheduling the first maintenance order according to the first feedback instruction includes: When the first feedback instruction is sent by the user corresponding to the first maintenance order, if the first feedback instruction is agreed, the first maintenance order is scheduled; if the first feedback instruction is disagreed, the scheduling of the first maintenance order is stopped; When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is agreed, the first maintenance order is scheduled according to the plan; if the first feedback instruction is disagreed, an insertion position is selected for each split process according to the first split maintenance time and the first time window, so as to schedule the first maintenance order; When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is disagreement, the step of selecting an insertion position for each split process according to the first split maintenance time and the first time window includes: According to the smallest first time window, the first split maintenance time that is smaller than the first time window is screened out to obtain a first split group; Filtering one or more first split maintenance times from the first split group so that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window; Insert the screened splitting processes corresponding to one or more of the first splitting maintenance times before the second maintenance order corresponding to the smallest first time window.

2. A vehicle maintenance intelligent scheduling method according to claim 1, characterized in that: The method further includes: Obtaining two maintenance items adjacent to the first and last of the second maintenance order after the maintenance sequence is adjusted; When the two maintenance items at the beginning and the end of the adjacent second maintenance orders are both related to the first process type, inserting the corresponding split process between the two adjacent second maintenance orders; The method further includes: When there are different maintenance items of the second maintenance orders that are related to the first process type and are at the first or last time at the same time, select the second maintenance order with the larger first time window; when the corresponding maintenance item is at the first time, insert the corresponding split process before the corresponding second maintenance order; when the corresponding maintenance item is at the last time, insert the corresponding split process after the corresponding second maintenance order.

3. A vehicle maintenance intelligent scheduling method according to claim 2, characterized in that: The step of selecting one or more first split maintenance times from the first split group so that the sum of the one or more first split maintenance times is less than the minimum first time window and is closest to the minimum first time window includes: Sending a second request instruction; receiving a second feedback instruction made according to the second request instruction; When the second feedback instruction does not contain designated information about the splitting process, one or more first splitting maintenance times are selected from the first splitting group, so that the sum of the one or more first splitting maintenance times is less than the minimum first time window and is closest to the minimum first time window; When the second feedback instruction has the specified information about the splitting process, it is determined according to the specified information whether the first splitting maintenance time corresponding to the specified splitting process is not greater than the minimum first time window; if so, the specified splitting process is inserted before the second maintenance order corresponding to the minimum first time window.

4. A vehicle maintenance intelligent scheduling method according to claim 3, characterized in that: The step of judging whether the first splitting maintenance time corresponding to the designated splitting process is not greater than the minimum first time window according to the designated information further includes: If not, obtain a third guarantee order from other workstations whose estimated completion time is earlier than the first required delivery time, and obtain the corresponding second time window; Determine whether the first split maintenance time corresponding to the specified split process is not greater than the minimum second time window, and if so, insert the specified split process before the third maintenance order corresponding to the minimum second time window; The step of determining whether the first splitting maintenance time corresponding to the designated splitting process is not greater than the minimum second time window further includes: If not, obtain the second process splitting information of the second maintenance order sorted before the insertion position of the first maintenance order, where the second process splitting information includes whether process splitting is allowed and, when process splitting is allowed, the second split maintenance time corresponding to each split process; Obtaining a corresponding second split maintenance time according to the second process split information; According to the second required delivery time corresponding to the second maintenance order that can be split into process steps and the second split maintenance time, determine whether the split process of the second maintenance order can be inserted between the third maintenance order without affecting the delivery of the second maintenance order and the third maintenance order; if yes, perform the insertion operation; if no, perform the warning operation; The method further includes: Obtaining a second updated delivery time of the first maintenance order after splitting the second maintenance order into processes so that the split processes of the second maintenance order are inserted into the third maintenance order; When the second updated delivery time is earlier than the first required delivery time, the number of the second maintenance orders for process splitting is reduced.

5. A vehicle maintenance intelligent dispatching device, characterized in that: include: The first module is used to obtain the first process splitting information of the newly added first maintenance order after entering the queue-jumping mode, when the first updated delivery time for the first maintenance order recalculated is later than the first required delivery time because the first maintenance order is allowed to jump in the queue between the existing second maintenance orders of the target workstation, the first process splitting information including whether process splitting is allowed and, when process splitting is allowed, the first split maintenance time corresponding to each split process and the first process type of the split process; The second module is used for adjusting the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type when the first process split information allows splitting; The third module is used to insert the splitting process of the first maintenance order into the second maintenance order according to the maintenance order, calculate the insertion estimated delivery time corresponding to the second maintenance order and the first maintenance order, and send a first request instruction when the insertion estimated delivery time is delayed; A fourth module is used to receive a first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction; The step of adjusting the maintenance order of the maintenance items of the second maintenance order that is sorted before the insertion position of the first maintenance order according to the first split maintenance time and the first process type comprises: Obtain a first time window corresponding to each second maintenance order, where the first time window is the difference between the estimated completion time of the second maintenance order and the corresponding required completion time; Obtaining the maintenance items included in each of the second maintenance orders; When the first split maintenance time is less than or equal to the first time window, the maintenance items included in the second maintenance order and related to the first process type are sorted first; When the first split maintenance time is greater than the first time window, the maintenance items included in the second maintenance order and related to the first process type are sorted later; The step of inserting the splitting process of the first maintenance order into the second maintenance order according to the maintenance sequence includes: Obtaining the maintenance items at the beginning and end of the second maintenance order after the maintenance sequence has been adjusted; When the type of the second maintenance order after adjustment is the first maintenance item related to the split process type, the corresponding split process is inserted before the corresponding second maintenance order; When the type of the second maintenance order after adjustment is at the end of the corresponding maintenance item related to the split process type, insert the corresponding split process after the corresponding second maintenance order; The step of receiving a first feedback instruction made according to the first request instruction, and scheduling the first maintenance order according to the first feedback instruction includes: When the first feedback instruction is sent by the user corresponding to the first maintenance order, if the first feedback instruction is agreed, the first maintenance order is scheduled; if the first feedback instruction is disagreed, the scheduling of the first maintenance order is stopped; When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is agreed, the first maintenance order is scheduled according to the plan; if the first feedback instruction is disagreed, an insertion position is selected for each split process according to the first split maintenance time and the first time window, so as to schedule the first maintenance order; When the first feedback instruction is sent by the user corresponding to the second maintenance order, if the first feedback instruction is disagreement, the step of selecting an insertion position for each split process according to the first split maintenance time and the first time window includes: According to the smallest first time window, the first split maintenance time that is smaller than the first time window is screened out to obtain a first split group; Filtering one or more first split maintenance times from the first split group so that the sum of the one or more first split maintenance times is less than the smallest first time window and is closest to the smallest first time window; Insert the screened splitting processes corresponding to one or more of the first splitting maintenance times before the second maintenance order corresponding to the smallest first time window.

6. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the method according to any one of claims 1 to 4 are executed.

7. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are executed.

Images