Sequenciamento de máquinas paralelas não-relacionadas com tempos de setup dependentes das tarefas

Revista Produção Online

Guilherme Etcheverry¹  Michel J. Anzanello² 

[1] UFRGS

关键词: Avaliação de desempenho;    Portfólio de Produtos;    Bibliometria;    Seleção de referencial teórico;    Decisão;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Associacao Brasileira de Engenharia de Producao (A B E P R O)

【 摘 要 】

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.

【 授权许可】

Unknown