QUADRAT Patent applications |
Patent application number | Title | Published |
20090313038 | Method for Processing a Link of Time Segments - A set of linked lists of time segments represent the actions of resources that are input of a time scheduling system. A system and method are described that operate on said linked list and that produce a solution that meets the constraints imposed by the actions of said resources. The method is described in the context of appointment scheduling systems for medical institutions, where appointments need to be scheduled for patients, taking into account a multitude of constraints such as the availability of staff, equipment, facilities and of the patient himself . | 12-17-2009 |
20090276278 | Method for Processing a Linked List of Time Segments - An appointment scheduling method and associated user interface wherein an overview of appointments of a patient, an overview of the agendas of involved resources and details on an instantiated appointment are displayed on a single screen permitting verification and confirmation of an instantiated appointment by the user. | 11-05-2009 |
20090276277 | Optimized Appointment Scheduling Method - An appointment scheduling method wherein available time slots for an appointment are ranked according to the result of a balancing of importance factors adhered by an enterprise to weights associated with the available time slots such as efficiency of use of resources, urgency of examination, financial impact etc. | 11-05-2009 |
20090112679 | Appointment Scheduling Method and User Interface - An appointment scheduling method and associated user interface wherein the risk of errors is decreased by displaying in different linked screens identification data of the patient and/or resource to which an action to be performed in the scheduling procedure, pertains. | 04-30-2009 |
20080250416 | Linking of Scheduling Systems for Appointments at Multiple Facilities - Scheduling systems for scheduling appointments on multiple sites need to be linked, if such systems use different databases. The activity to be performed by the performing site during the appointment may be given by a requesting code, specific for the requesting site. If the activity can be performed at the requesting site, i.e. the requesting site and the performing site are identical, then this “requesting code” may define that one or more resources are required for performing the scheduled appointment at the requesting site. The availability of these resources can be fetched from one or more databases coupled to the requesting site. If the performing site is different from the requesting site, the requesting code used at the performing site for the activity may be different from the requesting code used at the requesting site, and different resources may be requested by the performing site. The availability of these different resources may be stored in one or more databases, different from the databases for resources at the requesting site. In the latter case, both the requesting site and the performing site keep records of the scheduled appointment e.g. in a respective database. If a person, for whom the appointment is made, is known at the requesting or performing site or both, person occupation checking may be done at either site or both. | 10-09-2008 |
20080222541 | Method and User Interface For Managing and Displaying Solutions For Multiple Resources in an Appointment Scheduling System - A solution space is computed and stored which comprises for a given set of constraints all possible solutions for all available resources of a certain kind. Upon selection of a specific resource, the solution space is filtered to select all possible combinations containing the specific resource and the result of the filtering is displayed. | 09-11-2008 |