Resource constrained scheduling of hierarchically structured design activity 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. >

[1]  Arthur C. Sanderson,et al.  Assembly Sequence Planning , 1990, AI Mag..

[2]  C. L. Ang,et al.  Development of a knowledge-based manufacturing modelling system based on IDEFO for the metal-cutting industry , 1994 .

[3]  Andrew Kusiak,et al.  Reengineering of design and manufacturing processes , 1994 .

[4]  R. J. Mayer,et al.  Information integration for concurrent engineering (IICE) , 1995 .

[5]  Samuel Corenstein.  An Algorithm for Project (Job) Sequencing with Resource Constraints , 1972, Oper. Res..

[6]  Arthur C. Sanderson,et al.  Evaluation Functions For Assembly Sequence Planning , 1989, Other Conferences.

[7]  J. Ettlie.  Managing the design-manufacturing process , 1990 .

[8]  Leila De Floriani,et al.  Computational algorithms for hierarchically structured project networks , 1982, Oper. Res. Lett..

[9]  Antony Unwin,et al.  Modeling and Analysis Using Q-GERT Networks , 1977 .

[10]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[11]  Douglas T. Ross,et al.  Structured Analysis (SA): A Language for Communicating Ideas , 1977, IEEE Transactions on Software Engineering.

[12]  S. Elmaghraby.  An Algebra for the Analysis of Generalized Activity Networks , 1964 .

[13]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[14]  Klaus Neumann,et al.  Stochastic Project Networks , 1990 .

[15]  Ray W. Baines,et al.  A state of the art review of IDEFO , 1993 .