CN109840710B - Automatic rotary shift scheduling system for hospital standardized training - Google Patents

Abstract

The invention discloses an automatic rotation scheduling system for hospital standardized training, which relates to the field of medical information aided design. The automatic rotation scheduling system for hospital standardized training includes: a storage module, a data processing module and a display module; a data processing module Used to determine the total practice time Ti of each _student , and the list of the ratio of the practice time length of each department to the total practice time _Ti for each student; Determine the maximum proportion in the list of the proportion of time length to the total internship time T _i ; sort the multiple maximum proportions from high to low to obtain the first sorting order, and determine the first sorting order as the department's shift order; The scheduling sequence of students in each department is determined according to the student scheduling algorithm, so as to ensure that there is no overlap, omission and conflict in the scheduling, and the number of students in each department is as balanced as possible.

Description

An automatic rotation scheduling system for standardized training in hospitals

technical field

The invention relates to the field of medical information aided design, and more particularly to an automatic rotation scheduling system for standardized training in hospitals.

Background technique

Standardized training for resident physicians (hereinafter referred to as "regular training") is an important part of post-graduation education for medical students, and is extremely important for training high-level clinical physicians and improving the quality of medical care. It occupies an important position of inheriting the past (basic education in medical schools) and beginning the future (continuing medical education) of lifelong medical education, and is the key to the formation of medical clinical experts.

However, regulated training is faced with many students, and students with different academic systems have different training time requirements, and students in different departments require different regulated training departments. As the number of departments increases and the number of people increases, the possibility of typesetting increases sharply. A regular trainee needs to complete the designated department within a designated period of time (usually 2 or 3 years). A regular-scale hospital has more than 20 people trained and more than 30 departments. The average number of departments to be rotated by each person is about 20 on average. Students of different academic systems have different training time requirements, and students of different departments require different training departments.

At present, the runner schedule can only be arranged manually by a special person. The complexity of scheduling increases greatly with the increase of personnel and shifts. The efficiency of scheduling is low, and manual scheduling may be wrong or missed. Phenomenon, scheduling errors in the medical field can lead to very serious consequences.

SUMMARY OF THE INVENTION

The embodiment of the present invention provides an automatic rotation scheduling system for standardized training in a hospital, which can achieve no overlap, omission and conflict in scheduling, avoid the pressure caused by manual scheduling, and have high scheduling efficiency.

The embodiment of the present invention provides an automatic rotation scheduling system for standardized training in a hospital, including: a storage module, a data processing module and a display module;

The data processing module is used to execute the automatic rotation scheduling step, wherein the automatic rotation scheduling step includes:

Step S1: Receive attribute information of a plurality of trainees, and store the attribute information of the trainees in a relation list; wherein, the attribute information of the trainees of the trainers includes the identities of the trainees; the The relationship list is used to store the corresponding relationship between the attribute information of the scheduled trainees and the practice time length of the required practice department;

Step S2, receive all the departments that need to be rotated and the practice time length of each rotating department of each of the multiple scheduled students, and store the practice time length in the relationship list according to the category of the rotating department. corresponding position;

Step S3, when receiving a shift scheduling request, obtain the relationship list;

Step S4, determine the total practice time T _i of each student based on the relationship list, and a list of the ratios of the practice time lengths of each department that each student needs to practice in the total practice time T _i ;

Step S5, determine the maximum ratio and the department category corresponding to the maximum ratio from the list of the ratios of the practice time _lengths of each department that each student needs to practice in to the total practice duration Ti;

Step S6, sorting the multiple maximum ratios from high to low to obtain a first sorting order, and determining the first sorting order as the shift order of the department;

Step S7, determining the order of the students in each department according to the students' scheduling algorithm in the order of the departments;

Step S8, combining the order of students in multiple departments to obtain an automatic wheel schedule;

the storage module, configured to store the relationship list;

The display module is used to display the automatic runner schedule.

Preferably, the data processing module is used to execute a student scheduling algorithm; wherein, the student scheduling algorithm includes:

Based on multiple ratio lists, obtain the attribute information of multiple first students corresponding to the current highest-ranked department;

Based on the attribute information of the first student, the duration ratio of each student's current highest-ranked department is obtained, and the duration ratios of multiple currently ranked departments are sorted from high to low to obtain a second sorting order. The sorting order is determined as the order of students in the current highest-ranked department, wherein the proportion of the current highest-ranked department’s duration is the ratio of the currently highest-ranked department’s practice time length to the total internship duration T _i ;

Select a sub-high-tech department from the shift sequence of the department, and obtain attribute information of multiple second students corresponding to the sub-high-tech department;

Based on the attribute information of the second student, the duration ratio of each student's sub-higher department is obtained, and the duration ratio of the sub-higher department is sorted from high to low to obtain a third sorting order, and the third sorting order is Combined with the student conflict avoidance algorithm, the order of students in the next high-level department is obtained.

Preferably, the data processing module is used to execute the specific steps of the student conflict avoidance algorithm:

Step 3-1. Determine the time length L that the current student needs to be inserted;

Step 3-2. Check the remaining time period of the current student's regular training;

Step 3-3, judging whether the remaining time period is a complete remaining time period;

Step 3-4, if the remaining time period is an incomplete remaining time period, then move the student's time period by L steps based on the endpoint of a certain remaining time period to free up the remaining time period: the incomplete remaining time period The remaining time period is that the time length M of each remaining time period is less than the time length L to be inserted, and the multiple remaining time periods are not continuous with each other;

Step 3-5, if the remaining time period is a complete remaining time period, select the insertion time position; wherein, when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called complete. remaining time period;

The selection and insertion time position includes:

Calculate all the candidate shift _scheduling insertion points _: C ₁ , _{C 2} , _...

_Select the _minimum value among _{H 1} , H ₂ ,... .

In this embodiment of the present invention, when a shift scheduling request is received, the relationship list is obtained; based on the relationship list, the total practice time _Ti of each student and the practice time of each department required by each student are determined. The list of the proportion of the length to the total internship time _Ti ; determine the maximum proportion and the department category corresponding to the maximum proportion from the list of the proportion of the _internship time length of each department that each student needs to practice in to the total internship time Ti; The maximum ratio is sorted from high to low to obtain the first sorting order, and the first sorting order is determined as the department's scheduling order; order, so as to ensure that there is no overlap, omission and conflict in the scheduling, and at the same time, the number of people in each department is as balanced as possible, and the advantages of high-speed computing of computers are fully utilized, which greatly reduces the scheduling pressure of medical staff, and the scheduling efficiency is high. Make the normal operation of the hospital more secure.

Description of drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained according to these drawings without creative efforts.

FIG. 1 is a block diagram of an automatic rotation scheduling system for standardized training in a hospital according to an embodiment of the present invention.

Detailed ways

A specific embodiment of the present invention will be described in detail below with reference to the accompanying drawings, but it should be understood that the protection scope of the present invention is not limited by the specific embodiment.

FIG. 1 exemplarily shows a block diagram of an automatic rotation scheduling system for hospital standardized training provided by an embodiment of the present invention. The automatic rotation scheduling system for hospital standardized training includes a storage module 1 , a data processing module 2 and a display module 3; The data processing module 2 is used to execute the automatic rotation scheduling step, wherein the automatic rotation scheduling step includes:

Step S1: Receive attribute information of a plurality of trainees, and store the attribute information of the trainees in a relationship list; wherein, the attribute information of the trainees of the trainers includes the identities of the trainees; the relationship list uses It is used to store the corresponding relationship between the attribute information of the scheduled trainees and the length of practice time of the required practice department.

Step S2: Receive all the departments that need to be rotated and the practice time length of each rotating department of each of the multiple scheduled students, and store the practice time length in the correspondence of the relationship list according to the category of the rotating department. Location.

In the embodiment of the present invention, firstly, the identity identifier of the shift scheduler may be a name or a specific identifier, such as user ₁ , user ₂ , ... user _n . When the identity identifier of the shift scheduler is received, the identity identifier Stored in the relationship list, the relationship list used in the present invention is shown in Table 1.

Table 1

Step S3: When a shift scheduling request is received, the relationship list is acquired.

Step S4: Determine the total practice time T _i of each student based on the relationship list, and a list of ratios of the practice time lengths of each department that each student needs to practice in to the total practice time Ti _.

Table 2 List of the ratio of the length of practice time in each department to the total practice time _Ti

Step S5: Determine the maximum ratio and the department category corresponding to the maximum ratio from a list of ratios of the length of practice time in each department that each student needs to practice in to the total practice time T _i .

Step S6: Sort the multiple maximum ratios from high to low to obtain a first sorting order, and determine the first sorting order as the shift order of the department.

It should be noted that if multiple departments have the same maximum ratio value, the multiple departments are randomly arranged.

That is, in actual processing, the departments corresponding to the same maximum ratio value are sorted first, and then the departments corresponding to the next largest ratio value are ranked.

Step S7: Determining the order of arrangement of students in each department according to the order of arrangement of students in each department.

Step S8: Combining the order of students in multiple departments to obtain an automatic wheel schedule.

The storage module is used to store the relation list.

This display module is used to display the automatic runner schedule.

Wherein, the data processing module is used to execute the student scheduling algorithm; wherein, the student scheduling algorithm includes:

Based on multiple ratio lists, obtain the attribute information of multiple first students corresponding to the currently highest ranked department.

Based on the attribute information of the first student, the duration ratio of each student's current highest-ranked department is obtained, and the duration ratios of multiple currently ranked departments are sorted from high to low to obtain a second sorting order, and the second sorting order Determine the order of the students in the currently ranked highest department, where the proportion of the department's duration is the ratio of the department's practice time to the total practice time T _i .

Select a sub-high-tech department from the department's shift order, and obtain the attribute information of multiple second students corresponding to the sub-high-tech department;

Based on the attribute information of the second student, obtain the time proportion of each student's sub-high-tech department, sort the time proportion of the sub-high-tech department from high to low to obtain a third sorting order, and combine the third sorting order with the student conflict The avoidance algorithm obtains the order of students in the next high-level department.

Specifically, the data processing module is used to execute the specific steps of the student conflict avoidance algorithm:

Step 3-1. Determine the time length L that the current student needs to be inserted.

Step 3-2. Check the remaining time period of the current student's regular training.

Step 3-3: Determine whether the remaining time period is a complete remaining time period.

Step 3-4. If the remaining time period is an incomplete remaining time period, move the student's time period by L steps based on the endpoint of a certain remaining time period to free up the remaining time period: the incomplete remaining time period The time length M of each remaining time period is smaller than the time length L to be inserted, and the plurality of remaining time periods are not continuous with each other.

Step 3-5, if the remaining time period is a complete remaining time period, select the insertion time position; wherein, when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called the complete remaining time. part.

The selection insertion time position includes:

Calculate all the candidate shift scheduling insertion points: C ₁ , C ₂ ,...C _n , "the maximum number of people in the department after insertion" H ₁ , H ₂ ,... H _n ;

_Select the _minimum value among _{H 1} , H ₂ ,... .

The purpose of the present invention is to design a complete set of automatic rotation scheduling system, below in conjunction with a simple example, the specific embodiment is described as follows:

The scenario is as follows:

Definition 1: (Department, department), the departments of the hospital include: obstetrics and gynecology, anesthesiology, endocrinology and other departments.

Definition 2: (person, user) This schedule involves 30 students, namely student 1, student 2, and so on.

Definition 3: (standard, standard) According to the National Health and Family Planning Commission, the "Standardized Training Content and Standards for Residents (Trial)" (hereinafter referred to as "Standard") was formulated and issued, which stipulated the departments and time required for each trainee to rotate. length. For example, for student user ₁ , his criteria are: <dep _1,i ,t _1,i >,<dep _1,j ,t _1,j >,…. It means to train in department dep _1,i for t _1,i time, in department dep _1,j for t _1,j time, and so on. There is no order requirement between departments.

Definition 4: (time unit) In order to simplify the process in practice, "0.5 month" is used as the basic time unit. In the standard, the duration of students in a single department (t _{1, i} , etc. in Definition 3) should be an integer multiple of "0.5 months", such as 0.5 months, January, 1.5 months, February, etc.

The chronological order is from January 2018 to December 2020, a total of 3 years and 36 months. The schedule is as follows:

(1) Calculating the order of scheduling: Completely arrange one department at a time, and then arrange the next department.

(1-1) For each student, such as student 1, calculate the total duration of his internship, the total duration is 36 months (3 years). For student 2, the total duration is 24 months (2 years).

(1-2) For student 1, calculate the list of his proportions: {<Obstetrics and Gynecology, 7/36>, <Anesthesiology, 8/36>, ...}, the highest proportion is the anesthesiology department, that is, <Anesthesiology, 8/36>. For the list of ratios of student 2: {<endocrinology, 1/24>, <gynecology, 9/24>, ...}, the highest ratio is gynecology, namely <gynecology, 9/24>.

(1-3) Sort the highest proportion of all people from high to low to get the order of departments. For example, Student 1 is <Anesthesiology, 8/36>, Student 2 is <Obstetrics, 9/24>, and so on. The sorted order of departments is: <Obstetrics and Gynecology, 9/24>, <Anesthesiology, 8/36>,…

(2) Schedule the current highest-ranked department. Obstetrics and gynecology first.

(2-1) List of ratios calculated in (1-2), 10 out of 30 trainees have standards in Obstetrics and Gynecology. Sort their proportions: <student 2, obstetrics and gynecology, 9/24>, <student 1, obstetrics and gynecology, 7/36>, ..., and the obstetrics and gynecology department of student 2 is ranked first.

(2-2) The schedule is now empty. Obviously, the obstetrics and gynecology department of student 2 is directly scheduled from January to March 2018. But in order to explain a more complicated situation, let's assume that the "student 5" of the "endocrinology department" needs to be trained for 1 month: for student 1, it is now necessary to insert the obstetrics and gynecology department schedule, and the duration requirement is L=2 months.

(2-2-1) Check the remaining time period: The specified training time for the trainee is from 2015-01 to 2018-12, and now other parts are full, and only 2 months of 2018-04 and 2018-12 are left. , but was cut open without a full "February" remainder, which does not meet the "full remainder" requirement.

(2-2-2) Free up the remaining time period: All the scheduled time periods of student 1 are merged forward. The student's 2018-05 to 2018-11 schedule is moved forward as a whole to 2018-04 to 2018-10, so that the spare time period becomes 2018-11 to 2018-12, which meets the "complete remaining" requirement.

(2-2-3) Select insertion time position: For the above example, there is only 1 candidate insertion position (2018-11), which cannot be selected. Let's consider another example. Now the trainee needs to insert the schedule of "Obstetrics and Gynecology - February". The spare time periods are 2018-10, 2018-11, and 2018-12, and the number of existing departments in these three months is 10, 9, and 9, respectively. Then the student has two candidate insertion points (C ₁ =2018-10～2018-11, C ₂ =2018-11～2018-12). If you choose 2018-10~2018-11, the number of obstetrics and gynecology in these two months will become 11 people, 10 people, and the maximum number H ₁ =11; if you choose 2018-11~2018-12, then these two months The number of people in the obstetrics and gynecology department is changed to 10 people, 10 people, and the maximum number of people is H ₂ =10. Therefore, choosing C ₂ as the insertion point is beneficial to the even distribution of resources.

Through the perfect algorithm, the present invention can ensure that there is no overlap, omission and conflict in the scheduling, and at the same time, the number of people in each department is as balanced as possible; the actual needs of the scheduling and the computer program design are combined, and the advantages of high-speed computing of the computer are fully utilized, which greatly reduces the The pressure on the scheduling of medical staff also makes the normal operation of the hospital more secure.

Although preferred embodiments of the present invention have been described, additional changes and modifications to these embodiments may occur to those skilled in the art once the basic inventive concepts are known. Therefore, the appended claims are intended to be construed to include the preferred embodiment and all changes and modifications that fall within the scope of the present invention.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit and scope of the invention. Thus, provided that these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims (1)

1. the automatic rotation scheduling system of a hospital standardized training, is characterized in that, comprises: storage module, data processing module and display module; The data processing module is used to execute the automatic rotation scheduling step, wherein the automatic rotation scheduling step includes: Step S1: Receive attribute information of a plurality of students in scheduling, and store the attribute information of students in scheduling in a relationship list; wherein, the attribute information on students in scheduling includes the identity of the students in scheduling; the relationship The list is used to store the corresponding relationship between the attribute information of the scheduled trainees and the practice time length of the required practice department; Step S2, receive all the departments that need to be rotated and the practice time length of each rotating department of each of the multiple scheduled students, and store the practice time length in the relationship list according to the category of the rotating department. corresponding position; Step S3, when receiving a shift scheduling request, obtain the relationship list; Step S4, determine the total practice time T _i of each student based on the relationship list, and a list of the ratios of the practice time lengths of each department that each student needs to practice in the total practice time T _i ; Step S5, determine the maximum ratio and the department category corresponding to the maximum ratio from the list of the ratios of the practice time _lengths of each department that each student needs to practice in to the total practice duration Ti; Step S6, sorting the multiple maximum ratios from high to low to obtain a first sorting order, and determining the first sorting order as the shift order of the department; Step S7, determining the order of the students in each department according to the students' scheduling algorithm in the order of the departments; Step S8, combining the order of students in multiple departments to obtain an automatic wheel schedule; the storage module, configured to store the relationship list; The display module is used to display the automatic runner schedule; The data processing module is used to execute the student scheduling algorithm; wherein, the student scheduling algorithm includes: Based on multiple ratio lists, obtain the attribute information of multiple first students corresponding to the current highest-ranked department; Based on the attribute information of the first student, the duration ratio of each student's current highest-ranked department is obtained, and the duration ratios of multiple currently ranked departments are sorted from high to low to obtain a second sorting order. The sorting order is determined as the order of the students in the current highest-ranked department, wherein the proportion of the current highest-ranked department’s duration is the ratio of the currently highest-ranked department’s practice time length to the total internship duration T _i ; Select a sub-high-tech department from the shift sequence of the department, and obtain attribute information of multiple second students corresponding to the sub-high-tech department; Based on the attribute information of the second student, the duration ratio of each student's sub-higher department is obtained, and the duration ratio of the sub-higher department is sorted from high to low to obtain a third sorting order, and the third sorting order is Combining the student conflict avoidance algorithm to get the students' scheduling order in the next high-level department; The data processing module is used to execute the specific steps of the student conflict avoidance algorithm: Step 3-1. Determine the time length L that the current student needs to be inserted; Step 3-2. Check the remaining time period of the current student's regular training; Step 3-3, judging whether the remaining time period is a complete remaining time period; Step 3-4, if the remaining time period is an incomplete remaining time period, then move the student's time period by L steps based on the endpoint of a certain remaining time period to free up the remaining time period: the incomplete remaining time period The remaining time period is that the time length M of each remaining time period is less than the time length L to be inserted, and the multiple remaining time periods are not continuous with each other; Step 3-5, if the remaining time period is a complete remaining time period, select the insertion time position; wherein, when the time length M of the remaining time period is greater than the time length L to be inserted, the remaining time period is called complete. remaining time period; The selection and insertion time position includes: Calculate all the candidate shift _scheduling insertion points _: C ₁ , _{C 2} , _{... Select} the _minimum value among _{H 1} , H ₂ ,... .

Images