Sequence step algorithm: Difference between revisions
mNo edit summary |
Adding WikiProject-based category (using WikiProjects listed on talk page) as parameter to {{expert needed}} template, to clear out the completely unhelpful Category:Articles needing unspecified expert attention. |
||
| Line 1: | Line 1: | ||
{{multiple issues| |
{{multiple issues| |
||
{{unreferenced|date=March 2020}} |
{{unreferenced|date=March 2020}} |
||
{{expert-subject|date=October 2009}} |
{{expert-subject|1=Computing|date=October 2009}} |
||
}} |
}} |
||
Revision as of 21:38, 13 March 2021
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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
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. |