Um estudo computacional de novas regras de prioridade para flow shop com tempos de setup e diferentes datas de liberação

Producao Online

Helio Yochihiro Fuchigami¹  Caio Soares de Araújo² 

[1] Universidade Federal de Goiás / Faculdade de Ciências e Tecnologia;Universidade Federal de Goiás / Regional Catalão

关键词: Scheduling;    Flow shop;    Priority rules;    Sequence-independent setup times;    Release dates;   

DOI  :  10.14488/1676-1901.v18i1.2747

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

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

【 摘 要 】

This research deals with the flow shop production system with sequence-independent setup times, different job release dates and two distinct problems: makespan and total flowtime minimization. It was undertaken a large computational study of the performance of new priority rules, widely used in practice by companies and defined here based on the structure of the problems analyzed. As is well known, the computational efficiency of the priority rules as solution methods is already presumed. Therefore, this work focused on the analysis of the effectiveness, i.e., the quality of the solution reached by the application of such rules in the two problems considered. The results proved the applicability of the proposed methods and identified the best rules for each case, with their respective ordering criteria.

【 授权许可】

CC BY