An improved lower bound for a bi-criteria scheduling problem

Authors:
Jin Yan
Affiliations:
School of Mathematics and Systems Sciences, Shandong University, Jinan 250100, China
Venue:
Operations Research Letters
Year:
2008

Citing 5
Cited 0

Improved bicriteria existence theorems for scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Existence Theorems for Scheduling to Meet Two Objectives

Existence Theorems for Scheduling to Meet Two Objectives
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
A note on scheduling to meet two min-sum objectives

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the bi-criteria scheduling problem of minimizing the sum of completion times and the sum of weighted completion times, min-sum of weighted completion times, we prove that there exists no constant @b1 such that (1+1/@c,@b)-approximate schedules can be found for any @c0. This result confirms a recently published conjecture.