| Article ID: | iaor2006473 |
| Country: | United States |
| Volume: | 14 |
| Issue: | 9 |
| Start Page Number: | 758 |
| End Page Number: | 764 |
| Publication Date: | Sep 2004 |
| Journal: | Progress in Natural Science |
| Authors: | Zhang F., Chen F., Tang G.C. |
| Keywords: | programming: quadratic |
Scheduling unrelated parallel machines with controllable processing times subject to release times is investigated. Based on the convex quadratic programming relaxation and the randomized rounding strategy, a 2-approximation algorithm is obtained for a special case with the all-or-none property and then a 3-approximation algorithm is presented for general problem.