Multi-room proton therapy system, dynamic scheduling method for radiotherapy and related devices

Abstract

The present application provides a multi-room proton therapy system, a dynamic scheduling method for radiotherapy and related devices, which belong to the field of radiotherapy. The method includes: obtaining the current scheduling plan of each treatment room; according to the current scheduling plan of the treatment room, obtaining the time required for the treatment room to complete the current remaining treatment task, and using the time as the first remaining treatment time; using the sum of multiple first remaining treatment times as the total remaining treatment time; adjusting the scheduling of the remaining treatment tasks according to the first remaining treatment time and the total remaining treatment time, which can ensure that the workload of each treatment room is more balanced, help avoid idleness and waste of treatment resources, and thus improve the efficiency of proton radiotherapy; achieve a larger patient flow, and better make proton therapy accessible to benefit more patients.

Description

Technical Field

[0001] The present application relates to the field of radiotherapy technology, and in particular to a multi-chamber proton therapy system, a dynamic scheduling method for radiotherapy, and related devices. Background Art

[0002] In the field of radiotherapy, scheduling management of treatment rooms is a crucial task. Since radiotherapy usually requires specific equipment and professionals, and the treatment process may involve multiple stages and different treatment parameters, efficient and reasonable scheduling of treatment rooms is of great significance for improving treatment efficiency, reducing patient waiting time, and optimizing medical resources.

[0003] Traditional radiotherapy scheduling methods are often based on static planning, that is, scheduling is performed before treatment begins based on a predetermined treatment plan and the available time of the treatment room. Alternatively, in a radiotherapy center with multiple photon radiotherapy devices, if treatment room 1 is unable to continue treatment, the subsequent patients in treatment room 1 will be re-planned for radiotherapy and manually reallocated to other treatment rooms. However, this static scheduling method or manual scheduling method is often not flexible and efficient enough in the face of various changes that may occur during the actual treatment process, such as failure of treatment equipment, unsatisfactory treatment progress in a treatment room, and extended or shortened patient treatment time.

[0004] Based on the above problems, the present invention proposes a dynamic scheduling method for a multi-room proton therapy system and radiotherapy, which achieves more efficient and reasonable scheduling management by comprehensively considering factors such as the real-time status of the treatment room, the progress and priority of the treatment task. Summary of the invention

[0005] The purpose of this application is to provide a dynamic scheduling method for a multi-room proton therapy system and radiotherapy, which achieves more efficient and reasonable scheduling management by comprehensively considering factors such as the real-time status of the treatment room, the progress and priority of the treatment task.

[0006] The purpose of this application is achieved by the following technical solutions:

[0007] The present application proposes a dynamic scheduling method for radiotherapy, the method comprising:

[0008] Get the current schedule for each treatment room;

[0009] According to the current scheduling plan of the treatment room, the time required for the treatment room to complete the current remaining treatment task is obtained, and the time is used as the first remaining treatment time; the sum of multiple first remaining treatment times is used as the total remaining treatment time;

[0010] Adjust the scheduling of remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time.

[0011] Preferably, the dynamic scheduling method, before adjusting the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time, the method further comprises:

[0012] Determine whether the remaining treatment tasks in the treatment room can be transplanted between different treatment rooms;

[0013] If so, the remaining treatment tasks of the treatment room are allowed to be reallocated and scheduled among the treatment rooms that can be transplanted;

[0014] If not, the treatment room and the remaining treatment tasks in the treatment room will be excluded from the list to be reallocated.

[0015] Preferably, the dynamic scheduling method determines whether the remaining treatment tasks of the treatment room can be transplanted between different treatment rooms; comprising:

[0016] The transplantability and consistency are judged according to the matching degree between the beam characteristic parameters measured by the treatment equipment and the beam characteristic parameters modeled in the treatment plan based on which the treatment task is based; and different indications are set according to the matching degree; the matching degree includes multiple levels.

[0017] The transplantability is determined based on the matching degree between the actual beam emission result of the treatment task and the planned beam emission result of the treatment task; and different indications are set based on the matching degree; the matching degree includes multiple levels.

[0018] Preferably, the dynamic scheduling method adjusts the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time, including:

[0019] According to the remaining total treatment time, the average remaining treatment time of each treatment room is obtained. ;

[0020]

[0021]

[0022] in, is the total remaining treatment time; N is the number of treatment rooms; is the first remaining time of the i-th treatment room;

[0023] like > , reallocate the remaining treatment tasks of the corresponding i-th treatment room;

[0024] Wherein, t is the preset time.

[0025] Preferably, the dynamic scheduling method, reallocating the remaining treatment tasks of the corresponding i-th treatment room, comprises:

[0026] like ; Then the remaining treatment tasks starting from the j+1th task in the i-th treatment room are allocated;

[0027] in, is the current time point of the i-th treatment room, is the estimated time point for completing the jth task.

[0028] Preferably, the dynamic scheduling method, reallocating the remaining treatment tasks of the corresponding i-th treatment room, comprises:

[0029] Sort the treatment tasks to be reallocated first according to the task numbers;

[0030] If multiple treatment tasks have the same number, they are sorted in the second order according to the treatment room number;

[0031] Reassign the sorted treatment tasks to the target treatment room;

[0032] The target treatment room meets the following requirements: .

[0033] Preferably, the dynamic scheduling method, reallocating the sorted treatment tasks to the target treatment room, comprises:

[0034] Added a healing mission to one of the target healing rooms;

[0035] Calculate the remaining treatment time of the treatment room after adding the treatment task ;

[0036] like , then stop adding;

[0037] like ; then continue to add the next task according to the second sorting and allocation plan.

[0038] Optionally, in the dynamic scheduling method, the allocation scheme includes:

[0039] The treatment tasks after the second sorting are assigned to the target treatment rooms one by one; when the tasks of a treatment room are arranged to the predetermined quota, they are arranged to the next treatment room until all tasks are assigned.

[0040] Optionally, in the dynamic scheduling method, the allocation scheme includes:

[0041] The treatment tasks after the second sorting will be allocated one by one according to the established cycle order of the target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, the target treatment room exits the cycle and continues to cycle according to the established order of the remaining target treatment rooms until all tasks are allocated.

[0042] Optionally, the dynamic scheduling method, after the second sorting, further includes:

[0043] Before assigning the treatment task to be reallocated to the target treatment room, determining the degree of matching between the treatment task and the target treatment room;

[0044] According to the matching degree, the target treatment rooms for the treatment task are sorted by a third method;

[0045] The target treatment tasks are allocated among the target treatment rooms according to the third sorting rule.

[0046] Preferably, the dynamic scheduling method allocates the target treatment tasks among the target treatment rooms according to the third sorting rule, including:

[0047] If multiple treatment rooms have the same matching degree for the same treatment task at the same time, the target treatment room for the treatment task will be first screened according to the treatment part;

[0048] The target treatment tasks are allocated among the target treatment rooms after the first screening according to the third sorting rule.

[0049] Preferably, the method further comprises:

[0050] If the same treatment task can still be assigned to multiple target treatment rooms after the first screening;

[0051] Then, a second screening is performed on the plurality of treatment rooms according to the execution positioning mode of the patient in the treatment task;

[0052] The target treatment tasks are allocated among the target treatment rooms after the second screening according to the third sorting rule.

[0053] Preferably, the method further comprises:

[0054] The treatment tasks after the second sorting are assigned one by one to the corresponding target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, no new tasks will be arranged; the remaining unarranged treatment tasks will be re-confirmed for matching degree, first screening and / or second screening among the remaining target treatment rooms.

[0055] Optionally, the dynamic scheduling method, before the first sorting, further includes:

[0056] Obtaining an optimal matching degree between the treatment task to be reallocated and a plurality of target treatment rooms, and using the optimal matching degree as a first matching degree;

[0057] According to the first matching degree, a plurality of treatment tasks to be assigned are first grouped;

[0058] The treatment tasks to be reallocated are allocated according to the order of the second ranking in the first grouping.

[0059] Preferably, the dynamic scheduling method further comprises:

[0060] When any treatment room finishes the current treatment task, the time interval between the current time and the last schedule is determined;

[0061] If the time interval is greater than or equal to the preset time interval, the scheduling determination is performed again.

[0062] On the other hand, the present application provides a dynamic scheduling device for radiotherapy, the device comprising:

[0063] The current scheduling acquisition module is used to obtain the current scheduling plan of each treatment room;

[0064] A time acquisition module is used to obtain the time required for the treatment room to complete the current remaining treatment task according to the current scheduling plan of the treatment room, and use the time as the first remaining treatment time; and use the sum of multiple first remaining treatment times as the total remaining treatment time;

[0065] The scheduling adjustment module is used to adjust the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time.

[0066] In a third aspect, the present application provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of any method described in the present application or the functions of the dynamic scheduling device for radiotherapy when executing the computer program.

[0067] In a fourth aspect, the present application provides a computer-readable storage medium, wherein the storage medium stores computer instructions. When a computer reads the computer instructions, the computer executes any method described in the present application.

[0068] In a fifth aspect, the present application provides a multi-chamber proton therapy system, comprising a plurality of adjacent treatment rooms for treating patients respectively, each treatment room being equipped with a rotating gantry for rotating relative to the patient, the rotating gantry comprising arms on both sides and an intermediate arm connecting the two arms, a proton accelerator for providing a proton beam being installed on the intermediate arm, and the multi-chamber proton therapy system also comprising the dynamic scheduling device for radiotherapy described in the present application.

[0069] Furthermore, in the multi-chamber proton therapy system, the plurality of adjacently arranged treatment rooms for respectively treating patients do not share a proton accelerator.

[0070] The beneficial effects of the present invention include at least the following aspects: By estimating in real time the time required for each treatment room to complete the remaining treatment tasks of the day, and adjusting the scheduling of the remaining treatment tasks based on this information, it is possible to ensure that the workload of each treatment room is more balanced. It helps to avoid idleness and waste of treatment resources, and can also make the overall treatment process smoother, thereby improving work efficiency; the mechanism of rescheduling is triggered according to the time interval after the treatment room completes the current treatment task, making the dynamic scheduling method more flexible and efficient. It can dynamically adjust the scheduling strategy according to the actual working conditions of the treatment room, avoiding the waste of resources and inefficiency caused by fixed scheduling. At the same time, by setting a preset interval threshold, it can reduce the waste of computing data while ensuring the stability of the scheduling, and respond to the changes in the workload of the treatment room in a timely manner, so as to achieve continuous optimization of the scheduling; the multi-room proton therapy system has a compact structure, which reduces the space occupied by the multi-room proton therapy system in the treatment room, and is conducive to the integrated miniaturization of the multi-room proton therapy system and the treatment room; the proton accelerator independently installed in each treatment room will not be affected by the failure of the proton accelerators in other treatment rooms to work properly. BRIEF DESCRIPTION OF THE DRAWINGS

[0071] The present application is further described below in conjunction with the accompanying drawings and embodiments.

[0072] Figure 1 is a schematic diagram of a dynamic scheduling method for radiotherapy provided in an embodiment of the present application;

[0073] Figure 2 is a schematic diagram of the current scheduling screen display result in an embodiment of the present application;

[0074] Figure 3 is a schematic diagram of the scheduling screen display result after redistribution in an embodiment of the present application;

[0075] Figure 4 is a schematic diagram of a dynamic scheduling device for radiotherapy in an embodiment of the present application;

[0076] Figure 5It is a partial structural schematic diagram of a multi-chamber proton therapy system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0077] Below, the present application is further described in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form a new embodiment.

[0078] Some embodiments of the present application provide a method for dynamic scheduling of radiotherapy, the method comprising:

[0079] Get the current schedule for each treatment room;

[0080] According to the current scheduling plan of the treatment room, the time required for the treatment room to complete the current remaining treatment task is obtained, and this time is used as the first remaining treatment time; the time required for each treatment room to complete the remaining treatment tasks of the day is estimated in real time, and can be presented to the user through the display screen; the sum of multiple first remaining treatment times is used as the total remaining treatment time;

[0081] Adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time;

[0082] Optionally, the system can automatically give the treatment task scheduling adjustment result, issue a reminder, and obtain the user's feedback result; determine whether to make adjustments based on the user's feedback;

[0083] Optionally, the system only provides a reallocated schedule plan, which can be used as a reference for adjustment by the operator;

[0084] The working principle of the above technical solution is: by obtaining the current scheduling plan of each treatment room, the current treatment task arrangement of each treatment room is understood: including the tasks currently being performed by each treatment room, the estimated completion time, and the tasks planned to be performed next, etc.

[0085] According to the current scheduling plan of the treatment rooms, the time required for each treatment room to complete the current remaining treatment task is calculated, that is, the first remaining treatment time.

[0086] Among them, the time required for each treatment room to complete all treatment tasks at that time is calculated as:

[0087] The time for treating a single task is the product of the total number of remaining tasks currently scheduled in the treatment room and the time already treated for the current task is subtracted.

[0088] The time for a single task treatment is: A + B*TB + C*TC + D*TD

[0089] Among them, A is the total time required for the patient to enter the treatment room, walk out of the treatment room, position the patient on the bed, remove the fixed mold and get out of bed; B is the number of irradiation fields in the treatment plan; TB is the average time required to complete an irradiation field; C is the number of 2D image guidance required in the treatment plan; TC is the average time required for one 2D image guidance; D is the number of 3D image guidance required in the treatment plan; TD is the average time required for one 3D image guidance.

[0090] The treatment time for each treatment task varies according to the type of disease being treated. For example, the treatment time for prostate cancer is 15 minutes, and the treatment time for lung cancer is 25 minutes. The treatment time for a single task can be automatically preset by the system based on the calculation results, or it can be preset by the user through the terminal interface.

[0091] The sum of the first remaining treatment time of multiple treatment rooms is used as the total remaining treatment time to reflect the overall workload of the entire treatment system. The remaining treatment tasks are scheduled according to the first remaining treatment time and the total remaining treatment time; the remaining treatment tasks are reasonably redistributed so that the time for each treatment room to complete all tasks of the day is close.

[0092] The display screen can show all treatment case schedules in different treatment rooms under one timeline;

[0093] For example, Figure 2 : The current scheduling screen displays the results: The width of each task module is the time scale width. It can also display the information of the treatment room to which each treatment task was originally assigned (divided by color in the figure). This figure shows the remaining treatment tasks to be completed in the three treatment rooms at 8 o'clock that day.

[0094] Attached Figure 3 : The scheduling screen displays the results after redistribution.

[0095] The effects of the above technical solution are: by estimating in real time the time required for each treatment room to complete the remaining treatment tasks of the day, and adjusting the scheduling of the remaining treatment tasks based on this information, it can ensure that the workload of each treatment room is more balanced; it helps to avoid idleness and waste of treatment resources, making the overall treatment process smoother, thereby improving work efficiency; the dynamic scheduling method can flexibly adjust the allocation of treatment tasks according to the real-time situation of the treatment room. This helps to ensure that treatment resources (such as treatment rooms, equipment, personnel, etc.) are maximized. By optimizing the scheduling, the patient's waiting time can be reduced, the treatment efficiency can be improved, and the patient's medical experience can be enhanced. At the same time, the dynamic scheduling method can also flexibly adjust the treatment plan according to the patient's specific situation and needs to better meet the patient's personalized needs. By displaying the scheduling of each treatment room on the display screen, managers can understand the working status and progress of the treatment room in real time. This not only helps to enhance the transparency of management, but also provides more accurate and timely data support for decision-making.

[0096] In summary, this dynamic scheduling method for radiotherapy improves work efficiency and resource utilization, enhances patient satisfaction and medical quality by optimizing the allocation and scheduling of treatment tasks, while enhancing management transparency, providing more efficient and reliable support for radiotherapy.

[0097] In some embodiments, before adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time, the method further includes:

[0098] Determine whether the remaining treatment tasks in the treatment room can be transplanted between different treatment rooms;

[0099] If so, the remaining treatment tasks of the treatment room are allowed to be reallocated and scheduled among the treatment rooms that can be transplanted;

[0100] If not, the treatment room and the remaining treatment tasks in the treatment room will be excluded from the list to be reallocated.

[0101] In some embodiments, determining whether the remaining treatment tasks of the treatment room can be transplanted between different treatment rooms includes:

[0102] The degree of matching between the beam characteristic parameters measured by the treatment device and the beam characteristic parameters of the treatment plan modeling based on the treatment task is used to determine whether the transplantation is possible and the consistency is good or bad; and different instructions are set according to the matching degree; the matching degree includes multiple levels,

[0103] For example: The degree of matching can be divided into four levels: The results can be displayed by indicator lights:

[0104] Level 1: Green indication, treatment is allowed in this treatment room, and the actual beam output result is estimated to be highly consistent with the planned simulation result;

[0105] Level 2: Yellow-green indication, treatment is allowed in this treatment room, and the actual beam output result is estimated to be generally consistent with the planned simulation result;

[0106] Level 3: Yellow light indicates that treatment is allowed in this treatment room, but the actual beam output result is expected to be poorly consistent with the planned simulation result (not recommended, and treatment is not recommended unless necessary);

[0107] Level 4: No treatment allowed. Treatment rooms that do not allow treatment are removed from the reallocation list.

[0108] When the treatment plan is assigned to the Level 3 yellow light treatment room, a pop-up window will remind the operator to confirm this operation.

[0109] The working principle and effect of the above technical solution are:

[0110] During the dynamic scheduling process, when it is identified that the remaining treatment time of a treatment room exceeds the preset range and its remaining treatment tasks need to be reallocated, a key judgment is first made: whether these remaining treatment tasks can be transplanted between different treatment rooms.

[0111] The so-called "transplantation" here refers to the transfer of tasks from one treatment room to another treatment room. It usually depends on the nature of the task, the equipment configuration of the treatment room, and the patient's condition. For example, some treatment tasks may rely on specific medical equipment or technology, and these tasks cannot be transplanted to other treatment rooms that do not have the corresponding equipment or technology. Similarly, some patients may only be able to receive treatment in a specific treatment room due to physical conditions or other reasons.

[0112] If it is judged that the remaining treatment tasks can be transplanted between different treatment rooms, then it will allow these tasks to be redistributed and scheduled between the transplantable treatment rooms, which means that these tasks will be reallocated to other suitable treatment rooms based on the current workload, equipment configuration, staffing and other factors of each treatment room to achieve workload balance and maximize efficiency. However, if it is judged that the remaining treatment tasks cannot be transplanted between different treatment rooms, then these tasks cannot be reallocated. In this case, the treatment room and its remaining treatment tasks will be excluded from the list to be reallocated, and their reallocation will no longer be considered; because these tasks are special or restrictive and cannot be performed in other treatment rooms.

[0113] In some embodiments, the equipment configuration can be that the treatment rooms used for multi-room proton radiotherapy (i.e., multiple proton treatment rooms) all use proton radiotherapy equipment of the same model from the same manufacturer, and each proton radiotherapy equipment is individually equipped with a proton accelerator that provides a proton beam, ensuring that treatment tasks can be transplanted between different treatment rooms.

[0114] If different remaining treatment tasks can be transplanted between different treatment rooms, a judgment is made based on the consistency between the beam characteristic parameters actually measured by the treatment equipment and the beam characteristic parameters of the treatment plan modeling based on which the treatment task is based; the actually measured beam characteristic parameters here come from the most recent measurement result of the accelerator beam characteristics; the beam characteristic parameters of the treatment plan modeling based on which the treatment task is based come from the modeling parameters of the treatment plan system; if the consistency between the beam characteristic parameters actually measured by the treatment equipment and the beam characteristic parameters of the treatment plan modeling based on which the treatment task is based is high, the degree of matching is high; otherwise, the degree of matching is low.

[0115] The matching degree is divided into multiple levels, such as four levels (level 1: high matching, level 2: general matching, level 3: low matching, level 4: no matching). Each level corresponds to a different indicator light color or indication method, which is used to intuitively reflect the feasibility of the task and the recommended priority.

[0116] The higher the level, the higher the consistency between the expected beam output result and the planned simulation result, and the higher the portability and executability of the task. On the contrary, the lower the level, the lower the portability and executability of the task.

[0117] For tasks with a lower degree of matching (such as level 3), the system will pop up a window to remind the operator when reallocating, ensuring that the operator understands and confirms this operation to avoid treatment risks or inefficiencies that may result from low task matching.

[0118] After determining which tasks can be transplanted and how well they match, the remaining treatment tasks will be scheduled and adjusted based on the first remaining treatment time and the total remaining treatment time.

[0119] The effect of the above technical solution is: through this judgment mechanism, the system can more accurately identify which treatment tasks can be reallocated and which cannot, thereby avoiding ineffective attempts and waste of resources. At the same time, it can also ensure that the nature and requirements of the tasks are met during the reallocation process, and the rights and safety of patients are guaranteed; significantly improve the accuracy and efficiency of dynamic scheduling; by accurately judging the portability of tasks, it can more reasonably allocate treatment tasks and reduce scheduling conflicts and confusion caused by the nature or restrictions of tasks. At the same time, it can also better balance the workload of each treatment room, improve the operating efficiency of the entire treatment system and the patient's medical experience.

[0120] The dynamic scheduling method of some embodiments of the present application adjusts the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time, including:

[0121] According to the remaining total treatment time, the average remaining treatment time of each treatment room is obtained. ;

[0122]

[0123]

[0124] in, is the total remaining treatment time; N is the number of treatment rooms; is the first remaining time of the i-th treatment room;

[0125] like > , and reallocate the remaining treatment tasks of the corresponding i-th treatment room.

[0126] Wherein, t is the preset time; t is determined according to the actual situation. For example, if the start time of the last treatment task in a treatment room is within the remaining treatment time, but the end time is outside the remaining treatment time, there is no need to reallocate in this case. Therefore, a range is determined here to ensure that there are extra remaining treatment tasks for redistribution when the remaining treatment time in any treatment room is greater than the average remaining treatment time.

[0127] t can be in the following ranges: ; It is the maximum value of the single task treatment time among the remaining treatment tasks.

[0128] The reallocation of the remaining treatment tasks of the corresponding i-th treatment room includes:

[0129] like ; Then the remaining treatment tasks starting from the j+1th task in the i-th treatment room are allocated;

[0130] in, is the current time point of the i-th treatment room, is the estimated time point for completing the jth task.

[0131] The working principle of the above technical solution is as follows: first, according to the current scheduling plan of each treatment room, calculate the time required for each treatment room to complete the current remaining treatment task, that is, the first remaining treatment time; then summarize the first remaining treatment time of all treatment rooms to obtain the total remaining treatment time; the total remaining treatment time and the number of treatment rooms are used to calculate the average remaining treatment time of each treatment room; compare the first remaining treatment time of each treatment room with the sum of the average remaining treatment time plus a preset time; the preset time is determined according to the actual situation to ensure the rationality of the reallocation of tasks. When it is found that the first remaining treatment time of a treatment room is greater than the average remaining treatment time plus the preset time, it means that the task load of the treatment room is too heavy and the task needs to be reallocated. When reallocating, the task to start the reallocation will be determined based on the time point when the treatment room is expected to complete each task and the current time point. Specifically, starting from the task whose estimated completion time exceeds the average remaining treatment time plus the preset time (the j+1th task), this task and the remaining treatment tasks after it are allocated; for example, if there are 6 tasks remaining in a treatment room, and the start time of the 5th task is within the average treatment time, but its end time exceeds the average treatment time, then according to the principles mentioned above, there is no need to reallocate the 5th task to other treatment rooms at this time. The system will only consider reallocating the 6th task, the last task, to other treatment rooms with vacancies.

[0132] The above redistribution method can ensure that the workload of each treatment room is reasonably distributed, thereby improving the efficiency of the treatment process and the satisfaction of patients; at the same time, through real-time calculation and dynamic adjustment, the system can flexibly respond to various changes in the treatment process to ensure a smooth and efficient treatment process. Throughout the process, the scheduling of the treatment room and the results of task allocation are displayed in real time on the display screen, so that managers and users can intuitively understand the progress of treatment and task arrangements, and make more reasonable and efficient decisions.

[0133] In some embodiments of the present application, the dynamic scheduling method, reallocating the remaining treatment tasks of the corresponding i-th treatment room, comprises:

[0134] Sort the treatment tasks to be reallocated by task number; Sort by j in ascending order;

[0135] If multiple treatment tasks have the same number, they are sorted in the second order according to the treatment room number; they are sorted in the second order according to i from small to large;

[0136] Reassign the sorted treatment tasks to the target treatment room;

[0137] The target treatment room meets the following requirements: .

[0138] In some embodiments, the step of reallocating the sorted treatment tasks to the target treatment room comprises:

[0139] Added a healing mission to one of the target healing rooms;

[0140] Calculate the remaining treatment time of the treatment room after adding the treatment task ;

[0141] like , then stop adding;

[0142] like ; then continue to add the next task according to the second sorting and allocation plan.

[0143] The working principle and effect of the above technical solution are as follows: before task reallocation, the treatment tasks to be reallocated are first sorted. The sorting follows two principles:

[0144] The first sorting principle is to sort by the number of the treatment tasks, with tasks with smaller numbers given priority; the purpose is to ensure that the tasks can be carried out in the order of the original plan and reduce unnecessary changes caused by reallocation.

[0145] If there are multiple treatment tasks with the same number, that is, these tasks were originally scheduled to start at the same time, the second sorting principle will be adopted, that is, sorting them according to the treatment room numbers where these tasks were originally located, and tasks with smaller treatment room numbers will be given priority.

[0146] After the sorting is completed, the treatment tasks are reallocated to the target treatment rooms. The selection criteria for these target treatment rooms are that their remaining treatment time is less than the average remaining treatment time minus the preset time, ensuring that the target treatment room has a similar remaining time to the average after receiving the new task;

[0147] When assigning tasks, a gradual addition strategy can be adopted; first, a treatment task is added to one of the target treatment rooms that meets the conditions, and the remaining treatment time of the treatment room after adding the task is recalculated; if after adding the task, the remaining treatment time of the treatment room is still less than the average remaining treatment time minus the preset time, the next task will continue to be added to the treatment room according to the second sorting principle and the allocation plan; this process will continue until the remaining treatment time of the treatment room exceeds the average remaining treatment time, or all tasks to be reallocated have been allocated.

[0148] Through the above dynamic scheduling method, the distribution of treatment tasks can be adjusted in real time and efficiently to ensure that the workload of each treatment room remains balanced, improve the work efficiency of the entire treatment and the patient's medical experience. At the same time, through reasonable task sorting and allocation strategies, the stability and continuity of the original treatment plan can be maintained to the greatest extent, reducing unnecessary changes and interference caused by task reallocation.

[0149] In some embodiments of the present application, the dynamic scheduling method, the allocation scheme includes:

[0150] The treatment tasks after the second sorting are assigned to the target treatment rooms one by one; when the tasks of a treatment room are arranged to the predetermined amount, they are arranged to the next treatment room until all tasks are assigned; the predetermined amount here is determined by the remaining treatment time of the treatment room.

[0151] The working principle of the above technical solution is as follows: in the allocation process, the principle of "predetermined quota" is followed, and the predetermined quota means that after arranging the quota task, the remaining treatment time of the treatment room meets the average remaining treatment time; specifically, when the task arrangement of a treatment room reaches its predetermined quota, it will stop allocating more tasks to the treatment room, and instead arrange the next task to the next treatment room that meets the conditions; this allocation method ensures that the workload of each treatment room is within a controllable range, avoiding the situation where a treatment room is overloaded while other treatment rooms are idle. For example, there are 10 remaining tasks allocated to 3 target treatment rooms. After the target treatment room with the smallest number accepts two tasks, the remaining treatment time is greater than or equal to the difference between the current average remaining treatment time and the preset t, then the two treatment tasks in front will be added to the target treatment room with the smallest number, and the remaining treatment tasks starting from the third place will be added to the next target treatment room, and so on, until all tasks are arranged.

[0152] Finally, when all treatment tasks to be reallocated are successfully allocated to the target treatment room according to the allocation plan, the entire dynamic scheduling process ends; thereby adjusting the allocation of treatment tasks in real time and efficiently, ensuring that the workload of each treatment room remains balanced, and improving the work efficiency of the entire treatment system and the patient's medical experience.

[0153] In some other embodiments of the present application, the dynamic scheduling method, the allocation scheme includes:

[0154] The treatment tasks after the second sorting will be allocated one by one according to the established cycle order of the target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, the target treatment room exits the cycle and continues to cycle according to the established order of the remaining target treatment rooms until all tasks are allocated.

[0155] The working principle of the above technical solution is: the treatment tasks after the second sorting are allocated one by one according to the established cycle order of the target treatment rooms; for example, there are 10 remaining tasks allocated to 3 target treatment rooms, and the 3 target treatment rooms are numbered 1, 2, and 3 respectively. The first task is allocated to treatment room 1, the second treatment task is allocated to treatment room 2, the third task is allocated to treatment room 3, and the fourth task continues to be allocated to treatment room 1. If the remaining treatment time after treatment room 1 accepts a task is greater than the average remaining treatment time, treatment room 1 exits the cycle, the fourth task is allocated to treatment room 2, and the fifth task is allocated to treatment room 3, and so on, until all tasks are allocated.

[0156] Through the above method, it can be ensured that the workload of each treatment room is within a controllable range, avoiding the situation where one treatment room is overloaded while other treatment rooms are idle, achieving a balanced distribution of treatment tasks among the treatment rooms, and improving the work efficiency of the entire treatment process and the patient's medical experience.

[0157] In some embodiments, after the second sorting, the method further includes:

[0158] Before assigning the treatment task to be reallocated to the target treatment room, determining the degree of matching between the treatment task and the target treatment room;

[0159] According to the matching degree, the target treatment room for the treatment task is sorted in a third order; the higher the matching degree, the higher the priority of assigning the task to the target treatment room, and the higher the ranking.

[0160] Allocating the target treatment tasks among the target treatment rooms according to the third sorting rule; for example, the matching degree can be divided into four levels: 1, 2, 3, and 4. The first level has the highest matching degree, and the target treatment room of the first level is preferentially selected for task transplantation;

[0161] In some embodiments, allocating the target treatment tasks among the target treatment rooms according to the third sorting rule includes:

[0162] If multiple treatment rooms have the same matching degree for the same treatment task at the same time, the target treatment room for the treatment task will be first screened according to the treatment part;

[0163] The target treatment tasks are allocated among the target treatment rooms after the first screening according to the third sorting rule.

[0164] In some embodiments, the method further comprises:

[0165] If the same treatment task can still be assigned to multiple target treatment rooms after the first screening;

[0166] Then, a second screening is performed on the plurality of treatment rooms according to the execution positioning mode of the patient in the treatment task;

[0167] The target treatment tasks are allocated among the target treatment rooms after the second screening according to the third sorting rule.

[0168] In some embodiments, the method further comprises:

[0169] The treatment tasks after the second sorting are assigned one by one to the corresponding target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, no new tasks will be arranged; the remaining unarranged treatment tasks will be re-confirmed for matching degree, first screening and / or second screening among the remaining target treatment rooms.

[0170] The working principle of the above technical solution is: after the second sorting, the treatment tasks to be reallocated are considered to be allocated to specific target treatment rooms; before that, the matching degree between each treatment task and the target treatment room is determined first.

[0171] According to the matching degree, the target treatment rooms are sorted in a third way, that is, the priority of the treatment tasks is determined according to the matching degree. The higher the matching degree, the higher the priority assigned to the target treatment room, and the higher the ranking.

[0172] Based on the third sorting, the target treatment tasks are assigned to the target treatment rooms according to the sorting rules. If there are multiple treatment rooms with the same degree of matching for the same treatment task, the treatment site will be further considered and a first screening will be performed. Through the first screening, it can be ensured that tasks for the same treatment site are assigned to the same or similar treatment rooms as much as possible to improve the consistency and efficiency of the treatment.

[0173] If the same treatment task can still be assigned to multiple treatment rooms after the first screening, the patient's execution positioning method will be further considered and a second screening will be conducted. This step is to ensure the patient's treatment experience and treatment quality, and to select a suitable treatment room based on the patient's specific situation.

[0174] According to the third sorting rule, the treatment tasks after the second sorting are assigned one by one to the corresponding target treatment rooms;

[0175] Specifically: arrange the transplantation of treatment tasks in the order of the second sorting, and when arranging each treatment task; select the treatment room according to the rules of the third sorting; give priority to the one with high matching degree, if there are multiple treatment rooms meeting the requirements at the same matching level, screen them according to the treatment part; if there are multiple treatment rooms meeting the requirements of the treatment tasks to be assigned, perform a second screening according to the execution positioning method; if the treatment part does not meet the requirements of the treatment room; only select according to the matching degree; if the execution positioning method does not meet the requirements, only determine according to the screening and sorting rules of the previous level; by allocating tasks of the same treatment part to the same or similar treatment rooms as much as possible, this will help maintain the continuity and consistency of treatment, and improve treatment effects and patient satisfaction.

[0176] However, when the task arrangement of a target treatment room reaches the predetermined quota, the system will no longer arrange new tasks for the treatment room to ensure that the workload of each treatment room is balanced.

[0177] For the remaining unscheduled treatment tasks, the system will re-confirm the matching degree, perform the first screening and / or the second screening among the remaining target treatment rooms, ensuring that all tasks to be assigned have the opportunity to be re-evaluated and assigned to the most suitable treatment room.

[0178] Before the first sorting in some embodiments of the present application, the method further includes:

[0179] Obtaining the optimal matching degree between the treatment task to be reallocated and the multiple target treatment rooms, and taking the optimal matching degree as the first matching degree; for example, if a treatment task to be reallocated can be transplanted to three target treatment rooms, and the matching degrees are level 1, level 2, and level 3 respectively, then the first matching degree of the treatment task is set to level 1;

[0180] According to the first matching degree, a plurality of treatment tasks to be assigned are first grouped; a plurality of treatment tasks to be assigned with a first matching degree of level 1 are grouped into one group, a plurality of treatment tasks to be assigned with a first matching degree of level 2 are grouped into one group, and a plurality of treatment tasks to be assigned with a first matching degree of level 3 are grouped into one group;

[0181] According to the order of the second sorting in the first group, the treatment tasks to be reallocated are allocated; the tasks in each first group are sorted separately, and the sorting method is consistent with the first and second sorting methods mentioned above; then the treatment tasks to be allocated in the first group with a matching degree of 1 are arranged first, and after the treatment tasks to be allocated in the first group with a matching degree of 1 are arranged, the treatment tasks to be allocated in the first group with a matching degree of 2 are arranged, and so on.

[0182] The working principle and effect of the above technical solution are as follows: First, the optimal matching degree between the treatment task to be reallocated and the multiple target treatment rooms is obtained, and this optimal matching degree is used as the first matching degree. For example, when a treatment task can be transplanted to three target treatment rooms, its matching degree with the three treatment rooms will be evaluated, and the highest matching level, that is, the optimal matching degree, will be selected as the first matching degree of the treatment task.

[0183] Next, a plurality of treatment tasks to be assigned are first grouped according to the first matching degree, and all treatment tasks to be assigned with a first matching degree of 1 are grouped into one group, and all treatment tasks to be assigned with a first matching degree of 2 are grouped into another group, and so on. Such grouping helps to better manage and assign treatment tasks, ensuring that tasks with higher matching degrees are processed first.

[0184] Then, the treatment tasks to be reallocated are allocated according to the order of the second sorting in the first grouping. In each grouping, the tasks are sorted according to the first sorting or second sorting method to ensure that the optimal allocation of tasks can also be achieved within the group.

[0185] During the allocation process, priority is given to the treatment tasks to be assigned in the first group with a matching degree of 1; this is because these tasks have the highest degree of matching with the target treatment room, and prioritizing them can improve treatment efficiency and resource utilization; when all the tasks in the first group with a matching degree of 1 are arranged, the tasks in the first group with a matching degree of 2 are arranged instead, and so on.

[0186] In this way, it can ensure that treatment tasks with a higher degree of matching are given priority, while taking into account the optimal allocation of tasks within the group, thereby maximizing the utilization of treatment resources and improving treatment efficiency.

[0187] In general, the working principle of this embodiment achieves accurate matching and efficient allocation of treatment tasks by obtaining the optimal matching degree, performing task grouping and priority allocation, which helps to improve treatment efficiency and quality and optimize medical resource allocation.

[0188] In some embodiments of the present application, the dynamic scheduling method further includes:

[0189] When any treatment room finishes the current treatment task, the time interval between the current time and the last schedule is determined;

[0190] If the time interval is greater than or equal to the preset time interval, the scheduling decision will be made again; the preset time interval is set based on factors such as the treatment tasks, historical data and actual needs of the treatment room, and is used to determine whether the rescheduling operation needs to be triggered; the preset time interval can be 10 minutes, 20 minutes, and there is no specific limitation here.

[0191] The working principle and effect of the above technical solution are: in the process of dynamic scheduling, not only will the schedule be adjusted in real time according to the current workload of the treatment room, but also the time interval after the treatment room completes the current treatment task will be taken into account; this is because the working status of the treatment room is constantly changing, and over time, the workload and remaining treatment time of the treatment room may change.

[0192] Specifically, when any treatment room finishes the current treatment task, the system immediately obtains the current time, compares it with the last scheduled time, and calculates the time interval. This time interval reflects the working hours of the treatment room from the last schedule to the present, and is an important basis for determining whether rescheduling is needed. Moreover, after any treatment is completed, the number of remaining treatment tasks has also changed. Based on the changes in the treatment tasks and the time interval from the last schedule, it is determined whether rescheduling is needed;

[0193] Determine whether this time interval is greater than or equal to the preset time interval; the preset time interval is set based on factors such as the treatment room's treatment tasks, historical data, and actual needs, and is used to determine whether a rescheduling operation needs to be triggered. If the time interval is less than the preset time interval, it means that the treatment room's working status is relatively stable and has not changed significantly, so there is no need to reschedule. If the time interval is greater than or equal to the preset time interval, it can be considered that the treatment room's work tasks and status may have changed significantly, and a rescheduling decision is required; therefore, it is necessary to re-collect the workload information, remaining treatment time and other data of each treatment room, and optimize the scheduling based on these data.

[0194] The mechanism of rescheduling is triggered according to the time interval after the treatment room finishes the current treatment task, making the dynamic scheduling method more flexible and efficient. It can dynamically adjust the scheduling strategy according to the actual working conditions of the treatment room, avoiding the waste of resources and inefficiency caused by fixed scheduling. At the same time, by setting a reasonable preset interval threshold, the system can reduce the waste of computing data while ensuring the stability of scheduling, and respond to changes in the workload of the treatment room in a timely manner to achieve continuous optimization of scheduling.

[0195] In some embodiments of the present application, a dynamic scheduling device for radiotherapy includes:

[0196] The current scheduling acquisition module is used to obtain the current scheduling plan of each treatment room;

[0197] The time acquisition module is used to obtain the time required for the treatment room to complete the current remaining treatment task according to the current scheduling plan of the treatment room, and use the time as the first remaining treatment time; the sum of multiple first remaining treatment times is used as the total remaining treatment time; real-time estimation of the time required for each treatment room to complete the remaining treatment tasks of the day, and can present it to the user through the display screen; the sum of multiple first remaining treatment times is used as the total remaining treatment time;

[0198] The scheduling adjustment module is used to adjust the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time.

[0199] Optionally, the system can automatically give the treatment task scheduling adjustment results, issue reminders, and obtain user feedback results; determine whether to make adjustments based on the user's feedback.

[0200] In some embodiments, before the schedule adjustment module, the device includes:

[0201] Judgment module: used to judge whether the remaining treatment tasks of the treatment room can be transplanted between different treatment rooms;

[0202] If so, the remaining treatment tasks of the treatment room are allowed to be reallocated and scheduled among the treatment rooms that can be transplanted;

[0203] If not, the treatment room and the remaining treatment tasks in the treatment room will be excluded from the list to be reallocated.

[0204] In some embodiments, the determination module further includes:

[0205] The matching degree determination unit is used to determine whether the transplantation is possible and the consistency of the treatment task based on the matching degree between the beam characteristic parameters actually measured by the treatment device and the beam characteristic parameters of the treatment plan modeling based on the treatment task; the matching degree includes multiple levels.

[0206] For example: The degree of matching can be divided into four levels: The results can be displayed by indicator lights:

[0207] Level 1: Green indication, treatment is allowed in this treatment room, and the actual beam output result is estimated to be highly consistent with the planned simulation result;

[0208] Level 2: Yellow-green indication, treatment is allowed in this treatment room, and the actual beam output result is estimated to be generally consistent with the planned simulation result;

[0209] Level 3: Yellow light indicates that treatment is allowed in this treatment room, but the actual beam output result is expected to be poorly consistent with the planned simulation result (not recommended, and treatment is not recommended unless necessary);

[0210] Level 4: No treatment allowed. Treatment rooms that do not allow treatment are removed from the reallocation list.

[0211] When the treatment plan is assigned to the Level 3 yellow light treatment room, a pop-up window will remind the operator to confirm this operation.

[0212] Optionally, the system only provides a reallocated schedule plan, which can be used as a reference for adjustment by the operator;

[0213] In some embodiments, the schedule adjustment module includes:

[0214] A time acquisition unit is used to obtain the average remaining treatment time of each treatment room according to the remaining total treatment time. ;

[0215]

[0216]

[0217] in, is the total remaining treatment time; N is the number of treatment rooms; is the first remaining time of the i-th treatment room;

[0218] Reassign units for > , and reallocate the remaining treatment tasks of the corresponding i-th treatment room.

[0219] Wherein, t is the preset time; the range of t can be: ; It is the maximum value of the single task treatment time among the remaining treatment tasks.

[0220] In some embodiments, the reallocation unit comprises,

[0221] Task selection subunit; used if ; Then the remaining treatment tasks starting from the j+1th task in the i-th treatment room are allocated;

[0222] in, is the current time point of the i-th treatment room, is the estimated time point for completing the jth task.

[0223] A first sorting subunit is used to sort the treatment tasks to be reallocated in a first order according to the task numbers; and to sort in a first order from small to large according to j;

[0224] A second sorting subunit is used for performing a second sorting according to the treatment room numbers if the numbers of multiple treatment tasks are the same; and performing the second sorting according to the order of i from small to large;

[0225] an allocating subunit, used for reallocating the sorted treatment tasks to a target treatment room;

[0226] The execution steps of the allocation subunit include:

[0227] Added a healing mission to one of the target healing rooms;

[0228] Calculate the remaining treatment time of the treatment room after adding the treatment task ;

[0229] like , then stop adding;

[0230] like ; then continue to add the next task according to the second sorting and allocation plan.

[0231] In some embodiments, in the execution step of the allocation subunit, the allocation scheme includes:

[0232] The treatment tasks after the second sorting are assigned to the target treatment rooms one by one; when the tasks of a treatment room are arranged to the predetermined quota, they are arranged to the next treatment room until all tasks are assigned.

[0233] In some other embodiments, in the execution step of the allocation subunit, the allocation scheme includes:

[0234] The treatment tasks after the second sorting will be allocated one by one according to the established cycle order of the target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, the target treatment room exits the cycle and continues to cycle according to the established order of the remaining target treatment rooms until all tasks are allocated.

[0235] In some embodiments, after the second sorting subunit, the reallocation unit further comprises:

[0236] A matching subunit, used for determining the matching degree between the treatment task to be reallocated and the target treatment room before allocating the treatment task to be reallocated to the target treatment room;

[0237] The third sorting unit is used to sort the target treatment room for the treatment task according to the matching degree. The higher the matching degree, the higher the priority of assigning the task to the target treatment room, and the higher the ranking.

[0238] A first allocation subunit is used to allocate the target treatment tasks among the target treatment rooms according to the third sorting rule; for example, the matching degree can be divided into four levels: 1, 2, 3, and 4. The first level has the highest matching degree, and the target treatment room of the first level is preferentially selected for task transplantation;

[0239] In some embodiments, the first allocation subunit includes:

[0240] A first screening subunit is used for, if the matching degree of multiple treatment rooms for the same treatment task is the same at the same time, to perform a first screening on the target treatment room for the treatment task according to the treatment part;

[0241] The first execution subunit is used to distribute the target treatment tasks among the target treatment rooms after the first screening according to a third sorting rule.

[0242] In some embodiments, the first allocation subunit further includes:

[0243] The second screening subunit is used for, if the same treatment task can still be assigned to multiple target treatment rooms after the first screening, to perform a second screening on the multiple treatment rooms according to the execution positioning mode of the patient in the treatment task;

[0244] The first execution subunit is used to distribute the target treatment tasks among the target treatment rooms after the second screening according to a third sorting rule.

[0245] In some embodiments, the first allocation subunit further includes:

[0246] The reallocation subunit is used to allocate the treatment tasks after the second sorting to the corresponding target treatment rooms one by one; when the tasks of a target treatment room are arranged to a predetermined quota, no new tasks will be arranged; the remaining unarranged treatment tasks will be re-confirmed for matching degree, first screening and / or second screening among the remaining target treatment rooms.

[0247] In some embodiments, before the first sorting subunit, the reallocation unit further includes:

[0248] The first matching degree acquisition subunit is used to acquire the optimal matching degree between the treatment task to be reallocated and the multiple target treatment rooms, and use the optimal matching degree as the first matching degree; for example, if a treatment task to be reallocated can be transplanted to three target treatment rooms, and the matching degrees are level 1, level 2, and level 3 respectively, then the first matching degree of the treatment task is set to level 1;

[0249] The first grouping subunit is used to perform a first grouping of the plurality of treatment tasks to be assigned according to the first matching degree; grouping the plurality of treatment tasks to be assigned with a first matching degree of level 1 into one group, grouping the plurality of treatment tasks to be assigned with a first matching degree of level 2 into one group, and grouping the plurality of treatment tasks to be assigned with a first matching degree of level 3 into one group,

[0250] The second allocation subunit is used to allocate the treatment tasks to be reallocated according to the second sorting order in the first group; sort the tasks in each first group separately, and the sorting method is consistent with the first and second sorting methods mentioned above; then give priority to arranging the treatment tasks to be allocated in the first group with a matching degree of 1, and after arranging the treatment tasks to be allocated in the first group with a matching degree of 1, arrange the treatment tasks to be allocated in the first group with a matching degree of 2, and so on.

[0251] In some embodiments, the dynamic scheduling device for radiotherapy further includes a second determination module, wherein the second determination module is configured to:

[0252] When any treatment room finishes the current treatment task, the time interval between the current time and the last schedule is determined;

[0253] If the time interval is greater than or equal to the preset time interval, the scheduling determination is performed again.

[0254] The working principle and effect of the above technical solution are the same as those in the embodiment of the dynamic scheduling method for radiotherapy, and will not be described in detail here.

[0255] This embodiment also provides an electronic device, which includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the method described in any one of the embodiments of the present application or the functions of the device described in the embodiments of the present application are implemented.

[0256] The embodiments of the present application also provide a computer-readable storage medium, which is used to store a computer program. When the computer program is executed, the steps of the dynamic scheduling method for radiotherapy described in any one of the embodiments of the present application are implemented. The specific implementation method is consistent with the implementation method and the technical effect achieved in the above-mentioned dynamic scheduling method for radiotherapy embodiment, and some contents will not be repeated here.

[0257] In the present application, a readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it. A program product can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0258] Computer-readable storage media may include data signals propagated in baseband or as part of a carrier wave, wherein readable program codes are carried. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The readable storage medium may also be any readable medium, which may send, propagate, or transmit a program for use by an instruction execution system, an apparatus, or a device or for use in combination with it. The program code contained on the readable storage medium may be transmitted with any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above. The program code for performing the operation of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and also conventional procedural programming languages ​​such as C language or similar programming languages. The program code may be executed entirely on a user computing device, partially on an associated device, as an independent software package, partially on a user computing device, partially on a remote computing device, or entirely on a remote computing device or server. Where a remote computing device is involved, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0259] The embodiment of the present application also provides a multi-chamber proton therapy system, which includes a plurality of adjacent treatment rooms for treating patients respectively, each treatment room is equipped with a rotating frame for rotating relative to the patient, the rotating frame includes arms located on both sides and an intermediate arm connecting the two arms, a proton accelerator for providing a proton beam is installed on the intermediate arm, and the multi-chamber proton therapy system also includes the dynamic scheduling device for radiotherapy described in the embodiment of the present application. The multi-chamber proton therapy system has a compact structure, which reduces the space occupied by the multi-chamber proton therapy system in the treatment room, and is conducive to the integrated miniaturization of the multi-chamber proton therapy system and the treatment room. Figure 5 The treatment gantry is a rotating gantry, and the particle accelerator can be a proton accelerator.

[0260] In some embodiments, the proton accelerators are not shared between the multiple adjacent treatment rooms for treating patients in the multi-room proton therapy system. The proton accelerators independently installed in each treatment room will not be affected by the failure of the proton accelerators in other treatment rooms to work properly.

[0261] Although the embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and cannot be understood as limiting the present invention. A person skilled in the art can change, modify, replace and modify the above embodiments within the scope of the invention without departing from the principles and purpose of the present invention, and all these changes should fall within the scope of protection of the claims of the present invention. This application is explained from the perspectives of purpose of use, efficiency, progress and novelty, and has met the functional enhancement and use requirements emphasized by the patent law. The above description and drawings of this application are only preferred embodiments of this application, and are not intended to limit this application. Therefore, all structures, devices, features, etc. that are similar or identical to this application, that is, all equivalent replacements or modifications made according to the scope of the patent application of this application, should fall within the scope of protection of the patent application of this application.

Claims

1. A dynamic scheduling method for radiotherapy, characterized in that: The method comprises: Get the current schedule for each treatment room; According to the current scheduling plan of the treatment room, the time required for the treatment room to complete the current remaining treatment task is obtained, and the time is used as the first remaining treatment time; the sum of multiple first remaining treatment times is used as the total remaining treatment time; Adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time; The adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time includes: According to the remaining total treatment time, the average remaining treatment time of each treatment room is obtained. ; like > , reallocate the remaining treatment tasks of the corresponding i-th treatment room; in, is the first remaining time of the i-th treatment room; t is the preset time; The reallocation of the remaining treatment tasks of the corresponding i-th treatment room includes: Assign the treatment task to be reallocated to a target treatment room; the target treatment room satisfies: .

2. The dynamic scheduling method according to claim 1, characterized in that: Before adjusting the scheduling of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time, the method further includes: Determine whether the remaining treatment tasks in the treatment room can be transplanted between different treatment rooms; If so, the remaining treatment tasks of the treatment room are allowed to be reallocated and scheduled among the treatment rooms that can be transplanted; If not, the treatment room and the remaining treatment tasks in the treatment room will be excluded from the list to be reallocated.

3. The dynamic scheduling method according to claim 2, characterized in that: Determine whether the remaining treatment tasks of the treatment room can be transplanted between different treatment rooms; including: The transplantability and consistency are judged according to the matching degree between the beam characteristic parameters measured by the treatment equipment and the beam characteristic parameters modeled in the treatment plan based on which the treatment task is based; and different indications are set according to the matching degree; the matching degree includes multiple levels.

4. The dynamic scheduling method according to claim 1 or 3, characterized in that: According to the remaining total treatment time, the average remaining treatment time of each treatment room is obtained. ; include: in, is the total remaining treatment time; N is the number of treatment rooms.

5. The dynamic scheduling method according to claim 4, characterized in that: The reallocation of the remaining treatment tasks of the corresponding i-th treatment room includes: like ; Then the remaining treatment tasks starting from the j+1th task in the i-th treatment room are allocated; in, is the current time point of the i-th treatment room, is the estimated time point for completing the jth task.

6. The dynamic scheduling method according to claim 5, characterized in that: The reallocation of the remaining treatment tasks of the corresponding i-th treatment room includes: Sort the treatment tasks to be reallocated first according to the task numbers; If multiple treatment tasks have the same number, they are sorted in the second order according to the treatment room number; Reassign the sorted treatment tasks to the target treatment room.

7. The dynamic scheduling method according to claim 6, characterized in that: The method of reallocating the sorted treatment tasks to the target treatment room comprises: Added a healing mission to one of the target healing rooms; Calculate the remaining treatment time of the treatment room after adding the treatment task ; like , then stop adding; like ; Then continue to add the next task according to the second sorting and allocation plan; The allocation scheme includes: Allocate the second sorted treatment tasks to the target treatment rooms one by one; when the tasks of a treatment room are assigned to the predetermined quota, assign them to the next treatment room until all tasks are assigned; or, The treatment tasks after the second sorting will be allocated one by one according to the established cycle order of the target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, the target treatment room exits the cycle and continues to cycle according to the established order of the remaining target treatment rooms until all tasks are allocated.

8. The dynamic scheduling method according to claim 6, characterized in that: After the second sorting, the method further includes: Before assigning the treatment task to be reallocated to the target treatment room, determining the degree of matching between the treatment task and the target treatment room; According to the matching degree, the target treatment rooms for the treatment task are sorted by a third method; The target treatment tasks are allocated among the target treatment rooms according to the third sorting rule.

9. The dynamic scheduling method according to claim 8, characterized in that: The step of allocating the target treatment tasks among the target treatment rooms according to the third sorting rule comprises: If multiple treatment rooms have the same matching degree for the same treatment task at the same time, the target treatment room for the treatment task will be first screened according to the treatment part; The target treatment tasks are allocated among the target treatment rooms after the first screening according to the third sorting rule.

10. The dynamic scheduling method according to claim 9, characterized in that: The method further comprises: If the same treatment task can still be assigned to multiple target treatment rooms after the first screening; Then, a second screening is performed on the plurality of treatment rooms according to the execution positioning mode of the patient in the treatment task; The target treatment tasks are allocated among the target treatment rooms after the second screening according to the third sorting rule.

11. The dynamic scheduling method according to claim 10, characterized in that: The method further comprises: The treatment tasks after the second sorting are assigned one by one to the corresponding target treatment rooms; when the tasks of a target treatment room are arranged to the predetermined quota, no new tasks will be arranged; the remaining unarranged treatment tasks will be re-confirmed for matching degree, first screening and / or second screening among the remaining target treatment rooms.

12. The dynamic scheduling method according to claim 6, characterized in that: Before the first sorting, the method further includes: Obtaining an optimal matching degree between the treatment task to be reallocated and a plurality of target treatment rooms, and using the optimal matching degree as a first matching degree; According to the first matching degree, a plurality of treatment tasks to be assigned are first grouped; The treatment tasks to be reallocated are allocated according to the order of the second ranking in the first grouping.

13. The dynamic scheduling method according to claim 1, characterized in that: The method further comprises: When any treatment room finishes the current treatment task, the time interval between the current time and the last schedule is determined; If the time interval is greater than or equal to the preset time interval, the scheduling determination is performed again.

14. A dynamic scheduling device for radiotherapy, characterized in that: The device comprises: The current scheduling acquisition module is used to obtain the current scheduling plan of each treatment room; A time acquisition module is used to obtain the time required for the treatment room to complete the current remaining treatment task according to the current scheduling plan of the treatment room, and use the time as the first remaining treatment time; and use the sum of multiple first remaining treatment times as the total remaining treatment time; A scheduling adjustment module, used for adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time; The adjusting the schedule of the remaining treatment tasks according to the first remaining treatment time and the remaining total treatment time includes: According to the remaining total treatment time, the average remaining treatment time of each treatment room is obtained. ; like > , reallocate the remaining treatment tasks of the corresponding i-th treatment room; in, is the first remaining time of the i-th treatment room; t is the preset time; The reallocation of the remaining treatment tasks of the corresponding i-th treatment room includes: Assign the treatment task to be reallocated to a target treatment room; the target treatment room satisfies: .

15. An electronic device, characterized in that: The electronic device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method according to any one of claims 1 to 13 or the functions of the device according to claim 14 when executing the computer program.

16. A computer-readable storage medium, characterized in that: The storage medium stores computer instructions. When a computer reads the computer instructions, the computer executes the steps of the method according to any one of claims 1 to 13.

17. A multi-chamber proton therapy system, characterized in that: The multi-chamber proton therapy system includes a plurality of adjacent treatment rooms for treating patients respectively, each treatment room is equipped with a rotating gantry for rotating relative to the patient, the rotating gantry includes arms located on both sides and an intermediate arm connecting the two arms, a proton accelerator for providing a proton beam is installed on the intermediate arm, and the multi-chamber proton therapy system also includes the device as claimed in claim 14.

18. The multi-chamber proton therapy system according to claim 17, characterized in that: The plurality of adjacent treatment rooms for respectively treating patients do not share a proton accelerator.

Images