Scheduling design activities with a pull system approach

The design process can be considered as a series of design phases. Each design phase can be further divided into number of design activities. In the network of design activities, the design activities generate information which is used by the succeeding activities. Since importance of the input information available from different activities changes with respect to the requirement of the design activities, a pull system approach for the management of design activities is proposed. Due to the concurrent consideration of many factors in the design process, it is required that the design activities are performed by teams of experts. In addition to the multiple resource requirement, the uncertainty in the weights and duration of design activities makes the problem of scheduling design activities complex. A heuristic algorithm is proposed to solve the problem considered in this paper.

[1]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[2]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

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

[4]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5]  Colin E. Bell,et al.  Solving resource-constrained project scheduling problems by A* search , 1990 .

[6]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[7]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[8]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

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

[10]  S. Selcuk Erenguc,et al.  Project Scheduling Problems: A Survey , 1993 .

[11]  Subhash C. Narula,et al.  Multi-Project Scheduling: Analysis of Project Performance , 1985 .

[12]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[13]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[14]  S. Elmaghraby,et al.  The Analysis of Activity Networks Under Generalized Precedence Relations GPRs , 1992 .

[15]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[16]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

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

[18]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[19]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[20]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Preemptive Case , 1972, Oper. Res..

[21]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[22]  Andrew Kusiak,et al.  Design of components for schedulability , 1994 .

[23]  John B. Kidd,et al.  Toyota Production System , 1993 .