Sequence step algorithm
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#edit
References#edit
- ^ Srisuwanrat, Chachrist (2009). The Sequence Step Algorithm A Simulation-Based Scheduling Algorithm for Repetitive Projects with Probabilistic Activity Durations (Thesis thesis). hdl:2027.42/62300.
- ^ Chachrist Srisuwanrat; Photios G. Ioannou (24 October 2007). "The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization" (PDF). Archived from the original (PDF) on 24 October 2007. Retrieved 19 June 2023.
Further reading#edit
- Photios G. Ioannou and Chachrist Srisuwanrat Sequence Step Algorithm for Continuous Resource Utilization in Probabilistic Repetitive Projects
- Chachrist Srisuwanrat; Photios G. Ioannou (24 October 2007). "The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization" (PDF). Archived from the original (PDF) on 24 October 2007. Retrieved 19 June 2023.
This article is mirrored from “Sequence step algorithm” on English Wikipedia, revision 1290120210, written by Wikipedia's contributors and licensed CC BY-SA 4.0. Editing it here creates a Quire copy with its own history.
Synced with Wikipedia revision 1290120210 · just now