This paper studies scheduling games with machine modification. A set of jobs is to be processed on a set of identical machines. An initial schedule before the modification of machines is given as a prior. Then some machines are removed and some new machines are added. Each job has the right either to stay on its original machine if the machine is not removed, or to move to another machine. The choices of all jobs after the machine modification constitute a new schedule. The individual cost of each job is its completion time, which is determined by the scheduling policy that the machines follow. We present properties of the Nash equilibriums under generalizations of the classical scheduling policies such as LPT, SPT and Makespan. For the social cost of minimizing the makespan, we establish the Price of Anarchy and Price of Stability of the games, and majorities of the parametric bounds are tight for each combination of the number of final machines, the number of added machines and the number of removed machines.

No abstract