Vehicle maintenance intelligent scheduling method and device, electronic equipment and storage medium
By obtaining process split information and adjusting maintenance order in vehicle maintenance scheduling, the problem of poor scheduling flexibility in the prior art is solved, more efficient delivery time management is achieved, and maintenance efficiency and user satisfaction are improved.
Patent Information
- Application Number
- CN202411541190.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-31
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-10-31
AI Technical Summary
When facing maintenance orders with delivery time requirements, the existing vehicle maintenance scheduling methods have poor scheduling flexibility and limited room for efficiency improvement, and fail to make full use of the resources of the maintenance workshop.
By obtaining process split information in line mode, adjusting maintenance order and inserting position, inserting the split process between existing orders, optimizing delivery time, sending request instructions and scheduling based on feedback to meet user needs.
It improves the flexibility and efficiency of vehicle maintenance and scheduling, can better meet users' delivery time requirements, reduce users' waiting time, and improve order transaction success rate.
Smart Images

Figure CN119047803A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of vehicle maintenance and scheduling, and in particular to a method, device, electronic device and storage medium for intelligent scheduling of vehicle maintenance and scheduling. Background Art
[0002] With the rapid growth of car ownership and the increasing demand for vehicle maintenance service quality, the vehicle maintenance industry is facing increasingly severe challenges. Traditional maintenance scheduling methods mainly rely on manual experience and a simple first-come, first-served principle, which often seem incapable of meeting complex and changing maintenance needs.
[0003] In the prior art, there have been some attempts to introduce intelligent means to improve vehicle maintenance scheduling. For example, Chinese patent application CN113326954A discloses a vehicle maintenance task scheduling method, which also includes: based on vehicle damage image recognition technology, damage part detection and processing are performed on the environmental inspection photos of the vehicle to be repaired to generate a vehicle damage list; damage data is extracted from the vehicle damage part pictures through a preset replacement and repair data model, and the damaged parts are marked with replacement and repair items according to the damage data to generate a work item list; maintenance items are extracted from the work item list to form a maintenance list; maintenance time evaluation is performed on the vehicle damage part pictures in the maintenance list through a preset maintenance time evaluation model to obtain a maintenance task list; based on the current task list and maintenance task list of the maintenance station, a task update list of the maintenance station is generated according to the preset maintenance task scheduling rules.
[0004] Specifically, the prior art obtains a maintenance task list by sorting the vehicle codes in the batch maintenance task list according to the maintenance time from long to short, and obtains a maintenance station list by sorting the time required to complete the current task list of the maintenance station from short to long, and assigns the vehicle codes in the maintenance task list to the maintenance station list from front to back in sequence, generates a task update list for the maintenance station, and thereby realizes the scheduling of maintenance tasks for different vehicles.
[0005] However, this solution mainly focuses on shortening the maintenance time, and does not consider the delivery of each maintenance order. Because in actual practice, when users perform maintenance on their vehicles, there will be requirements for picking up the vehicles, but the above-mentioned existing scheduling methods do not consider this factor.
[0006] Usually, when faced with a maintenance order with a delivery time requirement, 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 needs, the existing maintenance order will be scheduled to see if the new maintenance order can be queued to the existing maintenance order. If the user's needs are still not met after queueing, the user will be clearly informed that delivery cannot be made within the specified time. The existing scheduling method has poor scheduling 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 the present application is to provide a vehicle maintenance intelligent scheduling method, device, electronic device and storage medium, which have the advantages of high flexibility and improved efficiency.
[0009] In a first aspect, the present application provides a vehicle maintenance intelligent scheduling method, comprising: 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; A first feedback instruction made according to the first request instruction is received, and the first maintenance order is scheduled according to the first feedback instruction.
[0010] After receiving the 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 queued first, and the queue-jumping mode will be entered at this time. In the queue-jumping mode, it will be determined whether the first maintenance order is allowed to be queued based on the second maintenance order currently existing at the target workstation of the first maintenance order. That is, if the first maintenance order is queued, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. When this condition is met, the first maintenance order will be queued. After the queue is jumped, 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, it will be determined whether the first maintenance order is allowed to be split, that is, the first process splitting information of the first maintenance order is obtained. If splitting is allowed, it will be split based on the first split maintenance time and the first process type. To adjust the maintenance order of the maintenance items in the second maintenance order that is sorted before the insertion position of the first maintenance order, and then insert the split process 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 estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If a delay occurs, a first request instruction is sent, and the scheduling operation of the first maintenance order is determined according to the user's first feedback instruction. Therefore, when the first updated delivery time is later than the first required delivery time, the present application adjusts the maintenance order of the maintenance items in the second maintenance order through the first process type, and then inserts the split process to connect the split process with the relevant maintenance items to improve efficiency. Therefore, the scheme of the present application has the beneficial effects of high flexibility and improved efficiency.
[0011] Further, in the present application, 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 includes: 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 related to the first process type included in the second maintenance order are sorted at the end.
[0012] Further, in the present application, 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 corresponding maintenance item is at the first, insert the corresponding splitting process before the corresponding second maintenance order; When the corresponding maintenance item is at the end, insert the corresponding splitting process after the corresponding second maintenance order; 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.
[0013] Further, in the present application, 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 for agreement, the first maintenance order is scheduled; if the first feedback instruction is for disagreement, an insertion position is selected for each split process according to the first split maintenance time and the first time window, thereby scheduling the first maintenance order.
[0014] Further, in the present application, the step of selecting an insertion position for each splitting process according to the first splitting 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.
[0015] Further, in the present application, 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.
[0016] Further, in the present application, the step of determining 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.
[0017] In the second aspect, the present application also proposes a vehicle maintenance intelligent scheduling device, comprising: 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; 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.
[0018] In a third aspect, the present application further proposes an electronic device, comprising a processor and a memory, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the above method are executed.
[0019] In a fourth aspect, the present application further proposes a storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps in the above method are executed.
[0020] As can be seen from the above, the present application provides a vehicle maintenance intelligent scheduling method, device, electronic device and storage medium. 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 queued first, and the queue-jumping mode will be entered at this time. In the queue-jumping mode, it will be determined whether the first maintenance order is allowed to be queued based on the second maintenance order currently existing at the target workstation of the first maintenance order. That is, if the first maintenance order is queued, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. When this condition is met, the first maintenance order will be queued. After the queue is jumped, 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, it will be determined whether the first maintenance order is allowed to be split, that is, the first process splitting information of the first maintenance order is obtained. If splitting is allowed, The maintenance order of the maintenance items in the second maintenance order that is 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 related maintenance items, thereby improving efficiency. On this basis, the estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If a delay occurs, a first request instruction is sent, and the scheduling operation of the first maintenance order is determined according to the user's first feedback instruction. Therefore, when the first updated delivery time is later than the first required delivery time, the present application adjusts the maintenance order of the maintenance items in the second maintenance order through the first process type, and then inserts the split process to connect the split process with related maintenance items to improve efficiency. Therefore, the solution of the present application has the beneficial effects of high flexibility and improved efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] Figure 1 A flow chart of a vehicle maintenance intelligent scheduling method provided in this application.
[0022] Figure 2 A schematic diagram of the structure of a vehicle maintenance intelligent scheduling device provided in this application.
[0023] Figure 3 A schematic diagram of the structure of an electronic device provided in this application.
[0024] In the figure: 210, first module; 220, second module; 230, third module; 240, fourth module; 310, processor; 320, memory. DETAILED DESCRIPTION
[0025] The technical solutions in the present application will be clearly and completely described below in conjunction with the 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 generally described and shown in the 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 drawings is not intended to limit the scope of the present application for protection, but merely represents the selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.
[0026] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so 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 this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.
[0027] With the rapid development of the automobile industry and the continuous growth of vehicle ownership, vehicle maintenance services are facing unprecedented challenges and opportunities. On the one hand, users have higher requirements for the quality and efficiency of maintenance services; on the other hand, maintenance workshops need to handle the growing maintenance needs more flexibly and efficiently under limited resource conditions. In this context, how to optimize maintenance scheduling, improve resource utilization, and meet the diverse needs of customers has become a key issue facing the industry.
[0028] Traditional maintenance scheduling methods mainly rely on manual experience and a simple first-come, first-served principle. This method is difficult to effectively handle urgent orders in the face of the complex and ever-changing modern maintenance environment, and it is also unable to fully utilize the resources of the maintenance workshop, often resulting in inefficiency and customer dissatisfaction.
[0029] In recent years, with the development of information technology and artificial intelligence, intelligent scheduling systems have begun to emerge in the vehicle maintenance industry. These systems attempt to improve scheduling effects through data analysis and algorithm optimization. However, existing intelligent scheduling solutions are often too rigid and difficult to adapt to various variables and special circumstances in the actual maintenance process. In particular, there are still obvious deficiencies in handling emergency orders and making full use of fragmented time.
[0030] The present invention aims at the above problems and proposes an innovative vehicle maintenance intelligent scheduling method. The core of the method is to maximize the use of existing time resources to advance the delivery of new orders while trying to meet the delivery needs of existing orders through flexible process splitting and dynamic insertion strategies.
[0031] For details, please refer to Figure 1 The present application provides a vehicle maintenance intelligent scheduling method, comprising: S110. After entering the queue-jumping mode, when the first updated delivery time for the newly added first maintenance order 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 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; S120: When the splitting information of the first process is to allow splitting, the maintenance order of the maintenance items of the second maintenance order that is sorted before the insertion position of the first maintenance order is adjusted according to the first splitting maintenance time and the first process type; S130, inserting the split 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; S140: Receive a first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.
[0032] Among them, the method proposed in the present application can be implemented by relying on a set of intelligent systems, which include a server for data processing, a data collection terminal for receiving data, and an output terminal for outputting processing results.
[0033] Among them, queue-jumping mode is a special operating state of the system, which is usually triggered when the first maintenance order that needs to be processed first is received. 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 it can be set to be automatically triggered when certain conditions are met.
[0034] Among them, the first maintenance order refers to a new maintenance order that needs to be inserted into the scheduling plan, which is usually an urgent or high-priority order.
[0035] The target station refers to the specific workstation or area selected by the system for the first maintenance order to perform maintenance work. In a complex repair shop, there are usually multiple maintenance stations, each of which may specialize in a specific type of maintenance task or have specific equipment.
[0036] In vehicle maintenance, in order to make the division of labor more refined, different maintenance stations can be set up for different maintenance tasks or different vehicle models. A maintenance station may handle the maintenance tasks of a specific vehicle model, or handle one or more highly related maintenance tasks. It is worth noting that the maintenance station can also perform other tasks besides the initially divided tasks, that is, different maintenance stations are interchangeable in some cases. In other words, a maintenance station can also perform the maintenance tasks of other maintenance stations under certain conditions.
[0037] Among them, the second maintenance order refers to the existing maintenance order that is already in the scheduling plan.
[0038] The first updated delivery time refers to the estimated completion time of the first maintenance order that is recalculated after the system attempts to insert the first maintenance order into the existing scheduling plan.
[0039] Among them, the first required delivery time refers to the time when the customer requires the first maintenance order to be completed.
[0040] 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.
[0041] Among them, the split process refers to breaking down a complete maintenance order into multiple relatively independent subtasks or processes.
[0042] The insertion position refers to the time point or position where the system plans to insert the first maintenance order.
[0043] Among them, maintenance items refer to the tasks included in the second maintenance order. For example, for a second maintenance order, it may include engine oil change, oil filter change, air filter inspection or replacement, fuel filter inspection or replacement, brake fluid inspection or replacement, coolant inspection or replacement, transmission oil inspection or replacement. These maintenance items belong to maintenance and are usually carried out at a maintenance station. That is, the split processes in the first maintenance order can also be regarded as maintenance items.
[0044] In vehicle maintenance, when 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, you can try to arrange to jump the queue based on the user's priority. The general practice is to determine whether to allow jumping the queue while ensuring that existing orders will not be delayed. If it is determined that jumping the queue is not possible, the user will be informed that the delivery cannot be completed within the specified delivery time. If jumping the queue is possible, the first updated delivery time after jumping the queue 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. If the first updated delivery time is later than the first required delivery time, the user will be informed that the delivery cannot be completed within the specified delivery time. It is then up to the user to decide whether to perform maintenance or cancel the order according to the jumping-in position.
[0045] In the above actual production scenario, the first update 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 multiple maintenance items. Different maintenance items may require different maintenance and repair tools, or even different maintenance staff. The traditional practice is usually to use the entire vehicle as the maintenance unit, that is, only after completing all maintenance items of the entire vehicle will the next vehicle be maintained. In this process, it is easy for the maintenance items of the front and rear vehicles to be mismatched, resulting in unreasonable arrangement of maintenance and repair tools and maintenance staff, thereby requiring more maintenance time. That is, if the last maintenance item of the preceding vehicle is the same as the first maintenance item of the succeeding vehicle, the scheduling time of maintenance and repair tools and maintenance staff can be reduced, thereby improving efficiency.
[0046] In this regard, the present application proposes obtaining the first process splitting information of the first maintenance order after the first maintenance order is entirely queued and the first updated delivery time is later than the first required delivery time, and determining whether the first maintenance order can be process split; when the process splitting can be performed, adjusting the maintenance order of the maintenance items in 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.
[0047] That is, when the first updated delivery time is later than the first required delivery time, the first maintenance order is split and the order of the maintenance items of the specific second maintenance order is adjusted, and then the splitting process is inserted so that the inserted splitting process can be connected with the previous second maintenance order or the subsequent second maintenance order, thereby improving maintenance efficiency.
[0048] For example, there are at least two second maintenance orders for the target workstation, namely order A and order B, where 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 splitting process of order C is (d, e, f). After the insertion of order C, the first updated delivery time is still later than the first required delivery time, and order A and order B are before the insertion position of order C. At this time, the maintenance order of the maintenance items of order A and order B is adjusted according to the first process type of the splitting process. The original default maintenance order is A (a→b→d) and B (c→d→e), that is, maintenance is performed in the order of Aa→Ab→Ad→Bc→Bd→Be→Cd→Ce→Cf. The order after adjustment may be A (a→b→d) and B (d→c→e). At this time, the split process d of order C is inserted between order A and order B, and the split process e and split process f are arranged in sequence after order B, that is, maintenance is performed 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, all adjacent tasks are not connected, which results in the need to call the corresponding maintenance and repair tools or even maintenance staff to execute each task. This method leads to low maintenance efficiency. When estimating the completion time, it is usually estimated for each order separately and then added up.
[0049] In the order of Aa→Ab→Ad→Cd→Bd→Bc→Be→Ce→Cf, it can be found that the three tasks Ad→Cd→Bd are the same type of tasks, and the two tasks Be→Ce are the same type of tasks. Since the tasks between different orders can be connected with each other, the scheduling of corresponding maintenance and repair tools and even maintenance personnel is reduced, thereby improving the maintenance efficiency.
[0050] In some embodiments, the order of maintenance items in the second maintenance order can be adjusted in advance so that they can be connected front and back, thereby improving maintenance efficiency. Taking the above embodiment as an example, the original default maintenance order is A (a→b→d) and B (c→d→e), which can be changed to A (a→b→d) and B (d→c→e) after adjustment. This method can improve efficiency to a certain extent in advance, but it has limitations, that is, it is possible that there are no connected maintenance items between the original second maintenance orders.
[0051] For example, the original maintenance items of order A are (a, b, d), and the maintenance items of order B are (c, e, f). At this time, it is impossible to improve efficiency by adjusting the maintenance order in advance. In this case, if the splitting process of order c is (d, e, f), the maintenance order of the maintenance items of order B can be adjusted to (e→c→f). Then, the splitting process d and the splitting process e are inserted between order A and order B, and the splitting process f is placed after order B. That is, the original order is Aa→Ab→Ad→Bc→Be→Bf→Cd→C e→Cf. At this time, all adjacent tasks are not connected. After adjustment, they are maintained in the order of Aa→Ab→Ad→Cd→Ce→Be→Bc→Bf→Cf. It can be found that the two tasks Ad→Cd are the same type of tasks, the two tasks Ce→Be are the same type of tasks, and the two tasks Bf→Cf are the same type of tasks. Since the tasks between different orders can be connected with each other, the scheduling of corresponding maintenance and repair tools and even maintenance staff is reduced, thereby improving the maintenance efficiency.
[0052] Specifically, the method provided in the present application can be implemented based on a multi-layered lift for automobile repair that can be lifted. The lift for automobile repair can usually be used to lift the automobile during maintenance to check the chassis and facilitate disassembly. By setting up a multi-layer structure, the insertion of the splitting process of the first maintenance order can be facilitated. For example, taking some of the above-mentioned embodiments as an example, after completing the maintenance of order A, the vehicle corresponding to order C is driven into a multi-layered lift for automobile repair that can be lifted for maintenance of the splitting process. After completing the maintenance of a specific splitting process, the vehicle corresponding to order C is lifted by the automobile repair lift, and then the vehicle corresponding to order B is driven into the remaining layers of the automobile repair lift to perform maintenance of order B. This method can quickly perform maintenance operations on different vehicles at one workstation, thereby improving efficiency.
[0053] It is worth noting that in the scheme of the present application, its purpose is to improve the maintenance efficiency as much as possible, so as to reduce the timeout waiting time required by the user corresponding to the first maintenance order, thereby improving the order transaction success rate. On this basis, the efficiency can be effectively improved by splitting the process, adjusting the maintenance order of the maintenance items, and inserting the split process, so that the first maintenance order can be advanced as much as possible. In this process, the insertion of the split process will cause the completion time of the second maintenance order that is interrupted to be delayed. At this time, it is necessary to consider whether the delay in the completion time of the second maintenance order will cause the second maintenance order to time out. Usually, each second maintenance order has an estimated completion time and a corresponding required completion time. The difference between the two is the first time window. The first time window represents the time margin that can be inserted. The insertion of tasks exceeding the first time window may cause the second maintenance order to time out. Therefore, in some preferred implementations, it is also necessary to adjust the maintenance order and insert the split process according to the first split maintenance time.
[0054] For example, the existing second maintenance order includes at least order A, order B, order D and order E arranged in sequence, wherein 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, which is the first maintenance order, can be inserted between order A and order B, and can also be inserted between order D and order E, then it can be selected according to the first split maintenance time corresponding to the split process to specifically adjust the maintenance sequence of order A and / or order B, or to adjust the maintenance sequence of order D and / or order E. Inserting the split process between order A and order B will adjust the maintenance sequence of order A and / or order B, and inserting the split process between order D and order E will adjust 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 it is preferentially inserted in the order position corresponding to the positive and large difference. The positive difference indicates that the first time window is greater than the corresponding first split maintenance time.
[0055] Since the split process is queued, the estimated delivery time needs to be recalculated and inserted. If the first maintenance order or the second maintenance order is delayed, a first request instruction is sent. The first request instruction can be specifically 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.
[0056] In summary, in the scheme of the present application, after receiving the 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 queued first, and the queue-jumping mode will be entered at this time. In the queue-jumping mode, it will be determined whether the first maintenance order is allowed to be queued based on the second maintenance order currently existing at the target workstation of the first maintenance order. That is, if the first maintenance order is queued, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. When this condition is met, the first maintenance order will be queued. After queue-jumping, 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 is allowed to be split, that is, the first process splitting information of the first maintenance order is obtained. If splitting is allowed, the split maintenance time and the first process splitting maintenance time will be calculated. The first process type is used to adjust the maintenance order of the maintenance items in the second maintenance order that is sorted before the insertion position of the first maintenance order, and then the split process is 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 estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If a delay occurs, a first request instruction is sent, and the scheduling operation of the first maintenance order is determined according to the user's first feedback instruction. Therefore, when the first updated delivery time is later than the first required delivery time, the present application uses the first process type to adjust the maintenance order of the maintenance items in the second maintenance order, and then inserts the split process to connect the split process with the relevant maintenance items to improve efficiency. Therefore, the solution of the present application has the beneficial effects of high flexibility and improved efficiency.
[0057] Further, in some embodiments, 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 includes: 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; Get the maintenance items included in each second maintenance order; 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 related to the first process type in the maintenance items included in the second maintenance order are sorted at the end.
[0058] In some of the above-mentioned 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 queue up the split process. In this process, efficiency improvement can be given the highest priority. When efficiency improvement is given 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 split processes. This method has the greatest overall efficiency improvement effect. However, this method may cause delays in some second maintenance orders. Therefore, in other embodiments, it is proposed to ensure the delivery of the second maintenance order as the highest priority.
[0059] Specifically, when ensuring the delivery of the second maintenance order is the highest priority, the strategy for adjusting the maintenance sequence of the maintenance items in the second maintenance order is to adjust according to the first split maintenance time and the first time window.
[0060] 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 first. This is because if the first split maintenance time is less than or equal to the first time window, inserting the corresponding split process before the corresponding second maintenance order will not affect the delivery of the second maintenance order. The corresponding split process can be inserted before the corresponding second maintenance order. Therefore, the relevant maintenance items need to be sorted first and connected with the split process.
[0061] For example, the existing second maintenance order includes at least Order A, and the maintenance items of Order A include (a, b, d). The first maintenance order is Order C, and the splitting processes of Order C are (b, e, f). If Order A is ranked before Order C, since the splitting 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 splitting maintenance time of the splitting process b can be obtained. Assuming that the first time window of Order A is T1, and the first splitting maintenance time of the splitting process b is T2, if T2 is less than or equal to T1, the maintenance item b in Order A is ranked first, which can be specifically (b→a→d). At this time, the splitting process b can be inserted before Order A.
[0062] If T2 is greater than T1, the maintenance item b in order A will be sorted later, specifically (a→d→b). At this time, the split process b can be inserted after order A.
[0063] Through the above solution, the delay of the second maintenance order caused by the splitting process can be avoided.
[0064] Specifically, the step of inserting the splitting process of the first maintenance order into the second maintenance order according to the maintenance order includes: Obtain the maintenance items at the beginning and end of the second maintenance order after the maintenance sequence has been adjusted; When the corresponding maintenance item is first, the corresponding splitting process is inserted before the corresponding second maintenance order; When the corresponding maintenance item is at the end, the corresponding split process is inserted after the corresponding second maintenance order; The method further includes: Get the first and last two maintenance items of the second adjacent maintenance order after the maintenance order is adjusted; When the first and last two maintenance items of the adjacent second maintenance orders are both related to the first process type, the corresponding split process is inserted between the two adjacent second maintenance orders; The method further includes: When there are different second maintenance orders whose maintenance items 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.
[0065] In the solution of this application, in addition to considering a single second maintenance order, the insertion strategy between adjacent orders is further optimized: The system will obtain the first and last two maintenance items of the second adjacent maintenance order after adjustment. The purpose of this step is to identify possible cross-order continuity opportunities.
[0066] When the two maintenance items at the beginning and end of the adjacent second maintenance orders are both related to the first process type, the corresponding split process is inserted between the two adjacent second maintenance orders. This arrangement can maximize the continuity of the maintenance items and further improve efficiency.
[0067] For example, if the last item of order A, which is the second maintenance order, is c, and the first item of order B, which is the second maintenance order, is c, and the first maintenance order has a split process related to c, then the system will choose to insert this split process between order A and order B. This will form an efficient maintenance sequence: order A → split process c → order B.
[0068] In addition, this application also considers a more complex situation, that is, the decision strategy when multiple second maintenance orders may be suitable for insertion: When there are different second maintenance orders with maintenance items related to the first process type and at the beginning or at the end at the same time, the second maintenance order with a larger first time window is selected. A larger first time window means that the order has more flexibility to accommodate the inserted split process.
[0069] The specific operation is: when the corresponding maintenance item is at the first, insert the corresponding split process before the corresponding second maintenance order; when the corresponding maintenance item is at the last, insert the corresponding split process after the corresponding second maintenance order.
[0070] For example, suppose that both order A and order B, which are the second maintenance orders, have maintenance items related to split operation x in the first place, and the first time window of order A is 30 minutes, and that of order B is 20 minutes. In this case, the system will choose to insert split operation x before order A because order A has a larger time buffer to accommodate this insertion.
[0071] Through this refined insertion strategy, this application not only ensures the efficient continuity of maintenance work, but also maximizes the use of the time window of each order, thereby minimizing the impact on the delivery time of existing orders while improving the overall maintenance efficiency. This balanced strategy not only meets the urgent needs of new orders, but also protects the interests of existing orders.
[0072] Further, in some of the embodiments, 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 not agreed, 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 for agreement, the first maintenance order is scheduled; if the first feedback instruction is for disagreement, an insertion position is selected for each split process according to the first split maintenance time and the first time window, thereby scheduling the first maintenance order.
[0073] On the basis of the above embodiments, this application further improves the feedback mechanism of the dispatching system to better balance the interests of new orders and existing orders and improve overall customer satisfaction. This mechanism not only takes into account the improvement of maintenance efficiency, but also fully considers the needs and wishes of different users, making the entire dispatching process more flexible and humane.
[0074] 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: When the first feedback instruction is sent by the user corresponding to the first maintenance order: If the first feedback instruction is "agree", the system will schedule the first maintenance order according to the previously calculated insertion plan, which indicates that the user of the newly added first maintenance order has accepted the queue insertion arrangement proposed by the system.
[0075] If the first feedback instruction is "disagree", the system will stop scheduling the first maintenance order. In this case, the system may provide the user with other options, such as delaying the delivery time or transferring to another maintenance point.
[0076] For example, suppose the system proposes a queue-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 time. If the user agrees to this plan, the system will execute the scheduling plan. If the user disagrees (perhaps because the advance time is not ideal), the system will cancel the queue-jumping arrangement and may suggest that the user consider other options.
[0077] When the first feedback instruction is sent by the user corresponding to the second maintenance order: If the first feedback instruction is "agree", the system will schedule the first maintenance order according to the plan, which indicates that the user of the order that was interrupted understands and accepts this arrangement.
[0078] If the first feedback instruction is "disagree", the system will not simply give up the scheduling, but will adopt a more flexible strategy. Specifically, the system will select a new insertion position for each split process based on the first split maintenance time and the first time window, thereby scheduling the first maintenance order.
[0079] This flexible approach reflects the system's intelligence in balancing the needs of different users. For example, suppose the system originally planned to insert a split process of an engine inspection (belonging to the first maintenance order) before a regular maintenance order (the second maintenance order). If this queue-jumping method causes a delay in the second maintenance order and the corresponding user disagrees with this arrangement, the system will not completely give up the scheduling, but will try to find other suitable insertion locations.
[0080] The system can check the time windows of other secondary maintenance orders to see if it is possible to insert a split operation without affecting those orders. For example, the system may find that there is enough time window between two tire replacement orders to insert an engine inspection operation without significantly delaying any existing orders and providing the necessary time for the urgent order.
[0081] This dynamic adjustment capability greatly improves the adaptability and efficiency of the system. It not only takes into account the time factor, but also the user's wishes, and maximizes the satisfaction of all parties while ensuring service quality.
[0082] In addition, this feedback mechanism can be further extended. For example, the system can set a priority threshold, and only when the priority of the new order exceeds a certain level will the request instruction be sent to the user of the existing order. This can avoid disturbing the users of regular orders too much, while ensuring that the truly urgent cases can be handled in a timely manner.
[0083] The system can also adjust the request strategy based on the user's historical feedback. For example, if a user often agrees to be cut in line, the system may be more inclined to select the user's order as the insertion target, and may also provide such users with some discounts or rewards to thank them for their cooperation.
[0084] In general, this feedback mechanism greatly improves the flexibility and efficiency of the entire maintenance scheduling system. It can not only cope with complex and changing actual situations, but also take care of the needs of individual users while improving overall efficiency, reflecting the innovation and practicality of the present invention in the field of intelligent scheduling. In this way, repair shops can not only better manage their resources and time, but also provide better customer service and improve customer satisfaction, thus gaining an advantageous position in the highly competitive auto repair market.
[0085] Further, in some embodiments, the step of selecting an insertion position for each splitting process according to the first splitting 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 selected to obtain the first split group; Filter out 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; Insert the selected splitting operations corresponding to the one or more first splitting maintenance times before the second maintenance order corresponding to the minimum first time window.
[0086] Based on the above embodiments, the present application further optimizes the insertion strategy of the split process, especially when the user of the second maintenance order disagrees with 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.
[0087] Specifically, when the system needs to select an insertion position for each split process based on the first split maintenance time and the first time window, the following steps are taken: First, the system will filter out the first split maintenance time that is less than the minimum first time window according to the minimum first time window, thus obtaining the first split group. The purpose of this step is to ensure that the selected split operation will not cause delays to existing orders.
[0088] For example, if the system detects that the minimum first time window is 30 minutes, it will filter out all split operations with maintenance time less than 30 minutes. If the first maintenance order contains split operations such as changing the oil (20 minutes), checking the brake system (25 minutes), and changing the air filter (15 minutes), they will all be included in the first split group.
[0089] Next, the system will select one or more first split maintenance times from the first split group so that their sum is less than the smallest first time window and as close to this time window as possible. This approach aims to maximize the use of available time and improve overall efficiency.
[0090] Continuing with the example above, the system will try to find the best combination. In this case, it might choose to check the brake system (25 minutes) because the total time of this work is 25 minutes, which is less than and closest to the 30-minute time window.
[0091] Finally, the system will insert the selected split operations corresponding to one or more first split maintenance times before the second maintenance order corresponding to the minimum first time window. This ensures that the inserted operations will not cause delays to any existing orders.
[0092] In practical applications, this method has shown great flexibility and efficiency. For example, suppose there is an urgent brake system repair order (the first maintenance order), which includes multiple split processes: check the brake pads (15 minutes), replace the brake fluid (20 minutes), and adjust the handbrake (10 minutes). The system first tried to insert the entire order, but was rejected by the user of the queued order.
[0093] At this point, the system checks the time windows of all existing orders and finds that the smallest time window is 25 minutes. The system immediately selects the operations that can be completed within 25 minutes, namely, checking the brake pads and adjusting the handbrake. Then, it selects the combination of these two operations (a total of 25 minutes) and inserts them into the corresponding time window.
[0094] Through precise calculation and selection, the system is able to maximize the use of each available time window. Even if the entire order cannot be inserted, the system can still partially meet the urgent needs, which greatly improves the flexibility of scheduling. This approach takes care of the needs of urgent orders while respecting the wishes of existing order users, which helps to improve overall user satisfaction. By finely managing 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.
[0095] In addition, this approach can be further expanded and optimized. For example, the system can take into account the dependencies between processes and ensure that the inserted process combinations are technically feasible. It can also take into account the degree of specialization of the workstation and give priority to the process combinations that are most suitable for a specific workstation.
[0096] The system can also introduce dynamic pricing mechanisms. For example, for successfully inserted split operations, a certain price discount can be provided to compensate for the possible inconvenience of the customer, while encouraging more customers to accept flexible maintenance arrangements.
[0097] In general, this refined scheduling method based on the first time window and split process greatly improves the efficiency and flexibility of the entire maintenance system. It can not only better respond to emergency orders, but also maximize the utilization of workstations while ensuring service quality.
[0098] Further, in some embodiments, 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 there is no specified information about the splitting process in the second feedback instruction, 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 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.
[0099] Based on the above embodiments, the present application further optimizes the process of split operation selection and insertion, and introduces a more flexible and intelligent decision-making mechanism. This improvement not only improves the adaptability of the system, but also enhances user participation, making the entire scheduling process more humane and personalized.
[0100] Specifically, in the process of selecting one or more first split maintenance times from the first split group, the system introduces the following steps: First, the system sends a second request. The purpose of this request is to obtain more user input or preferences so that the system can make a decision that better meets the user's needs. For example, the system may send a message to the user of the first maintenance order, asking them if they have any special priority repair items.
[0101] Next, the system will receive a second feedback instruction made according to the second request instruction. This feedback may come from the user or from a technician in a repair shop, which provides additional decision-making basis for the system.
[0102] The system will then take different actions depending on the content of the second feedback instruction: When there is no specified information about the splitting process in the second feedback instruction: The system will select one or more first split maintenance times from the first split group according to the method described above, so that their sum is less than the smallest first time window and is closest to this time window. In this case, the system will make decisions based on pure time efficiency.
[0103] For example, suppose the first split group contains the following operations: Change Oil (20 minutes), Check Brake System (25 minutes), and Change Air Filter (15 minutes), and the smallest first time window is 35 minutes. The system will select the operations Change Oil and Change Air Filter because their total time (35 minutes) is closest and does not exceed the available time window.
[0104] When the second feedback instruction has specified information about the splitting process: The system will give priority to the process specified by the user or technician. Specifically, the system will determine whether the first split maintenance time corresponding to the specified split process is not greater than the minimum first time window based on the specified information. If so, the system will insert the specified split process before the second maintenance order corresponding to the minimum first time window.
[0105] For example, if the user specifically emphasizes in feedback that the brake system check needs to be prioritized (25 minutes), and the minimum first time window happens to be 30 minutes, the system will prioritize this work, even if other combinations may be better from a pure time efficiency perspective.
[0106] By allowing users to participate in the decision-making process, the system can better meet individual needs and improve user satisfaction. The system can adjust the scheduling strategy based on real-time feedback, making the entire 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 critical safety-related maintenance work is given priority. By accurately understanding user needs, the system can better allocate workstations and human resources.
[0107] In addition, through the above technical solution, the splitting process specified by the user can be completed with priority, and part of the work of the first maintenance order can be completed on the basis of effectively utilizing the first time window. In this way, even if the user needs to pick up the car at the first required delivery time, it can be guaranteed that some of the most important maintenance processes are completed.
[0108] In addition, this approach can be further expanded and optimized. For example, the system can learn and record user preferences and automatically take these factors into account in future dispatches. It can also combine vehicle usage data and maintenance history to proactively make priority maintenance recommendations.
[0109] The system can also introduce more complex decision logic. For example, 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 high overall efficiency.
[0110] Furthermore, in some embodiments, the step of determining 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 the third guarantee order in 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. If so, insert the specified split process before the third maintenance order corresponding to the minimum second time window. The step of judging whether the first splitting maintenance time corresponding to the specified splitting process is not greater than the minimum second time window also includes: If not, obtain the second process splitting information of the second maintenance order sorted before the insertion position of the first maintenance order, the second process splitting information including whether process splitting is allowed and, when process splitting is allowed, the second split maintenance time corresponding to each split process; Obtaining the corresponding second split maintenance time according to the second process split information; According to the second required delivery time and the second split maintenance time corresponding to the second maintenance order that can be split into processes, 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 not, perform the warning operation; The method further includes: Obtain the second updated delivery time of the first maintenance order after the second maintenance order is split 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.
[0111] Based on the above embodiments, this application further expands the system's scheduling capabilities and introduces more comprehensive and flexible strategies to cope with more complex actual situations. This improvement not only improves the system's ability to handle emergency orders, but also enhances the optimization effect of the overall workflow, allowing repair shops to more efficiently utilize all available resources.
[0112] Specifically, when the system encounters a situation where it cannot schedule a specified split process within the minimum first time window, it will take the following steps: First, the system will query the status of other maintenance stations, obtain the third maintenance orders from other maintenance stations whose estimated completion time is earlier than the first required delivery time, and calculate the corresponding second time window. The purpose of this step is to find more possibilities, not limited to the arrangement of a single station.
[0113] For example, suppose the original maintenance station cannot schedule a 45-minute brake system inspection within 30 minutes. The system will check other stations and find, for example, that the tire replacement station has a 60-minute free time window (the second time window) after 1 hour.
[0114] Next, the system will determine whether the first split maintenance time corresponding to the specified split operation is not greater than the minimum second time window. If so, the system will insert the specified split operation before the third maintenance order corresponding to the minimum second time window.
[0115] 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 work into the idle time of the tire changing station.
[0116] However, if no suitable time window can be found even at other workstations, the system will take a more innovative approach: The system will obtain the second process split information of the second maintenance order that is sorted before the insertion position of the first maintenance order. This information includes whether process splitting is allowed, and if splitting is allowed, the second split maintenance time corresponding to each split process.
[0117] The purpose of this step is to explore whether existing orders can be adjusted to create space for urgent work. For example, the system may find that a comprehensive maintenance order that originally took 2 hours can be broken down into several smaller operations.
[0118] Then, the system will obtain the corresponding second split maintenance time based on the second process split information.
[0119] Next, the system will make a complex judgment: based on the second required delivery time and the second split maintenance time corresponding to the second maintenance order that can be split into processes, it will 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.
[0120] If it is possible, the system will perform the insertion operation. If not, the system will perform a warning operation to remind relevant personnel that manual intervention may be required.
[0121] By scheduling across stations and reorganizing existing orders, the system is able to make full use of all available time and resources. Even when there seems to be no room, the system can still find innovative solutions. The system is no longer limited to fixed workflows, but is able to dynamically adjust and optimize the work schedule of the entire repair shop. While pursuing efficiency, the system still ensures respect for the delivery time of existing orders. The system is able to conduct complex decision-making processes autonomously, reducing the need for human intervention.
[0122] In addition, this application also introduces an optimization mechanism: 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.
[0123] 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.
[0124] 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.
[0125] 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.
[0126] Second, refer to Figure 2 , the present application also proposes a vehicle maintenance intelligent dispatching device, comprising: 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; 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; 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; The fourth module 240 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.
[0127] After receiving the 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 queued first, and the queue-jumping mode will be entered at this time. In the queue-jumping mode, it will be determined whether the first maintenance order is allowed to be queued based on the second maintenance order currently existing at the target workstation of the first maintenance order. That is, if the first maintenance order is queued, it is necessary to ensure that the delivery time of the second maintenance order will not be delayed. When this condition is met, the first maintenance order will be queued. After the queue is jumped, 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, it will be determined whether the first maintenance order is allowed to be split, that is, the first process splitting information of the first maintenance order is obtained. If splitting is allowed, it will be split based on the first split maintenance time and the first process type. To adjust the maintenance order of the maintenance items in the second maintenance order that is sorted before the insertion position of the first maintenance order, and then insert the split process 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 estimated delivery time of the first maintenance order and the corresponding second maintenance order after insertion is calculated. If a delay occurs, a first request instruction is sent, and the scheduling operation of the first maintenance order is determined according to the user's first feedback instruction. Therefore, when the first updated delivery time is later than the first required delivery time, the present application adjusts the maintenance order of the maintenance items in the second maintenance order through the first process type, and then inserts the split process to connect the split process with the relevant maintenance items to improve efficiency. Therefore, the scheme of the present application has the beneficial effects of high flexibility and improved efficiency.
[0128] In addition, in some preferred embodiments, a vehicle maintenance intelligent scheduling device proposed in the present application can perform any step of the above method.
[0129] Thirdly, refer to Figure 3 The present application also proposes an electronic device, including a processor 310 and a memory 320, wherein 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 executed.
[0130] 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 marked), and 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 of the above embodiment to achieve the following functions: after entering the queue-jumping mode, when the newly added first maintenance order is allowed to jump in line between the existing second maintenance order of the target workstation and the first updated delivery time for the first maintenance order is recalculated to be later than the first required delivery time, the first process splitting information of the first maintenance order is obtained, and 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; when the first process splitting information is to allow splitting, 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; insert the split processes 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; receive a first feedback instruction made according to the first request instruction, and schedule the first maintenance order according to the first feedback instruction.
[0131] In a fourth aspect, the present application further 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 executed.
[0132] Through the above technical solution, when the computer program is executed by the processor, the method in any optional implementation method of the above embodiment is executed to achieve the following functions: after entering the queue-jumping mode, when the first updated delivery time for the first maintenance order recalculated due to the fact that the newly added first maintenance order is allowed to jump into the queue between the existing second maintenance orders of the target workstation is later than the first required delivery time, the first process splitting information of the first maintenance order is obtained, and the first process splitting information includes whether the process splitting is allowed and when the 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 is to allow splitting, the maintenance order of the maintenance items of the second maintenance order sorted before the insertion position of the first maintenance order is adjusted according to the first split maintenance time and the first process type; the split process of the first maintenance order is inserted into the second maintenance order according to the maintenance order, and the insertion estimated delivery time corresponding to the second maintenance order and the first maintenance order is calculated. When the insertion estimated delivery time is delayed, a first request instruction is sent; a first feedback instruction made according to the first request instruction is received, and the first maintenance order is scheduled according to the first feedback instruction.
[0133] 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), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable red-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk.
[0134] 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 schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For 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 mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, and the indirect coupling or communication connection of devices or units can be electrical, mechanical or other forms.
[0135] In addition, the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, and may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0136] Furthermore, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
[0137] The above description is only an embodiment of the present application and is not intended to limit the protection scope of the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, 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; A first feedback instruction made according to the first request instruction is received, and the first maintenance order is scheduled according to the first feedback instruction.
2. A vehicle maintenance intelligent scheduling method according to claim 1, characterized in that: 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 related to the first process type included in the second maintenance order are sorted at the end.
3. A vehicle maintenance intelligent scheduling method according to claim 2, characterized in that: 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 corresponding maintenance item is at the first, insert the corresponding splitting process before the corresponding second maintenance order; When the corresponding maintenance item is at the end, insert the corresponding splitting process after the corresponding second maintenance order; 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.
4. A vehicle maintenance intelligent scheduling method according to claim 3, characterized in that: 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 for agreement, the first maintenance order is scheduled; if the first feedback instruction is for disagreement, an insertion position is selected for each split process according to the first split maintenance time and the first time window, thereby scheduling the first maintenance order.
5. A vehicle maintenance intelligent scheduling method according to claim 4, characterized in that: The step of selecting an insertion position for each splitting process according to the first splitting maintenance time and the first time window comprises: 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. A vehicle maintenance intelligent scheduling method according to claim 5, 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.
7. A vehicle maintenance intelligent scheduling method according to claim 6, 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.
8. 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; 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.
9. 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 7 are executed.
10. 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 7 are executed.
Citation Information
Patent Citations
Flexible processing scheduling method based on an ERP and MES data interaction technology
CN109615165A
Production scheduling method and device, computer equipment and computer readable storage medium
CN115713204A
Production scheduling method for complex customization industry
CN117892947A
Data management system and method based on steel pipe intelligent manufacturing production process
CN118521143A
Automobile factory order decoupling production method
CN118586685A
Cited By
Vehicle repair store operation system and method using intelligent station
CN121936802A
