Summary: Semi-on-line scheduling problems on two uniform machines with set-up time are studied, where the largest processing time is known in advance. Both objectives to minimize the maximum machine completion time and the maximum job completion time are considered. Algorithms with a competitive ratio of \(\frac32\) are presented for the considered problems. It is also shown that no algorithm exists that has a competitive ratio smaller than \(\sqrt2\).