Scheduling on unrelated parallel machines with sequence dependent setup times

Abstract

This article proposes a scheduling heuristic for unrelated parallel machines with sequence dependent setup times. The minimization of total weighted completion time and the minimization of weighted tardiness are the objective functions of interest. A three phase heuristic, based on Bank and Werner’s (2001) NP-hard problems solving procedure, is proposed to (i) perform an initial ordering of the jobs, (ii) allocate the jobs to the machines, and (iii) improve final solution of both objectives with Tabu Search. The heuristic performance is evaluated comparing the quality of proposed solution with the optimal solution obtained from total enumeration. The proposed model is applied in an industry of electronic components industry composed of two unrelated parallel machines with deterministic processing and setup times. We obtained a 1.1% deviation for the optimal total weighted completion time and 4.6% of deviation for the weighted tardiness in less than ten minutes of computational time.

Keywords

• Sequenciamento. Máquinas paralelas não relacionadas. Tabu search.