# Can there be a 1.1 approximation algorithm for the load balancing problem?

I know this is a very specific question, but: Let's assume that someone designed a 1.1 approximation algorithm for the load balancing problem involving exactly 2 machines. After running the algorithm on a set of n activities, the final loads are 80 for the first machine and 120 for the second one. Is this possible given that:

a) the aforementioned job set only contained jobs with a load less than 100?

b) the aforementioned job set only contained jobs with a load less than 10?

This is taken from a set of exercises given by my uni professor as preparation for the final exam.

• Unclear what you call a "load time". Both statements can be true, take all "load times" equal to $1$. May 13 at 16:43
• Yep, I see why it was unclear. I edited the question. Thanks. May 16 at 12:04
• @asparagus Please tell us, what you tried by yourself. We want to see some effort. May 16 at 12:29
• Please edit the question to make it understandable. May 16 at 12:34