Sequence step algorithm
 | This article needs additional citations for verification. (December 2022) |
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
- ^ Srisuwanrat, Chachrist (2009). The Sequence Step Algorithm A Simulation-Based Scheduling Algorithm for Repetitive Projects with Probabilistic Activity Durations (Thesis thesis).
- ^ "Wayback Machine" (PDF). web.archive.org. 2007-10-24. Archived from the original on 2007-10-24. Retrieved 2022-12-19.
{{cite web}}: CS1 maint: bot: original URL status unknown (link)
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
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |