A Study Of Combining Heuristics For Scheduling Projects With Limited Multiple Resources
Abbreviated Journal Title
Z. Angew. Math. Mech.
Computer Science; Interdisciplinary Applications; Engineering, ; Industrial
The main objective of this study was to find a simple and quick procedure on the microcomputer for scheduling activities of a constrained multiple resource single project network that would minimize project duration. From this research there are two different types of results presented. First, a combination of simple heuristics which find the average of the minimum project durations for the constrained resource problem is presented. This combination not only supports the previous research on successful simple heuristic methods which set the priorities for constrained resource problems, but also produces results which are significantly better than those obtained by single heuristics. Second, a procedure for determining this combination of heuristics is introduced. A computer algorithm, COMAL, was developed for this study with constrained resource problems, but in the future its use may be expanded into other fields.
Zeitschrift Fur Angewandte Mathematik Und Mechanik
Morse, Larry C. and Whitehouse, Gary E., "A Study Of Combining Heuristics For Scheduling Projects With Limited Multiple Resources" (1988). Faculty Bibliography 1980s. 679.