Simplifying multiproject scheduling problem based on design structure matrix and its solution by an improved aiNet algorithm

13Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Managing multiple project is a complex task involving the unrelenting pressures of time and cost. Many studies have proposed various tools and techniques for single-project scheduling; however, the literature further considering multimode or multiproject issues occurring in the real world is rather scarce. In this paper, design structure matrix (DSM) and an improved artificial immune network algorithm (aiNet) are developed to solve a multi-mode resource-constrained scheduling problem. Firstly, the DSM is used to simplify the mathematic model of multi-project scheduling problem. Subsequently, aiNet algorithm comprised of clonal selection, negative selection, and network suppression is adopted to realize the local searching and global searching, which will assure that it has a powerful searching ability and also avoids the possible combinatorial explosion. Finally, the approach is tested on a set of randomly cases generated from ProGen. The computational results validate the effectiveness of the proposed algorithm comparing with other famous metaheuristic algorithms such as genetic algorithm (GA), simulated annealing algorithm (SA), and ant colony optimization (ACO). Copyright © 2012 Chunhua Ju and Tinggui Chen.

Cite

CITATION STYLE

APA

Ju, C., & Chen, T. (2012). Simplifying multiproject scheduling problem based on design structure matrix and its solution by an improved aiNet algorithm. Discrete Dynamics in Nature and Society, 2012. https://doi.org/10.1155/2012/713740

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free