论文信息 - Heuristics for resource-constrained scheduling†

Heuristics for resource-constrained scheduling†

SUMMARY In this paper we present two heuristics (TIMROS and TIMGEN) for allocating resources to activities of projects under single-resource constraints. The heuristics are based on criteria which utilize the duration and resources required for each activity. Allocation of resources is then performed according to the priority ranking of the activities with respect to the developed criteria. †This research was conducted while Nasr was at Rutgers.

Elsayed A. Elsayed | N. Z. Nasr | E. Elsayed | N. Nasr

[1] J. D. Wiest,et al. Management Guide to PERT/CPM , 1969 .

[2] Leon F. McGinnis,et al. A Critique of Project Planning with Constrained Resources , 1973 .

[3] E. W. Davis,et al. Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[4] Leon F. McGinnis. Project Scheduling with Resource Considerations , 1982 .

[5] Katsoulas PeterC.,et al. A Branch and Bound Algorithm for Use in Resource Allocation , 1976 .

[6] Edward W. Davis,et al. Project Scheduling under Resource Constraints—Historical Review and Categorization of Procedures , 1973 .

[7] James R. Brown,et al. Project scheduling under resource constraints an extension of Brooks' Algorithm. , 1976 .

[8] Gary E. Whitehouse,et al. GENRES: An extension of Brooks Algorithm for project scheduling with resource constraints , 1979 .

[9] Elsayed A. Elsayed,et al. Algorithms for project scheduling with resource constraints , 1982 .

[10] T. E. Moore,et al. An Implicit Enumeration Algorithm for the Nonpreemptive Shop Scheduling Problem , 1974 .

[11] J. D. Wiest,et al. A Heuristic Model for Scheduling Large Projects with Limited Resources , 1967 .