This HTML5 document contains 20 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
n7http://en.wikipedia.org/wiki/Simulation_Optimization_Library:
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
wikidatahttp://www.wikidata.org/entity/
n2http://dbpedia.org/resource/Simulation_Optimization_Library:

Statements

Subject Item
n2:_Throughput_Maximization
rdfs:label
Simulation Optimization Library: Throughput Maximization
rdfs:comment
The problem of Throughput Maximization is a family of iterative stochastic optimization algorithms that attempt to find the maximum expected throughput in an n-stage Flow line. According to Pichitlamken et al. (2006), there are two solutions to the discrete service-rate moderate-sized problem. With an expected throughput (defined as the limiting throughput over a long time horizon, as opposed to the approximation induced through the need for a warm-up period and ratio-estimate as described under . Each simulation replication should consist of warming up the system with 2000 released jobs starting from an empty system, then recording the time T required to release the next 50 jobs, and estimating the throughput on this replication as 50=T jobs per unit time. Time is then measured in the num
dcterms:subject
dbc:Stochastic_optimization
dbo:wikiPageID
31592827
dbo:wikiPageRevisionID
934852333
dbo:wikiPageWikiLink
dbr:Replication_(statistics) dbr:Stochastic_optimization dbr:Flow_line dbr:Algorithm dbc:Stochastic_optimization
owl:sameAs
wikidata:Q17084408 freebase:m.0glpw0f n16:f6dU
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
The problem of Throughput Maximization is a family of iterative stochastic optimization algorithms that attempt to find the maximum expected throughput in an n-stage Flow line. According to Pichitlamken et al. (2006), there are two solutions to the discrete service-rate moderate-sized problem. With an expected throughput (defined as the limiting throughput over a long time horizon, as opposed to the approximation induced through the need for a warm-up period and ratio-estimate as described under . Each simulation replication should consist of warming up the system with 2000 released jobs starting from an empty system, then recording the time T required to release the next 50 jobs, and estimating the throughput on this replication as 50=T jobs per unit time. Time is then measured in the number of simulation replications performed.
gold:hypernym
dbr:Family
prov:wasDerivedFrom
n7:_Throughput_Maximization?oldid=934852333&ns=0
dbo:wikiPageLength
4746
foaf:isPrimaryTopicOf
n7:_Throughput_Maximization
Subject Item
n7:_Throughput_Maximization
foaf:primaryTopic
n2:_Throughput_Maximization