Project scheduling in AND-OR Graphs based on Design Structure Matrix

Lidi Ren, Sijun Bai, Yuntao Guo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper considers a project scheduling problem in AND-OR Graphs which include two types of nodes to represent the relationship of predecessor and successor. The problem is to find the earliest starting times for all activities and calculate the project duration. Using the Design Structure Matrix to capture the information flow between two tasks, a model was given to solve the problem in this paper.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Emergency Management and Management Sciences, ICEMMS 2010
Pages161-164
Number of pages4
DOIs
StatePublished - 2010
Event2010 IEEE International Conference on Emergency Management and Management Sciences, ICEMMS 2010 - Beijing, China
Duration: 8 Aug 201010 Aug 2010

Publication series

NameProceedings - 2010 IEEE International Conference on Emergency Management and Management Sciences, ICEMMS 2010

Conference

Conference2010 IEEE International Conference on Emergency Management and Management Sciences, ICEMMS 2010
Country/TerritoryChina
CityBeijing
Period8/08/1010/08/10

Keywords

  • AND-OR Graphs
  • Design Structure Matrix
  • Project scheduling problem

Fingerprint

Dive into the research topics of 'Project scheduling in AND-OR Graphs based on Design Structure Matrix'. Together they form a unique fingerprint.

Cite this