We consider the general machine scheduling problem to minimize the scheduling cost. One of the most efficient approaches to solve this problem is to use time-indexed Integer Programming formulation. However, the size of this formulation is very big, and even solving its Linear Programming (LP) relaxation is very time consuming. In this work, we apply the column-and-row generation approach to solve the LP relaxation of the time-indexed formulation in significantly less amount of time.