Parallel Machine Scheduling with Resources Constraint and Sequence Dependent Setup Times

This paper considered the scheduling problem of minimizing makespan on parallel machines with multiple resources constraint and job sequence dependent setup times. We proposed a mixed integer programming model to formulate the problem and used commercial software to get the optimal solution and Gantt chart of a small-size case. Then a Genetic Algorithm (GA) was developed to solve the problem in an acceptable time for large-size cases. Computational experiences shown that the proposed GA can achieve high quality solutions comparable to those obtained by commercial software and outperform the schedule rules existing in real manufacturing operation.