Scheduling is the allocation of shared resources over time to competing activities, and has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machines represent resources; each machine can process at most one job at a time. This chapter reviews a variety of GA applications to the JSSP. We begin our discussion by formulating the JSSP by a disjunctive graph. We then look at domain independent binary and permutation representations, followed by an active schedule representation with GT crossover and the genetic enumeration method. Section 7.7 discusses a method for integrating local optimisation directly into GAs. Section 7.8 discusses performance comparison using the well known Muth and Thompson benchmark and the more difficult ten tough problems.