Sequence step algorithm: Difference between revisions
Content deleted Content added
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.3) (Whoop whoop pull up - 12943 |
Citation bot (talk | contribs) Alter: title. Add: hdl. Removed parameters. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 1640/3352 |
||
| Line 1: | Line 1: | ||
{{more citations needed|date=December 2022}} |
{{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= |
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= |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=2022-12-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 |url-status=bot: unknown }}</ref> |
||
==See also== |
==See also== |
||
Revision as of 09:25, 27 March 2023
 | This article needs additional citations for verification. (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]
See also
References
- ^ 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.
- ^ . 2007-10-24 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. Archived from the original on 2007-10-24. Retrieved 2022-12-19.
{{cite web}}: Missing or empty|title=(help)CS1 maint: bot: original URL status unknown (link)
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. |