Resource constrained scheduling of hierarchically structured designactivity networks

In this paper, a new approach to the problem of scheduling of design activities with precedence and multiple resource constraints is proposed. In addition to the AND type relationship, OR and EXCLUSIVE OR relationships may also exist between design activities. In order to handle these logical relationships, IDEF3 is used for network representation. A large network of design activities can be arranged in different levels of abstraction. A procedure is proposed to transform an IDEF3 model into a set of alternative precedence networks. In the networks selected, the activities that are resource independent are grouped with a partitioning procedure. In order to increase the efficiency of the search for the best schedule, a procedure based on the Christofides et al. (1987) reduction procedure is introduced to determine a lower bound on the completion time of the hierarchically structured design activity network