Summary: A set of jobs is to be processed on a machine which is subject to breakdown and repair. When the processing of a job is interrupted by a machine breakdown, the processing later resumes at the point at which the breakdown occurred. We assume that the machine uptime is Erlang distributed and that processing and repair times follow general distributions. Simple permutation policies on both machine parameters and the processing distributions are given which minimize the weighted number of tardy jobs, weighted flow times and the weighted sum of the job delays.