A note on scheduling to meet two min-sum objectives

Authors:
Eric Angel;Evripidis Bampis;Aleksei V. Fishkin
Affiliations:
LaMI, CNRS UMR 8042, Université d'ívry Val d'Essonne, France;LaMI, CNRS UMR 8042, Université d'ívry Val d'Essonne, France;Department of Computer Science, University of Liverpool, Chadwick Building, Peach Street, Liverpool L69 7ZF, UK
Venue:
Operations Research Letters
Year:
2007

Citing 4
Cited 4

Improved bicriteria existence theorems for scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Information Processing Letters
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An improved lower bound for a bi-criteria scheduling problem

Operations Research Letters
Single approximation for the biobjective Max TSP

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/@c),1+@c)-approximation algorithm, and show that for @c1, there is no (x,y)-approximation with 1