| Article ID: | iaor20081728 |
| Country: | China |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 116 |
| End Page Number: | 119 |
| Publication Date: | Jan 2006 |
| Journal: | Journal of Tongji University |
| Authors: | Tang Guochun, Zhang Feng |
| Keywords: | programming: quadratic |
The method of convex quadratic programming relaxation has been used for the scheduling with rejection. The jobs have different release times. The objection function is total weighted completion times of the remaining jobs plus the sum of the penalties of the jobs rejected. A 2-approximation algorithm has been obtained.