TY - JOUR AU - Araújo, Daniella Castro AU - Nagano, Marcelo Seido PY - 2015/12/28 Y2 - 2024/03/28 TI - NEW HEURISTICS FOR THE NO-WAIT FLOWSHOP WITH SEQUENCE-DEPENDENT SETUP TIMES PROBLEM JF - Brazilian Journal of Operations & Production Management JA - BJO&PM VL - 12 IS - 2 SE - Articles DO - 10.14488/BJOPM.2015.v12.n2.a1 UR - https://bjopm.org.br/bjopm/article/view/V12N2A1 SP - 180-194 AB - <p class="MsoNormal" style="text-align: justify; line-height: 200%; margin: 0cm 0cm 0pt;"><span style="font-size: small;"><span style="font-family: Times New Roman;"><span style="color: black;" lang="EN-US">In this paper, we address the problem of scheduling jobs in a no-wait flowshop </span><span lang="EN-US">with sequence-dependent setup times<span style="color: black;"> with the objective of minimizing the makespan and the total flowtime. As this problem is well-known for being NP-hard, w</span>e present two new constructive heuristics in order <span style="color: black;">to obtain good approximate solutions for the problem in a short CPU time</span>, named GAPH and QUARTS. GAPH is based on a structural property for minimizing makespan and QUARTS breaks the problem in quartets in order to minimize the total flowtime. Experimental results demonstrate the superiority of the proposed approachs 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). </span></span></span></p> ER -