A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines

Xuyang Chu and Jiping Tao

Mathematical Problems in Engineering, 2020, vol. 2020, 1-9

Abstract:

We consider the classic online scheduling problem on uniform machines in the online setting where jobs arrive over time. Preemption is not allowed. The objective is to minimize total weighted completion time. An online algorithm based on the directly waiting strategy is proposed. Its competitive performance is proved to be by the idea of instance reduction, where is the fastest machine speed after being normalized by the slowest machine speed.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/7527862.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/7527862.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:7527862

DOI: 10.1155/2020/7527862

Access Statistics for this article

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