Property | Value |
dcterms:bibliographicCitation
|
<http://dblp.uni-trier.de/rec/bibtex/journals/tc/AgrawalaCGT84>
|
dc:creator
|
<https://dblp.l3s.de/d2r/resource/authors/Ashok_K._Agrawala>
|
dc:creator
|
<https://dblp.l3s.de/d2r/resource/authors/Edward_G._Coffman_Jr.>
|
dc:creator
|
<https://dblp.l3s.de/d2r/resource/authors/M._R._Garey>
|
dc:creator
|
<https://dblp.l3s.de/d2r/resource/authors/Satish_K._Tripathi>
|
foaf:homepage
|
<http://dx.doi.org/doi.org%2F10.1109%2FTC.1984.1676440>
|
foaf:homepage
|
<https://doi.org/10.1109/TC.1984.1676440>
|
dc:identifier
|
DBLP journals/tc/AgrawalaCGT84
(xsd:string)
|
dc:identifier
|
DOI doi.org%2F10.1109%2FTC.1984.1676440
(xsd:string)
|
dcterms:issued
|
1984
(xsd:gYear)
|
swrc:journal
|
<https://dblp.l3s.de/d2r/resource/journals/tc>
|
rdfs:label
|
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.
(xsd:string)
|
foaf:maker
|
<https://dblp.l3s.de/d2r/resource/authors/Ashok_K._Agrawala>
|
foaf:maker
|
<https://dblp.l3s.de/d2r/resource/authors/Edward_G._Coffman_Jr.>
|
foaf:maker
|
<https://dblp.l3s.de/d2r/resource/authors/M._R._Garey>
|
foaf:maker
|
<https://dblp.l3s.de/d2r/resource/authors/Satish_K._Tripathi>
|
swrc:number
|
4
(xsd:string)
|
swrc:pages
|
351-356
(xsd:string)
|
owl:sameAs
|
<http://bibsonomy.org/uri/bibtexkey/journals/tc/AgrawalaCGT84/dblp>
|
owl:sameAs
|
<http://dblp.rkbexplorer.com/id/journals/tc/AgrawalaCGT84>
|
rdfs:seeAlso
|
<http://dblp.uni-trier.de/db/journals/tc/tc33.html#AgrawalaCGT84>
|
rdfs:seeAlso
|
<https://doi.org/10.1109/TC.1984.1676440>
|
dc:subject
|
uniform processor systems, Consider a set of processors P1,..., Pm differing only in speed, and a set of jobs with exponentially distributed execution times; The rate parameter for the ith processor is given by ?i, 1 =i = m, where we assume the processors are ordered so that ?1 = ?2 = ... = ?m. The problem is to sequence the jobs nonpreemptively so as to minimize expected total flow time (sum of finishing times). We define a threshold ru, Mean flow time minimization, routing problems, stochastic optimization, stochastic scheduling
(xsd:string)
|
dc:title
|
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.
(xsd:string)
|
dc:type
|
<http://purl.org/dc/dcmitype/Text>
|
rdf:type
|
swrc:Article
|
rdf:type
|
foaf:Document
|
swrc:volume
|
33
(xsd:string)
|