Scheduling Design Activities

The design process can be divided into a number of activities that are performed according to precedence constraints among them. The objective of concurrent engineering approach is to minimize the total design time without violating any of the constraints. A limited number of available resources constrain the simultaneous execution of design activities. The execution of succeeding design activities depends on the available information provided by the preceding activities. The smooth flow of information from the beginning to the end of the design process is a key factor for successful and timely completion of the design process. In this paper, a pull system approach for management of activities in the design process is proposed. In this approach, the dynamic scheduling policies are adopted. A heuristic for scheduling of activities is developed.

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

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

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

[4]  David M. Auslander,et al.  Control and dynamic systems , 1970 .

[5]  Gérard Verfaillie,et al.  Operations research and artificial intelligence cooperation to solve scheduling problems: the OPAL and OSCAR systems , 1990, Expert Planning Systems.

[6]  Arnaldo Hernandez.  Just-In-Time Manufacturing: A Practical Approach , 1989 .

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

[8]  Andrew Kusiak,et al.  Intelligent Manufacturing Systems , 1990 .

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

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

[11]  Kang G. Shin,et al.  Scheduling job operations in an automatic assembly line , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[12]  J. Keith Ord,et al.  A Simple Approximation to the Completion Time Distribution for a PERT Network , 1991 .

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

[14]  Adedeji Badiru.  Project Management in Manufacturing and High Technology Operations , 1996 .

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

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

[17]  Tariq Haroon Ahmad,et al.  Project management with CPM , 1976 .

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

[19]  Andrew Kusiak.  Concurrent Engineering: Design of Assemblies for Schedulability , 1991 .

[20]  Joseph J. Moder,et al.  Project Management with CPM and PERT , 1964 .

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

[22]  Bajis M. Dodin.  Approximating the distribution functions in stochastic networks , 1985, Comput. Oper. Res..

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

[24]  Andrew Kusiak.  Intelligent Design and Manufacturing , 1992 .

[25]  E. Bensana,et al.  OPAL: A Knowledge-Based System for Industrial Job-Shop Scheduling , 1988 .

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

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

[28]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

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