A comment on scheduling two parallel machines with capacity constraints

Ageev, 2004, Pipage rounding: A new method of constructing algorithms with proven performance guarantee, J. Combin. Optim., 8, 307, 10.1023/B:JOCO.0000038913.96607.c2 J. Bramel, L. Chan, D. Simchi-Levi, Worst-case analysis of the modified LPT heuristic for the two-machine makespan problem with capacity constraints, Manuscript. Woeginger, 2000, When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS) ?, INFORMS J. Comput., 12, 57, 10.1287/ijoc.12.1.57.11901 Yang, 2003, An approximation algorithm for scheduling two parallel machines with capacity constraints, Discrete Appl. Math., 130, 449, 10.1016/S0166-218X(02)00601-7