Online scheduling on m uniform machines to minimize total (weighted) completion time

Authors:
Ming Liu;Chengbin Chu;Yinfeng Xu;Feifeng Zheng
Affiliations:
School of Management, Xian Jiaotong University, Xian, Shaanxi Province, 710049, PR China and Laboratoire Génie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92295 Châtenay-Ma ...;School of Management, Xian Jiaotong University, Xian, Shaanxi Province, 710049, PR China and Laboratoire Génie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92295 Châtenay-Ma ...;School of Management, Xian Jiaotong University, Xian, Shaanxi Province, 710049, PR China;School of Management, Xian Jiaotong University, Xian, Shaanxi Province, 710049, PR China
Venue:
Theoretical Computer Science
Year:
2009

Citing 8
Cited 0

Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Online computation and competitive analysis

Online computation and competitive analysis
Approximation Techniques for Average Completion Time Scheduling

SIAM Journal on Computing
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

Mathematics of Operations Research
Minimizing the total completion time on-line on a single machine, using restarts

Journal of Algorithms
On-line scheduling of parallel machines to minimize total completion times

Computers and Operations Research
A class of on-line scheduling algorithms to minimize total completion time

Operations Research Letters
On-line scheduling to minimize average completion time revisited

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study two online problems on m uniform machines with speeds s"1@?...@?s"m. The problems are online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and weight become known at its arrival time. For the first problem Q|r"j,online|@?C"j, we prove that R-LIST algorithm is 4m-3+32-competitive. For the second problem Q|r"j,online,pmtn|@?w"jC"j, we show that WSPT-1 algorithm is 2-competitive if s"i/s"m=@?"h"="1^is"h/@?"h"="1^ms"h for i=1,...,m-1. Then we study a special case where s"1=s"2=...=s"m"-"1@?s"m. We obtain that algorithm WSPT-1 is 2-competitive if s"m(m-2)@?s"1(m-1).