Methods and systems for assigning multiple tasks

Details Methods and systems for assigning multiple tasks Methods and systems for assigning multiple tasks

2002-10-29

2010-11-23

Jeanty, Romain (Department: 3624)

Data processing: financial, business practice, management, or co

Automated electrical financial or business practice or...

Health care management

C705S002000, C705S301000, C705S305000, C705S320000, C715S716000, C715S733000, C715S748000, C715S751000

Reexamination Certificate

active

07840434

ABSTRACT:
Methods and systems are disclosed for assigning multiple tasks to a technician. One method allows a user to interface with an Integrated Dispatch System and assign multiple tasks to at least one technician. Each task describes a 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.

REFERENCES:
patent: 2909128 (1959-10-01), Keen
patent: 3304416 (1967-02-01), Wolf
patent: 3500557 (1970-03-01), White
patent: 3571949 (1971-03-01), Gormley
patent: 3780695 (1973-12-01), Richard
patent: 4937743 (1990-06-01), Rassman et al.
patent: 5111391 (1992-05-01), Fields et al.
patent: 5125513 (1992-06-01), Branch
patent: 5467268 (1995-11-01), Sisley et al.
patent: 5634055 (1997-05-01), Barnewall et al.
patent: 5682421 (1997-10-01), Glovitz et al.
patent: 5726884 (1998-03-01), Sturgeon et al.
patent: 5881131 (1999-03-01), Farris et al.
patent: 5887243 (1999-03-01), Harvey et al.
patent: 5920846 (1999-07-01), Storch et al.
patent: 5943652 (1999-08-01), Sisley et al.
patent: 5999908 (1999-12-01), Abelow
patent: 5999990 (1999-12-01), Sharrit et al.
patent: 6049776 (2000-04-01), Donnelly et al.
patent: 6085166 (2000-07-01), Beckhardt
patent: 6169517 (2001-01-01), Eslambolchi et al.
patent: 6272457 (2001-08-01), Ford et al.
patent: 6349238 (2002-02-01), Gabbita et al.
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6611751 (2003-08-01), Warren
patent: 6662194 (2003-12-01), Joao
patent: 6850895 (2005-02-01), Brodersen et al.
patent: 6873949 (2005-03-01), Hickman et al.
patent: 6879962 (2005-04-01), Smith et al.
patent: 6985872 (2006-01-01), Benbassat et al.
patent: 6990458 (2006-01-01), Harrison et al.
patent: 7003475 (2006-02-01), Friedland et al.
patent: 7013284 (2006-03-01), Guyan et al.
patent: 7107285 (2006-09-01), Von Kaenel et al.
patent: 7212985 (2007-05-01), Sciuk
patent: 7340037 (2008-03-01), Jean et al.
patent: 7346531 (2008-03-01), Jacobs
patent: 7437727 (2008-10-01), Leong et al.
patent: 2001/0021910 (2001-09-01), Goldstein
patent: 2001/0042001 (2001-11-01), Goto et al.
patent: 2001/0051905 (2001-12-01), Lucas
patent: 2002/0007289 (2002-01-01), Malin et al.
patent: 2002/0010610 (2002-01-01), Jacobs et al.
patent: 2002/0010614 (2002-01-01), Arrowood
patent: 2002/0010615 (2002-01-01), Jacobs
patent: 2002/0022984 (2002-02-01), Daniel et al.
patent: 2002/0029160 (2002-03-01), Thompson et al.
patent: 2002/0029161 (2002-03-01), Brodersen et al.
patent: 2002/0032028 (2002-03-01), Kaupe
patent: 2002/0035460 (2002-03-01), Hales
patent: 2002/0040313 (2002-04-01), Hunter et al.
patent: 2002/0054082 (2002-05-01), Karpf
patent: 2002/0072956 (2002-06-01), Willems et al.
patent: 2002/0073114 (2002-06-01), Nicastro et al.
patent: 2002/0181685 (2002-12-01), Doherty et al.
patent: 2002/0188488 (2002-12-01), Hinkle
patent: 2003/0018509 (2003-01-01), Ossip et al.
patent: 2003/0033184 (2003-02-01), Benbassat et al.
patent: 2003/0144892 (2003-07-01), Cowan et al.
patent: 2003/0182348 (2003-09-01), Leong et al.
patent: 2003/0204431 (2003-10-01), Ingman
patent: 08044799 (1996-02-01), None
patent: 10143557 (1998-05-01), None
Lesaint et al. “Dynaic Workforce Scheduling for Brisish Telecomminications” Informs. Jan.-Feb. 2000.
L. Haugen, “A Study of Scheduling and Quality of Field-Service Support Systems,” Ph.D. Thesis, University of Minnesota, Nov. 1993, pp. 1-251.
Collins et al., “Automated Asignment and Scheduling of Service Personnel” IEEE Expert, vol. 9, No. 2, Apr. 1994, pp. 33-39.
Hill, Arthur V., Naumann, J. David, & Chervany, Norman L.. (1983). SCAT and SPAT: Large-Scale Computer-Based Optimization Systems for the Personnel Assignment Problem. Decision Sciences, 14(2), 207.
A. V. Hill, “An Experimental Comparison of Dispatching Rules for Field Service Support”, Decision Sciences, vol. 23, No. 1, Winter 1992, pp. 235-249.
Mark S. Fox & Stephen F. Smith “ISIS-A Knowledge-Based System for Factory Scheduling” The Robotics Institute, Carnegie-Mellon University; Expert Systems vol. 1, No. 1 (Jul. 1984).
Thomas Dean & Mark Boddy “An Analysis of Time-Dependant Planning” AAAI-88 Proceedings (1988).
John N. Tsitsiklis “Special Cases of Traveling Salesman and Repairman Problems with Time Windows” Networks. vol. 22 (1992) 263-282.
AV Hill, VA Mabert, & DW Montgomery “A Decision Support System for the Courier Vehicle Scheduling Problem” Omega Int. J. of Mgmt. Sci., vol. 16, No. 4, pp. 333-345 (1988).
Arthur V Hill “An Experimental Comparison of Dispatching Rules for Field Service Support” Decision Sciences vol. 23 Issue 1, pp. 235-249 (1992).
Arthur V. Hill “An Experimental Comparison of Human Schedulers and Heuristic Algorithms for the Traveling Salesman Problem” Journal of Operations Management, vol. 2, Issue 4, pp. 215-223 (Aug. 1982).
Monte Zweben “Anytime Rescheduling” Innovative Approches to Planning Scheduling and Control Workshop held at San Diego, CA (Nov. 1990).
Arthur V. Hill “Chexpedite: A computer-based Approach to the Bank Courier Problem” Decision Sciences vol. 13 Issue 2, pp. 251-265 (1981).
Mark S. Fox, Norman Sadeh, & Can Baykan “Constrained Heuristic Search” International Joint Conference On Artificial Intelligence, Proceedings of the 11th international joint conference on Artificial intelligence—vol. 1, pp. 309-315 (1989).
Bahman Kalantari, Arthur V. Hill, Sant R. Arora “An Algorithm for the Traveling Salesman Problem with Pickup and Delivery” European Journal of Operational Research 22 pp. 377-386 (1983).
Henri Prade “Using Fuzzy Set Theory in a Scheduling Problem: A Cae Study” Fuzzy Sets and Systems 2 pp. 153-165 (1979).
Marmel, Miċrosoft Project 2000 Bible, Mar. 30, 2000, IDG Books Worldwide, Inc., p. 42-47, & 120.
Software Systems for Telecommunications, Science and technology Series, Bell Communications research, Oct. 1992, [retrieved from U.S. Appl. No. 08/608,838] pp. 34, 35, 53, 54, 58, 82, 83, 87, 93, 99, 100, 111-114, 139, 145, 146, 152, 153, 164.
First User Documentation, Southwestern Bell Telephone Company, Dec. 1995, Index, pp. 1-3, Section 1, p. 1, Section 2, pp. 1-2 [retrieved from U.S. Appl. No. 08/608,838.
“13 Step System Flow” and additional information, training memorandum prepared by Southwestern Bell Center of Learning, approx 1992 (first publically available Jul. 6, 1999) [retrieved from U.S. Appl. No. 08/608,838.
Rey, R. F., Engineering and Operations in the Bell System, AT&T Bell Laboratories, Murray Hill, NJ, 1984, pp. 605-621.

Affiliated with

Also associated with

Rating

Methods and systems for assigning multiple tasks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and systems for assigning multiple tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for assigning multiple tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4239483