Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
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
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science
Online scheduling to minimize modified total tardiness with an availability constraint
Theoretical Computer Science
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Computers and Operations Research
| Hi-index | 0.01 |
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.