DocumentCode
784501
Title
Resource constrained scheduling of hierarchically structured design activity networks
Author
Belhe, Upendra ; Kusiak, Andrew
Author_Institution
Intelligent Syst. Lab., Iowa Univ., Iowa City, IA, USA
Volume
42
Issue
2
fYear
1995
fDate
5/1/1995 12:00:00 AM
Firstpage
150
Lastpage
158
Abstract
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
Keywords
concurrent engineering; design engineering; management; scheduling; AND; EXCLUSIVE OR; IDEF3 model; OR; abstraction levels; alternative precedence networks; completion time; concurrent engineering; hierarchically structured design activity networks; logical relationships; lower bound; management; partitioning procedure; reduction procedure; resource constrained scheduling; search efficiency; Concurrent engineering; Costs; Gain control; Industrial engineering; Intelligent systems; Job shop scheduling; Process design; Process planning; Product development; Virtual manufacturing;
fLanguage
English
Journal_Title
Engineering Management, IEEE Transactions on
Publisher
ieee
ISSN
0018-9391
Type
jour
DOI
10.1109/17.387271
Filename
387271
Link To Document