Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/10—Office automation; Time management
  • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/10—Office automation; Time management
  • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
  • G06Q10/1093—Calendar-based scheduling for persons or groups

Definitions

• the present invention relates to an improved appointment scheduling system and associated user interface.
• the present invention is in particular applicable in the context of appointment scheduling systems to be applied in medical institutions, where appointments need to be scheduled for patients, taking into account a multitude of constraints such as the availability of personnel and equipment, and of the patient himself.
• a third line of input can be a physician or colleague secretary, requesting on a note the entry of an appointment on a certain date, for a certain physician/room and for a specific patient.
• a physician often switches to the medical file or other result viewing of the active patient. Sometimes, the same patient is put active again, sometimes not. When not being attentive, one may presume the active patient is taken with, while it is not the case. In the latter case, the previous patient is still active in the result viewer and the physician may take the wrong decisions based on a wrong anamnesis.
• Used objects such as a specific exam or resource are shown at dedicated places in the graphical user interface (GUI) .
• GUI graphical user interface
• the action buttons of creating appointments are icons, sometimes accompanied by a name (OK, Next, etc.) - longest cases would refer to 'Create appointment'.
• a number of data on client and/or resources can be filled in or selected and displayed.
• Messages regarding actions pertaining to a client or a resource to be performed with regard to an appointment scheduling procedure are displayed.
• the actions can be activated by user interaction, for example by checking a check box.
• a displayed message regarding an action is comprises data pertaining to the client or resource to which said action pertains .
• the invention provides that the attention of the user is prompted at crucial moments in the procedure to the object onto which an action part of an appointment scheduling procedure is going to be performed.
• An object can be a client (being a patient in a medical appointment scheduling system) or a resource.
• Data pertaining to an object are e.g. names, codes, unique identifiers etc.
• the term 'resource' has a broad meaning and, in connection with a medical appointment scheduling system, refers to physical resources such as radiology room, examination equipment such as a CT scanner and also to human resources such as physicians, operators etc.
• the embodiments of the methods of the present invention are generally implemented in the form of a computer program product adapted to carry out the method steps of the present invention when run on a computer.
• the computer program product is commonly stored in a computer readable carrier medium such as a CD-ROM.
• the computer program product takes the form of an electric signal and can be communicated to a user through electronic communication.
• Another aspect of this invention pertains to an improved user interface for an appointment scheduling system.
• the user interface has a number of linked screens in which a user enters and selects data pertaining to a client and/or to resources involved in an appointment scheduling operation.
• a message can be displayed on an action a user of the appointment scheduling system can perform.
• a displayed message pertaining to a client or a resource comprises data identifying said client or resource.
• the invention also provides the ability to retrieve from memory and display a history list of the patient identifiers of the last appointments given.
• Figures 1 to 3 are screen shots pertaining to embodiments of an appointment scheduling system and associated user interface according to the present invention.
• Figure 4 describes a set of actions related to resources and connected by comprising, relational and sequential links
• Figure 5 describes a reduced set of actions that is left after working out the relational links according to a preferred embodiment
• Figure 6 describes a reduced set of actions that is left after working out the relational and comprising links according to a preferred embodiment
• Figure 7 describes a reduced set of actions that is left over after working out the relational, comprising and sequential links according to a preferred embodiment
• Figure 8 describes a set of time windows associated with actions
• Figure 9 demonstrates the processing of a relational link according to a preferred embodiment
• Figure 10 demonstrates the processing of a comprising link according to a preferred embodiment
• Figure 11 demonstrates the processing of a sequential link with a preceding action according to a preferred embodiment
• Figure 12 demonstrates the processing of a sequential link with a following action according to a preferred embodiment
• Figure 13 demonstrates the processing of a sequential link with a following action, taking into account slack time according to a preferred embodiment
• Figure 14 shows an example of processing a relational link according to a preferred embodiment
• Figure 15 shows another example of processing a relational link according to a preferred embodiment
• Figure 16 shows three examples of processing a comprising link according to a preferred embodiment
• Figure 17 shows an example of the processing of time windows according to a preferred embodiment
• Figure 18 shows an example of using deductive logic-
• Figure 19 shows an example of using inductive logic
• Figure 20 shows a data processing system according to a preferred embodiment of the current invention.
• Figures 1 to 3 show screen prints of the user interface of an appointment scheduling system according to the present invention.
• the user interface has different tabs relating to different kinds of information regarding the scheduling procedure.
• the individual tabs are displayed in linked screens. Examples are a screen in which patient identification data can be filled in or selected from a list, an appointment scheduling screen and a screen displaying agendas of different resources such as doctors, examination rooms, examination equipment etc.
• Object identifiers more specifically objects names, such as the names of patients, examinations, doctors etc. are displayed as frequently as possible. They are preferably displayed on places where the user takes the action.
• Another action could be 'Show medical history for Patient ASPLUND' . In that way, the user will consciously take the action of viewing the medical history for the particular indicated patient.
• the crucial action of connecting a certain exam/procedure to a patient is done.
• the invention provides that in such cases information is given on the specific type of action as well as on the object on which the action is performed. Messages of the following type are then generated in a action box: 'Show possible 'Exam code' appointments for Patient X' .
• the following example is the shown: "Show possible CA-appointment for ASPLUND, JOHAN" .
• figure 2 shows how a resource object can repeatedly be indicated. This is crucial for a secretary managing multiple resources.
• the resource's code or name can be indicated, as is shown in figure 3.
• the invention is based on the underlying appointment scheduling procedure in which every link has access to the application model, describing the current state of the application (e.g. selected patient, procedure, resource, etc) . It can use any type of information within the model to describe itself. With any modification of the model, the links can track these changes and update themselves accordingly (e.g. change the presented string presented in the user interface) .
• Another aspect of this invention relates to the displaying and referencing of frequently used patient identifications (ID' s) as described below.
• ID' s frequently used patient identifications
• appointment scheduler doesn't always have a unique ID at hand to retrieve the specific patient from the database.
• side information typically : name, first name, date of birth, address.
• this side information can be corrupted (and is difficult to avoid) : errors are made when the information is being stored in the system, typically typing errors a lot of persons do not have an exact spelling of their names (typically persons whose written language is not in western characters) in Arabic culture, only a year of birth is known, these persons are attributed the first of January as day and month of birth, consequentially making a patient search becomes difficult address is subjected to change
• An embodiment of the appointment scheduling system of the present invention provides a solution to this problem for the cases where patients : receive regularly appointments, e.g. in case of hospitalised patients and patients undergoing therapy - call back to modify their existing appointment (s) in some way
• the appointment scheduling system is designed so that all objects that can be selected and with which a certain action is performed, are queued in a history list, which is stored on the server for each individual user. During start up of the application, the history s lists are retrieved from the server and made available to the user. Below aspects of the underlying scheduling method, more specifically of the method of generating a solution space, are described extensively.
• an appointment needs to be scheduled to s examine a patient by means of a scanner.
• the patient needs to undress before and to dress again after the scan.
• the exam itself takes 2 hours. Both for undressing and dressing one hour is provided. After the patient has undressed, he does not want 0 to wait for the exam. When the exam is finished, he accepts that he may have to wait up to one hour before he can dress again.
• Figure 4 describes the actions that are part of the appointment and the relations between them.
• the appointment (100) action comprises 5 three other actions: the undressing (110) action, the actual exam (120) action and the dressing (130) action. This comprising relationship is represented by three comprising links (190, 191, 192) between the individual actions (110, 120, 130) and the appointment (100) action.
• the appointment (100) action is called a 0 parent relative to the undressing (110) , the actual exam (120) and dressing (130) actions which are called children. Because of the parent-child relationship of a comprising link (190, 191, 192), it is not symmetrical.
• An action is defined as being "atomic" when it does not comprise other actions. For example, the undress (110) action is atomic, but the appointment (100) action is not.
• the exam (120) can only be carried out when the scanner (140) is available. This kind of relationship is represented by a relational link (183) .
• a relational link (184) also exists between the exam and the operator (150) .
• a relational link between two actions indicates that both actions can only be carried out at the same time. From this follows that such a link is by nature symmetrical and transitive. The transitivity is expressed in Fig. 4 by the dotted line (185) between the scanner and operator action.
• a procedure or exam is preceded by a pre-op action and followed by a post-op action.
• an action refers to an activity related to a resource.
• a resource can be a patient, a physician, a nurse, an operator a diagnostic or treatment apparatus, a examination or treatment room, or any other kind of resource with which an activity can be associated.
• the resource can or can not be related to the domain of healthcare.
• the activity can be the use of equipment, the presence of a person, the occupation of a facility or any other activity that refers to the use or availability of any resource.
• any topology of any number of actions related by comprising, relational or sequential links is possible.
• Figure 8 shows how with each action (100, 110, 120, 130, 140, 150, 160, 170) in Figure 4 a corresponding time window (501-507) is associated.
• a time window consists of a linked list of non — 1 -L 1 Z. -
• the linked list consists of the time segments (510, 511, 512) .
• a time window can represent the range of time when an action can potentially occur. However, a time window can also represent a range of time when the action can start or when it can end.
• the time windows (500-503) of the patient (150) , the dressing room (170) , the scanner (140) and the operator (150) are part of the problem definition data. These time windows represent constraints imposed by the corresponding resources.
• the time windows (504-507) of the undressing (110), exam (120) and dressing (130) actions and of the appointment (100) as a whole, however, are initially undetermined, as they are the subject of the solution that has to be calculated for the scheduling problem.
• An undetermined time window is represented as one contiguous time segment with the length of the time window. For example, 508 is the initial time window associated with the exam action (120) .
• the number of segments of an undetermined time window may change and the beginning and end times of the remaining time segments may become increasingly more focused, until they represent a situation that is consistent with all the constraints imposed by the resources.
• the result of processing a link involves adjusting the time segments in the time windows corresponding to the linked actions in a way that they become consistent with the constraints imposed by the corresponding resources .
• Figure 9 illustrates a number of situations for actions connected through relational links, of which the time segments occur in different relative positions (overlapping and non-overlapping) .
• the interpretation of the time windows (620-623) is that the represent the time during which the action (600-603) can take place. Since the meaning of a relational link is that the two actions (600,601) can only take place simultaneously, the effect of working out the link is that each time window (620,621) should be replaced by a time window (622,623) that consists of time segments (612,613) that are the cross sections of the time segments (610,611) in the original time windows .
• Figure 10 illustrates a number of situations for actions connected through comprising links, of which the time segments occur in different relative positions (overlapping and non-overlapping) .
• the interpretation of the time windows (700-702) is that the represent the time during which the action can take place.
• the meaning of a comprising link is that the time segments (711) of a child action (701) have to occur within the time segments (710) of the time window (720) of the parent action (700) . This is achieved by replacing the time segments (711) of the time window (721) of the child action (701) by the cross section (712) of themselves (711) with the time segments (710) of the time window (720) of the parent action (700) .
• time window of an action linked list of time segments describing when an action can take place.
• - time window of start times of an action linked list of time segments describing when said action can start;
• - time window of end times of an action linked list of time segments describing when said action can end;
• the time window of an action, the time window of start times of the same action and the time window of end times of that same action are interrelated.
• a time window (921) representing start times (911) of an action is calculated from a corresponding time window (920) representing said action, by subtracting from the end times of the time segments (910) in the latter time window (920) the duration (930) of said action.
• a time window (821) representing end times is of an action is calculated from a corresponding time window (820) representing said action, by adding to the start times of the time segments (810) in the latter time window (820) the duration (830) of the action.
• time windows representing start times and end times of an action are also interrelated by shifting the start and end times in the time segments by the duration of the action.
• a first restriction involves the start times of a following action in order to achieve that that the start times of a following action can never be earlier than the earliest end time of any of the preceding actions.
• this effect is achieved by replacing the time segments (813) of the start times (823) of the following action (802) by the cross section (814) between themselves (813) and the time segments (811) of the end times (821) of the preceding action (800) .
• a second restriction involves the end times of the preceding action in order to achieve that the end times of a preceding action can never be later than the latest start times of any of the following actions.
• this effect is achieved by replacing the time segments (913) of the end times (923) of the preceding action (902) by a cross section (914) between themselves (913) and the time segments (911) of the start times (921) of the following action (900) .
• the end times of the time segments of the preceding action are preferably extended by the maximum allowed slack time, prior to applying said first restriction.
• the time window (1020) of the preceding action (1000) is used to calculate the time window (1021) of the end times (1001) of the preceding action (1000) by shifting the start times of the time segments (1010) forward by the duration (1030) of the preceding action (1000) .
• the segments (1011) of the time window (1021) of the end times (1001) of the preceding action are extended by the maximum slack time (1040) to yield the time segments (1012) of the time window (1022) of the end times (1002) of the preceding action plus the slack time.
• the end times of the segments (1013) of the time window (1023) of the following action (1003) are shifted backwards by the duration (1050) of the following action (1003) .
• the segments (1015) of the time window (1025) of the start times of the following action (1005) are obtained by making the cross section between the time segments (1012) and the time segments (1014) .
• the problem that has to be resolved is finding the time window representing the start time(s) for the exam.
• a first step consists of working out the relational links in Figure 4. Referring to Figure 14, this is done by using the general principles according to the current invention that were earlier explained by- means of Figure 9.
• relational links can be worked out between the exam, the operator and the scanner.
• the graph in Figure 4 can be reduced to the one in Figure 5, with the notion that he time windows associated with the appointment and the exam actions are not the original ones, but the ones that were obtained from the previous step.
• a second step consists of working out the comprising links in the graph in Figure 5.
• this is achieved by processing the time segments in the time windows of the undress, exam and dress actions so that they fall within the time segments of the time window of the appointment action. This is demonstrated in Figure 16A, 16B and 16C using the general principles of the current invention that were earlier explained by means of Figure 10.
• the third step consists of working out the constraints imposed by the sequential links.
• the exam action is preceded and followed by another action. According to one aspect of the current invention, this has implications on start and end times of the time segments of the corresponding time windows. Referring to Figure 17, the start times (1310) of the exam should never be earlier than the earliest end times (1307) of the undress action, and the end times (1303) of the exam including slack time should never be later than the latest start times (1301) of the dressing action, according to the general principles that were earlier explained by means of Figure 11, 12 and 13.
• an inductive logic method is used to control the processing of the time windows as opposed to deductive logic.
• deductive logic starts with variables of which the values are known (called “the hypotheses”) and deduces step by step according to a predefined flow the value of the variable for which a solution is sought (called the “final conclusion”) .
• This processing occurs through the calculation of the value of intermediate values (called “intermediate conclusions”).
• deductive logic In deductive logic, the information processing flow itself is the subject of the programming and as a result, once it has been programmed, it is fixed. Therefore, deductive logic programming is efficient for those problems of which the taxonomy of relations between variables is fixed, and only the values of the hypotheses are subject to change.
• Hl, H2 and H3 are the basic hypotheses. Processing (151) the hypothesis H2 results in the intermediate conclusion Cl. Processing (152) the conclusion Cl and the hypothesis Hl results in the intermediate conclusion C2. Processing (153) the conclusion C2 and the hypothesis H3 then leads to the final conclusion C3.
• the entry point for an inductive logic method according to the current invention is the final conclusion itself of which the value is initially unknown.
• the data of the hypotheses is first gathered and then systematically processed to o calculate the final conclusion.
• An inductive step to calculate an (intermediate) conclusion comprises determining what other variables are needed to calculate said (intermediate) conclusion. There are two possibilities: s 1) Either the values of the variables that are needed are known because they are either hypotheses or intermediate conclusions of which the value has been earlier determined; in that case the variables can be processed to obtain the (intermediate) conclusion. o 2) Or at least one of the variables that are needed is an intermediate conclusion of which the value has not been determined yet; in that case this (intermediate) conclusion initiates a new inductive step.
• the subject of the programming in an inductive logic method is not a deductive information processing flow, but a rule set that manages the inductive steps.
• Developing a rule set for an inductive method involves determining: 0 1) the nature (classes) of the variables (intermediate conclusions) that are needed to calculate a conclusion; 2) for each nature (class) of a variable (intermediate conclusion) determining what kind of processing on what other variables (other intermediate conclusions or hypotheses) is 5 needed to calculate the result of said (intermediate) conclusion.
• the problem definition now not only states the values of the hypothesis, but also the taxonomy of the relations between the variables. This allows for far greater flexibility when solving problems that have different taxonomies of relations between variables.
• FIG. 19 An example of using an inductive logic method is presented in Figure 19.
• the entry point is a call to calculate the value of the variable C3.
• the rule set dictates that the variable C3 requires the processing of two other variables being H3 , of which the value is known since it is a hypothesis, and the intermediate conclusion C2 , of which the value at this point is unknown. The latter causes a new inductive step to calculate the unknown variable C2.
• the rule set dictates that the variable C2 requires the processing of two other variables Hl, of which the value is known since it is a hypothesis, and of the intermediate conclusion Cl, of which the value at this point is unknown.
• the latter causes a new inductive step to calculate Cl.
• the rule set dictates that the variable Cl requires the processing of the variable H2 , of which the value is known. This results in the processing of H2 to obtain Cl. Now that Cl is known, this results in the processing of Cl and Hl to calculate C2. Now that C2 is known, this results in the processing of C2 and H3 to calculate the
• the solution of the scheduling problem stated in the above example is preferably carried out by using an inductive logic method.
• the inductive logic is managed by a set of three rules: a first rule dictates that obtaining the value of a variable of the type "start times of an action” requires the processing of the value of the "end times of that action” and the value of “the previous action” . - a second rule dictates that obtaining the value of a variable of the type “action” requires the processing of the values of the "parent actions” and the “related actions” . a third rule dictates that obtaining the value of a variable of the type "end times of an action” requires the processing of that same “action", the “slack time” and “the following action” .
• the method according to the current invention processes time windows and results in a time window that generally comprises a plurality of time segments, each one indicating a single solution of when the corresponding action can take place (or start) .
• the method hence produces not just one solution for the scheduling problem, as in the prior art, but a complete set of solutions also called a solution space .
• the method according to the current invention can be used for any resource scheduling and management problem that can be modelled as a set of actions corresponding to resources that are related by a combination of comprising, relating and sequential links and slack time .
• the method starts by instantiating a variable start times exam, which is the final conclusion of the scheduling problem.
• IS2 first one
• IS3 second one
• a computer comprises a network connection means (1750, a central processing unit (1760) and memory means (1770) which are all connected through a computer bus (1790) .
• the computer typically also has a computer human interface for inputting data (1710, 1720) and a computer human interface for outputting data (1730) .
• the computer program code is stored on a computer readable medium such as a mass storage device (1740) or a portable data carrier (1790) which is read by means of a portable data carrier reading means (1780) .

Landscapes

• Business, Economics & Management (AREA)
• Human Resources & Organizations (AREA)
• Engineering & Computer Science (AREA)
• Strategic Management (AREA)
• Entrepreneurship & Innovation (AREA)
• Operations Research (AREA)
• General Business, Economics & Management (AREA)
• Marketing (AREA)
• Data Mining & Analysis (AREA)
• Quality & Reliability (AREA)
• Tourism & Hospitality (AREA)
• Physics & Mathematics (AREA)
• Economics (AREA)
• General Physics & Mathematics (AREA)
• Theoretical Computer Science (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Medical Treatment And Welfare Office Work (AREA)
• User Interface Of Digital Computer (AREA)
• Digital Computer Display Output (AREA)

Priority Applications (4)

Applications Claiming Priority (6)

Publications (1)

Family

ID=41017213

Family Applications (1)

Country Status (6)

Families Citing this family (9)

Family Cites Families (10)

• 2006
  • 2006-02-17 WO PCT/EP2006/060040 patent/WO2006094886A2/en not_active Ceased
  • 2006-02-17 EP EP06708331A patent/EP1866853A1/en not_active Withdrawn
  • 2006-02-17 JP JP2007557460A patent/JP2008532152A/ja active Pending
  • 2006-02-17 CN CN2006800151306A patent/CN102089774A/zh active Pending
  • 2006-02-17 RU RU2007136604/09A patent/RU2007136604A/ru not_active Application Discontinuation
  • 2006-02-17 US US11/817,646 patent/US20090112679A1/en not_active Abandoned

Also Published As

Similar Documents

Legal Events