http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Sequence_step_algorithmSequence step algorithm - Revision history2026-10-26T05:08:05ZRevision history for this page on the wikiMediaWiki 1.43.1http://debianws.lexgopc.com/wiki143/index.php?title=Sequence_step_algorithm&diff=5765415&oldid=previmported>THEDUMOX: Adding short description: "Computer Algorithm"2025-05-12T23:03:20Z<p>Adding <a href="https://en.wikipedia.org/wiki/Short_description" class="extiw" title="wikipedia:Short description">short description</a>: "Computer Algorithm"</p>
<p><b>New page</b></p><div>{{Short description|Computer Algorithm}}<br />
{{Use dmy dates|date=June 2023}}<br />
{{more citations needed|date=December 2022}}<br />
<br />
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|hdl=2027.42/62300 }}</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=The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization |url=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=2023-06-19 |archive-date=2007-10-24 |archive-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 |lang=en |author1=Chachrist Srisuwanrat |author2=Photios G. Ioannou}}</ref><br />
<br />
==See also==<br />
* [[Computational resource]]<br />
* [[Linear scheduling method]]<br />
<br />
== References ==<br />
<references /><br />
<br />
==Further reading==<br />
* 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]<br />
* {{Cite web |date=2007-10-24 |title=The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization |url=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=2023-06-19 |archive-date=2007-10-24 |archive-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 |lang=en |author1=Chachrist Srisuwanrat |author2=Photios G. Ioannou}}<br />
<br />
{{DEFAULTSORT:Sequence Step Algorithm}}<br />
[[Category:Scheduling algorithms]]<br />
[[Category:Network theory]]<br />
<br />
<br />
{{algorithm-stub}}</div>imported>THEDUMOX