A special parallel machine scheduling problem is studied and formulated into a mixed integer programming model, considering setup time and time window. A valid inequality is deduced and improved with the setup time consideration. An relaxed IP model with valid inequality can provide a primary cable assignment scheme and lower bound to the scheduling problem. A SS algorithm is proposed to solve the problem. At last, the numerical experiments is carried out which demonstrates that the proposed solution approach is effective and efficient.