Method and apparatus for assigning a plurality of work projects

• US 5,913,201 A
• Filed: 03/31/1997
• Issued: 06/15/1999
• Est. Priority Date: 04/30/1991
• Status: Expired due to Term

• Current Assignee: GTE Laboratories Incorporated (Lumen Technologies, Inc.)
• Original Assignee: GTE Laboratories Incorporated (Lumen Technologies, Inc.)
• Inventors: Kocur, George A.
• Primary Examiner(s): Thomas, Joseph
• Application Number:
  US08/828,867
• Time in Patent Office: 806 Days
• Field of Search: 705/9, 705/8, 705/7, 705/11, 705/10, 705/32, 345/963, 364/468.06, 364/468.07, 364/468.08, 434/108
• US Class Current: 705/7.17
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/063116 Schedule adjustment for a person or group
• CPC Class Codes: G06Q 10/063118 Staff planning in a project environment
• CPC Class Codes: G06Q 10/1091 Recording time for administrative or management purposes

Abstract

An apparatus and computerized method of assigning workers to a plurality of work-projects, utilizing linear programminig is disclosed. The linear programming formulations forecast the adequacy of the workforce, assigning workers so as to maximize scheduling of appointments while minimizing the aggregate travel time of workers to reach the work-project sites.

Claims

1. A computer implemented method for assigning a plurality of work-projects to be performed by a plurality of workers, each work-project having specified requirements for completion of the work-project and each worker having associated therewith specified capabilities for performing said work-projects, said method comprising the steps of:

(a) receiving on a computer both actual and forecast work-project data identifying a work-project j, including the skill requirements required for said work-project, and a time-commitment for completing said work-project,

(b) receiving on a computer worker data identifying a worker i, including skill set for said worker and the hours available h(i) for said worker,

(c) producing on a computer a first assignment of a work-project using linear programming to one of said workers by matching the skill requirements of each actual and forecast work-project with the skill set for said worker, and limiting the hours of said worker i to less than or equal to h(i),

(d) deferring each work-project not assigned in step (c),

(e) producing a second assignment of a work-project to a worker by matching the skill requirements of each actual work-project with the skill set for each worker, and limiting the hours of each worker i to less than or equal to h(i),

(f) deferring each work-project not assigned in step (e),

(g) assigning using linear programming each work-project not deferred in step (f) to one of said workers, by matching the skill requirement of a work-project to the skill set of said worker, limiting the hours of said worker i to less than or equal to h(i), minimizing the aggregate travel time for said worker to reach the site of each work-project, and ignoring work-project time-commitments, producing a third assignment of work-projects to said worker,

(h) ordering by time the third assignment of work-projects of step (g) for each worker,

(i) comparing the time-commitment of each work-project to the ordering by time of step (h), and selecting those work-projects whereby the time-commitment has been exceeded, and

(j) correcting the assignment of a work project selected in step (i).

2. The method of claim 1 wherein work-project data further includes,

a specified priority p(j) for accomplishing a work-project j,

a standard work time for SWT(j) for each work-project i.

3. The method of claim 2 wherein the worker data further includes,

the expected hours to be worked x(i,j) by worker i on work-project j.

4. The method of claim 3 wherein step (c) further comprises the step of,

maximizing the value of the expression ##EQU13## subject to the constraints ##EQU14##

5. The method of claim 1 wherein step (g) further comprises the steps of, determining a travel time (t(i,j)) for a worker i to travel to work-project j,

minimizing the value of the expression ##EQU15## subject to the constraints ##EQU16##

6. An automated machine apparatus for assigning a plurality of work-projects to be performed by a plurality of workers, each work-project having specified requirements for completion of the work-project and each worker having associated therewith specified capabilities for performing said work-projects, said apparatus comprising:

(a) means for receiving both actual and forecast work-project data identifying a work-project j, including the skill requirements required for said work-project, and a time-commitment for completing said work-project,

(b) means for receiving worker data identifying a worker i, including skill set for said worker and the hours available h(i) for said worker,

(c) a first linear programming means for producing a first assignment of a work-project to a worker by matching the skill requirements of each actual and forecast work-project with the skill set for each worker, and limiting the hours of each worker i to less than or equal to h(i),

(d) means for deferring each work-project not assigned in step (c),

(e) a second linear programming means for producing a second assignment of a work-project to a worker by matching the skill requirements of each actual work-project with the skill set for each worker, and limiting the hours of each worker i to less than or equal to h(i),

(f) means for deferring each work-project not assigned in step (e),

(g) a third linear programming means for assigning each work-project not deferred in step (f) to a worker, by matching the skill requirement of a work-project to the skill set of a worker, limiting the hours of each worker i to less than or equal to h(i), minimizing the aggregate travel time for said worker to reach the site of each work-project, ignoring work-project time-commitments, and producing a third assignment of work-projects to each worker,

(h) means for ordering by time the third assignment of work-projects of step (g) for each worker,

(i) means for comparing the time-commitment of each work-project to the ordering by time of step (h), and selecting those work-projects whereby the time-commitment has been exceeded,

(j) means for correcting the assignment of a work project selected in step (i).