PARALLEL MACHINE SCHEDULING IN A FLEXIBLE MANUFACTURING SYSTEM

摘要

We consider the problem of assigning parts and tools on a Flexible Manufacturing System composed by W identical parallel workstations, so that the workload of the Workstations I well balanced. The goal is to minimize the total number of tools needed On all workstations, including multiple copies, if any. We give a mixed integer program- Ming formulation of this problem and a branch and cut problem and a branch and cut procedure to solve it. Several Computational experiences have been carried out in order to evaluate the performance Of the proposed procedure.