Abstract
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 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have