On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Authors:
Cliff Stein;Joel Wein
Affiliations:
Department of Computer Science, Sudikoff Laboratory, Dartmouth College, Hanover, NH, USA;Department of Computer Science, Polytechnic University, Brooklyn, NY 11201, USA
Venue:
Operations Research Letters
Year:
1997

Citing 13
Cited 29

Scheduling with multiple performance measures: the one-machine case

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

SIAM Journal on Computing
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
Single-machine scheduling to minimize a function of two or three maximum cost criteria

Journal of Algorithms
Minimizing maximum promptness and maximum lateness on a single machine

Mathematics of Operations Research
An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Improved Scheduling Algorithms for Minsum Criteria

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Operations Research Letters

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
Simultaneously optimizing two scheduling objectives

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
All-Norm Approximation Algorithms

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Bicriteria approximation algorithms for scheduling problems with communications

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science
Trade-offs on the location of the core node in a network

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
All-norm approximation algorithms

Journal of Algorithms
Experimental analysis of online algorithms for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing
Bicriteria approximation algorithms for scheduling problems with communications delays

Journal of Scheduling
Approximation Algorithms for Scheduling on Multiple Machines

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Hierarchical minimization of completion time variance and makespan in jobshops

Computers and Operations Research
Pareto approximations for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing
Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Discrete Applied Mathematics
A unified approach to scheduling on unrelated parallel machines

Journal of the ACM (JACM)
Hierarchical minimization of completion time variance and makespan in jobshops

Computers and Operations Research
Experimental analysis of online algorithms for the bicriteria scheduling problem

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
On the bicriteria k-server problem

ACM Transactions on Algorithms (TALG)
Approximation algorithms for the bi-criteria weighted MAX-CUT problem

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
List scheduling in order of α-points on a single machine

Efficient Approximation and Online Algorithms
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A note on scheduling to meet two min-sum objectives

Operations Research Letters
An improved lower bound for a bi-criteria scheduling problem

Operations Research Letters
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems
Fair online load balancing

Journal of Scheduling
Single approximation for the biobjective Max TSP

Theoretical Computer Science
Multi-criteria scheduling: an agent-based approach for expert knowledge integration

Journal of Scheduling
Approximation with a fixed number of solutions of some multiobjective maximization problems

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.