Sequence step algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 00:18, 23 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]

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. Retrieved 2022-12-19.

@@ Line 1: / Line 1: @@
-{{unreferenced|date=March 2020}}
+{{more citations needed|date=December 2022}}
-A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource|resource]] utilization. <ref>{{Cite thesis |title=The Sequence Step Algorithm A Simulation-Based Scheduling Algorithm for Repetitive Projects with Probabilistic Activity Durations. |url=http://deepblue.lib.umich.edu/handle/2027.42/62300 |date=2009 |degree=Thesis |language=en-US |first=Chachrist |last=Srisuwanrat}}</ref> This is achieved by running through two main nested [[Control flow#Loops|loops]]: A sequence step loop and a replication loop. For each sequence step, each replication loop is a simulation run that collects crew [[Idle (CPU)|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.<ref>{{Cite web |date=2007-10-24 |title=Wayback Machine |url=https://web.archive.org/web/20071024033354/http://iglc.net/conferences/2007/folder.2007-06-29.2095743756/Srisuwanrat%20Ioannou_%20The%20investigation%20of%20lead%20time%20buffering%20under%20uncertainty%20using%20simulation.pdf |access-date=2022-12-19 |website=web.archive.org}}</ref>
+A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource|resource]] utilization.<ref>{{Cite thesis |title=The Sequence Step Algorithm A Simulation-Based Scheduling Algorithm for Repetitive Projects with Probabilistic Activity Durations. |url=http://deepblue.lib.umich.edu/handle/2027.42/62300 |date=2009 |degree=Thesis |language=en-US |first=Chachrist |last=Srisuwanrat}}</ref> This is achieved by running through two main nested [[Control flow#Loops|loops]]: A sequence step loop and a replication loop. For each sequence step, each replication loop is a simulation run that collects crew [[Idle (CPU)|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.<ref>{{Cite web |date=2007-10-24 |title=Wayback Machine |url=https://web.archive.org/web/20071024033354/http://iglc.net/conferences/2007/folder.2007-06-29.2095743756/Srisuwanrat%20Ioannou_%20The%20investigation%20of%20lead%20time%20buffering%20under%20uncertainty%20using%20simulation.pdf |access-date=2022-12-19 |website=web.archive.org}}</ref>
 ==See also==
 * [[Computational resource]]
 * [[Linear scheduling method]]
 == References ==
 <references />
 ==Further reading==
 * Photios G. Ioannou and Chachrist Srisuwanrat [http://www.informs-sim.org/wsc06papers/220.pdf Sequence Step Algorithm for Continuous Resource Utilization in Probabilistic Repetitive Projects]
@@ Line 17: / Line 17: @@
 [[Category:Scheduling algorithms]]
 [[Category:Network theory]]
 {{algorithm-stub}}