WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

Jiping Tao and Tundong Liu

Mathematical Problems in Engineering, 2013, vol. 2013, 1-7

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 for the case of single machine, and it is ( )-competitive for the case of parallel machines , where P is the ratio of the longest to the shortest processing time.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/343287.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/343287.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:343287

DOI: 10.1155/2013/343287

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().