Method for resource assignment and scheduling

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1900

Patent

active

054672686

ABSTRACT:
A system and method for assigning and scheduling resource requests to resource providers use a modified "best-first" search technique that combines optimization, artificial intelligence, and constraint-processing to arrive at near-optimal assignment and scheduling solutions. In response to changes in a dynamic resource environment, potential changes to an existing assignment set are evaluated in a search for a better solution. New calls are assigned and scheduled as they are received, and the assignment set is readjusted as the field service environment changes, resulting in global optimization. Each search operation is in response to either an incremental change to the assignment set such as adding a new resource request, removing a pending resource request, reassigning a pending resource request, or to a request for further evaluation. Thus, the search technique assumes that the existing assignment set is already optimized, and limits the task only to evaluating the effects of the incremental change. In addition, each search operation produces a complete assignment and scheduling solution. Consequently, the search can be terminated to accept the best solution generated so far, making the technique an "anytime" search.

REFERENCES:
patent: 4092718 (1978-05-01), Wendt
patent: 4212069 (1980-07-01), Baumann
patent: 4799162 (1989-01-01), Shinkawa et al.
patent: 4937743 (1990-06-01), Rassman et al.
patent: 5099431 (1992-03-01), Natarajan
patent: 5122959 (1992-06-01), Nathanson et al.
patent: 5177684 (1993-01-01), Harker et al.
patent: 5241465 (1993-08-01), Oba et al.
patent: 5255181 (1993-10-01), Chapman et al.
patent: 5295065 (1994-03-01), Chapman et al.
patent: 5325292 (1994-06-01), Crockett
A. V. Hill and D. C. Whybark, "Chexpedite: A Computer-Based Approach to the Bank Courier Problem," Decision Sciences, vol. 13, No. 2, Apr. 1982, pp. 251-265.
M. S. Fox and S. F. Smith, "ISIS--a knowledge-based system for factory scheduling," Expert Systems, vol. 1, No. 1, 1984, pp. 25-49.
A. V. Hill and D. C. Whybark, "Comparing Exact Solution Procedures for the Multi-Vehicle Routing Problem," The Logistics and Transportation Review, vol. 12, No. 3, 1976, pp. 145-153.
T. Dean and M. Boddy, "An Analysis of Time-Dependent Planning," in Proceedings of the Seventh National Conference on Artificial Intelligence, A.A.A.I., 1988, pp. 49-54.
H. Berliner and G. Goetsch, "A Study of Search Methods: The Effect of Constraint Satisfaction and Adventurousness," in Proceedings of the Ninth International Joint Conference on Artificial Intelligence, vol. 2, Aug. 18-23, 1985, pp. 1079-1082.
A. V. Hill, J. D. Naumann, and N. L. Chervany, "SCAT and SPAT: Large-Scale Computer-Based Optimization Systems for the Personnel Assignment Problem", Decision Sciences, vol. 14, No. 2, Apr. 1983, pp. 207-220.
B. Kalantari, A. V. Hill, and S. R. Arora, "An algorithm for the traveling salesman problem with pickup and delivery customers," European Journal of Operational Research, vol. 22, No. 3, Dec. 1985, pp. 377-386.
A. V. Hill, "An Experimental Comparison of Dispatching Rules for Field Service Support," Decision Sciences, vol. 23, No. 1, Winter 1992, pp. 235-249.
D. Whitley, T. Starkweather, and D. Shaner, "The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination," Handbook of Genetic Algorithms, Chapter 22, 1991, pp. 350-372.
M. Zweben, M. Deale, and R. Gargan, "Anytime Rescheduling," in Proceedings of a Workshop on Innovative Approaches to Planning, Scheduling and Control, San Diego, California, Nov. 5-8, 1990, pp. 251-259.
A. V. Hill, V. A. Mabert, and D. W. Montgomery, "A Decision Support System for the Courier Vehicle Scheduling Problem," OMEGA Int. J. of Mgmt Sci., vol. 16, No. 4, 1988, pp. 333-345.
H. Prade, "Using Fuzzy Set Theory in a Scheduling Problem: A Case Study," Fuzzy Sets and Systems, vol. 2, No. 2, 1979, pp. 153-165.
M. S. Fox, N. Sadeh and C. Baykan, "Constrained Heuristic Search," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI), Detroit, Michigan, vol. 1, Aug. 20-25, 1989, pp. 309-315.
W. Chiang and M. S. Fox, "Protection Against Uncertainty in a Deterministic Schedule," in Proceedings of the Fourth International Conference on Expert Systems in Production and Operations Management, Hilton Head, South Carolina, May 1990, pp. 184-196.
M. Zweben, "Constraint-Based Simulated Annealing: An Iterative Improvement Framework for Constraint Satisfaction Search," NASA Ames Research Center, Moffett Field, California, Aug. 9, 1990, pp. 1-13.
R. Hublou, "Manufacturing Operations Scheduling," Business Intelligence Program Report D90-1436, SRI International, May 1990, pp. 1-39.
A. V. Hill, "An Experimental Comparison of Human Schedulers and Heuristic Algorithms for the Traveling Salesman Problem," Journal of Operations Management, vol. 2, No. 4, Aug. 1982, pp. 215-223.
P. Prosser, "A Reactive Scheduling Agent," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, Michigan, Aug. 20-25, 1989, pp. 1004-1009.
E. Ghalichi and J. Collins, "The Dispatch Advisor," in Proceedings of the Workshop on Artificial Intelligence for Customer Service and Support, Eighth IEEE Conference on Artificial Intelligence Applications, Monterey, California, Mar. 3, 1992, pp. 60-68.
J. E. Collins and E. M. Sisley, "AI in Field Service: The Dispatch Advisor," in Working Notes, AI in Service and Support: Bridging the Gap Between Research and Applications, Eleventh National Conference on Artificial Intelligence, Washington, D.C., Jul. 11-15, 1993, pp. 26-37.
J. Tsitsiklis, "Special Cases of Traveling Salesman and Repairman Problems with Time Windows," Report LIDS-P-1987, Massachusetts Institute of Technology, Jun. 1990, pp. 1-23.
S. F. Smith, "The OPIS Framework for Modeling Manufacturing Systems," Tech Report CMU-RI-TR-89-30, Carnegie-Mellon University, Dec. 1989, pp. 1-56.
D. L. Haugen, "A Study of Scheduling and Quality of Field-Service Support Systems," Ph.D. Thesis, University of Minnesota, Nov. 1993, pp. 1-251.

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

Method for resource assignment and scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for resource assignment and scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for resource assignment and scheduling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1225459

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