JP2008532153A - Workflow settings for medical processes - Google Patents

Description

  The present invention relates to a method for creating a workflow for a medical process. And a related user interface.

  Medical processes consist of particularly complex processes. In particular, they need to be continuously reviewed, updated and optimized. It is also in Non-Patent Document 1 (page 12). They tend to be different between medical facilities and between specialists. Even within a discipline, there are differences between procedures and established procedures.

  The role of information technology (IT) is inevitable in optimizing these medical procedures. “Information technology can reduce errors and the risk from errors, make the latest evidence and decision support systems available at the time of patient treatment and research support, and make timely and accurate quality measurements. Support, strengthen cooperation between clinicians, and strengthen accountability for functions (Non-Patent Document 1 (page 127))

Here, an attempt is made to create a method in which the defined medical process is put into practice (by law, institution, expert, procedure). Based on the following conditions:
-It should be transparent and intuitive to use.
-It should be easily adaptable (in case of inspection).
-A process or person should force a particular process or sometimes leave room for deviation.
-Contextual adaptation: Depending on the outcome of a particular step, other options should be enforced.
-It should be possible to function in parallel processes for multiple patients.
Generic system: It is desirable not to limit the length or complexity of the process.

Some existing applications use what are called “workflow engines”. They automate certain aspects of the workflow, but are not currently running:
-Need for transparency: the process that the workflow engine is running on the back side, sometimes interfering in the user interface, but not intuitive in the user interface.
The need for easy adaptation: Workflow engines are generally automating certain complex processes, which are inherently difficult to adapt.
The need to override: The workflow engine imposes a workflow that you can accept or ignore, but there is no suggested alternative.
-Necessity of parallel process: this part is currently ignored-No parallel process involving different patients has been addressed. However, multiple tasks are a daily medical concern.
-Necessity of generic systems: Workflow engines are discontinued at specific parts of the global process-they do not incorporate general methods for handling medical processes.

One aspect of the present invention is to provide an improved workflow method for medical processes to avoid the above problems.
“Method for processing linked lists of time segments” submitted simultaneously with the original application in the original application country The recommendation of the Committee on the Quality of Health Care in America &'dedesign care processes based on the practices of the United States of the United States and the Society of the United States and the United States of the United States. (Recommended by US Quality of Health Committee)

  The above aspect is realized by the method described in claim 1.

  Specific features for preferred embodiments of the invention are set out in the dependent claims.

  Within the workflow method according to the invention, the process is defined as a sequence of successive steps starting from an input point or starting from one of a set of possible input points and ending at an end point. The An acceptable transition from one step to another is also predefined. Such a transition may be an initial value or an option or a condition.

  The input points are displayed on the screen as items that can be selected by the user. Examples of input points for various treatments are: patient, appointment registration, resource. (See FIG. 2).

When the user selects an input point, the first window is displayed with a number of actions related to the first step of the process. (See Figure 3)
An example of treatment is to enter or select the name of a patient or a resource such as a physician, laboratory, testing equipment, etc.

  When the user performs these actions, the next step of the procedure defined by the acceptable transition is displayed as a selectable item. The user is then guided through the procedure. Selecting one of the steps defined as an acceptable transition will display the next window, which consists of actions relating to the step selected in the process. Again, the procedure shown in the window should be completed.

  The selection of an acceptable transition and the completion of the window shown as a result of the selection is repeated until the end of the process is reached.

  Embodiments of the method of the present invention are generally performed in the form of a computer program product suitable for executing the steps of the method of the present invention when executed on a computer.

  Computer program products are typically stored on a computer readable storage medium such as a CD-ROM. Instead, computer program products take the form of electronic signals and can communicate with users through electronic communication.

  Other advantages and embodiments of the present invention will become apparent from the following description and drawings.

  The following describes an example of a user interface relating to a workflow in the reservation registration system, and an example of settings for creating a workflow for the process.

  An example of a registration engine for a reservation registration system is described in detail in US Pat.

The process generally consists of:
1. 1. Input point or initialization Continuous step addition (all in context), including: a. Initial steps b. Optional step 3. New step in process 4. 4. Undefined number of iterations of steps 2 and 3. Summary of the last step in the workflow or the result of the workflow

  In order to embody this, an example of a process for registering a reservation will be shown.

  There are many ways to register an appointment (although it is easy to see first), and it makes a difference between healthcare facilities, departments, user groups, or treatment types.

Some examples:
1) Differences between medical facilities:
a. Some institutions indicate that appointment registration needs to begin with the patient's choice-others are with the choice of procedure.
b. Some allow parallel enrollment for different patients, but others do not.
c. You can ask to check the mandatory part (eg patient occupation) or enter it as a qualitative element in the process (eg entity).
2) Differences by department:
a. For some departments, it is necessary to issue an order and a reservation cannot be made.
b. A specific questionnaire is required and must be filled in with the results at a specific step in the workflow (eg immediately after patient selection).
c. In certain steps, certain characters / proofs must be printed.
3) Differences between users and groups:
a. The clerk has a strict workflow.
b. In the case of a physician, the initial value can be similar, but multiple options (deviations) can be used.
c. The administrator has a full range of options.
4) Differences in procedure types:
a. Depending on the results of the questionnaire, certain types of procedures are proposed or avoided.
b. Depending on the clinical route, specific procedures can be proposed or not supported.

  A typical registration workflow is shown in FIG.

The initial workflow can be:
1) Patient selection
2) Procedure selection,
3) Investigation of possible reservations,
4) Confirmation of reservation,
However, as shown, many deviating flows are possible.

  In the user interface embodiment, this is resolved as follows:

Each input point of the workflow is shown at the top of the screen and is adjacent to each other.

In the example shown in FIG. 2, there are three workflows:
Patient, appointment registration, resources.

  Note that these workflows can also be defined at the system (enterprise), department, user group, workstation or user level. In general, a workflow defined at a low level (eg, a department) overrides a workflow definition at a high level (eg, a company).

The same workflow can be opened in parallel with an existing workflow.
In the case of reservation registration, this is necessary because, in parallel, the user can:
-Patient in front of the user (eg at the desk)
-Patient by phone-Doctor on the side of the user requesting confirmation or registration of appointment

  When such an input point can be selected, a first window is shown. The medical process (in this case appointment registration) is controlled by a continuous window.

  Other actions are indicated by the status or result of the window.

  In the above example, the possibility of registering a new patient is the initial value. Because it is so defined. If this is not possible in this workflow, no treatment will be visible in this treatment portion of the window.

Other treatments emerge when a patient is selected.
Create an appointment for patient X. (default value)
-Indicates an existing appointment for patient X.

  In this way, the process is constructed as described above in the workflow diagram of FIG.

The result is as follows:
-Users have a clear offering about their possibilities.
-Since it is controlled, the offering is reliable.
-The system is generic.
-It contains options, so deviates from the default workflow.
-Can be set at various levels of the medical business entity.
-Includes the possibility of parallel workflows.

Similarly, workflows can be created to control other medical processes. For example:
-Other management processes, such as patient registration, order entry, checkout.
-Clinical processes in electronic patient records.
-Departmental processes, such as radiology technician workflow, caregiver nurse workflow, physician workflow for standardized procedures or procedures.

  The present invention is based on the following basic process.

The process is described as a graph, where each step is a node. The transition from one node to the next is defined in three ways:
1) According to the initial value 2) According to the optional method to other nodes 3) According to the conditions

This transition phase can be defined during configuration by the administrator. Typically, an administrator defines at the end of each window:
1) What is a continuous initial node, what are the conditions,
2) What are the optional continuous nodes and what are the allowed conditions in the user interface?

  In connection with the user interface, a shortcut key can be defined for each action-this can speed up the workflow. Typically, the default workflow treatment is always above the treatment portion of the window.

  In each of the following aspects of the basic registration method, the method for generating the answer space is shown more specifically and in detail.

  Before describing the general principle of the registration method, the method is first described by creating a specific example that is also a specific example of the present invention.

  Based on that example, the appointment requires registration to examine the patient with a scanner. The patient needs to undress before using the scanner and wear after using the scanner.

  The test itself takes 2 hours. One hour is provided for both undressing and clothing. You do not want to wait for the exam after the patient has taken off. Accept the need to wait up to an hour at the end of the exam before being able to wear again.

  FIG. 4 shows the treatments that are part of the appointment and the relationship between them. The appointment (100) treatment consists of three other treatments: an undressing (110) treatment, an actual examination (120) treatment, and a clothing (130) treatment. This included relationship is indicated by three included links (190, 191, 192) between the individual actions (110, 120, 130) and the reservation (100) actions. The appointment (100) procedure is called the parent and is related to the undressing (110), actual examination (120), and dressing (130) procedures called the child. Due to the parent-child relationship of the included links (190, 191, 192), it is not symmetric.

  A treatment is defined as “atomic” when it does not include other treatments. For example, the procedure for undressing (110) is atomic. However, the reservation (100) procedure is not.

  The treatment of undressing (110), actual inspection (120), and clothing (130) continues sequentially. This relationship is indicated by sequential links (193, 194). This sequentiality means that such links are not symmetric, as indicated by the arrows in FIG.

  The inspection (120) can only be performed when the scanner (140) is available. This type of relationship is indicated by an associated link (183). In addition, an associated link (184) exists between the test and the operator (150) because it is necessary to have an operator available to perform the test. The associated link between the two treatments indicates that both treatments can be performed simultaneously. From this, such links are essentially symmetric and temporary. This temporary thing is displayed in FIG. 4 by the dotted line (185) between a scanner and an operator's treatment.

  In the more general case, treatment or examination is preceded by pre-treatment behavior and post-treatment behavior is performed later. In the more general case, treatment refers to resource-related activities. Such resources can be patients, doctors, nurses, operators, diagnostic or therapeutic devices, examination or treatment rooms, or other types of resources with which activities can be associated. The resource may or may not be associated with a medical area. The activity may be the use of a device, the presence of a person, the occupation of a function, or other activity that means the use or potential use of a resource. As a more general case, any number of treatment topologies included, related or related by sequential links is possible.

  FIG. 8 shows how the corresponding time window (501-507) is associated with each treatment (100, 110, 120, 130, 140, 150, 160, 170) in FIG. The time window consists of a linked list of non-adjacent time segments, each segment having a start and end time. For example, a linked list for treatment of a patient (160) consists of time segments (510, 511, 512).

  The time window can indicate the time zone when the treatment potentially occurred. However, when the treatment can be started or finished, the time zone can also be indicated.

  In the example of FIG. 8, the patient (150), changing room (170), scanner (140), and operator (150) time windows (500-503) are part of the problem definition data. These time windows show the constraints imposed by the corresponding resource. However, the undressing (110), examination (120), dressing (130) treatment, and appointment (100) time windows (504-507) as a whole are initially undetermined. This is because it is an answer problem that must be calculated for the registration problem. An undetermined time window is shown as one adjacent time segment having the length of the time window. For example, (508) is the initial time window associated with the examination procedure (120). The answer to the time registration problem is processed according to the present invention. The number of segments in an undecided time window can change, and the start and end times of the remaining time segments are gradually focused until they show a situation that is consistent with all constraints imposed by the resource.

  Since the constraints imposed by the resources are indicated by related (180-185), included (190-192), sequential (193,194) links, processing the answer basically Get settled on creating.

  At link creation time, several different cases are communicated about the various properties of the link (related, included or sequential), interpretation of the time window of the treatment (start time, end time or treatment time), time segment Are distinguished from each other (time segment overlap within the time window of the linked procedure). The result of processing the link includes adjusting the time segment within the time window corresponding to the linked action in a manner consistent with the constraints imposed by the corresponding resource.

  The following items discuss the processing of various links.

  A time window for processing actions that are connected through associated links.

FIG. 9 illustrates several situations for treatments connected by associated links where time segments occur at various relative positions (overlapping and non-overlapping). The interpretation of the time window (620-623) is to represent the period during which the treatment (600-603) takes place. The meaning of the associated link is that two actions (600, 601) can only occur at the same time, and the result of the link creation is that each time window (620, 621) is a time segment within the original time window ( 610, 611) is replaced by a time window (622, 623) consisting of time segments (612, 613) which are cross sections.

  Because of the temporal nature of the associated link, if a procedure has more than one associated link with another procedure (directly or indirectly), the time window for all treatments is the time segment for all associated It should be replaced by a time window that is a cross section of all time segments of the treatment time window.

Time window to process for treatments connected through an included link FIG. 10 illustrates several situations for treatments connected through an included link. In it, time segments occur at various relative positions (overlapping and non-overlapping). The interpretation of the time window (700-702) is that it represents the period of time during which treatment can be performed. The meaning of the included link is that the child treatment (701) time segment (711) must occur within the time segment (710) of the parent treatment (700) time window (720). This is because the child treatment (701) time window (721) time segment (711) is replaced by the parent treatment (700) time window (720) time segment (710) and itself (711) cross section ( (cross section) (712).

Time window for processing actions connected by sequential links The following terms are introduced or specified:
Treatment time window: A linked list of time segments indicating when treatment can be performed.
-Time window of treatment start time: A linked list of time segments indicating when the treatment can start.
End time window of treatment: A linked list of time segments indicating when the treatment can be finished.

  Time window of treatment: The time window of the same treatment start time and the time window of the same treatment end time are correlated.

  Referring to FIG. 12, and in accordance with an embodiment of the present invention, a time window (921) indicating the start time (911) of the treatment is representative of the treatment and from the corresponding time window (920), Calculated by subtracting from the end time of the time segment (910) in the later time window (920) during the treatment (930).

  Referring to FIG. 11 and according to an embodiment of the present invention, a time window (821) indicating the end time of a treatment is representative of the treatment, and from the corresponding time window (820), Calculated by adding to the start time of the time segment (810) in the later time window (820) during the period (830).

In accordance with an embodiment of the present invention, time windows representative of treatment start and end times are also correlated by shifting the start and end times in the time segment according to the treatment period.

  In accordance with one embodiment of the present invention, when a first predecessor (800, 902) is followed by a second postaction (802, 900), certain constraints are the start and end times of both treatments. Applies to both.

  The first constraint includes the start time of subsequent treatments in order to realize that the start time of subsequent treatments cannot be earlier than the earliest end time of any of the previous treatments. In accordance with one aspect of the present invention, this result is determined by the cross-section (814) between the time segment (813) and the time segment (811) at the end time (821) of the preceding treatment (800). This is realized by replacing the time segment (813) of the start time (823) of 802).

  The second constraint includes the end time of the preceding treatment in order to realize that the end time of the preceding treatment cannot be later than the latest start time of any of the subsequent treatments. In accordance with one aspect of the present invention, the result is the time segment (913) of the end time (923) of the preceding procedure (902), the start time (921) of itself (913) and the subsequent procedure (900). This is accomplished by replacing with a cross section (914) between the time segments (911) of

  If a margin time is allowed between both treatments, the end time of the time segment of the preceding treatment is preferably extended by the maximum margin time allowed before applying the first constraint. Referring to FIG. 13, using the time window (1020) of the preceding action (1000), the calculation of the time window (1021) of the end time (1001) of the preceding action (1000) 1030) by moving the start time of the time segment (1010) forward. Thereafter, the segment (1011) of the time window (1021) of the preceding treatment end time (1001) is expanded by the maximum margin time (1040), and the time window (1002) of the preceding treatment plus margin time end time (1002) ( 1022) of time segments (1012). In order to obtain the time window (1024) of the start time of the subsequent treatment (1004), the end time of the segment (1013) of the time window (1023) of the subsequent treatment (1003) is set backward, and the subsequent treatment (1003) It shifts only for the period (1050). The segment (1015) of the time window (1025) at the start time of the subsequent treatment (1005) is obtained by creating a cross section between the time segment (1012) and the time segment (1014).

Creating a sequential link between two treatments involves using the two above constraints.
The method according to the present invention is shown as follows:
The associated link is processed (1),
The composite link is processed (2),
The relationship between time windows representative of treatment, start time and end time (3) is processed;
-Sequential links are processed (4),
The margin time is processed in sequential links (5).

  We proceed next by creating a previously introduced case based on the principles of the present invention.

  The problem to be solved is to find a time window representative of the start time for the examination.

The first step consists of creating the relevant links in FIG.

  Referring to FIG. 14, this is done by using the general principle according to the invention described earlier according to FIG.

  Similarly, with reference to FIG. 15, the associated links can function between exams, operators, and scanners.

  After this operation, the graph of FIG. 4 can be reduced to the graph of FIG. This is due to the view that the time window associated with the appointment and examination procedure is not new and is derived from the previous step.

  The second step consists of creating the links included in the graph in FIG. In accordance with the present invention, this is accomplished by processing time segments within the time window of the undressing, examination, and dressing procedures to fall within the time segment of the scheduled treatment time window. This is illustrated in FIGS. 16A, 16B, and 16C using the general principles of the present invention described earlier with reference to FIG.

  After this operation, the graph of FIG. 4 or 5 can be reduced to that of FIG. This is due to the view that the time window associated with undressing, testing, and dressing procedures is not new, but is derived from the previous step.

  The third step consists of addressing the constraints imposed by the sequential links.

  The examination procedure precedes and follows other treatments. According to one aspect of the invention, this has implications for the start time and end time of the time segment of the corresponding time window.

  Referring to FIG. 17, based on the general principles previously described with reference to FIGS. 11, 12, and 13, the examination start time (1310) should not be earlier than the earliest end time (1307) of the undressing procedure. Also, the end time (1303) of the examination including the allowance time must not be later than the latest start time (1301) of the clothing treatment.

  After this operation, the graphs in FIGS. 4, 5 and 6 can be reduced to that of FIG. This is due to the view that the time window associated with the examination procedure is derived from the previous step.

Introduction of deductive and inductive logic,
In accordance with the preferred embodiment of the present invention, the processing of the time window is controlled using an inductive logic method as opposed to a priori logic. These terms will be described in detail.

  Generally speaking, a priori logic starts with a variable whose numerical value is known (called "assumed value"). Then, based on the predefined flow, the numerical value of the variable that is looking for an answer (called “final conclusion”) is estimated for each step. This process occurs through numerical computation of intermediate values (called “intermediate conclusions”).

  In deductive logic, the flow of information processing itself is a programming issue and, as a result, is fixed when programmed. Therefore, deductive logic programming is effective for problems where the classification of relationships between variables is established. And only the value of the hypothetical value becomes the object of change.

  An example of the deductive logic method is shown in FIG. H1, H2, and H3 are basic assumption values. The intermediate conclusion C1 is obtained by the processing (151) of the assumed value H2. The intermediate conclusion C2 is obtained by the processing (152) of the conclusion C1 and the assumed value H1. The final conclusion C3 is reached by processing the conclusion C2 and the assumed value H3 (153).

  In contrast, the input point of the inductive logic method according to the present invention is the final conclusion itself, whose value is initially unknown. Hypothetical data is first collected by a set of inductive steps that take the form of a search process. Next, a systematic process is performed to calculate the final conclusion.

The inductive step for calculating the (intermediate) conclusion involves determining what other variables are needed to calculate the (intermediate) conclusion. There are two possibilities.
1) The value of the required variable is known, because they are hypotheses or intermediate conclusions in which the value has been previously determined and in which the variable can be processed to obtain an (intermediate) conclusion because there is,
2) Or at least one of the required variables is an intermediate conclusion whose value has not yet been determined, in which this (intermediate) conclusion initializes a new inductive step.

  The problem of programming with inductive logic is not a deductive information processing flow, but a rule set that processes inductive steps.

Developing a rule set for an inductive method involves the following decisions:
1) Calculate the result of the (intermediate) conclusion for each property (class) of the variable (intermediate conclusion) for each property (class) of the variable (intermediate conclusion) necessary for calculating the conclusion To determine what other variables (other intermediate conclusions or hypotheses) are needed.

  Unlike deductive logic methods, the problem definition here is not only a hypothesis, but also a taxonomy of the relationship between variables. This allows great flexibility when solving problems that have different taxonomies in the relationship between variables. Once the rule set is programmed, problems with various taxonomics on the relationship between the variables can be solved using the same program.

  An example using the inductive ethics method is shown in FIG. The input point is a call for calculating the value of the variable C3. The rule set directs the processing of the other two variables for which the variable C3 is H3. Among them, the value is known because it is an assumed value. In addition, the intermediate conclusion C2 has an unknown value at this point. The latter results in a new recursive step for calculating the unknown C2. The rule set instructs the variable C2 to process the other two variables H1 and the intermediate conclusion C1. The value of H1 is known because it is an assumed value. Also, the value of the intermediate conclusion C1 is unknown at this point. The latter creates a new recursive step to calculate C1. The rule set directs variable C1 to seek processing of variable H2. The value of H2 is known. Thereby, the process of H2 is performed to obtain C1. Now C1 is known and C1 and H1 are processed to calculate C2. This makes C2 known. Thereby, C2 and H3 are processed in order to calculate the final conclusion C3.

Preferred Embodiment Based on Inductive Logic In accordance with the present invention, the solution to the registration problem described in the above example is preferably implemented using an inductive logic method.

According to one embodiment, the following classes or variables are used for resource management.
The time window associated with the treatment,
A time window associated with the start time of the treatment,
The time window associated with the end time of the treatment.

Based on the same embodiment, it is managed by three rules with a set of inductive logic.
-The first rule needs to process the "treatment end time" value and the "previous treatment" value to get the value of the "treatment start time" type (type) I have indicated that.
-The second rule indicates that in order to obtain the value of a "treatment" type variable, the values of "parent treatment" and "related treatment" need to be processed.
-The third rule dictates that the same "treatment", "room" and "following treatment" need to be processed in order to obtain the value of the "treatment end time" type variable .

  However, in the more general case, other sets of rules can be selected to produce equivalent results and still be within the scope of the present invention. This is derived from the fact that the classes of variables in the above rule set can be related to each other by a simple relationship.

  We have found that the above set of three classes of variables in combination with the above three rules provides an internal storage method rather than allowing registration of resources and management of various situations.

  The method according to the present invention processes a time window to obtain a time window that generally consists of a plurality of time segments. Each shows a single answer when the corresponding action can be taken (or started). Here, the method is within the prior art but is not a single answer to the registration problem as a complete set of answers, but the complete set of answers is also called an answer space.

  The method according to the present invention can be used for resource registration and management issues that can be modeled as a set of actions corresponding to the associated, related, linked resources by the combination of sequential links and spare time.

  Given the general principles of the present invention, we move forward by processing previously introduced examples.

  Referring to FIG. 17, the method begins the method by illustrating a variable start time check. That is the final conclusion of the registration problem.

  Symbols in one circle in FIGS. 14 to 17 indicate that the same symbols in one circle in other diagrams are referred to.

  This results in an inductive step (IS1) because the value of the variable start time of the examination at this point is unknown. In order for the first rule according to the present invention to calculate the value of the start time of the examination (1410), the value of the end time of the examination treatment (1408 = 1405) and the undressing treatment (1406 = 1302) are required. Instruct. Since at this point none of these values are known, this results in two new recursive steps. The first step (IS2) is for calculating the undressing treatment value (1406 = 1302), and the second step (IS3) is for calculating the end time value of the examination (1408 = 1405).

  We proceed by first explaining the inductive step (IS2). Referring to FIGS. 14-17, the second rule requires processing of the treatment value of the reservation (1300 = 1103), which is the parental treatment, in order to calculate the value of treatment for undressing (1406 = 1302). Instruct. Since the reservation action value (1300 = 1103) is unknown at this point, this again causes an inductive step (IS4) for the variable calculation. This variable (1300 = 1103) reservation is of “treatment” type. The same (second) rule is applied to determine the treatment of treatment values for the associated dressing room (1101) and patient (1100). These treatment values are known because they are hypothetical values. So this can calculate the treatment value for the appointment (1300 = 1103) and then the treatment value for undressing (1406 = 1302).

  Next we proceed by describing the inductive step (IS3). Referring to FIGS. 14 to 17, the third rule is that the calculation of the examination end time value (1408 = 1405) is the value of the examination treatment (1402 = 1308) and the clothing treatment value (1400 = 1305). ) Is necessary. Since the examination treatment variable (1402 = 1308) is of the “treatment” type, the second rule is applied. This requires processing the parent reservation (1306 = 1103) action and the associated scanner (1200) and operator (1201) action values. The parental reservation action value (1306 = 1103) is calculated in the same way as the inductive step (IS2). The associated treatment values (1200, 1201) are known because they are hypothetical values, and the treatment values for the examination (1402 = 1308) can be calculated. Furthermore, since the variable (1400 = 1305) is also the type of treatment, the second rule is applied once again, leading to the processing of the values of the variables (1303 = 1103) and (1304 = 1101). At this point, the calculation of the inspection end time value (1408 = 1405) can be completed, and then the inspection start time value (1410) is calculated.

  The above invention is preferably implemented using a data processing system such as a computer. An example of such a system (1700) is shown in FIG. The computer comprises a network connection means (1750), a central processing unit (1760), and a storage means (1770), all connected through a computer bus (1790). Computers typically have a computer human interface for data input (1710, 1720) and a computer human interface for data output (1730). According to one embodiment, the computer program code can be read by a mass storage device (1740) or a portable data holder reading means (1780), such as a portable data holder (1790). Stored on a computer readable medium.

  Those skilled in the art will recognize that many modifications can be made without departing from the scope of the present invention as set forth in the appended claims, as detailed in the preferred embodiments of the present invention. It will be obvious.

An example of a patient registration workflow is shown. Figure 3 is a screen projection showing a user interface according to the present invention. Another screen projection associated with the user interface. A set of treatments related to, including, including and related to a resource are shown. Fig. 6 illustrates a reduction set treatment left after creation of an associated link, in accordance with a preferred embodiment. Fig. 6 illustrates the treatment of a reduced set left after creation of an associated, included link, according to a preferred embodiment. Fig. 6 illustrates the treatment of a reduced set left after creation of an associated, inclusive, sequential link according to a preferred embodiment. A set of time windows associated with the treatment is shown. Fig. 6 illustrates the treatment of an associated link according to a preferred embodiment. Fig. 6 illustrates the treatment of an included link according to a preferred embodiment. Fig. 6 illustrates sequential link treatment with prior treatment according to a preferred embodiment. Fig. 6 illustrates sequential link treatment with subsequent treatment according to a preferred embodiment. In the preferred embodiment, taking into account the relaxation time, the sequential link treatment with subsequent treatment is shown. Fig. 4 illustrates an example of an associated link treatment according to a preferred embodiment. Fig. 4 shows another example of treatment of related links according to a preferred embodiment. Three examples of included link treatments according to the preferred embodiment are shown. Fig. 4 illustrates an example time window treatment according to a preferred embodiment. Here is an example using deductive logic. Here is an example using inductive logic. 1 illustrates a data processing system according to a preferred embodiment of the present invention.

Claims (5)

A workflow method for a medical process that consists of the following steps:
(I) forming the process as a series of sequential steps starting from at least one input point and ending at an end point;
(Ii) form an acceptable transition from one step to another;
(Iii) displaying the input point on the screen as an item that can be selected by the user;
(Iv) displaying a first window at the time of selection of the input point, the first window comprising several actions relating to the first step of the process;
(V) The next step of the procedure is displayed at the time of completion of the procedure, and the procedure is formed by an acceptable transition as an item that can be selected. (Vi) One of the steps formed as an acceptable transition. Displaying a window of actions relating to a selected step of the process in selecting
(Vii) completing the procedure;
(Viii) Repeat items (5) to (7) until the end point is reached.   2. The workflow method according to claim 1, wherein the migration is one of migration as an initial setting, migration of options, and migration based on conditions.   A workflow method according to any preceding claim, wherein the process is a reservation registration process.   A computer program product suitable for performing the method of any of the preceding claims when executed on a computer.   A computer readable medium comprising computer readable program code suitable for performing the steps of any of claims 1 to 3.

Images