This application relates generally to the field of load balancing. More specifically, the disclosure provided herein relates to the field of dynamic workforce reallocation.
Telecommunications networks may provide a number of services, such as plain old telephone service (“POTS”), digital subscriber line (“DSL”), and cable. A telecommunications network may be divided into a plurality of geographic areas known as turfs. Maintenance of the telecommunications network generally involves a proper reallocation of technicians across the turfs such that work orders can be timely filled. For example, when one turf experiences a high volume of work orders, it may be desirable to reallocate available technicians from another, preferably nearby, turf with a low volume of work orders to help with the high volume. The reallocation of technicians may be based on a number of factors, such as the location, skills, schedule, and availability of the technicians, as well as the priority of the work orders and the amount of time to complete the work orders.
A load balance supervisor (“LBS”) may be assigned to coordinate the reallocation of technicians within a plurality of turfs (hereinafter referred to as an “assignment group”). In many instances, the LBS may not be familiar with the assignment group, which increases the difficulty of coordinating the reallocation of technicians across the assignment group. For example, the LBS may be assigned to an unfamiliar disaster area after a hurricane or a tornado. Without familiarity with the disaster area, the LBS may conventionally rely on turf maps and the advice of field supervisors to determine the most optimal locations from where to reallocate available technicians. A reliance on turf maps and manually contacting field supervisors for individual questions about the assignment group, however, may be inefficient and subject to human error.
Embodiments of the disclosure presented herein include methods, systems, and computer-readable media for determining a plurality of turfs from where to reallocate a workforce to a given turf. According to one aspect, a method for determining a plurality of turfs from where to reallocate a workforce to a given turf is provided. According to the method, an indication of the given turf is received. Optimal turfs from where to reallocate technicians to the given turf are determined from a plurality of turfs. Visual cues for identifying at least a portion of the optimal turfs are generated.
According to another aspect, a system for determining a plurality of turfs from where to reallocate a workforce to a given turf is provided. The system includes a memory and a processor functionally coupled to the memory. The memory stores a program containing code for determining a plurality of turfs from where to reallocate a workforce to a given turf. The processor is responsive to computer-executable instructions contained in the program and operative to receive an indication of the given turf, determine which of a plurality of turfs are optimal turfs from where to reallocate technicians to the given turf and generate visual cues identifying at least a portion of the optimal turfs.
According to yet another aspect, a computer-readable medium having instructions stored thereon for execution by a processor to perform a method for determining a plurality of turfs from where to reallocate a workforce to a given turf is provided. According to the method, an indication of the given turf is received. Optimal turfs from where to reallocate technicians to the given turf are determined from a plurality of turfs. Visual cues for identifying at least a portion of the optimal turfs are generated.
Other systems, methods, and/or computer program products according to embodiments will be or become apparent to one with skill in the art upon review of the following drawings and detailed description. It is intended that all such additional systems, methods, and/or computer program products be included within this description, be within the scope of the present invention, and be protected by the accompanying claims.
The following detailed description is directed to methods, systems, and computer-readable media for determining a plurality of turfs from where to reallocate a workforce to a given turf. In the following detailed description, references are made to the accompanying drawings that form a part hereof, and which are shown by way of illustration specific embodiments or examples.
As used herein, the terms “work order,” “job,” and “task” are used interchangeably. Although not so limited, embodiments described herein primarily refer to a “work order” as the maintenance and repair of a telecommunications network by a technician. However, it will be apparent to one of ordinary skill in the art that, in further embodiments, a “work order” may include any suitable service that involves the allocation and reallocation of personnel to perform the service.
Embodiments described herein provide a Next Generation Load Balance (“NGLB”) tool for work force reallocation. According to exemplary embodiments, the NGLB tool has a graphical user interface (“GUI”), such as a GUI 400 of
According to further embodiments, the NGLB tool includes a proximal turf locator, such as the proximal turf locator 216 of
Referring now to the drawings, it is to be understood that like numerals represent like elements through the several figures, and that not all components and/or steps described and illustrated with reference to the figures are required for all embodiments.
For the sake of simplicity and without limitation, only two turfs 104a and 104b and three buckets 108a, 108b, and 108c are illustrated in
The LBS 106 utilizes a computer 110 to aid in reallocating the plurality of technicians 102 across the turfs 104. The computer 110 includes a reallocation module 112, which enables the computer 110 to display a graphical user interface (“GUI”), such as the GUI 400 of
In one embodiment, the reallocation module 112 generates at least a portion of the GUI 400 based on data stored in a data storage unit 114. The data storage unit 114 may store any suitable data related to the technicians 102, such as the location, skills, schedule, and availability of the technicians 102. The data storage unit 114 may be a database. In one embodiment, the data storage unit 114 is an Integrated Dispatch System (“IDS”). The IDS is described in greater detail in U.S. Patent Application Publication No. 2004/0111311, entitled “Turfs and Skills for Multiple Technicians,” to Ingman et al.; U.S. Patent Application Publication No. 2004/0111312, entitled “Validating Turfs for Work Orders,” to Ingman et al.; U.S. Patent Application Publication No. 2004/0111313, entitled “Methods and Systems for Assigning Multiple Tasks,” to Ingman et al.; and U.S. Patent Application Publication No. 2004/0111634, entitled “Security Permissions for an Integrated Dispatch System,” to Ingman et al.
Generally, program modules include routines, programs, components, data structures, and other types of structures that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that embodiments may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. The embodiments may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
The processing unit 202 may be a standard central processor that performs arithmetic and logical operations, a more specific purpose programmable logic controller (“PLC”), a programmable gate array, or other type of processor known to those skilled in the art and suitable for controlling the operation of the server computer. Processing units are well-known in the art, and therefore not described in further detail herein.
The memory 204 communicates with the processing unit 202 via the system bus 212. In one embodiment, the memory 204 is operatively connected to a memory controller (not shown) that enables communication with the processing unit 202 via the system bus 212. According to exemplary embodiments, the memory 204 includes the reallocation module 112. In one embodiment, the reallocation module 112 is embodied in computer-readable media containing instructions that, when executed by the processing unit 202, generates a GUI, such as the GUI 400 of
As illustrated in
By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, Erasable Programmable ROM (“EPROM”), Electrically Erasable Programmable ROM (“EEPROM”), flash memory or other solid state memory technology, CD-ROM, digital versatile disks (“DVD”), or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer 110.
The user interface devices 206 may include one or more devices with which a user accesses the computer 110. The user interface devices 206 may include, but are not limited to, computers, servers, personal digital assistants, cellular phones, or any suitable computing devices. In one embodiment, the computer 110 functions as a web server located remotely from the LBS 106 by executing a web server application, such as BEA WEBLOGIC SERVER from BEA SYSTEMS. By enabling the computer 110 to function as a web server, the LBS 106 may access the GUI 400 generated by the computer 110 over a network, such as the network 214, using, for example, a local web browser interface on a PC or other computing device.
According to exemplary embodiments, the I/O devices 208 enable a user to interface with the reallocation module 112. In one embodiment, the I/O devices 208 are operatively connected to an I/O controller (not shown) that enables communication with the processing unit 202 via the system bus 212. The I/O devices 208 may include one or more input devices, such as, but not limited to, a keyboard, a mouse, and an electronic stylus. Further, the I/O devices 208 may include one or more output devices, such as, but not limited to, a display screen and a printer.
The network devices 210 enable the computer 110 to communicate with other networks or remote systems via the network 214. Examples of the network devices 210 may include, but are not limited to, a modem, a radio frequency (“RF”) or infrared (“IR”) transceiver, a telephonic interface, a bridge, a router, or a network card. The network 214 may include a wireless network such as, but not limited to, a Wireless Local Area Network (“WLAN”) such as a WI-FI network, a Wireless Wide Area Network (“WWAN”), a Wireless Personal Area Network (“WPAN”) such as BLUETOOTH, a Wireless Metropolitan Area Network (“WMAN”) such a WiMAX network, or a cellular network. Alternatively, the network 214 may be a wired network such as, but not limited to, a Wide Area Network (“WAN”) such as the Internet, a Local Area Network (“LAN”) such as the Ethernet, a wired Personal Area Network (“PAN”), or a wired Metropolitan Area Network (“MAN”).
The load balance PC 304 includes a display 306 and a mouse 308, according to one embodiment. In further embodiments, the load balance PC 304 may include any suitable input/output devices 208. It will be apparent to one having ordinary skill in the art that the load balance PC 304 may be substituted with any suitable computing device, such as a personal digital assistant or a cellular phone. The display 306 may be configured to display the GUI 400 and the plurality of turfs 104 provided by the proximal turf locator 216.
In exemplary embodiments, the load balance PC 304 includes a web browser 310, such as INTERNET EXPLORER from MICROSOFT CORPORATION, for accessing the GUI 400 and for facilitating communications between the LBS 106 and the computer 110. Using the web browser 310, the LBS 106 may access the GUI 400 by inputting a Uniform Resource Locator (“URL”) into the web browser 310. The load balance PC 304 may communicate with the computer 110 via Hypertext Transfer Protocol (“HTTP”). As previously described, the computer 110 may function as a web server. In one embodiment, access to the GUI 400 by the load balance PC 304 may be restricted by a login screen requiring, for example, a login identification and a password. In further embodiments, communications between the load balance PC 304 and the computer 110 may be encrypted by any suitable encryption mechanism.
In exemplary embodiments, the computer 110 may communicate with the data storage unit 114 via a Java Database Connectivity (“JDBC”) application program interface (“API”). In one embodiment, the computer 110 retrieves data from the data storage unit 114 at regular intervals, such as every two to five minutes. In further embodiments, the computer 110 retrieves data from the data storage unit 114 when requested by the LBS 106. In other embodiments, the reallocation module 112 may be stored on the load balance PC 304 such that the GUI 400 is accessed from the load balance PC 304 and such that the load balance PC 304 communicates with and retrieves data from the data storage unit 114.
According to exemplary embodiments, the GUI 400 includes a plurality of turfs, such as an Alabaster turf 402, a Calera turf 404, a Chelsea turf 406, a Columbiana turf 408, a Montevallo turf 410, and a Riverchase turf 412 in a Turf column 415. The GUI 400 may further include a plurality of buckets: a POTS bucket 414, a DSL bucket 416, a Cable bucket 418, a Specials bucket 420, and a Non-Demand (“ND”) bucket 422. According to exemplary embodiments, each of the buckets 414, 416, 418, 420, 422 includes four columns: an Hours column 424, a Tickets column 426, a Dispatched Technicians (hereinafter referred to as Dispatches) column 428, and a Future Tickets (hereinafter referred to as Futures) column 430. Each of a plurality of cells 432, 434, 436, 438 may be associated with a column, a bucket, and a turf. For example, the cell 432 is associated with the Hours column 424, the POTS bucket 414, and the Alabaster turf 402.
A turf, such as the Alabaster turf 402, may refer to any suitable geographic area. For example, the Alabaster turf 402 refers to the city of Alabaster, Ala. As illustrated in
According to exemplary embodiments, the POTS bucket 414 contains information related to POTS related work orders. The DSL bucket 416 contains information related to DSL related work orders. The Cable bucket 418 contains information related to cable related work orders. The Specials bucket 420 contains information related to special circuit related work orders, such as Digital Signal 1 (“DS1”) and Digital Signal 3 (“D53”). The ND bucket 422 is a catch-all bucket containing information related to work orders not categorized in the POTS bucket 414, the DSL bucket 416, the Cable bucket 418, or the specials bucket 420.
The Hours column 424 indicates the number of hours of pending and assigned work orders in each turf 402, 404, 406, 408, 410, 412. For example, the cell 432 indicates that there are ten hours of pending and assigned POTS related work orders in the Alabaster turf 402. As used herein, an assigned work order is defined as a work order that is assigned to a technician, such as the technician 102, and a pending work order is defined as a work order that is not assigned to a technician 102 and is to be completed within the current business day.
In one embodiment, each cell, such as the cell 432, in the Hours column 424 may be accessed by an input device, such as the mouse 308. For example, the Hours column 424 may be accessed by hovering a mouse cursor over the cell 432 or by clicking the cell using the mouse 308. In response to accessing a cell, such as the cell 432, in the Hours column 424, the GUI 400 may display a window, such as a drop-down window 500 illustrated in
Referring again to
The Dispatches column 428 indicates the number of the technicians 102 dispatched. For example, the cell 436 indicates that four technicians 102 are dispatched to perform POTS related work orders in the Alabaster turf 402. In one embodiment, each cell, such as the cell 436, in the Dispatches column 428 may be accessed by an input device, such as the mouse 308. For example, the Dispatches column 428 may be accessed by hovering a mouse cursor over the cell 436 or by clicking the cell using the mouse 308. In response to accessing a cell, such as the cell 436, in the Dispatches column 428, the GUI 400 may display a window, such as a drop-down window 600 illustrated in
Referring again to
The GUI 400 further includes a Regional Maintenance Center (“RMC”) column 440, which indicates the RMC number designated to a particular turf, according to exemplary embodiments. In one embodiment, each RMC number listed under the RMC column 440 may be accessible by an input device, such as the mouse 308. For example, a RMC number may be accessed by hovering a mouse cursor over the RMC number or by clicking the RMC number using the mouse 308. In response to accessing the RMC number, the GUI 400 may display a window, such as a drop-down window, according to one embodiment. The window may include information related to each of the buckets 414, 416, 418, 420, 422, such as hours, tickets, and dispatches.
Each of the turfs, such as the turfs 402, 404, 406, 408, 410, 412, in the GUI 400 may be accessed by an input device, such as the mouse 308.
The drop-down window 442 further identifies a list 450 of turfs, such as five turfs, in ranking order from one to five, according to one embodiment: (1) the Calera turf 404; (2) the Montevallo turf 410; (3) the Chelsea turf 406; (4) the Columbiana turf 408; and (5) the Riverchase turf 412. In further embodiments, the drop-down window 442 may include a list containing any suitable number of turfs. The list 450 provides a plurality of proximal turfs with respect to the Alabaster turf 402, which was selected in the GUI 400. The list 450 may be determined and ranked according to any suitable criteria, such as the distance between each of the listed turfs 404, 406, 408, 410, 412 and the Alabaster turf 402 as well as the ease with which a technician, such as the technician 102, can move from each of the listed turfs 404, 406, 408, 410, 412 to the Alabaster turf 402. The ease with which the technician 102 can move between two turfs may be affected by any number of factors, such as the availability of roads between turfs and the traffic on the roads at a given time. The suitable criteria may be provided by, for example, the field supervisors or other experts of the turfs. The given turf may be selected by the LBS 106 or other load balancing personnel.
The list 450 may be determined by the proximal turf locator 216. As previously described, the proximal turf locator 216 may be embodied in computer-readable media containing instructions that, when executed by the processing unit 202, determines a plurality of turfs from where to reallocate a workforce to a given turf. An exemplary method for determining a plurality of turfs from where to reallocate a workforce to a given turf is described in greater detail below with respect to
The list 450 provides the LBS 106 with a concise and organized summary of the proximal turfs, such as the turfs 404, 406, 408, 410, 412 with respect to a turf selected from the Turf column 415 by the LBS 106, such as the Alabaster turf 402. As illustrated in
In response to the LBS 106 selecting one of the turfs from the Turf column 415, such as the Alabaster turf 402, the GUI 400 may provide visual cues of the turfs proximal to the selected turf. The visual cues may be included in the GUI 400 to replace the list 450 or to supplement the list 450. Although not so limited, the visual cues are presented in the GUI 400 as highlights or shades associated with the turfs, according to one embodiment. In further embodiments, the visual cues not only indicate the proximal turfs, but also rank the turfs such that the LBS 106 can easily determine the most optimal turfs from where to reallocate technicians 102. For example, as illustrated in
In further embodiments, the visual cues may be presented in other suitable formats. In one example, the visual cues may utilize a coloring scheme to identify proximal turfs and to rank the proximal turfs. For example, the color green may be associated with the most proximal turf and the color red may be associated with the least proximal turf, while other colors may be associated with turfs to indicate in-between levels of proximity. In another example, the visual cues may utilize different font sizes, colors, and formats, such as identifying proximal turfs with a bold font. The visual cues may be enhanced with audio or other multimedia, according to exemplary embodiments.
In response to determining the most optimal turfs, the proximal turf locator 216 generates (at 806) visual cues identifying at least a portion of the most optimal turfs based on the given turf 402. The visual cues provide a concise and organized presentation that the LBS 106 can use to easily identify the optimal turfs. In one embodiment, the visual cues are provided in a list, such as the list 450. In further embodiments, the visual cues are provided by highlighting or shading selected portions of a GUI, such as the GUI 400.
Although the subject matter presented herein has been described in conjunction with one or more particular embodiments and implementations, it is to be understood that the embodiments defined in the appended claims are not necessarily limited to the specific structure, configuration, or functionality described herein. Rather, the specific structure, configuration, and functionality are disclosed as example forms of implementing the claims.
The subject matter described above is provided by way of illustration only and should not be construed as limiting. Various modifications and changes may be made to the subject matter described herein without following the example embodiments and applications illustrated and described, and without departing from the true spirit and scope of the embodiments, which is set forth in the following claims.
The present application is a continuation of U.S. patent application Ser. No. 11/778,953, now U.S. Pat. No. 8,352,302, filed Jul. 17, 2007, titled “Methods, Systems, and Computer-Readable Media for Determining a Plurality of Turfs from Where to Reallocate a Workforce to a Given Turf,” which is related to U.S. patent application Ser. No. 11/778,999, now U.S. Pat. No. 8,380,744, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Generating A Report Indicating Job Availability”; U.S. patent application Ser. No. 11/779,027, now U.S. Pat. No. 8,060,401, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing An Indication Of A Schedule Conflict”; U.S. patent application Ser. No. 11/779,054, now U.S. Pat. No. 8,069,072, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing An Indication Of Hightime”; U.S. patent application Ser. No. 11/779,087, now U.S. Pat. No. 8,249,905, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing Future Job Information”; U.S. patent application Ser. No. 11/778,867, now abandoned, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing Notification Of A Last Job Dispatch”; U.S. patent application Ser. No. 11/778,919, now U.S. Pat. No. 8,239,232, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing Commitments Information Relative To A Turf”; U.S. patent application Ser. No. 11/778,962, now U.S. Pat. No. 8,341,547, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing Contact Information At Turf Level”; U.S. patent application Ser. No. 11/779,011, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing A Ratio Of Tasks Per Technician”; and U.S. patent application Ser. No. 11/779,073, now abandoned, filed Jul. 17, 2007, titled “Methods, Systems, And Computer-Readable Media For Providing Workforce To Load Information”; each of which is hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4509123 | Vereen | Apr 1985 | A |
4937743 | Rassman et al. | Jun 1990 | A |
5155689 | Wortham | Oct 1992 | A |
5214281 | Rowe | May 1993 | A |
5467268 | Sisley et al. | Nov 1995 | A |
5515510 | Kikinis | May 1996 | A |
5542088 | Jennings, Jr. et al. | Jul 1996 | A |
5590269 | Kruse et al. | Dec 1996 | A |
5615121 | Babayev et al. | Mar 1997 | A |
5623404 | Collins et al. | Apr 1997 | A |
5751450 | Robinson | May 1998 | A |
5757290 | Watanabe et al. | May 1998 | A |
5758264 | Bonta et al. | May 1998 | A |
5778345 | McCartney | Jul 1998 | A |
5920846 | Storch et al. | Jul 1999 | A |
5943652 | Sisley et al. | Aug 1999 | A |
5963911 | Walker et al. | Oct 1999 | A |
5987377 | Westerlage et al. | Nov 1999 | A |
6006171 | Vines et al. | Dec 1999 | A |
6078255 | Dividock et al. | Jun 2000 | A |
6134530 | Bunting et al. | Oct 2000 | A |
6275812 | Haq et al. | Aug 2001 | B1 |
6415259 | Wolfinger et al. | Jul 2002 | B1 |
6445968 | Jalla | Sep 2002 | B1 |
6578005 | Lesaint et al. | Jun 2003 | B1 |
6633900 | Khalessi et al. | Oct 2003 | B1 |
6639982 | Stuart et al. | Oct 2003 | B1 |
6684136 | Sinex | Jan 2004 | B2 |
6845394 | Ritche | Jan 2005 | B2 |
6889196 | Clark | May 2005 | B1 |
6904408 | McCarthy et al. | Jun 2005 | B1 |
6934379 | Falcon et al. | Aug 2005 | B2 |
6941514 | Bradford | Sep 2005 | B2 |
6990458 | Harrison et al. | Jan 2006 | B2 |
7065456 | Butka et al. | Jun 2006 | B1 |
7085280 | Martin, IV | Aug 2006 | B2 |
7127412 | Powell et al. | Oct 2006 | B2 |
7171375 | Clarke | Jan 2007 | B2 |
7222082 | Adhikari et al. | May 2007 | B1 |
7283971 | Levine et al. | Oct 2007 | B1 |
7346531 | Jacobs | Mar 2008 | B2 |
7415313 | Brueckner et al. | Aug 2008 | B2 |
7634431 | Stratton | Dec 2009 | B2 |
7640196 | Weiss | Dec 2009 | B2 |
7725857 | Foltz et al. | May 2010 | B2 |
7729939 | Richardson et al. | Jun 2010 | B2 |
8041616 | Cullen et al. | Oct 2011 | B2 |
8249905 | Ingman et al. | Aug 2012 | B2 |
20010032103 | Sinex | Oct 2001 | A1 |
20010037229 | Jacobs et al. | Nov 2001 | A1 |
20010049619 | Powell et al. | Dec 2001 | A1 |
20020010615 | Jacobs et al. | Jan 2002 | A1 |
20020015064 | Robotham et al. | Feb 2002 | A1 |
20020029161 | Brodersen et al. | Mar 2002 | A1 |
20020040313 | Hunter et al. | Apr 2002 | A1 |
20020065700 | Powell et al. | May 2002 | A1 |
20020069018 | Brueckner et al. | Jun 2002 | A1 |
20020069235 | Chen | Jun 2002 | A1 |
20020076031 | Falcon et al. | Jun 2002 | A1 |
20020125998 | Petite et al. | Sep 2002 | A1 |
20020143469 | Alexander et al. | Oct 2002 | A1 |
20020152290 | Ritche | Oct 2002 | A1 |
20030033184 | Benbassat et al. | Feb 2003 | A1 |
20030061068 | Curtis | Mar 2003 | A1 |
20030069797 | Harrison | Apr 2003 | A1 |
20030088492 | Damschroder | May 2003 | A1 |
20030120538 | Boerke et al. | Jun 2003 | A1 |
20030139955 | Kirii et al. | Jul 2003 | A1 |
20030149598 | Santoso et al. | Aug 2003 | A1 |
20030152045 | Martin, IV | Aug 2003 | A1 |
20030167238 | Zeif | Sep 2003 | A1 |
20030182052 | DeLorme et al. | Sep 2003 | A1 |
20030187710 | Baumer et al. | Oct 2003 | A1 |
20030216957 | Florence et al. | Nov 2003 | A1 |
20030220734 | Harrison et al. | Nov 2003 | A1 |
20030233278 | Marshall | Dec 2003 | A1 |
20040010334 | Bickley et al. | Jan 2004 | A1 |
20040019542 | Fuchs et al. | Jan 2004 | A1 |
20040064436 | Breslin et al. | Apr 2004 | A1 |
20040111311 | Ingman et al. | Jun 2004 | A1 |
20040111312 | Ingman et al. | Jun 2004 | A1 |
20040111313 | Ingman et al. | Jun 2004 | A1 |
20040111634 | Ingman et al. | Jun 2004 | A1 |
20040204969 | Wu | Oct 2004 | A1 |
20040220825 | Schwerin-Wenzel et al. | Nov 2004 | A1 |
20040234043 | Argo | Nov 2004 | A1 |
20040249743 | Virginas et al. | Dec 2004 | A1 |
20040254805 | Schwerin-Wenzel et al. | Dec 2004 | A1 |
20050015504 | Dorne et al. | Jan 2005 | A1 |
20050043986 | McConnell et al. | Feb 2005 | A1 |
20050094772 | Harrison et al. | May 2005 | A1 |
20050100137 | Beamon | May 2005 | A1 |
20050119930 | Simon | Jun 2005 | A1 |
20050131943 | Lewis et al. | Jun 2005 | A1 |
20050144058 | Luo | Jun 2005 | A1 |
20050171877 | Weiss | Aug 2005 | A1 |
20050228725 | Rao et al. | Oct 2005 | A1 |
20050288970 | Holcom et al. | Dec 2005 | A1 |
20060015393 | Eisma et al. | Jan 2006 | A1 |
20060031110 | Benbassat et al. | Feb 2006 | A1 |
20060050854 | Beamon | Mar 2006 | A1 |
20060053035 | Eisenberg | Mar 2006 | A1 |
20060064305 | Alonso | Mar 2006 | A1 |
20060064338 | Brotman et al. | Mar 2006 | A1 |
20060090160 | Forsythe et al. | Apr 2006 | A1 |
20060111957 | Carmi et al. | May 2006 | A1 |
20060129691 | Coffee et al. | Jun 2006 | A1 |
20060150077 | Sheldon et al. | Jul 2006 | A1 |
20060182527 | Ranstrom et al. | Aug 2006 | A1 |
20060206246 | Walker | Sep 2006 | A1 |
20060213817 | Scott et al. | Sep 2006 | A1 |
20060235739 | Levis et al. | Oct 2006 | A1 |
20060241853 | Gadler | Oct 2006 | A1 |
20060241855 | Joe et al. | Oct 2006 | A1 |
20060244638 | Lettau | Nov 2006 | A1 |
20070043464 | Zeif | Feb 2007 | A1 |
20070078988 | Miloushev et al. | Apr 2007 | A1 |
20070087756 | Hoffberg | Apr 2007 | A1 |
20070129082 | Thacher | Jun 2007 | A1 |
20070129880 | Thacher | Jun 2007 | A1 |
20070174101 | Li et al. | Jul 2007 | A1 |
20070179830 | Iknoian | Aug 2007 | A1 |
20070211881 | Parker-Stephen | Sep 2007 | A1 |
20070219842 | Bansal et al. | Sep 2007 | A1 |
20070226090 | Stratton | Sep 2007 | A1 |
20070251988 | Ahsan et al. | Nov 2007 | A1 |
20070279214 | Buehler | Dec 2007 | A1 |
20070282654 | Sarkar | Dec 2007 | A1 |
20080016436 | Liu et al. | Jan 2008 | A1 |
20080046803 | Beauchamp et al. | Feb 2008 | A1 |
20080065456 | Labedz et al. | Mar 2008 | A1 |
20080140597 | Satir et al. | Jun 2008 | A1 |
20080162242 | Schneur et al. | Jul 2008 | A1 |
20080172242 | Hyatt | Jul 2008 | A1 |
20080263491 | Foltz et al. | Oct 2008 | A1 |
20090020297 | Ingman et al. | Jan 2009 | A1 |
20090024431 | Ingman et al. | Jan 2009 | A1 |
20090024435 | Ingman et al. | Jan 2009 | A1 |
20090024436 | Ingman et al. | Jan 2009 | A1 |
20090024437 | Ingman et al. | Jan 2009 | A1 |
20090024438 | Ingman et al. | Jan 2009 | A1 |
20090024455 | Ingman et al. | Jan 2009 | A1 |
20090024646 | Ingman et al. | Jan 2009 | A1 |
20090024957 | Ingman et al. | Jan 2009 | A1 |
20090024999 | Ingman et al. | Jan 2009 | A1 |
20090177375 | Jung et al. | Jul 2009 | A1 |
20120259670 | Ingman et al. | Oct 2012 | A1 |
20120265577 | Ingman et al. | Oct 2012 | A1 |
20130014062 | Ingman et al. | Jan 2013 | A1 |
Number | Date | Country |
---|---|---|
1139247 | Oct 2001 | EP |
Entry |
---|
Wennberg, J. “Finding Equilibrium in U.S. Physician Supply” Health Affairs vol. 12 Issue: 2 pp. 89-103 DOI: 10.1377/hlthaff.Dec. 2, 1989 Published: SUM 1993. |
Xu et al. “Effective Heuristic Procedures for a Field Technician Scheduling Problem” (2001) Kluwer Academic Publishers, p. 495-509. |
U.S. Notice of Allowance dated Dec. 27, 2012 in U.S. Appl. No. 13/533,402. |
“MDSI Mobile Data Solutions—Innovative and effective mobile workforce management and wireless connection”, 1998, www.mdsi-advantex.com, pp. 1-31. |
Lesaint et al., “Engineering Dynamic Scheduler for Work Manager”, Jul. 1998, BT Technol J, 16(3):16-29. |
Dimitri Golenko-Ginzburg, Zilla Simuany-Stern, Valdimir Kats, “A Multilevel Decision-Making System with Multipleresources for Controlling Cotton Harvesting” Int. J. Production Economics 46-47 (1996) pp. 55-63. |
Xu et al., Effective Heuristic Procedures for a Field Technician Scheduling Problem (2001) Kluwer Academic Publishers, p. 495-509. |
Wennberg, J. et al., “Finding Equillibrium in U.S. Physician Supply, ” Health Affairs vol. 12, Issue:2 pp. 89-103 DOI: 10.1377/hlthaff.Dec. 2, 1989 Published: SUM 1993. |
U.S. Office Action dated Feb. 2, 2010 in U.S. Appl. No. 11/778,867. |
U.S. Office Action dated Aug. 23, 2010 in U.S. Appl. No. 11/778,919. |
U.S. Office Action dated Dec. 9, 2010 in U.S. Appl. No. 11/778,919. |
U.S. Office Action dated Aug. 25, 2011 in U.S. Appl. No. 11/778,919. |
U.S. Notice of Allowance dated Dec. 19, 2011 in U.S. Appl. No. 11/778,919. |
U.S. Office Action dated Oct. 13, 2010 in U.S. Appl. No. 11/778,953. |
U.S. Office Action dated Mar. 24, 2011 in U.S. Appl. No. 11/778,953. |
U.S. Notice of Allowance dated Sep. 27, 2012 in U.S. Appl. No. 11/778,953. |
U.S. Office Action dated Apr. 15, 2010 in U.S. Appl. No. 11/778,962. |
U.S. Office Action dated Aug. 26, 2010 in U.S. Appl. No. 11/778,962. |
U.S. Office Action dated Jan. 25, 2011 in U.S. Appl. No. 11/778,962. |
U.S. Office Action dated Feb. 21, 2012 in U.S. Appl. No. 11/778,962. |
U.S. Notice of Allowance dated Jul. 26, 2012 in U.S. Appl. No. 11/778,962. |
U.S. Office Action dated Apr. 1, 2010 in U.S. Appl. No. 11/778,999. |
U.S. Office Action dated Sep. 24, 2010 in U.S. Appl. No. 11/778,999. |
U.S. Notice of Allowance dated May 3, 2011 in U.S. Appl. No. 11/778,999. |
U.S. Office Action dated Nov. 24, 2010 in U.S. Appl. No. 11/779,011. |
U.S. Office Action dated May 11, 2011 in U.S. Appl. No. 11/779,011. |
U.S. Office Action dated Apr. 25, 2012 in U.S. Appl. No. 11/779,011. |
U.S. Office Action dated Oct. 11, 2012 in U.S. Appl. No. 11/779,011. |
U.S. Office Action dated Feb. 4, 2011 in U.S. Appl. No. 11/779,027. |
U.S. Notice of Allowance dated Aug. 4, 2011 in U.S. Appl. No. 11/779,027. |
U.S. Office Action dated Nov. 16, 2010 in U.S. Appl. No. 11/779,054. |
U.S. Notice of Allowance dated May 12, 2011 in U.S. Appl. No. 11/779,054. |
U.S. Notice of Allowance dated Aug. 24, 2011 in U.S. Appl. No. 11/779,054. |
U.S. Office Action dated Feb. 1, 2011 in U.S. Appl. No. 11/779,073. |
U.S. Office Action dated Oct. 27, 2010 in U.S. Appl. No. 11/779,087. |
U.S. Notice of Allowance dated Mar. 24, 2011 in U.S. Appl. No. 11/779,087. |
U.S. Office Action dated Aug. 22, 2012 in U.S. Appl. No. 13/533,402. |
Number | Date | Country | |
---|---|---|---|
20130096974 A1 | Apr 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11778953 | Jul 2007 | US |
Child | 13688588 | US |