| Article ID: | iaor2007675 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 5 |
| Start Page Number: | 583 |
| End Page Number: | 590 |
| Publication Date: | Sep 2006 |
| Journal: | Operations Research Letters |
| Authors: | Kern Walter, Brueggemann Tobias, Hurink Johann L. |
| Keywords: | heuristics |
We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3/2. In a special case, the approximation ratio is 3/2−1/√(6)≈1.092.