| Article ID: | iaor2009275 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 57 |
| End Page Number: | 60 |
| Publication Date: | Jan 2008 |
| Journal: | Operations Research Letters |
| Authors: | Yan Jin |
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 γ>O. This result confirms a recently published conjecture.