Quality of move-optimal schedules for minimizing total weighted completion time

Authors:
Tobias Brueggemann;Johann L. Hurink;Walter Kern
Affiliations:
Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Operations Research Letters
Year:
2006

Citing 3
Cited 1

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Improving local search heuristics for some scheduling problems. Part II

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Performance Guarantees of Local Search for Multiprocessor Scheduling

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 32. In a special case, the approximation ratio is 32-1/6~1.092.