• Introduces an optimal polynomial-time algorithm for preemptive scheduling on uniform machines with non-simultaneous availability.
• Derives a lower bound on the optimal makespan using a virtual machine transformation that ensures earlier-available machines have greater speeds.
• Achieves time complexity O(nm + m^2), making it efficient for practical scheduling problems.
• Limits the number of preemptions to at most 1/2(m^2 + 3m) - 2, balancing optimality with operational simplicity.