Paper Info
Title
On-line scheduling of parallel machines to minimize total completion times
Abstract
In this paper, we consider the scheduling problem on identical parallel machines, in which jobs are arriving over time and preemption is not allowed. The goal is to minimize the total completion times. According to the idea of the Delayed-SPT Algorithm proposed by Hoogeven and Vestjens [Optimal on-line algorithms for single-machine scheduling. In: Proceedings 5th international conference on integer programming and combinatorial optimization (IPCO). Lecture notes in computer science, vol. 1084. Berlin: Springer; 1996. p. 404-14], we give an on-line algorithm for the scheduling problem on m identical parallel machines. We show that this algorithm is 2-competitive and the bound is tight.
Year
DOI
Venue
2009
10.1016/j.cor.2008.11.008
Computers & OR
Keywords
DocType
Volume
total completion time,Parallel machine scheduling,Delayed-SPT Algorithm,m identical parallel machine,on-line algorithm,computer science,combinatorial optimization,scheduling problem,On-line scheduling,integer programming,On-line algorithm,identical parallel machine,Analysis of algorithm,single-machine scheduling,optimal on-line algorithm
Journal
36
Issue
ISSN
Citations 
9
Computers and Operations Research
11
PageRank 
References 
Authors
0.62
10
2
Name
Order
Citations
PageRank
Peihai Liu1526.01
Xiwen Lu218221.03