This research addresses on developing Integer Linear Programming model for solving the alternative machine scheduling problem. The definition of the scheduling problem is as follows. There is a set of jobs. Each job can be performed on one of alternative machines. The objective function is to minimize total weighted tardiness. The problem is formulated as an integer linear programming (ILP) model, with discretized time horizon. The Model is applied on numerical instance. The optimal solution is obtained by solving the ILP Model.