A portion of the disclosure of this patent document and its figures contain material subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, however, the copyright owner otherwise reserves all copyrights whatsoever.
1. Field of the Invention
This invention generally relates to computers and to telecommunications and, more particularly, to methods and systems for assigning multiple tasks to one or more technicians when repairing a telecommunications network.
2. Description of the Related Art
When a telecommunications network requires repair, technicians are currently assigned based upon schedule, turf, and skills. The current Integrated Dispatch System analyzes a technician's work schedule and the estimated time to complete a task. The Integrated Dispatch System, for example, analyzes the technician's work schedule and determines how much available time the technician can work. Once the technician's schedule is known, the Integrated Dispatch System then searches for tasks that match the technician's skill level and turf. Lastly, the Integrated Dispatch System then selects a task that can be completed within the technician's available time. The Integrated Dispatch System repeats this process to determine the most efficient assignment of tasks.
An example provides further illustration. Assume the Integrated Dispatch System has three pending tasks (or “jobs”). Each of these three pending jobs is estimated to require three hours to complete (e.g., each job has a three hour “duration”). So, the Integrated Dispatch System has nine hours of work to assign. If the technician works an eight-hour day, the Integrated Dispatch System cannot assign all three jobs to a single technician—the amount of work exceeds the technician's available work time. The technician only receives two jobs, for a total of six hours of work. So, even though the technician works an eight-hour day, the Integrated Dispatch System is constrained and can only assign six hours of work. The Integrated Dispatch System is thus forced to inefficiently assign jobs.
The problem is that the estimated completion times are really averages. Each task has an average time for completion. Sometimes the task requires more than the average time, and sometimes the task requires less than the average time. So, in the above example, even though the technician may be able to complete all three tasks in an eight-hour day, the current Integrated Dispatch System is forced to inefficiently assign tasks based upon the average completion time.
There is, accordingly, a need in the art for an Integrated Dispatch System that permits assigning multiple tasks to a technician, a need for methods and systems that assign tasks independent of a technician's work schedule, and a need for methods and systems that assign tasks independent of the duration of the tasks.
The aforementioned problems are reduced by an enhanced Integrated Dispatch System. This enhanced Integrated Dispatch System comprises computer programs and computer systems for dispatching work orders for the repair of a telecommunications system. This invention allows multiple tasks to be assigned to one or more technicians. As the telecommunications network needs repair, the present invention allows more than one task to be assigned to each technician. This enhanced Integrated Dispatch System assigns tasks (or “jobs”) independent of the technician's work schedule. This enhanced Integrated Dispatch System also assigns tasks independent of the estimated time for completion of the task. A user of this enhanced Integrated Dispatch System can assign multiple tasks to one technician or to a group of technicians. The user can specify how many tasks get assigned, and the user can even specify how many tasks should be completed by a predefined time. The enhanced algorithm more efficiently assigns tasks and, thus, allows more tasks per day. Because this invention permits more repairs per day, this invention, therefore, also improves customer satisfaction with their telecommunications service.
One aspect of this invention describes a method for assigning multiple tasks to a technician. The Integrated Dispatch System allows a user to interface and assign multiple tasks to multiple technicians. Each task describes provisioning or repair of a telecommunications network. The method displays a graphical user interface on a computer, and the graphical user interface indicates the assignment of the multiple tasks.
Still another embodiment describes a computer system for assigning multiple tasks to multiple technicians. The system has the Integrated Dispatch System stored in a memory device. The Integrated Dispatch System manages the dispatch of work orders in a telecommunications network. The Integrated Dispatch System allows a user to assign multiple tasks to at least one technician. Each task describes a repair of the telecommunications network. A processor communicates with the memory device.
These and other features, aspects, and advantages of this invention are better understood when the following Detailed Description of the Invention is read with reference to the accompanying drawings, wherein:
The central processor 30 is typically a microprocessor. Advanced Micro Devices, Inc., for example, manufactures a full line of microprocessors, such as the ATHLON™ (ATHLON™ is a trademark of Advanced Micro Devices, Inc., One AMD Place, P.O. Box 3453, Sunnyvale, Calif. 94088-3453, 408.732.2400, 800.538.8450, www.amd.com). Sun Microsystems also designs and manufactures microprocessors (Sun Microsystems, Inc., 901 San Antonio Road, Palo Alto Calif. 94303, www.sun.com). The Intel Corporation manufactures microprocessors (Intel Corporation, 2200 Mission College Blvd., Santa Clara, Calif. 95052-8119, 408.765.8080, www.intel.com). Other manufacturers also offer microprocessors. Such other manufacturers include Motorola, Inc. (1303 East Algonquin Road, P.O. Box A3309 Schaumburg, Ill. 60196, www.Motorola.com), International Business Machines Corp. (New Orchard Road, Armonk, N.Y. 10504, (914) 499-1900, www.ibm.com), and Transmeta Corp. (3940 Freedom Circle, Santa Clara, Calif. 95054, www.transmeta.com). Those skilled in the art further understand that the program, processes, methods, and systems described in this patent are not limited to any particular manufacturer's central processor.
The preferred operating system is a UNIX®-based system (UNIX® is a registered trademark of The Open Group, 44 Montgomery Street, Suite 960, San Francisco, Calif. 94104, 415.374.8280, www.opengroup.org). Other operating systems, however, are also suitable. Such other operating systems would include WINDOWS® (WINDOWS® is a registered trademark of Microsoft Corporation, One Microsoft Way, Redmond Wash. 98052-6399, 425.882.8080, www.Microsoft.com). WINDOWS NT®, and Mac® OS (Mac® is a registered trademark of Apple Computer, Inc., 1 Infinite Loop, Cupertino, Calif. 95014, 408.996.1010, www.apple.com). Those of ordinary skill in the art again understand that the program, processes, methods, and systems described in this patent are not limited to any particular operating system.
The system memory device (shown as memory subsystem 24, flash memory 26, or peripheral storage device 28) may also contain an application program. The application program cooperates with the operating system and with a video display unit (via the serial port 46 and/or the parallel port 48) to provide a Graphical User Interface (GUI). The Graphical User Interface typically includes a combination of signals communicated along the keyboard port 42 and the mouse port 44. The Graphical User Interface provides a convenient visual and/or audible interface with a user of the computer system 22.
Once the user highlights the technicians to be assigned, the user then selects what days the technicians will be assigned multiple tasks.
The user then selects the “Edit Schedule” control button 82 using the touch-sensitive device. The Integrated Dispatch System responds and causes the technician scheduler graphical user interface 70 to present tabs “Schedule,” “Skills,” “Turfs,” and “Other” (shown, respectively, as reference numerals 84, 86, 88, and 90). As
Once the “Number Bulk Tech Processing” attribute 104 is activated, the user can specify how the multiple tasks are assigned. The user, for example, may specify a quantity of tasks to be assigned to one or more technicians, and the user may further specify the quantity of tasks to be completed by a predefined time. As
The “Number Bulk” attribute 104 assigns multiple tasks to each technician. The “Number Bulk” attribute, for example, assigns the specified number of tasks (or “jobs”), for each category (represented by data fields 106, 108, 110, and 112), to each technician with the “Number Bulk” attribute (e.g., list 72 of technicians shown in
When multiple tasks are assigned, the multiple tasks may have a similar or common characteristic. One or more technicians, for example, may be assigned multiple tasks having similar skills. The term “skills” describes one or more qualifications for repairing or for provisioning a telecommunications network. A technician could be assigned multiple tasks occurring within a single turf or a range of turfs. The term “turf,” as used herein, denotes a geographic area within a telecommunications network. A turf could be a territory, a wire center, the boundary of one or more wire centers, or a portion of a wire center. A turf could be a composite of geographic areas, and the geographic areas may or may not be contiguous. A technician could also be assigned multiple tasks all having the same job type (e.g., buried service wires), or the technician could be assigned multiple tasks having a range of job types. Certain tasks could even be excluded from the multiple tasks, such as any jobs outside a technician's turfs or beyond a technician's skills. The multiple tasks could be assigned by geographic area, such as when a group of technicians are assigned all tasks occurring in a particular subdivision.
Once the “by noon” and the “after noon” data fields are defined, the “Number Bulk Tech Processing” attribute 104 is applied. The user selects an “Apply” control button 116, and an “OK” control button 118 closes the number bulk tech graphical user interface 98. Now that the “Number Bulk” process is defined, the Integrated Dispatch System determines the most efficient provisioning and/or repair of the telecommunications network. As work orders are generated, the Integrated Dispatch System dynamically reviews the list 72 of selected “Number Bulk” technicians, their turfs, and their skill levels. The Integrated Dispatch System then tries to determine the most efficient and multiple work order assignments for the quickest, most economical dispatch.
The flowchart continues with
The Integrated Dispatch System (shown as reference numeral 20 in
While the present invention has been described with respect to various features, aspects, and embodiments, those skilled and unskilled in the art will recognize the invention is not so limited. Other variations, modifications, and alternative embodiments may be made without departing from the spirit and scope of the present invention.
Number | Name | Date | Kind |
---|---|---|---|
2909128 | Keen | Oct 1959 | A |
3304416 | Wolf | Feb 1967 | A |
3500557 | White | Mar 1970 | A |
3571949 | Gormley | Mar 1971 | A |
3780695 | Richard | Dec 1973 | A |
4937743 | Rassman et al. | Jun 1990 | A |
5111391 | Fields et al. | May 1992 | A |
5125513 | Branch | Jun 1992 | A |
5467268 | Sisley et al. | Nov 1995 | A |
5634055 | Barnewall et al. | May 1997 | A |
5682421 | Glovitz et al. | Oct 1997 | A |
5726884 | Sturgeon et al. | Mar 1998 | A |
5881131 | Farris et al. | Mar 1999 | A |
5887243 | Harvey et al. | Mar 1999 | A |
5920846 | Storch et al. | Jul 1999 | A |
5943652 | Sisley et al. | Aug 1999 | A |
5999908 | Abelow | Dec 1999 | A |
5999990 | Sharrit et al. | Dec 1999 | A |
6049776 | Donnelly et al. | Apr 2000 | A |
6085166 | Beckhardt | Jul 2000 | A |
6169517 | Eslambolchi et al. | Jan 2001 | B1 |
6272457 | Ford et al. | Aug 2001 | B1 |
6349238 | Gabbita et al. | Feb 2002 | B1 |
6578005 | Lesaint et al. | Jun 2003 | B1 |
6611751 | Warren | Aug 2003 | B2 |
6662194 | Joao | Dec 2003 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6873949 | Hickman et al. | Mar 2005 | B2 |
6879962 | Smith et al. | Apr 2005 | B1 |
6985872 | Benbassat et al. | Jan 2006 | B2 |
6990458 | Harrison et al. | Jan 2006 | B2 |
7003475 | Friedland et al. | Feb 2006 | B1 |
7013284 | Guyan et al. | Mar 2006 | B2 |
7107285 | Von Kaenel et al. | Sep 2006 | B2 |
7212985 | Sciuk | May 2007 | B2 |
7340037 | Jean et al. | Mar 2008 | B1 |
7346531 | Jacobs | Mar 2008 | B2 |
7437727 | Leong et al. | Oct 2008 | B2 |
20010021910 | Goldstein | Sep 2001 | A1 |
20010042001 | Goto et al. | Nov 2001 | A1 |
20010051905 | Lucas | Dec 2001 | A1 |
20020007289 | Malin et al. | Jan 2002 | A1 |
20020010610 | Jacobs et al. | Jan 2002 | A1 |
20020010614 | Arrowood | Jan 2002 | A1 |
20020010615 | Jacobs | Jan 2002 | A1 |
20020022984 | Daniel et al. | Feb 2002 | A1 |
20020029160 | Thompson et al. | Mar 2002 | A1 |
20020029161 | Brodersen et al. | Mar 2002 | A1 |
20020032028 | Kaupe | Mar 2002 | A1 |
20020035460 | Hales | Mar 2002 | A1 |
20020040313 | Hunter et al. | Apr 2002 | A1 |
20020054082 | Karpf | May 2002 | A1 |
20020072956 | Willems et al. | Jun 2002 | A1 |
20020073114 | Nicastro et al. | Jun 2002 | A1 |
20020181685 | Doherty et al. | Dec 2002 | A1 |
20020188488 | Hinkle | Dec 2002 | A1 |
20030018509 | Ossip et al. | Jan 2003 | A1 |
20030033184 | Benbassat et al. | Feb 2003 | A1 |
20030144892 | Cowan et al. | Jul 2003 | A1 |
20030182348 | Leong et al. | Sep 2003 | A1 |
20030204431 | Ingman | Oct 2003 | A1 |
Number | Date | Country |
---|---|---|
08044799 | Feb 1996 | JP |
10143557 | May 1998 | JP |
Number | Date | Country | |
---|---|---|---|
20040111313 A1 | Jun 2004 | US |