Graph-based modeling: PERT scheduling with resources using qualitative simulation graphs

Authors:
Ricki G. Ingalls;Douglas J. Morrice
Affiliations:
Compaq Computer Corporation, Houston, TX and Oklahoma State University, Stillwater, OK;The University of Texas at Austin, Austin, TX
Venue:
Proceedings of the 32nd conference on Winter simulation
Year:
2000

Citing 3
Cited 1

Eliminating canceling edges from the simulation graph model methodology

WSC '96 Proceedings of the 28th conference on Winter simulation
The implementation of temporal intervals in qualitative simulation graphs

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Slam II - Network Models for Decision Support

Slam II - Network Models for Decision Support

Workflow Simulation across Multiple Workflow Domains

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Qualitative Simulation Graph Methodology (QSGM) is well suited to address the PERT scheduling with resources problem. The coverage property of QSGM has two important implications for the PERT scheduling problem. First, it means that all possible schedules are represented. Second, it means that, as long as the delay time intervals are not violated, we can characterize all possible outcomes of a decision that needs to be made in the schedule. This gives rise to the possibility of robust point-in-time scheduling decisions without needed to rerun the simulation in order to get the results.