Sequence step algorithm explained

A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization.[1] This is achieved by running through two main nested loops: A sequence step loop and a replication loop. For each sequence step, each replication loop is a simulation run that collects crew idle time for activities in that sequence step. The collected crew idle times are then used to determine resource arrival dates for user-specified confidence levels. The process of collecting the crew idle times and determining crew arrival times for activities on a considered sequence step is repeated from the first to the last sequence step.[2]

See also

References

  1. The Sequence Step Algorithm A Simulation-Based Scheduling Algorithm for Repetitive Projects with Probabilistic Activity Durations. . 2009 . Thesis . en-US . Chachrist . Srisuwanrat. 2027.42/62300 .
  2. Web site: 2007-10-24 . The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization . 2023-06-19 . 2007-10-24 . https://web.archive.org/web/20071024033354/http://iglc.net/conferences/2007/folder.2007-06-29.2095743756/Srisuwanrat%20Ioannou_%20The%20investigation%20of%20lead%20time%20buffering%20under%20uncertainty%20using%20simulation.pdf . en . Chachrist Srisuwanrat . Photios G. Ioannou.

Further reading