NEW HEURISTICS FOR THE NO-WAIT FLOWSHOP WITH SEQUENCE-DEPENDENT SETUP TIMES PROBLEM

Autor(es)

Araujo, Danielle Castro ^[1] ; Naganoa, Marcelo Seido ^[1]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Sao Paulo, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: BRAZILIAN JOURNAL OF OPERATIONS & PRODUCTION MANAGEMENT; v. 12, n. 2, p. 180-194, DEC 2015.
• Citações Web of Science: 0

Resumo

In this paper, we address the problem of scheduling jobs in a no-wait flow shop with sequence-dependent setup times with the objective of minimizing the make span and the total flow time. As this problem is well-known for being NP-hard, we present two new constructive heuristics in order to obtain good approximate solutions for the problem in a short CPU time, named GAPH and QUARTS. GAPH is based on a structural property for minimizing make span and QUARTS breaks the problem in quartets in order to minimize the total flow time. Experimental results demonstrate the superiority of the proposed approaches over three of the best-know methods in the literature: BAH and BIH, from Bianco, Dell'Olmo and Giordani (1999) and TRIPS, by Brown, McGarvey and Ventura (2004). (AU)

• Processo FAPESP: 09/06832-2 - Programação da produção em sistemas no-wait flow shop com tempos de setup dependentes da sequência
• Beneficiário: Daniella Castro Araujo
• Modalidade de apoio: Bolsas no Brasil - Mestrado