Please use this identifier to cite or link to this item: https://doi.org/10.1109/TEM.2011.2107558
Title: A novel approach to DSM-based activity sequencing problem
Authors: Qian, Y.
Lin, J.
Goh, T.N. 
Xie, M. 
Keywords: Design structure matrix
heuristic
hybrid optimization approach
iterative process
project scheduling
Issue Date: Nov-2011
Source: Qian, Y., Lin, J., Goh, T.N., Xie, M. (2011-11). A novel approach to DSM-based activity sequencing problem. IEEE Transactions on Engineering Management 58 (4) : 688-705. ScholarBank@NUS Repository. https://doi.org/10.1109/TEM.2011.2107558
Abstract: Recently, there has been a growing interest in applying the design structure matrix (DSM) for planning projects that consist of many interrelated activities. One important objective of planning is to find an activity sequence so as to minimize the sum of superdiagonal numbers in a DSM. It is known that the problem is NP-complete and is difficult to solve. In this study, we prove several structural properties of the problem, and propose a heuristic for obtaining good feasible solutions. We find that based on the fold operation, a block of activities can be treated as a single activity. A novel hybrid algorithm is then presented for solving large activity sequencing problems. Finally, we perform a number of experiments and show that good solutions can be easily obtained by our approach. Moreover, the improvement achieved by the proposed approach is significant. © 2011 IEEE.
Source Title: IEEE Transactions on Engineering Management
URI: http://scholarbank.nus.edu.sg/handle/10635/72250
ISSN: 00189391
DOI: 10.1109/TEM.2011.2107558
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

15
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

11
checked on Nov 18, 2017

Page view(s)

33
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.