This is an old revision of this page, as edited by Kcdills(talk | contribs) at 17:55, 21 June 2016(Adding/removing wikilink(s); Copyedit (minor)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 17:55, 21 June 2016 by Kcdills(talk | contribs)(Adding/removing wikilink(s); Copyedit (minor))
This article needs attention from an expert on the subject. Please add a reason or a talk parameter to this template to explain the issue with the article. When placing this tag, consider associating this request with a WikiProject.(October 2009)
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.
