Abstract:  The scheduling problem for a class of automated mixed production line with time window constraint is discussed. For such a system, it should sequence both the jobs and the robot movements. Based on a systematic analysis, in considering time window constraint on job processing times, robot availability constraint, and resource capability constraint, the problem is formulated as a mixed integer programming model. Then, the commercial software CPLEX is used to solve it. Computational results on benchmark and randomly generated instances show that the proposed MIP approach is very efficient in scheduling the automated mixed production line.