| Article ID: | iaor2005496 |
| Country: | China |
| Volume: | 46 |
| Issue: | 6 |
| Start Page Number: | 1047 |
| End Page Number: | 1054 |
| Publication Date: | Nov 2003 |
| Journal: | Acta Mathematica Sinica |
| Authors: | Xu Dachuan |
We derive a 1.2752-approximation algorithm for the NP-hard single machine total weighted completion time problem with controllable processing times by the technique of semidefinite programming relaxation.