A classical problem to explore the design of truthful mechanisms is the strategic version of machine scheduling, where a set of jobs must be assigned to a given number of machines whose speeds are private knowledge of selfish agents. We study this problem with the objective of maximizing the minimum load on any of the given machines and present a truthful 8-Approximation.