The present application is related to commonly assigned U.S. patent application Ser. No. 11/778,953, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR DETERMINING A PLURALITY OF TURFS FROM WHERE TO REALLOCATE A WORKFORCE TO A GIVEN TURF; commonly assigned U.S. patent application Ser. No. 11/779,027, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING AN INDICATION OF A SCHEDULE CONFLICT; commonly assigned U.S. patent application Ser. No. 11/779,054, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING AN INDICATION OF HIGHTIME; commonly assigned U.S. patent application Ser. No. 11/779,087, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING FUTURE JOB INFORMATION,”; commonly assigned U.S. patent application Ser. No. 11/778,867, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING NOTIFICATION OF A LAST JOB DISPATCH,”; commonly assigned U.S. patent application Ser. No. 11/778,919, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING COMMITMENTS INFORMATION RELATIVE TO A TURF,”; commonly assigned U.S. patent application Ser. No. 11/778,962, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING CONTACT INFORMATION AT TURF LEVEL,”; commonly assigned U.S. patent application Ser. No. 11/779,011, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING A RATIO OF TASKS PER TECHNICIAN,”; and commonly assigned U.S. patent application Ser. No. 11/779,073, filed concurrently herewith, titled “METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING WORKFORCE TO LOAD INFORMATION,”; each of which is hereby incorporated herein by reference.
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. Maintenance of the telecommunications network generally involves the assignment of an appropriate technician to each outstanding job such that all of the outstanding jobs are timely filled. When a technician finishes one job and is ready to be dispatched to another job, the technician may receive next job information. The next job information may include, for example, the location of the next job and the type of work to be done in the next job. The technician may receive the next job information via a portable computing device, such as a laptop computer, which enables the technician to receive the job information out in the field without having to return to a base station.
A sufficient number of technicians are typically hired to comfortably fill an estimated number of jobs. There may be times, however, when the availability of technicians is greater than the availability of jobs for which the available technicians are qualified. In such a case, instead of receiving next job information on the portable computing device when the technician is ready to be dispatched to another job, the technician will receive a No Jobs Available (“NJA”) message. The NJA message may be transmitted to the technician from a load balance personal computer (“PC”) responsible for dispatching technicians to jobs.
The amount of unproductive time between the technician receiving a NJA message and being dispatched to the next job is known as Lost Productive Time (“LPT”). LPT may be a significant expense for entities involved in scheduling and dispatching technicians or other personnel. As such, the ability to track LPT may prove valuable for supervisors and managers responsible for dispatching the technicians.
LPT may conventionally be estimated by manually retrieving a technician's work list (i.e., a list containing the time periods in which the technician was dispatched to jobs) and calculating the amount of time between jobs on the work list. The work list, however, generally provides no information regarding whether or when the technician received a NJA message. Thus, no way existed to associate the amount of time between jobs with the NJA message to more precisely determine the LPT.
Embodiments of the disclosure presented herein include methods, systems, and computer-readable media for generating a report indicating job availability. According to one aspect, a method for generating a report indicating job availability is provided. According to the method, a selected assignment group is displayed. A number of status messages received by a technician in the selected assignment group is displayed. The status messages indicate that no jobs are available for the technician. An amount of lost time associated with the technician in the selected assignment group is displayed. The lost time includes a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job. The amount of lost time associated with the technician in the selected assignment group is displayed.
According to another aspect, a system for generating a report indicating job availability is provided. The system includes a memory and a processor functionally coupled to the memory. The memory stores a program containing code for generating the report indicating job availability. The processor is responsive to computer-executable instructions contained in the program and operative to display a selected assignment group, display a number of status messages received by a technician in the selected assignment group, determine an amount of lost time associated with the technician in the selected assignment group, and display the amount of lost time associated with the technician in the selected assignment group. The status messages may indicate that no jobs are available for the technician. According to exemplary embodiments, the lost minutes comprise a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job.
According to yet another aspect, a computer-readable medium having instructions stored thereon for execution by a processor to perform a method for generating a report indicating job availability is provided. According to the method, a selected assignment group is displayed. A number of status messages received by a technician in the selected assignment group is displayed. The status messages indicate that no jobs are available for the technician. An amount of lost time associated with the technician in the selected assignment group is displayed. The lost time includes a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job. The amount of lost time associated with the technician in the selected assignment group is displayed.
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 generating a report indicating job availability (e.g., a No Jobs Available (“NJA”) report). 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. As used herein, a technician refers to any suitable personnel for performing a 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”) containing an organized overview of work order and technician statuses within a plurality of turfs. The NGLB tool may be utilized by a load balance supervisor (“LBS”) or other load balancing personnel to aid in the coordination of work force reallocation within the plurality of turfs. In one embodiment, the NGLB tool is provided to the LBS as a web-based application that can be accessed remotely via, for example, a web browser.
According to further embodiments, the NGLB tool includes a No Jobs Available (“NJA”) report module, such as a NJA report module 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”) (not shown) that provides the LBS 106 with an organized, visual presentation of the technicians 102, the turfs 104, and the buckets 108, according to one embodiment. In one example, if work orders in the Alpha turf 104a cannot be timely filled without additional technicians 102, the LBS 106 may view the GUI to determine if the technicians 102 in the Beta turf 104b can be utilized. In a further example, if service orders in the POTS bucket 108a cannot be timely filled without additional technicians 102, the LBS 106 may view the GUI to determine if the technicians 102 in the DSL bucket 108b or the cable bucket 108c are qualified to fill POTS work orders. 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. In this embodiment, the LBS 106 may access the GUI over a network, such as a network 214 of
In one embodiment, the reallocation module 112 generates at least a portion of the GUI 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 (not shown) containing information related to the reallocation of the technicians 102 across a plurality of the turfs 104, as described in greater detail below. Exemplary information related to the reallocation across a plurality of the turfs 104 includes, but is not limited to, the physical proximity between the technicians 102, the availability of the technicians 102, the physical proximity between the turfs 104, the existing load on each of the turfs 104, and the anticipated load on each of the turfs 104. According to further embodiments, the reallocation module 112 may be embodied in hardware, software, firmware, or any combination thereof.
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 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 a 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 NJA report provided by the NJA report module 216.
In exemplary embodiments, the load balance PC 304 includes a web browser 310, such as INTERNET EXPLORER from MICROSOFT CORPORATION, for accessing the NJA report and for facilitating communications between the LBS 106 and the computer 110. Using the web browser 310, the LBS 106 may access the NJA report 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 NJA report 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 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.
In one embodiment, one or more of the NDC selection 502, the assignment group selection 504, the start date selection 506, and the end date selection 508 may be left unselected. For example, if the start date selection 506 and the end date selection 508 are left unselected, the generated NJA report may include data for a default time frame. After selecting the NDC selection 502, the assignment group selection 504, the start date selection 506, and the end date selection 508, the LBS 106 may depress a Get Report button 510 to retrieve the NJA report.
The NJA summary report 402 may include a NDC selection 602 (referred to in
In response to depressing a Get Report button 610, a summary portion 612 and a report portion 614 may be displayed. As illustrated in
According to exemplary embodiments, the NDC column 616 corresponds to the NDC selected via the NDC selection 602. At the row 636, the NDC column 616 indicates that the Alabama NDC was selected. According to exemplary embodiments, the number of NJA messages column 618 indicates the aggregate number of NJA received by the technicians 102 for all of the assignment groups selected in the assignment group selection 604. At the row 636, the number of NJA messages column 618 indicates that 220 NJA messages were received. According to exemplary embodiments, the number of total lost minutes column 620 indicates the aggregate amount of time lost by the technicians 102 for all of the assignment groups selected in the assignment group selection 604 between receiving a NJA message and being dispatched to the next job. At the row 636, the number of total lost minutes column 620 indicates that 1,640 minutes were lost. According to exemplary embodiments, the number of lunch minutes column 622 indicates the number of lost minutes specified the number of total lost minutes column 620 that were attributable to lunch time. At the row 636, the number of lunch minutes column 622 indicates that 997 of the 1,640 minutes were attributable to lunch time. The lunch time may be any suitable time frame, for example, between 11 am and 1 pm. According to exemplary embodiments, the number of net lost minutes column 624 indicates the LPT, which is the difference between the number of total lost minutes column 620 and the number of lunch minutes column 622. At the row 636, the number of net lost minutes column 624 is 643 minutes (i.e., 1,640−997 minutes).
According to exemplary embodiments, the number of POTS minutes column 626 indicates a number of total lost minutes and number of lunch minutes attributable to the technicians 102 assigned to a POTS bucket. At the row 636, the number of POTS minutes column 626 indicates 864 total lost minutes and 382 lunch minutes attributable to the technicians 102 assigned to the POTS bucket for POTS related work orders. According to exemplary embodiments, the number of DSL minutes column 628 indicates a number of total lost minutes and number of lunch minutes attributable to the technicians 102 assigned to a DSL bucket for DSL related work orders. At the row 636, the number of DSL minutes column 628 indicates 227 total lost minutes and 220 lunch minutes attributable to the technicians 102 assigned to the DSL bucket. According to exemplary embodiments, the number of cable minutes column 630 indicates a number of total lost minutes and number of lunch minutes attributable to the technicians 102 assigned to a cable bucket for cable related work orders. At the row 636, the number of cable minutes column 630 indicates nine total lost minutes and zero lunch minutes attributable to the technicians 102 assigned to the cable bucket. According to exemplary embodiments, the number of specials minutes column 632 indicates a number of total lost minutes and number of lunch minutes attributable to the technicians 102 assigned to a specials bucket for special circuit related work orders (e.g., Digital Signal 1 (“DS1”) and Digital Signal 3 (“DS3”)). At the row 636, the number of specials minutes column 632 indicates 129 total lost minutes and 128 lunch minutes attributable to the technicians 102 assigned to the specials bucket. According to exemplary embodiments, the number of ND minutes column 634 indicates a number of total lost minutes and number of lunch minutes attributable to the technicians 102 assigned to a ND bucket for work orders not assigned to the POTS, DSL, cable, and specials buckets. At the row 636, the number of ND minutes column 634 indicates 361 total lost minutes and 267 lunch minutes attributable to the technicians 102 assigned to the ND bucket.
The report portion 614 may include an assignment group column 638, a number of NJA messages column 640, number of total lost minutes column 642, a number of lunch minutes column 644, a number of POTS total minutes column 646, a number of POTS lunch minutes column 648, a number of DSL total minutes column 650, a number of DSL lunch minutes column 652, a number of cable total minutes column 654, a number of cable lunch minutes column 656, a number of specials total minutes column 658, a number of specials lunch minutes column 660, a number of ND total minutes column 662, and a number of ND lunch minutes column 664.
According to exemplary embodiments, the assignment group column 638 corresponds to the assignment group selected via the assignment group selection 604. As described above, the assignment group selection 604 indicates that all of the assignment groups were selected. As such, the assignment group column 638 includes all of the assignment groups, such as an assignment group 668, associated with the Alabama NDC selected via the NDC selection 602. The number of NJA messages column 640 indicates that three NJA messages were received by the technicians 102 in the assignment group 668. The number of total lost minutes column 642 indicates that sixteen minutes were lost between receiving a NJA message and being dispatched to the next job in the assignment group 668. The number of lunch minutes column 644 indicates that sixteen of the sixteen minutes in the number of total lost minutes column 642 were attributable to lunch time. The number of POTS total minutes column 646 and the number of POTS lunch minutes column 648 indicate sixteen total lost minutes and sixteen lunch minutes, respectively, attributable to the technicians 102 assigned to the POTS bucket. The number of DSL total minutes column 650 and the number of DSL lunch minutes column 652 indicate zero total lost minutes and zero lunch minutes, respectively, attributable to the technicians 102 assigned to the DSL bucket. The number of cable total minutes column 654 and the number of cable lunch minutes column 656 indicate zero total lost minutes and zero lunch minutes, respectively, attributable to the technicians 102 assigned to the cable bucket. The number of specials total minutes column 658 and the number of specials lunch minutes column 660 indicate zero total lost minutes and zero lunch minutes, respectively, attributable to the technicians 102 assigned to the specials bucket. The number of ND total minutes column 662 and the number of ND lunch minutes column 664 indicate zero total lost minutes and zero lunch minutes, respectively, attributable to the technicians 102 assigned to the ND bucket.
It should be appreciated that the POTS, DSL, cable, specials, and ND buckets illustrated in
Although not so limited, the number of lost minutes column 620 and the number of lunch minutes column 622 measure time in minutes. However, it will be apparent to one having ordinary skill in the art that the time may be measured in any suitable unit of time. Further, while
The NJA details report 404 may include a NDC column 702 (referred to in
The NJA message time column 708 may indicate the date and time at which the technician 102 identified by the technician ID column 710 and the technician name column 712 received a NJA message. In one embodiment, the NJA message time column 708 identifies the date and time of the most recent message if the technician 102 receives multiple NJA messages. The technician ID column 710 and the technician name column 712 identify a particular technician, such as the technician 102. The next dispatch time column 714 indicates the date and time at which the technician 102 identified by the technician ID column 710 and the technician name column 712 was dispatched to the next job after receiving the NJA message, according to exemplary embodiments. The number of lost minutes column 716 indicates the time lost by the technicians 102 between receiving the NJA message and being dispatched to the next job. As such, the number of minutes in the number of lost minutes column 716 is the number of minutes between the time in the NJA message time column 708 and the next dispatch time column 714. For example, at the row 722, the NJA message time column 708 indicates a time of 13:39, and the next dispatch time column 714 indicates a time of 13:45. The number of minutes between 13:39 and 13:45 is six, which is the number of minutes indicated in the number of lost minutes column 716 at the row 722.
The number of NJA messages column 718 indicates the number of NJA messages received by the technician 102 identified by the technician ID column 710 and the technician name column 712 since the time and date identified in the NJA message time column 708, according to exemplary embodiments. At the row 722, the number of NJA messages column 718 indicates that one NJA message was received. The supervisor column 720 indicates the name of the field supervisor responsible for managing the technician 102 identified by the technician ID column 710 and the technician name column 712. In one embodiment, the field supervisor is responsible for each technician 102 in a particular bucket.
Although not illustrated in
The NJA report module 216 determines and displays (at 806) a number of lost minutes associated with the technician 102 in the selected assignment group. As previously described, the lost minutes are the difference between the time at which the technician 102 received one of the NJA messages and the time at which the technician 102 is dispatched to the next job. In
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.
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 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 |
6684136 | Sinex | Jan 2004 | 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 | 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 |
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 |
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 |
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 | 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 |
20030233278 | Marshall | Dec 2003 | 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 |
20040234043 | Argo | Nov 2004 | A1 |
20040249743 | Virginas 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 |
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 |
20060150077 | Sheldon et al. | Jul 2006 | A1 |
20060182527 | Ranstrom et al. | Aug 2006 | A1 |
20060213817 | Scott et al. | Sep 2006 | A1 |
20060235739 | Levis et al. | Oct 2006 | A1 |
20070043464 | Zeif | Feb 2007 | A1 |
20070078988 | Miloushev et al. | Apr 2007 | A1 |
20070087756 | Hoffberg | Apr 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 |
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 |
20090024957 | Ingman et al. | Jan 2009 | A1 |
20090024999 | Ingman et al. | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
1139247 | Oct 2001 | EP |
Entry |
---|
“MDSI Mobile Data Solutions—Innovative and effective mobile workforce management and wireless connection”, 1998, pp. 1-31. |
D Lesaint et al., “Engineering Dynamic Scheduler for Work Manager”, BT Technol J vol. 16 No. 3, Jul. 1998, pp. 16-29. |
U.S. Official Action dated Feb. 2, 2010 in U.S. Appl. No. 11/778,867. |
U.S. Official Action dated Feb. 10, 2010 in U.S. Appl. No. 11/778,867. |
U.S. Official Action dated Apr. 15, 2010 in U.S. Appl. No. 11/778,962. |
U.S. Official Action dated Aug. 23, 2010 in U.S. Appl. No. 11/778,919. |
U.S. Official Action dated Aug. 26, 2010 in U.S. Appl. No. 11/778,962. |
U.S. Official Action dated Oct. 13, 2010 in U.S. Appl. No. 11/778,953. |
U.S. Official Action dated Oct. 27, 2010 in U.S. Appl. No. 11/779,087. |
U.S. Official Action dated Nov. 16, 2010 in U.S. Appl. No. 11/779,054. |
U.S. Official Action dated Nov. 24, 2010 in U.S. Appl. No. 11/779,011. |
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. |
U.S. Official Action dated Dec. 9, 2010 in U.S. Appl. No. 11/778,919. |
U.S. Official Action dated Jan. 25, 2011 in U.S. Appl. No. 11/778,962. |
Xu et al., Effective Heuristic Procedures for a Field Technician Scheduling Problem (2001) Kluwer Academic Publishers, pp. 495-509. |
U.S. Official Action dated Mar. 24, 2011 in U.S. Appl. No. 11/778,953. |
U.S. Official Action dated Feb. 4, 2011 in U.S. Appl. No. 11/779,027. |
U.S. Official Action dated Feb. 1, 2011 in U.S. Appl. No. 11/779,073. |
U.S. Notice of Allowance dated Mar. 24, 2011 in U.S. Appl. No. 11/779,087. |
U.S. Official Action dated May 11, 2011 in U.S. Appl. No. 11/779,011. |
U.S. Notice of Allowance dated May 12, 2011 in U.S. Appl. No. 11/779,054. |
U.S. Notice of Allowance dated Dec. 19, 2011 in U.S. Appl. No. 11/778,919. |
U.S. Notice of Allwance dated August 4, 2011 in U.S. Appl. No. 11/779,027. |
U.S. Office Action dated Aug. 25, 2011 in U.S. Appl. No. 11/778,919. |
U.S. Official Action dated Feb. 21, 2012 in U.S. Appl. No. 11/778,962. |
U.S. Official Action dated Apr. 25, 2012 in U.S. Appl. No. 11/779,011. |
U.S. Notice of Allowance dated Jul. 26, 2012 in U.S. Appl. No. 11/778,962. |
U.S. Notice of Allowance dated Sep. 27, 2012 in U.S. Appl. No. 11/778,953. |
Wennberg, J et al., “Finding Equillibrium in U.S. Physician Sypply,” HEALTH AFFAIRS vol. 12, Issue:2 pp. 89-103 DOI: 10.1377/hlthaff. Dec. 2, 1989 Published: SUM 1993. |
U.S. Office Action dated Oct. 11, 2012 in U.S. Appl. No. 11/779,011. |
U.S. Office Action dated Aug. 22, 2012 in U.S. Appl. No. 13/533,402. |
Number | Date | Country | |
---|---|---|---|
20090024646 A1 | Jan 2009 | US |