会议专题

Project Scheduling in AND-OR Graphs Based on Design Structure Matrix

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.

project scheduling problem AND-OR Graphs design structure matrix

Lidi Ren Sijun Bai Yuntao Guo

School of Management, Northwestern Polytechnical University Xian China School of Management, Northwester Polytechnical University Xian China

国际会议

2010 IEEE International Conference on Emergency Management and Management Sciences(2010 IEEE应急管理与管理科学国际会议 ICEMMS)

北京

英文

161-164

2010-08-08(万方平台首次上网日期,不代表论文的发表时间)