--- title: Sequence step algorithm slug: sequence-step-algorithm qid: snapshot: enwiki-001290120210 content_hash: license: CC BY-SA 4.0 source: https://en.wikipedia.org/w/index.php?oldid=1290120210 tags: [22901455, 22911725, 23374305, 23468805, 23603337, 24043274, 26220375, 27424733, 28696367] --- # Sequence step algorithm > [!note] Provenance > Snapshot `enwiki-001290120210` · content root `…` > Derived from · Licensed CC BY-SA 4.0 A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization. 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. A sequence step algorithm (SQS-AL) is an algorithm implemented in a discrete event simulation system to maximize resource utilization. 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. ==See also== Computational resource Linear scheduling method ==Further reading== Photios G. Ioannou and Chachrist Srisuwanrat Sequence Step Algorithm for Continuous Resource Utilization in Probabilistic Repetitive Projects