Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Integrating a Genetic Algorithm into a Knowledge-Based System for Ordering Complex Design Processes

4 references·12 citing·37 second hop

FromToDepth

this work references cited by second hop

References

1991Schedule Optimization Using Genetic Algorithms499 cited
1996A Genetic Algorithm for Scheduling and Decomposition of Multidisciplinary Design Problems104 cited
1994Ordering design tasks based on coupling strengths81 cited
1989A knowledge-based tool for multilevel decomposition of a complex design problem73 cited

Cited by

2007Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art42 cited
2011A Novel Approach to DSM-Based Activity Sequencing Problem28 cited
1999Tools and Techniques for Decomposing and Managing Complex Design Projects28 cited
2005Re-sequencing of Design Processes With Activity Stochastic Time and Cost: An Optimization-Simulation Approach18 cited
2005Identifying and Evaluating Parallel Design Activities Using the Design Structure Matrix18 cited
2009Evaluation of Acceleration Effect of Dynamic Sequencing of Design Process in a Multiproject Environment15 cited
2021Enhanced Genetic and Imperialist Competitive Based Algorithms for Reducing Design Feedbacks in the Design Structure Matrix11 cited
2012Development of a DSM-Based Methodology in an Academic Setting11 cited
2009Matrix-based decomposition algorithms for engineering applications: the survey and generic framework10 cited
1997

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN ICED 97 TAMPERE, AUGUST 19 - 21, 1997 REDUCING DESIGN CYCLE TIME AND COST THROUGH PROCESS RESEQUENCING

9 cited

2013Development of a Genetic Algorithm to Automate Clustering of a Dependency Structure Matrix7 cited

2009Sequencing of design tasks based on the degree of permissible concurrency6 cited