Minimização do tempo total de atraso no problema de flowshop com buffer zero através de busca tabu

Abstract

Trabalhos na área de programação de tarefas mostram que atender a data de entrega dos consumidores é uma preocupação crítica na maioria dos sistemas de manufatura. Enquanto existe considerável pesquisa para minimizar o makespan para o problema de flowshop sem restrição de estoque intermediário, poucos trabalhos abordam o critério do atraso total no ambiente flowshop com buffer zero entre as máquinas. Problemas de seqüenciamento com buffer zero ocorrem em processos de manufatura em série que não possuem espaço para armazenamento intermediário. Neste artigo, pesquisa-se a aplicação de busca tabu para explorar o espaço de soluções deste problema. Estratégias adicionais são avaliadas. Testes computacionais são apresentados e comparações com uma adaptação do algoritmo NEH e com um algoritmo Branch-and-Bound são realizadas.

Reactive GRASP with path relinking for solving parallel machines scheduling problem with resource-assignable sequence dependent setup times

“…This way of comparison also was made by Armentano and Ronconi [3]. Table 1 presents, for each set of problems of n×m size, the averages of the relative percentage improvement of RGPR with relation to the software CPLEX.…”

“…The solution shown in Figure 1 is represented by the array [4, 2, -1, 3, 1]. Note that the jobs of the groups [4,2] and [3,1] are processed respectively in machines 1 and 2. In this work, to solve the PMRSDST problem, we propose a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic with a reactive mechanism to define the randomness parameter used in the construction of the feasible solutions.…”

An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization

“…For the former, Armentano and Ronconi (2000) proposed a Tabu Search procedure, Ronconi and Henriques (2009) a new NEH-based method and a GRASP algorithm and proposed an iterated local search method. For the latter, Wang, Pan, and Fatih Tasgetiren (2010) proposed a hybrid Harmony Search (HS) algorithm, Deng, Xu, and Gu (2012) a Discrete Artificial Bee Colony (DABC) algorithm, and Moslehi and Khorasanian (2013) a branch and bound algorithm that can be used in small instances.…”

A New Constructive Heuristic for the Fm|block|ΣT

“…In particular, to the best of our knowledge, only Armentano and Ronconi (2000) and Ronconi and Henriques (2009) dealt with the blocking flow shop problem for total tardiness minimization. Armentano and Ronconi (2000) propose a Tabu Search procedure that uses the LBNEH method proposed in Armentano and Ronconi (1999) to obtain the initial solution. Alternatively, in Ronconi and Henriques (2009), a constructive method (FPDNEH) and a Greedy Adaptive Search Procedure (GRASP) is proposed for this problem.…”