Sequence step algorithm - Revision history

THEDUMOX: Adding short description: "Computer Algorithm"

2025-05-12T23:03:20Z

Adding short description: "Computer Algorithm"

← Previous revision		Revision as of 23:03, 12 May 2025
Line 1:		Line 1:
			{{Short description\|Computer Algorithm}}
	{{Use dmy dates\|date=June 2023}}		{{Use dmy dates\|date=June 2023}}
	{{more citations needed\|date=December 2022}}		{{more citations needed\|date=December 2022}}

Franz.wohlkoenig: Missing or empty |title= solved

2023-06-19T06:19:03Z

Missing or empty |title= solved

← Previous revision		Revision as of 06:19, 19 June 2023
Line 1:		Line 1:
			{{Use dmy dates\|date=June 2023}}
	{{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\|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>		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>

	==See also==		==See also==
Line 12:		Line 13:
	==Further reading==		==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]		* 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]
	* ~~Chachrist~~ ~~Srisuwanrat~~ and ~~Photios~~ G. ~~Ioannou~~ [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 ~~The~~ ~~Investigation~~ of ~~Lead-Time~~ ~~Buffering~~ ~~under Uncertainty Using Simulation and Cost Optimization]~~		* {{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}}

	{{DEFAULTSORT:Sequence Step Algorithm}}		{{DEFAULTSORT:Sequence Step Algorithm}}

Citation bot: Alter: title. Add: hdl. Removed parameters. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 1640/3352

2023-03-27T09:25:28Z

Alter: title. Add: hdl. Removed parameters. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 1640/3352

← Previous revision		Revision as of 09:25, 27 March 2023
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=~~Wayback Machine~~ \|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 ~~\|website=web.archive.org~~ \|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>		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==

InternetArchiveBot: Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.3) (Whoop whoop pull up - 12943

2023-03-26T01:04:37Z

Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.3) (Whoop whoop pull up - 12943

← Previous revision		Revision as of 01:04, 26 March 2023
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=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=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 \|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==

BattyBot: Replaced {{unreferenced}} with {{more citations needed}} and other General fixes

2022-12-23T00:18:52Z

Replaced {{unreferenced}} with {{more citations needed}} and other General fixes

← Previous revision		Revision as of 00:18, 23 December 2022
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==		==See also==
	* [[Computational resource]]		* [[Computational resource]]
	* [[Linear scheduling method]]		* [[Linear scheduling method]]


	== References ==		== References ==
	<references />		<references />

	==Further reading==		==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]		* 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:Scheduling algorithms]]
	[[Category:Network theory]]		[[Category:Network theory]]


	{{algorithm-stub}}		{{algorithm-stub}}

Nonentity683 at 10:38, 19 December 2022

2022-12-19T10:38:35Z

← Previous revision		Revision as of 10:38, 19 December 2022
Line 1:		Line 1:
	{{unreferenced\|date=March 2020}}		{{unreferenced\|date=March 2020}}

	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><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==		==See also==
Line 7:		Line 7:
	* [[Linear scheduling method]]		* [[Linear scheduling method]]


		⚫	== References ==
		⚫	<references />
	==Further reading==		==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]		* 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 14:		Line 17:
	[[Category:Scheduling algorithms]]		[[Category:Scheduling algorithms]]
	[[Category:Network theory]]		[[Category:Network theory]]
			{{algorithm-stub}}

⚫	== References ==
⚫	<references />~~{{algorithm-stub}}~~

Nonentity683 at 10:36, 19 December 2022

2022-12-19T10:36:49Z

← Previous revision		Revision as of 10:36, 19 December 2022
Line 15:		Line 15:
	[[Category:Network theory]]		[[Category:Network theory]]

			== References ==

	{{algorithm-stub}}		<references />{{algorithm-stub}}

Nonentity683: Added References.

2022-12-19T10:35:39Z

Added References.

← Previous revision		Revision as of 10:35, 19 December 2022
Line 1:		Line 1:
	{{unreferenced\|date=March 2020}}		{{unreferenced\|date=March 2020}}

	A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource\|resource]] utilization. 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.		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><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==		==See also==

PrimeBOT: /* top */Task 24: remove a maintenance template following a TFD

2022-01-18T21:39:57Z

top: Task 24: remove a maintenance template following a TFD

← Previous revision		Revision as of 21:39, 18 January 2022
Line 1:		Line 1:
	{{multiple issues\|
	{{unreferenced\|date=March 2020}}		{{unreferenced\|date=March 2020}}
	{{expert-subject\|1=Computing\|date=October 2009}}
	}}

	A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource\|resource]] utilization. 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.		A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource\|resource]] utilization. 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.

JPxG: 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.

2021-03-13T21:38:41Z

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.

← Previous revision		Revision as of 21:38, 13 March 2021
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}}
	}}		}}

← Previous revision		Revision as of 23:03, 12 May 2025
Line 1:		Line 1:
			{{Short description\|Computer Algorithm}}
	{{Use dmy dates\|date=June 2023}}		{{Use dmy dates\|date=June 2023}}
	{{more citations needed\|date=December 2022}}		{{more citations needed\|date=December 2022}}

← Previous revision		Revision as of 21:39, 18 January 2022
Line 1:		Line 1:
	{{multiple issues\|
	{{unreferenced\|date=March 2020}}		{{unreferenced\|date=March 2020}}
	{{expert-subject\|1=Computing\|date=October 2009}}
	}}

	A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource\|resource]] utilization. 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.		A '''sequence step algorithm''' ('''SQS-AL''') is an [[algorithm]] implemented in a [[discrete event simulation]] system to maximize [[System resource\|resource]] utilization. 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.