Heuristic Scheduling of Activities under Resource and Precedence Restrictions

This paper extends the field of heuristic algorithms for resource constrained scheduling problems in three important areas. First, an algorithm is introduced where the role of the heuristic scheduling urgency factor is expanded from one of solely determining the order in which activities are considered for scheduling at a given instant, to one of determining the combination of activities to be scheduled at this instant. Second, a new hybrid scheduling urgency factor capitalizing on the fact that this algorithm is sensitive to the absolute value rather than relative sequence of the urgency factors is introduced. Finally, a systematic approach to the evaluation of such algorithms is introduced. This includes the identification of relevant problem attributes and the adoption of evaluative concepts such as computational efficiency and analytic and systems effectiveness.

• 저널Management Science · 23(4) · 412–422
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.23.4.412
• 저자Arne Thesen