Patent
1994-02-03
1997-04-08
Oberley, Alvin E.
395674, G06F 9455
Patent
active
056196954
ABSTRACT:
An improved scheduling system is effective to schedule resources in a resource constrained environment. The first step in the process is initialization wherein the set of requests to be scheduled and the processing controls are input to the system. A primary sort is done to determine the order of request processing according to an "importance" ranking. Next, the feasible segments are determined. This determination defines the times where the request could conceivably be scheduled with respect to constraints and resource availabilities. A dynamic laxity determination implements a set of heuristics which models a request's allocation possibilities by taking into account the remaining unscheduled requests with which it conflicts. Account is taken of those requests which require multiple concurrent resources by combining multiple resources. A worthiness determination is made which defines a function indicating advantageous start times admitting high worth values. The best start time is determined for request scheduling by combining factors such as worth and request interactions. The request is then placed into the schedule. The primary sort is then resorted in light of the present schedule and processing controls.
REFERENCES:
patent: 4122523 (1978-10-01), Morse et al.
patent: 4256925 (1981-03-01), Goode
patent: 4672536 (1987-06-01), Giroir et al.
patent: 4744026 (1988-05-01), Vanderbei
patent: 4852001 (1989-07-01), Tsushima et al.
patent: 4896369 (1990-01-01), Adams, Jr. et al.
patent: 4912656 (1990-05-01), Cain et al.
patent: 5031089 (1991-07-01), Liu et al.
patent: 5053970 (1991-10-01), Kurihara et al.
patent: 5111391 (1992-05-01), Fields et al.
patent: 5128860 (1992-07-01), Chapman
patent: 5148370 (1992-09-01), Litt et al.
patent: 5153877 (1992-10-01), Esaki et al.
patent: 5202993 (1993-04-01), Tarsy et al.
patent: 5210872 (1993-05-01), Ferguson et al.
patent: 5212791 (1993-05-01), Damian et al.
patent: 5216427 (1993-06-01), Yan et al.
patent: 5216593 (1993-06-01), Dietrich et al.
patent: 5241465 (1993-08-01), Oba et al.
patent: 5270920 (1993-12-01), Pearse et al.
patent: 5291397 (1994-03-01), Powell
patent: 5319781 (1994-06-01), Syswerda
patent: 5325525 (1994-06-01), Shan et al.
patent: 5367687 (1994-11-01), Tarsy et al.
patent: 5406476 (1995-04-01), Deziel, Jr. et al.
patent: 5432887 (1995-07-01), Khaw
Rhinehart & Beasley "Dynamic Programming for Chemical Engineering Applications", Chemical Engineering Dec. 7, 1987 p. 113, vol. 94 No. 18.
Journal of the Association for Computing Machinery, vol. 21, No. 1, Jan. '74 pp. 66-75, Scheduling for Minimum Total Loss Using Service Time Distributions by Kenneth C. Sevcik.
Hain, T.C., "Heuristic method for resource constrained project scheduling", Journal of the Institution of Engineers, vol. 6, issue 65, pp. 183-186 May 85.
Norris, "Two level heuristic for the resource constrained scheduling problem", International Journal of Production Research, vol. 24, Issue 5, pp. 1203-1219 1986.
Elsayed, E.A., "Heuristics for resource constrained scheduling", International Journal of production research, vol. 24, No. 2, pp. 299-310 1986.
Dean et al., "Multiproject Staff Scheduling with Variable Resource Constrants", IEEE Transactions on Engineering Managment, vol. 39, Issue 1, pp. 59-72 1992.
Norbis, M.I., "A Multiobjective Multi Level Heuristic for Dynamic Resource Constrained Scheduling Problems", European Journal of Operational Research, vol. 33, Issue 1, pp. 30-41 1988.
Cooper, D.F., "Heuristics for scheduling resource constrained projects", Management Science, vol. 22, Issue 11, pp. 1186-1194 1976.
Khattab et al., "A New Heuristic for Project Scheduling with a Single Resource Constraint", vol. 20, Issue 3, pp. 381-387 1991.
Arbabi Mansur
Baniak Jonathan E.
Courtenay III St. John
Lockheed Martin Corporation
Oberley Alvin E.
Wurm, Esquire Mark A.
LandOfFree
Method and apparatus for scheduling resources 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 and apparatus for scheduling resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for scheduling resources will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2403021