Sequence step algorithm

From Wikipedia, the free encyclopedia

This article or section has multiple issues. Please help improve the article or discuss these issues on the talk page. It does not cite any references or sources. Please help improve it by citing reliable sources. Tagged since November 2007. The notability of this article's subject is in question. If notability cannot be established, it may be listed for deletion or removed. Tagged since November 2007. It may need to be wikified to meet Wikipedia's quality standards.Tagged since November 2007.

The Sequence Step Algorithm (SQS-AL) is an algorithm implemented in discrete event simulation system to maximize resource utlization.

It uses sequence step which is a drawing concept in activity-on-node network to orderly determine repetitive activity start date. This is achieved by first selecting a desire confdetermining the distribution of resoure idle time . The determine repetitive activity start date. the problem of probabilistic repetitive project scheduling.

[edit] Further reading

• Photios G. Ioannou and Chachrist Srisuwanrat Sequence Step Algorithm for Continuous Resource Utilization in Probabilistic Repetitive Projects
  
• Chachrist Srisuwanrat and Photios G. Ioannou The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization
  

[edit] See also

• Linear Scheduling Method
• Repetitive Scheduling Method
• Time-Location Based Scheduling Method