An improved lower bound for a bi-criteria scheduling problem

  title={An improved lower bound for a bi-criteria scheduling problem},
  author={Jin Yan},
  journal={Oper. Res. Lett.},
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 > 1 such that (1 + 1/ , )-approximate schedules can be found for any > 0. This result confirms a recently published conjecture. © 2007 Published by Elsevier B.V. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

kindt, J.C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms

T V.
View 1 Excerpt

Existence theorems for scheduling to meet two objectives, Technical Report PCSTR99-347

A. Rasala
Dartmouth College, • 1999
View 1 Excerpt

Various optimizers for single-stage production

W. E. Smith
Naval Res. Logist. Q. 3 • 1956
View 1 Excerpt

Similar Papers

Loading similar papers…