Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Sequence step algorithm

From Wikipedia, the free encyclopedia
Computer Algorithm

icon
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Sequence step algorithm" – news ·newspapers ·books ·scholar ·JSTOR
(December 2022) (Learn how and when to remove this message)

Asequence step algorithm (SQS-AL) is analgorithm implemented in adiscrete event simulation system to maximizeresource utilization.[1] This is achieved by running through two main nestedloops: A sequence step loop and a replication loop. For each sequence step, each replication loop is a simulation run that collects crewidle 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]
  1. ^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.
  2. ^Chachrist Srisuwanrat; Photios G. Ioannou (24 October 2007)."The Investigation of Lead-Time Buffering under Uncertainty Using Simulation and Cost Optimization"(PDF). Archived fromthe original(PDF) on 24 October 2007. Retrieved19 June 2023.

Further reading

[edit]


Stub icon

Thisalgorithms ordata structures-related article is astub. You can help Wikipedia byexpanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Sequence_step_algorithm&oldid=1290120210"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp