wspt's competitive performance for minimizing the total weighted flow time: from single to parallel machines
Clicks: 129
ID: 250512
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
129 views
8 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #482 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We consider the classical online scheduling problem over single and parallel machines with the objective of minimizing total weighted flow time. We employ an intuitive and systematic analysis method and show that the weighted shortest processing time (WSPT) is an optimal online algorithm with the competitive ratio of P+1 for the case of single machine, and it is (P+(3/2)−(1/2m))-competitive for the case of parallel machines (m>1), where P is the ratio of the longest to the shortest processing time.
| Reference Key |
tao2013mathematicalwspt's
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Jiping Tao;Tundong Liu |
| Journal | journal of power sources |
| Year | 2013 |
| DOI |
10.1155/2013/343287
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.