Patents by Inventor Ian S Alletson

Ian S Alletson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7210119
    Abstract: Tasks (T) such as repair jobs on a telecommunications system, that are to be performed by a plurality of resources such as field engineers (E), at different locations in a geographical area (2), are scheduled by means of a scheduler (10) at a work manager server (5). The scheduler provides schedule data (11) corresponding to schedules of the tasks that individual ones of the resources are to carry out, from task data (4) concerning the tasks to be carried out and resource data (6) concerning characteristics of resources available to carry out the tasks over a given period. Not all the tasks are scheduled, resulting in unscheduled task data (11a). The schedule data (11) is downloaded to a workstation (7) together with the unscheduled task data. The downloaded data is analysed at the workstation to determine a candidate resource (E) to perform the task (T) corresponding to the unscheduled task data.
    Type: Grant
    Filed: March 1, 2001
    Date of Patent: April 24, 2007
    Assignee: @Road, Ltd.
    Inventors: Dionisios Pothos, Robert N W Laithwaite, Ian S Alletson
  • Patent number: 7082605
    Abstract: Tasks (T) such as repair jobs on a telecommunications system, that are to be performed by a plurality of resources such as field engineers (E), at different locations in a geographical area (2), are scheduled by means of a scheduler (10) at a work manager server (5). The scheduler provides schedule data (11) corresponding to schedules of the tasks that individual ones of the resources are to carry out, from task data (4) concerning the tasks to be carried out and resource data (6) concerning characteristics of resources available to carry out the tasks over a given period. The scheduled tasks are provided with associated contingency values (C) which are each computed as a function of the difference between the time that a task is scheduled to start and the latest start time that is feasible for the task . The schedule data (11) is downloaded to a workstation (7).
    Type: Grant
    Filed: March 1, 2001
    Date of Patent: July 25, 2006
    Assignee: Vidus Limited
    Inventors: Ian S Alletson, Dionisios Pothos, Robert NW Laithwaite, Geoff Lowndes
  • Patent number: 6578005
    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.
    Type: Grant
    Filed: March 19, 1998
    Date of Patent: June 10, 2003
    Assignee: British Telecommunications public limited company
    Inventors: David Lesaint, Christos Voudouris, Nader Azarmi, Robert N. W. Laithwaite, John J O'Donoghue, Andrew P Noble, Paul Walker, Ian S Alletson
  • Publication number: 20030050065
    Abstract: Tasks m such as repair jobs on a telecommunications system, that are to be performed by a plurality of resources such as field engineers (E), at different locations in a geographical area (2), are scheduled by means of a scheduler (10) at a work manager server (5). The scheduler provides schedule data (11) corresponding to schedules of the tasks that individual ones of the resources are to carry out, from task data (4) concerning the tasks to be carried out and resource data (6) concerning characteristics of resources available to carry out the tasks over a given period. The scheduled tasks are provided with associated contingency values (C) which are each computed as a function of the difference between the time that a task is scheduled to start and the latest start time that is feasible for the task . The schedule data (11) is downloaded to a workstation (7).
    Type: Application
    Filed: September 19, 2002
    Publication date: March 13, 2003
    Inventors: Ian S Alletson, Dionisios Pothos, Robert NW Laithwaite
  • Publication number: 20030041087
    Abstract: Tasks (T) such as repair jobs on a telecommunications system, that are to be performed by a plurality of resources such as field engineers (E), at different locations in a geographical area (2), are scheduled by means of a scheduler (10) at a work manager server (5). The scheduler provides schedule data (11) corresponding to schedules of the tasks that individual ones of the resources are to carry out, from task data (4) concerning the tasks to be carried out and resource data (6) concerning characteristics of resources available to carry out the tasks over a given period. Not all the tasks are scheduled, resulting in unscheduled task data (11a). The schedule data (11) is downloaded to a workstation (7) together with the unscheduled task data. The downloaded data is analysed at the workstation to determine a candidate resource (E) to perform the task (T) corresponding to the unscheduled task data.
    Type: Application
    Filed: September 19, 2002
    Publication date: February 27, 2003
    Inventors: Dionisios Pothos, Robert Laithwaite, Ian S Alletson