Methods and systems for scheduling complex work orders for a...

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Health care management

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S002000

Reexamination Certificate

active

09824849

ABSTRACT:
Provided herein are data structures, processes and systems to facilitate scheduling of complex work orders to a mobile workforce. Complex work orders are comprised of several distinct sub-orders that require coordinated scheduling because the start of one sub-order is dependent on the start or completion of another. The data structure provided herein identifies a set of member sub-orders required for completing complex work orders and relates those sub-orders to one another by precedence criteria that establish which sub-orders are dependent on which other sub-orders. This data structure is used in computer processes integrated with workforce management systems to permit such systems to schedule and/or assign individual work orders in a coordinated manner to satisfy the precedence criteria. Also provided are processes for validating the completion of predecessor sub-orders prior to starting successor sub-orders and transmitting warning messages to field technicians when the precedence criteria have not been satisfied.

REFERENCES:
patent: 4937743 (1990-06-01), Rassman et al.
patent: 5093794 (1992-03-01), Howie et al.
patent: 5113380 (1992-05-01), Levine
patent: 5168451 (1992-12-01), Bolger
patent: 5289368 (1994-02-01), Jordan et al.
patent: 5289531 (1994-02-01), Levine
patent: 5325292 (1994-06-01), Crockett
patent: 5355511 (1994-10-01), Hatano et al.
patent: 5428546 (1995-06-01), Shah et al.
patent: 5467268 (1995-11-01), Sisley et al.
patent: 5532702 (1996-07-01), Mintz
patent: 5590269 (1996-12-01), Kruse et al.
patent: 5615121 (1997-03-01), Babayev et al.
patent: 5623404 (1997-04-01), Collins et al.
patent: 5636122 (1997-06-01), Shah et al.
patent: 5655118 (1997-08-01), Heindel et al.
patent: 5737728 (1998-04-01), Sisley et al.
patent: 5758313 (1998-05-01), Shah et al.
patent: 5764953 (1998-06-01), Collins et al.
patent: 5774661 (1998-06-01), Chatterjee et al.
patent: 5774867 (1998-06-01), Fitzpatrick et al.
patent: 5826239 (1998-10-01), Du et al.
patent: 5848395 (1998-12-01), Edgar et al.
patent: 5870545 (1999-02-01), Davis et al.
patent: 5893906 (1999-04-01), Daffin et al.
patent: 5904727 (1999-05-01), Prabhakaran
patent: 5913201 (1999-06-01), Kocur
patent: 5920846 (1999-07-01), Storch et al.
patent: 5922040 (1999-07-01), Prabhakaran
patent: 5963913 (1999-10-01), Henneuse et al.
patent: 5970466 (1999-10-01), Detjen et al.
patent: 6016477 (2000-01-01), Ehnebuske et al.
patent: 6047260 (2000-04-01), Levinson
patent: 6070144 (2000-05-01), Ginsberg et al.
patent: 6088626 (2000-07-01), Lilly et al.
patent: 6092048 (2000-07-01), Nakaoka
patent: 6115640 (2000-09-01), Tarumi
patent: 6144971 (2000-11-01), Sunderman et al.
patent: 6219412 (2001-04-01), Wellner et al.
patent: 6278978 (2001-08-01), Andre et al.
patent: 6415259 (2002-07-01), Wolfinger et al.
patent: 6430562 (2002-08-01), Kardos et al.
patent: 6473748 (2002-10-01), Archer
patent: 6484036 (2002-11-01), Sorkin et al.
patent: 6532465 (2003-03-01), Hartley et al.
patent: 6535883 (2003-03-01), Lee et al.
patent: 6546364 (2003-04-01), Smirnov et al.
patent: 6546425 (2003-04-01), Hanson et al.
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6633900 (2003-10-01), Khalessi et al.
patent: 6697784 (2004-02-01), Bacon et al.
patent: 6701299 (2004-03-01), Kraisser et al.
patent: 6721288 (2004-04-01), King et al.
patent: 6745381 (2004-06-01), Ehnebuske et al.
patent: 6754321 (2004-06-01), Innes et al.
patent: 6823315 (2004-11-01), Bucci et al.
patent: 6850895 (2005-02-01), Brodersen et al.
patent: 7127412 (2006-10-01), Powell et al.
patent: 2001/0029499 (2001-10-01), Tuatini et al.
patent: 2001/0037229 (2001-11-01), Jacobs et al.
patent: 2001/0047287 (2001-11-01), Jacobs et al.
patent: 2001/0047288 (2001-11-01), Jacobs et al.
patent: 2001/0049619 (2001-12-01), Powell et al.
patent: 2002/0007299 (2002-01-01), Florence
patent: 2002/0010610 (2002-01-01), Jacobs et al.
patent: 2002/0016645 (2002-02-01), Jacobs et al.
patent: 2002/0023157 (2002-02-01), Lo et al.
patent: 2002/0035493 (2002-03-01), Mozayeny et al.
patent: 2002/0046073 (2002-04-01), Indseth et al.
patent: 2002/0065700 (2002-05-01), Powell et al.
patent: 2002/0199182 (2002-12-01), Whitehead
patent: 2005/0027580 (2005-02-01), Crici et al.
patent: 195 39 662 (1997-10-01), None
patent: WO 00/28451 (2000-05-01), None
patent: WO 00/68856 (2000-11-01), None
patent: WO 00/68859 (2000-11-01), None
Adhikari, R., “Scheduling Solutions”, Information Week, www.informationweek.com, Apr. 1998. 7 pages.
Alanko T. et al., “Mowgli: Improvements for Internet Applications Using Slow Wireless Links”, The 8thIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 3, 1997. pp. 1038-1042.
Aytug, H. et al., “A Review of Machine Learning in Scheduling”, IEEE Transactions on Engineering Management, vol. 41, No. 2, May 1994. pp. 165-171.
Blumberg, D., “Optimizing Mobile Workforce”, Leisure Publications, Feb. 1, 2001.
ClickSchedule, Products, Click Schedule Tour and Article Web pages, ClickService Software, Inc., www.clickservice.com/products, 2000 (retrieved Feb. 2005). 12 pages.
“Connectria Unveils ServeClick to Enable the Next Wave of E-Commerce—‘E-Scheduling’ of Services, Appointments & Reservations”, Business Wire, New York, Jan. 4, 2000. Two pages.
“DeliveryNet for Home Delivery”, www.Descartes.com, e-Fulfillment Solutions, Mar. 20, 2000. Nine pages.
De Serres, Y., “Simultaneous optimization of flow control and scheduling in queues”, McGill University, Publication No. AAT NN72160, 1991. Abstract only, one page.
DiCarlo, L., “Connectria: E-scheduling is next big thing”, eWeek, Mar. 20, 2000. pp. 1-3.
Domenjoud, E. et al., “Generating feasible schedules for a pick-up and delivery problem”, Proceedings of CP, Technical Report 98-R-142, Apr. 1998. pp. 1-12.
Dumas, Y. et al., “Pickup and Delivery Problem with Time Windows”, European Journal of Operational Research, vol. 54, No. 1, Sep. 1991. Abstract only. One page.
Gunes, E.D., “Workforce Scheduling”, Department of Industrial Engineering Bilkent University, Apr. 1999. 1-11.
ILOG.com, “ILOG Dispatcher Field Service Dispatcher”, ILOG Worldwide (retrieved from archive.org), Dec. 2000 (retrieved Feb. 2005). 2 pages.
ILOG.com, ILOG World Leader in software components, Business Rules, Rule Engine, Rule Language, Rule Kit, Constraint Base Scheduling, ILOG Dispatcher Web pages, www.ilog.com/products/rules, 2000 (retrieved Feb. 2005). 21 pages.
Keller, A. et al., “Zippering: Managing intermittent connectivity in DIANA”, Mobile Networks and Application, Baltzer Science Publishers BV, Netherlands, vol. 2, No. 4, 1997. pp. 357-364.
Kleinrock, L., “Nomadicity: Anytime, anywhere in a disconnected world”, Mobile Networks and Applications, Journal of Special Topics in Mobile Networks and Applications, J.C. Baltzer AG, Science Publishers, Netherlands, vol. 1, No. 4, 1996. pp. 351-357.
LaPorta T.F. et al., “Challenges for nomadic computing: Mobility management and wireless communications”, Mobile Networks and Applications, Journal of Special Topics in Mobile Networks and Applications, J.C. Baltzer AG, Science Publishers, Netherlands, vol. 1, No. 1, Aug. 1996. pp. 3-16.
Livneh, E., “Case Study: Automating Service Allocation and Scheduling”, Association for Services Management International, www.afsmi.org, May 1997. pp. 1-5.
Marinho J. et al., “Decision Support System for Dynamic Production Scheduling”, IEEE International Symposium on Assembly and Task Planning, Jul. 1999. pp. 424-429.
Martin, J., “Principles of Object-Oriented Analysis and Design”, PTR Prentice Hall, New Jersey 1993. pp. vii-xiii and 133-154.
Marshak, R.T, “ClickSchedule: Completing the Online Buying Experience”, ClickSoftware, Patrica Seybold Group, Oct. 1999. pp. 1-3.
Mazer, M.S. et al., “Writing the Web While Disconnected”, IEEE Personal Communications, vol. 5, No.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Methods and systems for scheduling complex work orders for a... 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 scheduling complex work orders for a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for scheduling complex work orders for a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3945894

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.