Abstract: A modeling tool for building a model of a problem involves a plurality of variables, whereby a heuristic search method can be carried out to optimize a solution for the modeled problem. The model of a problem includes a plurality of expressions defined as corresponding to one or more declarative statements and at least some of the expressions are dependent on at least one of the variables. The problem modeling tool can include automatically updating each declarative statement in response to changes to each variable associated therewith.

Abstract: The invention relates to resource management, and describes a method and apparatus to be used in planning of resource deployment. In an embodiment of the invention, the number and characteristics of forecasted and/or unprocessed jobs falling within a time period such as a week, or a month, are compared to resource availability and status for that time period, in terms of attributes such as location, skills and time. A cost—in terms of jobs that cannot be carried out, given current resource availability and status—is evaluated. Preferably the attributes are stored as resource records, so that there is one resource record per resource, and the attributes of at least some of the resource records are modified using a heuristic search means or similar. The resource records are modified until a minimum cost is identified, and these resource records can then be used to formulate successive capacity plans, which can be input to a scheduling system.

Abstract: The invention provides methods and systems for assisting in the redistribution of resources between entities each having sets of tasks which must be performed, pools of resources for performing tasks, and a manager capable of reviewing the tasks and the resources of the entity and determining therefrom surplus resources not required for the performance of the tasks of that entity, and sought-after resources required for the performance of tasks not able to be met by the resources of that entity. The method comprises: receiving offers of surplus resources and requests of sought-after resources from each entity; subjecting received offers and requests to an optimisation procedure to determine a set of matched pairs, each pair comprising an offer received from an entity and a request received from another entity, said offer and request having corresponding characteristics; and communicating information relating to matched pairs to the respective entities.

Abstract: In a multi-modal user interface, user inputs may be made in various different ways. For instance, the user might use a keyboard, a speech system, a vision system, a mouse or pen. Different inputs made by the user may be related and may have different significance. A processing system detects and resolves ambiguities and/or conflicts in inputs made by the user using the different input modes available.

Abstract: The present invention is concerned with a system for building at least one algorithm to apply to an optimisation problem in order to find a solution to the problem, where the or each algorithm comprises a plurality of components.

Abstract: This invention concerns a problem modelling tool for building a model of a problem that involves a plurality of variables, whereby a heuristic search method can be carried out to optimise a solution for the modelled problem, and wherein the model of a problem comprises a plurality of expressions defined as corresponding one or more declarative statements and at least some of the expressions are dependent on at least one of said variables. In embodiments of the invention, the problem modelling tool includes means for automatically updating the, or each, declarative statement in response to changes to the or each variable associated therewith.

Abstract: A plurality of resources, typically service operatives, are allocated to a plurality of tasks by a method in which initial information relating to the tasks to be allocated and the resources available to perform the tasks is provided. An initial series of schedules is first generated allocating resources to the tasks, and then modifying the individual schedule of at least one resource in response to updated information. Changes to individual schedules may be made in response to such updated information independently of the schedule generation. The initial, series of schedules may be generated in a two-stage process in which a rule-based system allocates tasks selected as being difficult to allocate (e.g., because they are linked to other tasks). then a stochastic (non-systematic) search system compiles the rest of the schedule.

Abstract: Call pattern data is generated for scheduling calls between a number of sites connected to a communication network. The call pattern data defines instructions for a number of sites to make a number of connections across the network to other sites over a predetermined period. This is achieved by creating a list of calls to be scheduled and then assigning in turn each of the calls to a source and a destination site. The source site and destination site are selected to satisfy one or a number of call constraint criteria associated with each call. The call pattern data representing the call is then generated and stored on a computer storage medium for subsequent download to the sites.

Abstract: The present invention relates to a method of generating call pattern data for scheduling calls between a number of sites connected to a communication network. The call pattern data defines instructions for a number of sites to make a number of connections across the network to other sites over a predetermined period. This is achieved by creating a list of calls to be scheduled and then assigning in turn each of the calls to a source and a destination site. The source site and destination site are selected to satisfy one or a number of call constraint criteria associated with each call. The call pattern data representing the call is then generated and stored on a computer storage medium for subsequent download to the sites.