JP3211084B2 - Automatic scheduling processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

TECHNICAL FIELD OF THE INVENTION

The present invention relates to a processing method for scheduling a schedule of a checkup service such as a health checkup applied by a number of organizations on a computer.

[0002]

[Prior art]

Centers for providing screening services such as medical examinations accept applications from many organizations and, based on the conditions stated in the application, use the annual processing capacity of the center for each of those applications. So-called scheduling is required.

[0003]

[Problems to be solved by the invention]

In this case, each application condition of each group includes the type of examination content, the number of examinees, the number of times to divide the number of examinations, the number of periods, the period, etc., and the period is indicated by, for example, the start and end dates, During that period, there are days when medical examinations are not generally available (specific days and days of the week).

[0004] The staff of the center obtains the number of days required for the service processing for each such application condition, and sequentially allocates the days on the operating days of the center in consideration of the processing capacity per day of the center, for example, and fills in a ledger. Then, scheduling is performed. In addition, if an application that cannot be assigned is issued, it will be necessary to review and correct it.

As described above, the scheduling work of allocating a medical examination application and creating a schedule for a medical examination service is a time-consuming task, and usually takes about 3 to 4 weeks. It is rare.

An object of the present invention is to provide an automatic scheduling method for automatically scheduling a service schedule for a medical examination or the like applied by a number of organizations based on the desired conditions of the organizations and the contents of the application.

[0007]

[Means for Solving the Problems]

A scheduling processing support device for receiving a plurality of types of diagnostic applications having different screening contents from a plurality of organizations together with a desired screening period and scheduling a service schedule for the applications in advance, wherein the application holds an application record for each application. A file, a group file holding group records for each group, and a reservation file holding the contents of the schedule of the service schedule,

[0008] The application record of the application file includes an organization code for each application organization, a type code corresponding to the examination content applied to the application organization, the number of subjects and the number of divisions, and an application for the organization. A classification number specifying a desired screening period of the type is held, and the group record of the group file includes a group code for each group, a priority specified according to the desired screening period from the group, and One or more period designations for designating a desired examination period identified by each section number in the application record,

From the group file, group records are taken out in descending order of priority, the application record having the group code of the group record is taken out from the application file, and the number of the application records is divided by the number of people. The required total number of days to apply the service determined by the type code is determined, and the days already allocated to the reservation file are excluded from the period determined by the period specification of the group record specified by the group code and the division number of the application record. Day, the required total number of days is allocated, and if the allocation is not successful, the content of the application is added to a non-allocation list, whereby the allocation of the application according to the record of the application file is sequentially performed, and sequentially performed. The result of the assigned application And a scheduling unit for outputting from

[0010] According to this processing method, scheduling of schedule assignment is automatically performed, and retry is also facilitated. At this time, assignment can be controlled by changing the priority of an organization.

[0011]

【Example】

FIG. 1 is a block diagram showing the configuration of the present invention. The figure shows the configuration of the automatic scheduling processing method.
Is an organization file composed of records for each organization, 2 is an application file composed of records for each application, 3 is an organization file in the organization file 1 in order of priority, and processes the application of that organization in the application file 2 and reserves the scheduled result A scheduling unit generated in the file 4.

For example, in a center that provides a medical examination service, a group file 1 shown in FIG.
The application file 2 is to be prepared in advance by inputting in accordance with the contents of the application which is provided by the staff of the center by filling in a predetermined application form from each organization, and the organization file 1 includes an organization code priority 1 Alternatively, an organization record consisting of multiple periods is created for each organization.

Here, for example, up to 20 sets can be designated by assigning a section number to a period, and each period is designated by a start date and an end date of the period,
A flag indicating 0 or 1 indicates whether the designated period is a designated period or a excluded period. This period designation is a section number held in the record of each application, as described later, and is used to indicate which period is applied to the application, and when the exclusion period is specified, the period is set It is assumed that the excluded day has been designated.

The above-mentioned priority is a value designated by the center for the purpose of designating the processing order of each organization in the scheduling by the value. As shown in (1), the setting is made based on a setting criterion that takes into account the state of the designated period. Further, by adjusting this value, the scheduling can be controlled.

[Table 1]

In the application file 2, an application record for each application including an organization code, a type code, the number of people, and the number of divisions is created.

Here, the group code is the group code of the application group, and the type code is the type of the application checkup, for example, a periodical health check.
Special work sounds are medical examinations, medical checkups, etc. The number of people and the number of times are the number of times to specify the number of people to be examined and the number of groups into which the number of people to be diagnosed is to be allocated for the day of medical examination. The category number is a number that specifies the period used for assigning the application (see the description of the group file).
One or more sets of period designations can be specified, and if "0" is designated as the classification number, it indicates that any of the period designations of the group can be used.

FIG. 2A shows an example of the contents of a group record of the group file 1. As an application for this group, FIG.
Assuming that there are two records applied as shown in the example below, the first application record allows 50 persons to be assigned to two persons during the period from April 1 to April 30 designated by the segment number “1”.
Attempts are made to allocate the checkup of the type code "1" in different times, and if there is a vacancy, allocation is performed. In addition, according to the second application record, on May 1, specified by the section number “2”, processing is performed so as to allocate the examination of the type code “3” for the five persons.

FIG. 3 shows an example of the processing flow of the scheduling unit 3. First, in a processing step 10, the records of the group file 1 are sorted by priority, arranged in order of priority, and in a processing step 11, a priority value is set. The record of one group is taken out from the smallest one of.

In processing step 12, the application file is searched by the organization code of the organization, and a record of one application is taken out. In processing step 13, the required number of days and times are calculated from the application type code, the number of people, and the number of times. decide.

In processing step 14, the period designation of the section number designated in the application is read from the extracted group record, and the determined number of days is allocated to a vacant day in the period for the required number of times. If the assignment is possible, the assignment is added to the reservation file 4.

In the processing step 15, the process branches depending on whether or not the allocation is possible. If the allocation is successful, the process returns to the processing step 12 if there is any unprocessed application identified by the processing step 16 and the next application is processed. Is performed as described above. If there is no unprocessed application, it is identified in the processing step 17, and if there is an unprocessed organization, the process returns to the processing step 11 to process the next priority organization.

If the assignment is not successful, the process branches from the processing step 15 to a processing step 18, for example, after adding the contents of the application to an unassignable list provided as an appropriate file, for example, and then proceeds to the processing step 16. move on.

In this way, when all the applications of all the organizations have been processed, the process proceeds from the processing step 17 to the processing step 19,
The contents of the schedule and the non-assignable list created in the reservation file 4 are output to an appropriate printer or the like, and the process is terminated.

The user adjusts the schedule according to the result,
Alternatively, the assignment is completed by adjusting the priority of the organization and trying the scheduling process again.

【The invention's effect】

As is apparent from the above description, according to the present invention, a remarkable industrial system in which a computer can automatically perform a scheduling process of a service schedule of a medical examination applied by a large number of organizations based on the desired conditions of the organizations and the contents of the application. Has a positive effect.

[Brief description of the drawings]

 FIG. 1 is a block diagram showing the configuration of the present invention, FIG. 2 is an explanatory diagram of an organization and an application record, and FIG. 3 is a flowchart of the process of the present invention.

[Explanation of symbols]

 1 indicates an organization file, 2 indicates an application file, 3 indicates a scheduling unit, 4 indicates a reservation file, and 10 to 19 indicate processing steps.

Continuation of the front page (56) References JP-A-64-2165 (JP, A) JP-A-63-263566 (JP, A) JP-A-63-214874 (JP, A) JP-A-62-26510 (JP) JP-A-61-27806 (JP, A) JP-A-61-23003 (JP, A) (58) Fields studied (Int. Cl. ⁷ , DB name) G06F 17/60 G06F 19/00 JICST File (JOIS)

Claims (1)

(57) [Claims] 1. A scheduling processing support apparatus for receiving a plurality of types of diagnostic applications having different examination contents from a plurality of organizations together with a desired medical examination period and scheduling a service schedule for the applications in advance, wherein the application for each application is provided. An application file holding records, an organization file holding organization records for each of the organizations, and a reservation file holding the contents of the schedule of the service schedule are provided, and the application record of the application file includes an organization for each application organization. A code, a type code corresponding to the content of the screening applied for in association with the application group, the number of subjects and the number of divisions, and a classification number for specifying a desired screening period of the application type of the group. The group record in the file A group code for each group, a priority specified corresponding to a desired screening period from the group, and one or more period designations specifying a desired screening period identified by each section number in the application record; From the group file, group records are taken out in descending order of priority, the application record having the group code of the group record is taken out from the application file, and the number of the application records is divided by the number of times. The total number of days required to apply the service determined by the type code is determined for each of the above, and from the period determined by the period specification of the group record specified by the group code and the division number of the application record, the date already allocated to the reservation file The required total number of days is allocated on the day excluding, and if the allocation is not successful, Adding a content of the application to a non-assignable list, thereby sequentially executing application allocation according to the record of the application file, and outputting a result of the sequentially executed application allocation from the reservation file. A scheduling processing support device characterized by the following.